C.-H. Luke Ong

	2009
52		David Hopkins, C.-H. Luke Ong: Homer: A Higher-Order Observational Equivalence Model checkER. CAV 2009: 654-660
51		Matthew Hague, C.-H. Luke Ong: Winning Regions of Pushdown Parity Games: A Saturation Method. CONCUR 2009: 384-398
50		Naoki Kobayashi, C.-H. Luke Ong: Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus. ICALP (2) 2009: 223-234
49		William Blum, C.-H. Luke Ong: The Safe Lambda Calculus Logical Methods in Computer Science 5(1): (2009)
	2008
48		Giorgio Ausiello, Juhani Karhumäki, Giancarlo Mauri, C.-H. Luke Ong: 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 Springer 2008
47		C.-H. Luke Ong: Verification of Higher-Order Computation: A Game-Semantic Approach. ESOP 2008: 299-306
46		Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre: Winning Regions of Higher-Order Pushdown Games. LICS 2008: 193-204
45		Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre: Collapsible Pushdown Automata and Recursion Schemes. LICS 2008: 452-461
44		Matthew Hague, C.-H. Luke Ong: Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems CoRR abs/0811.1103: (2008)
43		Matthew Hague, C.-H. Luke Ong: Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems. Logical Methods in Computer Science 4(4): (2008)
	2007
42		S. B. Sanjabi, C.-H. Luke Ong: Fully abstract semantics of additive aspects by translation. AOSD 2007: 135-148
41		Matthew Hague, C.-H. Luke Ong: Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems. FoSSaCS 2007: 213-227
40		C.-H. Luke Ong: Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes. MFCS 2007: 15-21
39		William Blum, C.-H. Luke Ong: The Safe Lambda Calculus. TLCA 2007: 39-53
	2006
38		C.-H. Luke Ong: Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract). CSL 2006: 31-40
37		C.-H. Luke Ong: On Model-Checking Trees Generated by Higher-Order Recursion Schemes. LICS 2006: 81-90
36		Andrzej S. Murawski, C.-H. Luke Ong: Fast verification of MLL proof nets via IMLL. ACM Trans. Comput. Log. 7(3): 473-498 (2006)
35		Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong: Syntactic control of concurrency. Theor. Comput. Sci. 350(2-3): 234-251 (2006)
	2005
34		C.-H. Luke Ong: Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings Springer 2005
33		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
32		Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiewicz: Idealized Algol with Ground Recursion, and DPDA Equivalence. ICALP 2005: 917-929
31		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
	2004
30		Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong: Syntactic Control of Concurrency. ICALP 2004: 683-694
29		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
28		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
27		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)
26		C.-H. Luke Ong, Pietro Di Gianantonio: Games characterizing Levy-Longo trees. Theor. Comput. Sci. 312(1): 121-142 (2004)
25		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)
	2003
24		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)
23		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)
	2002
22		C.-H. Luke Ong: Model Checking Algol-Like Languages Using Game Semantics. FSTTCS 2002: 33-36
21		C.-H. Luke Ong, Pietro Di Gianantonio: Games Characterizing Levy-Longo Trees. ICALP 2002: 476-487
20		C.-H. Luke Ong: Observational Equivalence of 3rd-Order Idealized Algol is Decidable. LICS 2002: 245-256
19		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
18		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)
	2001
17		Andrzej S. Murawski, C.-H. Luke Ong: Evolving Games and Essential Nets for Affine Polymorphism. TLCA 2001: 360-375
	2000
16		C.-H. Luke Ong: Light Logic and Resource Bounded Computation. APLAS 2000: 181
15		Andrzej S. Murawski, C.-H. Luke Ong: Discreet Games, Light Affine Logic and PTIME Computation. CSL 2000: 427-441
14		Andrzej S. Murawski, C.-H. Luke Ong: Dominator Trees and Fast Verification of Proof Nets. LICS 2000: 181-191
13		J. M. E. Hyland, C.-H. Luke Ong: On Full Abstraction for PCF: I, II, and III. Inf. Comput. 163(2): 285-408 (2000)
	1999
12		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
11		Andrzej S. Murawski, C.-H. Luke Ong: Exhausting Strategies, Joker Games and IMLL with Units. Electr. Notes Theor. Comput. Sci. 29: (1999)
10		Thong wei Koh, C.-H. Luke Ong: Internal Languages for Autonomous and *-Autonomous Categories. Electr. Notes Theor. Comput. Sci. 29: (1999)
	1997
9		C.-H. Luke Ong, Charles A. Stewart: A Curry-Howard Foundation for Functional Computation with Control. POPL 1997: 215-227
	1996
8		C.-H. Luke Ong: A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract). LICS 1996: 230-241
	1995
7		J. M. E. Hyland, C.-H. Luke Ong: Pi-Calculus, Dialogue Games and PCF. FPCA 1995: 96-107
	1993
6		C.-H. Luke Ong, Eike Ritter: A Generic Strong Normalization Argument: Application to the Calculus of Constructions. CSL 1993: 261-279
5		C.-H. Luke Ong: Non-Determinism in a Functional Setting LICS 1993: 275-286
4		J. M. E. Hyland, C.-H. Luke Ong: Modified Realizability Toposes and Strong Normalization Proofs. TLCA 1993: 179-194
3		Samson Abramsky, C.-H. Luke Ong: Full Abstraction in the Lazy Lambda Calculus Inf. Comput. 105(2): 159-267 (1993)
	1992
2		C.-H. Luke Ong: Lazy Lambda Calculus: Theories, Models and Local Structure Characterization (Extended Abstract). ICALP 1992: 487-498
	1988
1		C.-H. Luke Ong: Fully Abstract Models of the Lazy Lambda Calculus FOCS 1988: 368-376

Coauthor Index

1	Samson Abramsky	[3] [28] [29]
2	Klaus Aehlig	[31] [33]
3	Giorgio Ausiello	[48]
4	Anindya Basu	[19]
5	William Blum	[39] [49]
6	Arnaud Carayol	[46]
7	Dan R. Ghica	[28] [29] [30] [35]
8	Pietro Di Gianantonio	[21] [26]
9	Matthew Hague	[41] [43] [44] [45] [46] [51]
10	David Hopkins	[52]
11	Martin Hyland (J. M. E. Hyland)	[4] [7] [13]
12	Juhani Karhumäki	[48]
13	Andrew D. Ker	[12] [18] [23]
14	Naoki Kobayashi	[50]
15	Thong wei Koh	[10]
16	April Rasala Lehman (April Rasala)	[19]
17	Giancarlo Mauri	[48]
18	Antoine Meyer	[46]
19	Jolie G. de Miranda	[31] [33]
20	Andrzej S. Murawski	[11] [14] [15] [17] [24] [25] [28] [29] [30] [32] [35] [36] [45]
21	Hanno Nickau	[12] [18] [23]
22	Eike Ritter	[6]
23	S. B. Sanjabi	[42]
24	Olivier Serre	[45] [46]
25	F. Bruce Shepherd	[19]
26	Ian D. B. Stark	[29]
27	Charles A. Stewart	[9]
28	Igor Walukiewicz	[32]
29	Gordon T. Wilfong	[19]

Colors in the list of coauthors