Automata, Logic and Games for the λ-Calculus

Automata, logic and games provide the mathematical theory that underpins the model checking of reactive systems.

[1]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[2]  C.-H. Luke Ong,et al.  Verifying higher-order functional programs with pattern-matching algebraic data types , 2011, POPL '11.

[3]  C.-H. Luke Ong,et al.  On Model-Checking Trees Generated by Higher-Order Recursion Schemes , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[4]  C.-H. Luke Ong,et al.  Functional Reachability , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[5]  Pawel Urzyczyn,et al.  Higher-Order Pushdown Trees Are Easy , 2002, FoSSaCS.

[6]  Colin Stirling,et al.  Dependency Tree Automata , 2009, FoSSaCS.

[7]  Naoki Kobayashi,et al.  Predicate abstraction and CEGAR for higher-order model checking , 2011, PLDI '11.

[8]  C.-H. Luke Ong,et al.  A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[9]  Naoki Kobayashi,et al.  Model Checking Higher-Order Programs , 2013, JACM.

[10]  Dana S. Scott,et al.  A Type-Theoretical Alternative to ISWIM, CUCH, OWHY , 1993, Theor. Comput. Sci..

[11]  C.-H. Luke Ong,et al.  A type-directed abstraction refinement approach to higher-order model checking , 2014, POPL.

[12]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[13]  E. Allen Emerson,et al.  An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus , 1989, Inf. Comput..

[14]  Igor Walukiewicz.  Pushdown Processes: Games and Model-Checking , 2001, Inf. Comput..

[15]  C.-H. Luke Ong,et al.  Higher-Order Model Checking: An Overview , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[16]  R. Platek.  Foundations of recursion theory , 1966 .

[17]  Suresh Jagannathan,et al.  CompCertTSO: A Verified Compiler for Relaxed-Memory Concurrency , 2013, JACM.

[18]  Andrzej S. Murawski,et al.  Böhm Trees as Higher-Order Recursive Schemes , 2013, FSTTCS.

[19]  Pierre Wolper,et al.  An automata-theoretic approach to branching-time model checking , 2000, JACM.

[20]  E. Emerson,et al.  Tree Automata, Mu-Calculus and Determinacy (Extended Abstract) , 1991, FOCS 1991.

[21]  C.-H. Luke Ong,et al.  Compositional higher-order model checking via ω-regular games over Böhm trees , 2014, CSL-LICS.