On global induction mechanisms in a μ-calculus with explicit approximations

RAIRO - Theoretical Informatics and Applications

Volumn 37, Issue 4, 2003, Pages 365-391

  Sprenger, Christoph ^a   Dam, Mads ^b  

^a INRIA   (France)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Approximants; Circular proofs; Global consistency condition; Inductive reasoning; Well foundedness; calculus

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FORMAL LOGIC; SEMANTICS; TREES (MATHEMATICS);

CIRCULAR PROOFS; INDUCTIVE REASONING;

AUTOMATA THEORY;

EID: 0942289456     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2003024     Document Type: Conference Paper

References (16)

1. T. Arts, M. Dam, L. Fredlund and D. Gurov, System description: Verification of distributed Erlang programs. Lecture Notes in Artificial Intelligence 1421 (1998) 38-41.
2. J. Bradfield and C. Stirling, Local model checking for infinite state spaces. Theor. Comput. Sci. 96 (1992) 157-174.
3. M. Dam, Proving properties of dynamic process networks. Inf. Comput. 140 (1998) 95-114.
4. M. Dam and D. Gurov, μ-calculus with explicit points and approximations. J. Logic Comput. 12 (2002) 43-57. Previously appeared in Fixed Points in Computer Science, FICS (2000).
5. M. Dam and D. Gurov, μ-calculus with explicit points and approximations. J. Logic Comput. 12 (2002) 43-57. Previously appeared in Fixed Points in Computer Science, FICS (2000).
6. E.A. Emerson and C.L. Lei, Modalities for model checking: branching time strikes back. Sci. Comput. Program. 8 (1987) 275-306.
7. L. Fredlund, A Framework for Reasoning about Erlang Code. Ph.D. thesis, Royal Institute of Technology, Stockholm, Sweden (2001).
8. D. Kozen, Results on the propositional μ-calculus. Theor. Comput. Sci. 27 (1983) 333-354.
9. D. Niwiński and I. Walukiewicz, Games for the μ-calculus. Theor. Comput. Sci. 163 (1997) 99-116.
10. D. Park, Finiteness is mu-ineffable. Theor. Comput. Sci. 3 (1976) 173-181.
11. S. Safra, On the complexity of ω-automata, in 29th IEEE Symposium on Foundations of Computer Science (1988) 319-327.
12. U. Schöpp, Formal verification of processes. Master's thesis, University of Edinburgh (2001)
13. U. Schöpp and A. Simpson, Verifying temporal properties using explicit approximants: Completeness for context-free processes, in Foundations of Software Science and Computational Structures (FoSSaCS 02), Grenoble, France. Springer, Lecture Notes in Comput. Sci. 2303 (2002) 372-386.
14. C. Sprenger and M. Dam, On the structure of inductive reasoning: Circular and tree-shaped proofs in the μ-calculus, Foundations of Software Science and Computational Structures (FoSSaCS 03), Warsaw, Poland, April 7-11 2003. A. Gordon, Springer, Lecture Notes in Comput. Sci. 2620 (2003) 425-440.
15. C. Stirling and D. Walker, Local model checking in the modal μ-calculus. Theor. Comput. Sci. 89 (1991) 161-177.
16. W. Thomas, Automata on infinite objects. J. van Leeuwen, Elsevier Science Publishers, Amsterdam, Handb. Theor. Comput. Sci. B (1990) 133-191.