default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDan R. Ghica
- > Home > Persons > Dan R. Ghica
Publications
- 2024
[j15]Paul W. Wilson, Dan R. Ghica, Fabio Zanasi:
String diagrams for Strictification and Coherence. Log. Methods Comput. Sci. 20(4) (2024)- [j14]Mario Alvarez-Picallo
, Teodoro Freund, Dan R. Ghica, Sam Lindley:
Effect Handlers for C via Coroutines. Proc. ACM Program. Lang. 8(OOPSLA2): 2462-2489 (2024) - [i18]Dan R. Ghica, Chris Barrett, Aleksei Tiurin:
Equivalence Hypergraphs: E-Graphs for Monoidal Theories. CoRR abs/2406.15882 (2024) - 2023
- [c54]Mario Alvarez-Picallo, Dan R. Ghica, David Sprunger, Fabio Zanasi:
Functorial String Diagrams for Reverse-Mode Automatic Differentiation. CSL 2023: 6:1-6:20 - [c53]Paul W. Wilson, Dan R. Ghica, Fabio Zanasi:
String Diagrams for Non-Strict Monoidal Categories. CSL 2023: 37:1-37:19 - [c52]Dan R. Ghica, George Kaye:
Rewriting Modulo Traced Comonoid Structure. FSCD 2023: 14:1-14:21 - [i17]Dan R. Ghica, George Kaye:
Rewriting modulo traced comonoid structure. CoRR abs/2302.09631 (2023) - [i16]Dan R. Ghica, Fabio Zanasi:
Hierarchical string diagrams and applications. CoRR abs/2305.18945 (2023) - 2022
- [j13]Dan R. Ghica, Sam Lindley, Marcos Maroñas Bravo, Maciej Piróg:
High-level effect handlers in C++. Proc. ACM Program. Lang. 6(OOPSLA2): 1639-1667 (2022) - [c51]Mario Alvarez-Picallo, Dan R. Ghica, David Sprunger, Fabio Zanasi:
Rewriting for Monoidal Closed Categories. FSCD 2022: 29:1-29:20 - [i15]Dan R. Ghica, George Kaye, David Sprunger:
Full abstraction for digital circuits. CoRR abs/2201.10456 (2022) - 2021
- [i14]Mario Alvarez-Picallo, Dan R. Ghica, David Sprunger, Fabio Zanasi:
Functorial String Diagrams for Reverse-Mode Automatic Differentiation. CoRR abs/2107.13433 (2021) - 2018
- [i8]Dan R. Ghica, Masahito Hasegawa, Pawel Sobocinski:
Diagrammatic methods for linear and nonlinear systems (NII Shonan Meeting 2018-18). NII Shonan Meet. Rep. 2018 (2018) - 2013
- [j9]Samson Abramsky, Dan R. Ghica:
Foreword. Ann. Pure Appl. Log. 164(11): 1037 (2013) - 2012
- [c25]Dan R. Ghica, Nikos Tzevelekos:
A System-Level Game Semantics. MFPS 2012: 191-211 - [i2]Dan R. Ghica, Nikos Tzevelekos:
A System-Level Semantics. CoRR abs/1201.4462 (2012) - 2010
- [j8]Dan R. Ghica, Russ Harmer:
Foreword. Ann. Pure Appl. Log. 161(5): 617 (2010) - [j7]Adam Bakewell, Aleksandar S. Dimovski, Dan R. Ghica, Ranko Lazic:
Data-abstraction refinement: a game semantic approach. Int. J. Softw. Tools Technol. Transf. 12(5): 373-389 (2010) - 2009
- [c17]Dan R. Ghica, Adam Bakewell:
Clipping: A Semantics-Directed Syntactic Approximation. LICS 2009: 189-198 - [c16]Adam Bakewell, Dan R. Ghica:
Compositional Predicate Abstraction from Game Semantics. TACAS 2009: 62-76 - 2008
- [j6]Guy McCusker, Dan R. Ghica:
Foreword for special issue of APAL for GaLoP 2005. Ann. Pure Appl. Log. 151(2-3): 69 (2008) - [j5]Dan R. Ghica, Andrzej S. Murawski:
Angelic semantics of fine-grained concurrency. Ann. Pure Appl. Log. 151(2-3): 89-114 (2008) - [c15]Adam Bakewell, Dan R. Ghica:
On-the-Fly Techniques for Game-Based Software Model Checking. TACAS 2008: 78-92 - 2007
- [c13]Adam Bakewell, Dan R. Ghica:
Game-based safety checking with Mage. SAVCBS 2007: 85-87 - 2006
- [j4]Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong:
Syntactic control of concurrency. Theor. Comput. Sci. 350(2-3): 234-251 (2006) - [c12]Aleksandar S. Dimovski, Dan R. Ghica, Ranko Lazic:
A Counterexample-Guided Refinement Tool for Open Procedural Programs. SPIN 2006: 288-292 - [c11]Dan R. Ghica, Andrzej S. Murawski:
Compositional Model Extraction for Higher-Order Concurrent Programs. TACAS 2006: 303-317 - 2005
- [c10]Aleksandar S. Dimovski, Dan R. Ghica, Ranko Lazic:
Abstraction-refinement for game-based model checking. GALOP@ETAPS 2005: 139 - [c8]Aleksandar S. Dimovski, Dan R. Ghica, Ranko Lazic:
Data-Abstraction Refinement: A Game Semantic Approach. SAS 2005: 102-117 - [e1]Dan R. Ghica, Guy McCusker:
1st Workshop on Games for Logic and Programming Languages, GALOP@ETAPS 2005, Edinburgh, UK, 2-3 April 2005. 2005 [contents] - 2004
- [c6]Dan R. Ghica, Andrzej S. Murawski:
Angelic Semantics of Fine-Grained Concurrency. FoSSaCS 2004: 211-225 - [c5]Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong:
Syntactic Control of Concurrency. ICALP 2004: 683-694 - [c4]Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong, Ian David Bede Stark:
Nominal Games and Full Abstraction for the Nu-Calculus. LICS 2004: 150-159 - [c3]Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong:
Applying Game Semantics to Compositional Software Modeling and Verification. TACAS 2004: 421-435 - 2003
- [j3]Dan R. Ghica, Guy McCusker:
The regular-language semantics of second-order idealized ALGOL. Theor. Comput. Sci. 309(1-3): 469-502 (2003) - 2000
- [c1]Dan R. Ghica, Guy McCusker:
Reasoning about Idealized ALGOL Using Regular Languages. ICALP 2000: 103-115
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-17 00:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
