Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDC.-H. Luke Ong
- > Home > Persons > C.-H. Luke Ong
Publications
- 2023
[c93]Fabian Zaiser, Andrzej S. Murawski, Chih-Hao Luke Ong:
Exact Bayesian Inference on Discrete Models via Probability Generating Functions: A Probabilistic Programming Approach. NeurIPS 2023- [i41]Fabian Zaiser, Andrzej S. Murawski, Luke Ong:
Exact Bayesian Inference on Discrete Models via Probability Generating Functions: A Probabilistic Programming Approach. CoRR abs/2305.17058 (2023) - 2022
- [c91]Guanyan Li, Andrzej S. Murawski, Luke Ong:
Probabilistic Verification Beyond Context-Freeness. LICS 2022: 33:1-33:13 - 2021
- [j22]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague
, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre:
Collapsible Pushdown Parity Games. ACM Trans. Comput. Log. 22(3): 16:1-16:51 (2021) - 2020
- [i27]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre:
Collapsible Pushdown Parity Games. CoRR abs/2010.06361 (2020) - 2019
- [j21]Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong:
ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States. ACM Trans. Program. Lang. Syst. 41(2): 11:1-11:38 (2019) - 2017
- [j17]Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre:
Collapsible Pushdown Automata and Recursion Schemes. ACM Trans. Comput. Log. 18(3): 25:1-25:42 (2017) - [c71]Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong:
ML and Extended Branching VASS. ESOP 2017: 314-340 - 2015
- [c63]Conrad Cotton-Barratt, David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong:
Fragments of ML Decidable by Nested Data Class Memory Automata. FoSSaCS 2015: 249-263 - [c62]Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong:
Weak and Nested Class Memory Automata. LATA 2015: 188-199 - [i15]Conrad Cotton-Barratt, David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong:
Fragments of ML Decidable by Nested Data Class Memory Automata. CoRR abs/1501.04511 (2015) - 2014
- [i10]Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong:
Weak and Nested Class Memory Automata. CoRR abs/1409.1136 (2014) - 2012
- [c49]David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong:
Hector: An Equivalence Checker for a Higher-Order Fragment of ML. CAV 2012: 774-780 - 2011
- [c46]David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong:
A Fragment of ML Decidable by Visibly Pushdown Automata. ICALP (2) 2011: 149-161 - 2008
- [c32]Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre:
Collapsible Pushdown Automata and Recursion Schemes. LICS 2008: 452-461 - 2006
- [j10]Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong:
Syntactic control of concurrency. Theor. Comput. Sci. 350(2-3): 234-251 (2006) - [j9]Andrzej S. Murawski, C.-H. Luke Ong:
Fast verification of MLL proof nets via IMLL. ACM Trans. Comput. Log. 7(3): 473-498 (2006) - 2005
- [c24]Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiewicz:
Idealized Algol with Ground Recursion, and DPDA Equivalence. ICALP 2005: 917-929 - 2004
- [j6]Andrzej S. Murawski, C.-H. Luke Ong:
On an interpretation of safe recursion in light affine logic. Theor. Comput. Sci. 318(1-2): 197-223 (2004) - [c22]Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong:
Syntactic Control of Concurrency. ICALP 2004: 683-694 - [c21]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 - [c20]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
- [j5]Andrzej S. Murawski, C.-H. Luke Ong:
Exhausting strategies, joker games and full completeness for IMLL with Unit. Theor. Comput. Sci. 294(1/2): 269-305 (2003) - 2001
- [c15]Andrzej S. Murawski, C.-H. Luke Ong:
Evolving Games and Essential Nets for Affine Polymorphism. TLCA 2001: 360-375 - 2000
- [c13]Andrzej S. Murawski, C.-H. Luke Ong:
Discreet Games, Light Affine Logic and PTIME Computation. CSL 2000: 427-441 - [c12]Andrzej S. Murawski, C.-H. Luke Ong:
Dominator Trees and Fast Verification of Proof Nets. LICS 2000: 181-191 - 1999
- [c9]Andrzej S. Murawski, C.-H. Luke Ong:
Exhausting Strategies, Joker Games and IMLL with Units. CTCS 1999: 209-239
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.
Reference lists
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.
Citation data
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.
OpenAlex data
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 2024-03-03 00:09 CET 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:
