On Model-Checking Trees Generated by Higher-Order Recursion Schemes

Authors:
C.-H. L. Ong
Affiliations:
Oxford University, UK
Venue:
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Year:
2006

Citing 0
Cited 51

Model-Checking Games for Typed λ-Calculi

Electronic Notes in Theoretical Computer Science (ENTCS)
Games, Automata and Matching

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Types and higher-order recursion schemes for verification of higher-order programs

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dependency Tree Automata

FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes

FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Recognizability in the Simply Typed Lambda-Calculus

WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Model-checking higher-order functions

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Types and Recursion Schemes for Higher-Order Program Verification

APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Dependent types from counterexamples

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Higher-order multi-parameter tree transducers and recursion schemes for program verification

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Symbolic backwards-reachability analysis for higher-order pushdown systems

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
The safe lambda calculus

TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Verification of higher-order computation: a game-semantic approach

ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
An automata-theoretic approach to infinite-state systems

Time for verification
Automated termination proofs for haskell by term rewriting

ACM Transactions on Programming Languages and Systems (TOPLAS)
Verifying higher-order functional programs with pattern-matching algebraic data types

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verification of tree-processing programs via higher-order model checking

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes

FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Predicate abstraction and CEGAR for higher-order model checking

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Krivine machines and higher-order schemes

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
HMC: verifying functional programs using abstract interpreters

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Hybrid contract checking via symbolic simplification

PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Functional programs as compressed data

PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Some results on a game-semantic approach to verifying finitely-presentable infinite structures (extended abstract)

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
A finite semantics of simply-typed lambda terms for infinite runs of automata

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Higher-order program verification and language-based security

ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
Complexity bounds for the verification of real-time software

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Introduction to decidability of higher-order matching

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Untyped recursion schemes and infinite intersection types

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Exact flow analysis by higher-order model checking

FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On the Significance of the Collapse Operation

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
A saturation method for collapsible pushdown systems

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Two-level game semantics, intersection types, and recursion schemes

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Introspective pushdown analysis of higher-order programs

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
A traversal-based algorithm for higher-order model checking

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Simple models for recursive schemes

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Hierarchies of infinite structures generated by pushdown automata and recursion schemes

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Recursive schemes, krivine machines, and collapsible pushdown automata

RP'12 Proceedings of the 6th international conference on Reachability Problems
A context-free linear ordering with an undecidable first-order theory

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
An intersection type system for deterministic pushdown automata

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Towards a scalable software model checker for higher-order programs

PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
Program certification by higher-order model checking

CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
Model-Checking higher-order programs with recursive types

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Model Checking Higher-Order Programs

Journal of the ACM (JACM)
C-SHORe: a collapsible approach to higher-order verification

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
The IO and OI hierarchies revisited

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Proof systems for retracts in simply typed lambda calculus

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
A type-directed abstraction refinement approach to higher-order model checking

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Pumping by Typing

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The UCLID project seeks to develop formal verification tools for infinite-state systems having a degree of automation comparable to that of model checking tools for finitestate systems. The UCLID modeling language describes systems where the state variables ...