Search results for "C.-H. Luke Ong"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Matthew Hague, C.-H. Luke Ong	A saturation method for the modal μ-calculus over pushdown systems.	Inf. Comput.	2011	DBLP DOI BibTeX RDF
1	Naoki Kobayashi, C.-H. Luke Ong	Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus	Logical Methods in Computer Science	2011	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong (eds.)	Typed Lambda Calculi and Applications - 10th International Conference, TLCA 2011, Novi Sad, Serbia, June 1-3, 2011. Proceedings	TLCA	2011	DBLP DOI BibTeX RDF
1	David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong	A Fragment of ML Decidable by Visibly Pushdown Automata.	ICALP	2011	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong, Steven James Ramsay	Verifying higher-order functional programs with pattern-matching algebraic data types.	POPL	2011	DBLP DOI BibTeX RDF
1	Jonathan Kochems, C.-H. Luke Ong	Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars.	RTA	2011	DBLP DOI BibTeX RDF
1	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	TASE	2011	DBLP BibTeX RDF
1	Matthew Hague, C.-H. Luke Ong	A Saturation Method for the Modal Mu-Calculus with Backwards Modalities over Pushdown Systems	CoRR	2010	DBLP BibTeX RDF
1	C.-H. Luke Ong	Models of Higher-Order Computation: Recursion Schemes and Collapsible Pushdown Automata.	Logics and Languages for Reliability and Security	2010	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF
1	Matthew Hague, C.-H. Luke Ong	Analysing Mu-Calculus Properties of Pushdown Systems.	SPIN	2010	DBLP DOI BibTeX RDF
1	Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre	Recursion Schemes and Logical Reflection.	LICS	2010	DBLP DOI BibTeX RDF	Collapsible Pushdown Automata, Monadic Second Order Logic and Mu-Calculus Global model checking, Parity Games, Recursion Schemes
1	C.-H. Luke Ong (eds.)	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	FOSSACS	2010	DBLP DOI BibTeX RDF
1	William Blum, C.-H. Luke Ong	The Safe Lambda Calculus	Logical Methods in Computer Science	2009	DBLP BibTeX RDF
1	Matthew Hague, C.-H. Luke Ong	Winning Regions of Pushdown Parity Games: A Saturation Method.	CONCUR	2009	DBLP DOI BibTeX RDF
1	Naoki Kobayashi, C.-H. Luke Ong	Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus.	ICALP	2009	DBLP DOI BibTeX RDF
1	David Hopkins, C.-H. Luke Ong	Homer: A Higher-Order Observational Equivalence Model checkER.	CAV	2009	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong, Nikos Tzevelekos	Functional Reachability.	LICS	2009	DBLP DOI BibTeX RDF
1	Naoki Kobayashi, C.-H. Luke Ong	A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes.	LICS	2009	DBLP DOI BibTeX RDF
1	Christopher H. Broadbent, C.-H. Luke Ong	On Global Model Checking Trees Generated by Higher-Order Recursion Schemes.	FOSSACS	2009	DBLP DOI BibTeX RDF	Collapsible Pushdown Automaton, Parity Game, Model Checking, Game Semantics, Recursion Scheme
1	Matthew Hague, C.-H. Luke Ong	Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems.	Logical Methods in Computer Science	2008	DBLP DOI BibTeX RDF
1	Matthew Hague, C.-H. Luke Ong	Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems	CoRR	2008	DBLP BibTeX RDF
1	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 TCS	2008	DBLP BibTeX RDF
1	Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre	Collapsible Pushdown Automata and Recursion Schemes.	LICS	2008	DBLP DOI BibTeX RDF	Higher-order pushdown automata, game semantics, higher-order recursion schemes
1	Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre	Winning Regions of Higher-Order Pushdown Games.	LICS	2008	DBLP DOI BibTeX RDF	higher-order pushdown automata, mu-calculus model-checking, parity games, higher-order recursion schemes
1	C.-H. Luke Ong	Verification of Higher-Order Computation: A Game-Semantic Approach.	ESOP	2008	DBLP DOI BibTeX RDF
1	William Blum, C.-H. Luke Ong	The Safe Lambda Calculus.	TLCA	2007	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong	Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes.	MFCS	2007	DBLP DOI BibTeX RDF
1	S. B. Sanjabi, C.-H. Luke Ong	Fully abstract semantics of additive aspects by translation.	AOSD	2007	DBLP DOI BibTeX RDF	aspect-oriented programming, translation, aspects, game semantics, full abstraction
1	Matthew Hague, C.-H. Luke Ong	Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems.	FoSSaCS	2007	DBLP DOI BibTeX RDF
1	Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong	Syntactic control of concurrency.	Theor. Comput. Sci.	2006	DBLP DOI BibTeX RDF
1	Andrzej S. Murawski, C.-H. Luke Ong	Fast verification of MLL proof nets via IMLL.	ACM Trans. Comput. Log.	2006	DBLP DOI BibTeX RDF	Multiplicative linear logic, disjoint union find, essential nets, dominator trees, proof nets
1	C.-H. Luke Ong	On Model-Checking Trees Generated by Higher-Order Recursion Schemes.	LICS	2006	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong	Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract).	CSL	2006	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF
1	Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiewicz	Idealized Algol with Ground Recursion, and DPDA Equivalence.	ICALP	2005	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong (eds.)	Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings	CSL	2005	DBLP BibTeX RDF
1	Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong	Safety Is not a Restriction at Level 2 for String Languages.	FoSSaCS	2005	DBLP DOI BibTeX RDF
1	Andrzej S. Murawski, C.-H. Luke Ong	On an interpretation of safe recursion in light affine logic.	Theor. Comput. Sci.	2004	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong, Pietro Di Gianantonio	Games characterizing Levy-Longo trees.	Theor. Comput. Sci.	2004	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong	An approach to deciding the observational equivalence of Algol-like languages.	Ann. Pure Appl. Logic	2004	DBLP DOI BibTeX RDF
1	Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong	Applying Game Semantics to Compositional Software Modeling and Verification.	TACAS	2004	DBLP DOI BibTeX RDF
1	Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong	Syntactic Control of Concurrency.	ICALP	2004	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF
1	Andrzej S. Murawski, C.-H. Luke Ong	Exhausting strategies, joker games and full completeness for IMLL with Unit.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
1	Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong	Adapting innocent game models for the Böhm treelambda -theory.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
1	Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong	Innocent game models of untyped lambda-calculus.	Theor. Comput. Sci.	2002	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong, Pietro Di Gianantonio	Games Characterizing Levy-Longo Trees.	ICALP	2002	DBLP DOI BibTeX RDF
1	Anindya Basu, C.-H. Luke Ong, April Rasala, F. Bruce Shepherd, Gordon T. Wilfong	Route oscillations in I-BGP with route reflection.	SIGCOMM	2002	DBLP DOI BibTeX RDF	I-BGP, route oscillations, route reflection, stability
1	C.-H. Luke Ong	Observational Equivalence of 3rd-Order Idealized Algol is Decidable.	LICS	2002	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong	Model Checking Algol-Like Languages Using Game Semantics.	FSTTCS	2002	DBLP DOI BibTeX RDF
1	Andrzej S. Murawski, C.-H. Luke Ong	Evolving Games and Essential Nets for Affine Polymorphism.	TLCA	2001	DBLP DOI BibTeX RDF	Full Completeness, Polymorphism, Linear Logic, Game Semantics
1	J. M. E. Hyland, C.-H. Luke Ong	On Full Abstraction for PCF: I, II, and III.	Inf. Comput.	2000	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong	Light Logic and Resource Bounded Computation.	APLAS	2000	DBLP BibTeX RDF
1	Andrzej S. Murawski, C.-H. Luke Ong	Dominator Trees and Fast Verification of Proof Nets.	LICS	2000	DBLP DOI BibTeX RDF	verification of proof nets, Linear Logic, dominator trees
1	Andrzej S. Murawski, C.-H. Luke Ong	Discreet Games, Light Affine Logic and PTIME Computation.	CSL	2000	DBLP DOI BibTeX RDF	PTIME, Complexity, Linear Logic, Game Semantics
1	Andrzej S. Murawski, C.-H. Luke Ong	Exhausting Strategies, Joker Games and IMLL with Units.	Electr. Notes Theor. Comput. Sci.	1999	DBLP DOI BibTeX RDF
1	Thong wei Koh, C.-H. Luke Ong	Internal Languages for Autonomous and *-Autonomous Categories.	Electr. Notes Theor. Comput. Sci.	1999	DBLP DOI BibTeX RDF
1	Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong	A Universal Innocent Game Model for the Böhm Tree Lambda Theory.	CSL	1999	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong, Charles A. Stewart	A Curry-Howard Foundation for Functional Computation with Control.	POPL	1997	DBLP DOI BibTeX RDF	ML
1	C.-H. Luke Ong	A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract).	LICS	1996	DBLP DOI BibTeX RDF
1	J. M. E. Hyland, C.-H. Luke Ong	Pi-Calculus, Dialogue Games and PCF.	FPCA	1995	DBLP BibTeX RDF
1	Samson Abramsky, C.-H. Luke Ong	Full Abstraction in the Lazy Lambda Calculus	Inf. Comput.	1993	DBLP DOI BibTeX RDF
1	J. M. E. Hyland, C.-H. Luke Ong	Modified Realizability Toposes and Strong Normalization Proofs.	TLCA	1993	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong	Non-Determinism in a Functional Setting	LICS	1993	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong, Eike Ritter	A Generic Strong Normalization Argument: Application to the Calculus of Constructions.	CSL	1993	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong	Lazy Lambda Calculus: Theories, Models and Local Structure Characterization (Extended Abstract).	ICALP	1992	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong	Fully Abstract Models of the Lazy Lambda Calculus	FOCS	1988	DBLP DOI BibTeX RDF	convergence testing, lazy lambda calculus, lazy languages, functional languages, proof theory, model theory, abstract models

Publications of "C.-H. Luke Ong" ( http://dblp.L3S.de/Authors/C.-H._Luke_Ong )