Verifying temporal properties using explicit approximants: Completeness for context-free processes (2002)

by Alex Simpson
Venue:In FOSSACS '02
Citations:5 - 0 self

Documents Related by Co-Citation

16 On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the µ-Calculus – Christoph Sprenger, Mads Dam - 2003
510 P.: An automata-theoretic approach to automatic program verification – M Y Vardi, Wolper - 1986
48 Hauptsatz for the intuitionistic theory of iterated inductive definitions – P Martin-Löf - 1971
158 An introduction to inductive definitions – P Aczel - 1977
9 calculus with explicit points and approximations – Mads Dam, Dilian Gurov
5 Finiteness is mu-ineable – David Park - 1976
2 Formal verication of processes – Ulrich Schpp - 2001
12 Local model checking in the modal -calculus – Colin Stirling, David Walker - 1991
19 A Framework for Reasoning about Erlang Code – L Fredlund - 2001
259 Results on the propositional _-calculus – D Kozen - 1983
2 and Dilian Gurov. µ-calculus with explicit points and approximations – Mads Dam - 2002
2 Formal Verification of Processes – Ulrich Schöpp - 2001
7 A Note on Global Induction Mechanisms in a µ-Calculus with Explicit Approximations – Christoph Sprenger, Mads Dam - 1999
9 A Calculus of Infinite Constructions and its application to the verification of communicating systems – E Giménez - 1996
3 Poítin: Distilling theorems from conjectures – Geoff Hamilton - 2005
41 Local Model Checking for Infinite State Spaces – J C Bradfield, C Stirling - 1991
78 Automating the Meta Theory of Deductive Systems – Carsten Schurmann, Dana Scott - 2000
66 Infinite Objects in Type Theory – Thierry Coquand
155 The Concept of a Supercompiler – Valentin F. Turchin - 1986