On Model-Checking Trees Generated by Higher-Order Recursion Schemes
Author:
Top Cited Papers
- 22 September 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 81-90
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 ...Keywords
This publication has 5 references indexed in Scilit:
- A Game-Theoretic Approach to Deciding Higher-Order MatchingLecture Notes in Computer Science, 2006
- A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of AutomataLecture Notes in Computer Science, 2006
- Tree automata, mu-calculus and determinacy2002
- On Full Abstraction for PCF: I, II, and IIIInformation and Computation, 2000
- The theory of ends, pushdown automata, and second-order logicTheoretical Computer Science, 1985