C.H. Luke Ong
According to our database^{1},
C.H. Luke Ong
authored at least 114 papers
between 1988 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2021
CoRR, 2021
2020
CoRR, 2020
CoRR, 2020
HigherOrder Recursion Schemes and Collapsible Pushdown Automata: Logical Properties.
CoRR, 2020
CoRR, 2020
Proceedings of the Proceedings 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis, 2020
Densities of almostsurely terminating probabilistic programs are differentiable almost everywhere.
CoRR, 2020
A Differentialform Pullback Programming Language for Higherorder Reversemode Automatic Differentiation.
CoRR, 2020
Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020
2019
ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States.
ACM Trans. Program. Lang. Syst., 2019
CoRR, 2019
HoCHC: A Refutationally Complete and Semantically Invariant System of Higherorder Logic Modulo Theories.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019
Proceedings of the Logics in Artificial Intelligence  16th European Conference, 2019
Proceedings of the Foundations of Software Science and Computation Structures, 2019
Fixing Incremental Computation  Derivatives of Fixpoints, and the Recursive Semantics of Datalog.
Proceedings of the Programming Languages and Systems, 2019
2018
Proc. ACM Program. Lang., 2018
Inf. Comput., 2018
CoRR, 2018
Artif. Intell., 2018
InterpChecker: Reducing State Space via Interpolations  (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2018
Species, Profunctors and Taylor Expansion Weighted by SMCC: A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018
2017
ACM Trans. Comput. Log., 2017
CoRR, 2017
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017
Quantitative semantics of the lambda calculus: Some generalisations of the relational model.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017
Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering, 2017
Proceedings of the Logic and Its Applications  7th Indian Conference, 2017
Proceedings of the Programming Languages and Systems, 2017
Deciding Secrecy of Security Protocols for an Unbounded Number of Sessions: The Case of DepthBounded Processes.
Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017
2016
NII Shonan Meet. Rep., 2016
Information flow analysis for a dynamically typed language with staged metaprogramming.
J. Comput. Secur., 2016
Proceedings of the 43rd Annual ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, 2016
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016
Proceedings of the Programming Languages and Systems, 2016
2015
Theor. Comput. Sci., 2015
CoRR, 2015
CoRR, 2015
CoRR, 2015
Proceedings of the 2015 ACM SIGPLAN International Conference on ObjectOriented Programming, 2015
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015
Proceedings of the Language and Automata Theory and Applications, 2015
Proceedings of the Foundations of Software Science and Computation Structures, 2015
2014
Innocent Strategies are Sheaves over Plays  Deterministic, Nondeterministic and Probabilistic Innocence.
CoRR, 2014
CoRR, 2014
Proceedings of the 2014 International Symposium on Model Checking of Software, 2014
Proceedings of the 41st Annual ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, 2014
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014
Compositional higherorder model checking via <i>ω</i>regular games over Böhm trees.
Proceedings of the Joint Meeting of the TwentyThird EACSL Annual Conference on Computer Science Logic (CSL) and the TwentyNinth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014
2013
Information Flow Analysis for a Dynamically Typed Functional Language with Staged Metaprogramming
CoRR, 2013
Proceedings of the Static Analysis  20th International Symposium, 2013
Proceedings of the Language and Automata Theory and Applications, 2013
Proceedings of the CONCUR 2013  Concurrency Theory  24th International Conference, 2013
2012
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2012
Proceedings of the Automata, Languages, and Programming  39th International Colloquium, 2012
Proceedings of the Computer Aided Verification  24th International Conference, 2012
Proceedings of the 2nd edition on Programming systems, 2012
2011
Automated Techniques for HigherOrder Program Verification (NII Shonan Meeting 20115).
NII Shonan Meet. Rep., 2011
Inf. Comput., 2011
Complexity of Model Checking Recursion Schemes for Fragments of the Modal MuCalculus
Log. Methods Comput. Sci., 2011
Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011
Verifying higherorder functional programs with patternmatching algebraic data types.
Proceedings of the 38th ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, 2011
Proceedings of the Automata, Languages and Programming  38th International Colloquium, 2011
2010
Models of HigherOrder Computation: Recursion Schemes and Collapsible Pushdown Automata.
Proceedings of the Logics and Languages for Reliability and Security, 2010
A Saturation Method for the Modal MuCalculus with Backwards Modalities over Pushdown Systems
CoRR, 2010
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010
Proceedings of the Model Checking Software, 2010
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010
2009
Log. Methods Comput. Sci., 2009
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009
A Type System Equivalent to the Modal MuCalculus Model Checking of HigherOrder Recursion Schemes.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009
Proceedings of the Foundations of Software Science and Computational Structures, 2009
Proceedings of the CONCUR 2009  Concurrency Theory, 20th International Conference, 2009
Proceedings of the Computer Aided Verification, 21st International Conference, 2009
2008
Log. Methods Comput. Sci., 2008
Proceedings of the TwentyThird Annual IEEE Symposium on Logic in Computer Science, 2008
Proceedings of the Programming Languages and Systems, 2008
2007
Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007
Proceedings of the 6th International Conference on AspectOriented Software Development, 2007
2006
ACM Trans. Comput. Log., 2006
Theor. Comput. Sci., 2006
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006
Some Results on a GameSemantic Approach to Verifying FinitelyPresentable Infinite Structures (Extended Abstract).
Proceedings of the Computer Science Logic, 20th International Workshop, 2006
2005
The Monadic Second Order Theory of Trees Given by Arbitrary LevelTwo Recursion Schemes Is Decidable.
Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005
Proceedings of the Foundations of Software Science and Computational Structures, 2005
2004
Theor. Comput. Sci., 2004
Theor. Comput. Sci., 2004
Ann. Pure Appl. Log., 2004
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004
2003
Theor. Comput. Sci., 2003
Theor. Comput. Sci., 2003
2002
Theor. Comput. Sci., 2002
Proceedings of the ACM SIGCOMM 2002 Conference on Applications, 2002
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002
Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002
2001
Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001
2000
Inf. Comput., 2000
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000
Proceedings of the Computer Science Logic, 2000
Light Logic and Resource Bounded Computation.
Proceedings of the First Asian Workshop on Programming Languages and Systems, 2000
1999
Proceedings of the Conference on Category Theory and Computer Science, 1999
Proceedings of the Conference on Category Theory and Computer Science, 1999
Proceedings of the Computer Science Logic, 13th International Workshop, 1999
1997
Proceedings of the Conference Record of POPL'97: The 24th ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, 1997
1996
A Semantic View of Classical Proofs: TypeTheoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract).
Proceedings of the Proceedings, 1996
1995
Proceedings of the seventh international conference on Functional programming languages and computer architecture, 1995
1993
Inf. Comput., August, 1993
Proceedings of the Typed Lambda Calculi and Applications, 1993
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993
A Generic Strong Normalization Argument: Application to the Calculus of Constructions.
Proceedings of the Computer Science Logic, 7th Workshop, 1993
1992
Lazy Lambda Calculus: Theories, Models and Local Structure Characterization (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992
1988
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988