C.-H. Luke Ong

Martin Lester, C.-H. Luke Ong, Max Schäfer: Information Flow Analysis for a Dynamically Typed Functional Language with Staged Metaprogramming. CoRR abs/1302.3178 (2013)

Emanuele D'Osualdo, Jonathan Kochems, C.-H. Luke Ong: Automatic Verification of Erlang-Style Concurrency. CoRR abs/1303.2201 (2013)

David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong: Hector: An Equivalence Checker for a Higher-Order Fragment of ML. CAV 2012: 774-780

C.-H. Luke Ong, Takeshi Tsukada: Two-Level Game Semantics, Intersection Types, and Recursion Schemes. ICALP (2) 2012: 325-336

Robin P. Neatherway, Steven James Ramsay, C.-H. Luke Ong: A traversal-based algorithm for higher-order model checking. ICFP 2012: 353-364

C.-H. Luke Ong, Ruy J. G. B. de Queiroz (Eds.): Logic, Language, Information and Computation - 19th International Workshop, WoLLIC 2012, Buenos Aires, Argentina, September 3-6, 2012. Proceedings. Lecture Notes in Computer Science 7456, Springer 2012, isbn 978-3-642-32620-2

Naoki Kobayashi, C.-H. Luke Ong: Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus. Logical Methods in Computer Science 7(4) (2011)

Matthew Hague, C.-H. Luke Ong: A saturation method for the modal μ-calculus over pushdown systems. Inf. Comput. 209(5): 799-821 (2011)

David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong: A Fragment of ML Decidable by Visibly Pushdown Automata. ICALP (2) 2011: 149-161

C.-H. Luke Ong, Steven James Ramsay: Verifying higher-order functional programs with pattern-matching algebraic data types. POPL 2011: 587-598

Jonathan Kochems, C.-H. Luke Ong: Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars. RTA 2011: 187-202

Zhenhua Duan, C.-H. Luke Ong (Eds.): 5th IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2011, Xi'an, China, 29-31 August 2011. IEEE Computer Society 2011, isbn 978-1-4577-1487-0

C.-H. Luke Ong (Ed.): Typed Lambda Calculi and Applications - 10th International Conference, TLCA 2011, Novi Sad, Serbia, June 1-3, 2011. Proceedings. Lecture Notes in Computer Science 6690, Springer 2011, isbn 978-3-642-21690-9

Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre: Recursion Schemes and Logical Reflection. LICS 2010: 120-129

Matthew Hague, C.-H. Luke Ong: Analysing Mu-Calculus Properties of Pushdown Systems. SPIN 2010: 187-192

Gérard Basler, Matthew Hague, Daniel Kroening, C.-H. Luke Ong, Thomas Wahl, Haoxian Zhao: Boom: Taking Boolean Program Model Checking One Step Further. TACAS 2010: 145-149

C.-H. Luke Ong: Models of Higher-Order Computation: Recursion Schemes and Collapsible Pushdown Automata. Logics and Languages for Reliability and Security 2010: 263-299

C.-H. Luke Ong (Ed.): Foundations of Software Science and Computational Structures, 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings. Lecture Notes in Computer Science 6014, Springer 2010, isbn 978-3-642-12031-2

Matthew Hague, C.-H. Luke Ong: A Saturation Method for the Modal Mu-Calculus with Backwards Modalities over Pushdown Systems. CoRR abs/1006.5906 (2010)

William Blum, C.-H. Luke Ong: The Safe Lambda Calculus. Logical Methods in Computer Science 5(1) (2009)

David Hopkins, C.-H. Luke Ong: Homer: A Higher-Order Observational Equivalence Model checkER. CAV 2009: 654-660

Matthew Hague, C.-H. Luke Ong: Winning Regions of Pushdown Parity Games: A Saturation Method. CONCUR 2009: 384-398

Christopher H. Broadbent, C.-H. Luke Ong: On Global Model Checking Trees Generated by Higher-Order Recursion Schemes. FOSSACS 2009: 107-121

Naoki Kobayashi, C.-H. Luke Ong: Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus. ICALP (2) 2009: 223-234

Naoki Kobayashi, C.-H. Luke Ong: A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes. LICS 2009: 179-188

C.-H. Luke Ong, Nikos Tzevelekos: Functional Reachability. LICS 2009: 286-295

Matthew Hague, C.-H. Luke Ong: Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems. Logical Methods in Computer Science 4(4) (2008)

C.-H. Luke Ong: Verification of Higher-Order Computation: A Game-Semantic Approach. ESOP 2008: 299-306

Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre: Winning Regions of Higher-Order Pushdown Games. LICS 2008: 193-204

Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre: Collapsible Pushdown Automata and Recursion Schemes. LICS 2008: 452-461

Giorgio Ausiello, Juhani Karhumäki, Giancarlo Mauri, C.-H. Luke Ong (Eds.): Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy. IFIP 273, Springer 2008, isbn 978-0-387-09679-7

Matthew Hague, C.-H. Luke Ong: Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems. CoRR abs/0811.1103 (2008)

S. B. Sanjabi, C.-H. Luke Ong: Fully abstract semantics of additive aspects by translation. AOSD 2007: 135-148

Matthew Hague, C.-H. Luke Ong: Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems. FoSSaCS 2007: 213-227

C.-H. Luke Ong: Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes. MFCS 2007: 15-21

William Blum, C.-H. Luke Ong: The Safe Lambda Calculus. TLCA 2007: 39-53

Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong: Syntactic control of concurrency. Theor. Comput. Sci. 350(2-3): 234-251 (2006)

Andrzej S. Murawski, C.-H. Luke Ong: Fast verification of MLL proof nets via IMLL. ACM Trans. Comput. Log. 7(3): 473-498 (2006)

C.-H. Luke Ong: Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract). CSL 2006: 31-40

C.-H. Luke Ong: On Model-Checking Trees Generated by Higher-Order Recursion Schemes. LICS 2006: 81-90

Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong: Safety Is not a Restriction at Level 2 for String Languages. FoSSaCS 2005: 490-504

Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiewicz: Idealized Algol with Ground Recursion, and DPDA Equivalence. ICALP 2005: 917-929

Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong: The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable. TLCA 2005: 39-54

C.-H. Luke Ong (Ed.): Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings. Lecture Notes in Computer Science 3634, Springer 2005, isbn 3-540-28231-9

C.-H. Luke Ong: An approach to deciding the observational equivalence of Algol-like languages. Ann. Pure Appl. Logic 130(1-3): 125-171 (2004)

C.-H. Luke Ong, Pietro Di Gianantonio: Games characterizing Levy-Longo trees. Theor. Comput. Sci. 312(1): 121-142 (2004)

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)

Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong: Syntactic Control of Concurrency. ICALP 2004: 683-694

Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong, Ian D. B. Stark: Nominal Games and Full Abstraction for the Nu-Calculus. LICS 2004: 150-159

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

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)

Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong: Adapting innocent game models for the Böhm treelambda -theory. Theor. Comput. Sci. 308(1-3): 333-366 (2003)

Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong: Innocent game models of untyped lambda-calculus. Theor. Comput. Sci. 272(1-2): 247-292 (2002)

C.-H. Luke Ong: Model Checking Algol-Like Languages Using Game Semantics. FSTTCS 2002: 33-36

C.-H. Luke Ong, Pietro Di Gianantonio: Games Characterizing Levy-Longo Trees. ICALP 2002: 476-487

C.-H. Luke Ong: Observational Equivalence of 3rd-Order Idealized Algol is Decidable. LICS 2002: 245-256

Anindya Basu, C.-H. Luke Ong, April Rasala, F. Bruce Shepherd, Gordon T. Wilfong: Route oscillations in I-BGP with route reflection. SIGCOMM 2002: 235-247

Andrzej S. Murawski, C.-H. Luke Ong: Evolving Games and Essential Nets for Affine Polymorphism. TLCA 2001: 360-375

J. M. E. Hyland, C.-H. Luke Ong: On Full Abstraction for PCF: I, II, and III. Inf. Comput. 163(2): 285-408 (2000)

C.-H. Luke Ong: Light Logic and Resource Bounded Computation. APLAS 2000: 181

Andrzej S. Murawski, C.-H. Luke Ong: Discreet Games, Light Affine Logic and PTIME Computation. CSL 2000: 427-441

Andrzej S. Murawski, C.-H. Luke Ong: Dominator Trees and Fast Verification of Proof Nets. LICS 2000: 181-191

Thong wei Koh, C.-H. Luke Ong: Internal Languages for Autonomous and *-Autonomous Categories. Electr. Notes Theor. Comput. Sci. 29: 151 (1999)

Andrzej S. Murawski, C.-H. Luke Ong: Exhausting Strategies, Joker Games and IMLL with Units. Electr. Notes Theor. Comput. Sci. 29: 209-239 (1999)

Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong: A Universal Innocent Game Model for the Böhm Tree Lambda Theory. CSL 1999: 405-419

C.-H. Luke Ong, Charles A. Stewart: A Curry-Howard Foundation for Functional Computation with Control. POPL 1997: 215-227

C.-H. Luke Ong: A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract). LICS 1996: 230-241

J. M. E. Hyland, C.-H. Luke Ong: Pi-Calculus, Dialogue Games and PCF. FPCA 1995: 96-107

Samson Abramsky, C.-H. Luke Ong: Full Abstraction in the Lazy Lambda Calculus. Inf. Comput. 105(2): 159-267 (1993)

C.-H. Luke Ong, Eike Ritter: A Generic Strong Normalization Argument: Application to the Calculus of Constructions. CSL 1993: 261-279

C.-H. Luke Ong: Non-Determinism in a Functional Setting. LICS 1993: 275-286

J. M. E. Hyland, C.-H. Luke Ong: Modified Realizability Toposes and Strong Normalization Proofs. TLCA 1993: 179-194

C.-H. Luke Ong: Lazy Lambda Calculus: Theories, Models and Local Structure Characterization (Extended Abstract). ICALP 1992: 487-498

C.-H. Luke Ong: Fully Abstract Models of the Lazy Lambda Calculus. FOCS 1988: 368-376