When not losing is better than winning: Abstraction and refinement for the full μ-calculus

Information and Computation

Volumn 205, Issue 8, 2007, Pages 1130-1148

  Grumberg, Orna ^a   Lange, Martin ^b   Leucker, Martin ^c   Shoham, Sharon ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b AARHUS UNIVERSITY   (Denmark)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; CALCULATIONS; COMPUTATIONAL COMPLEXITY; SEMANTICS; TEMPORAL LOGIC;

3-VALUED MODELING; 3-VALUED SEMANTICS; ABSTRACTION REFINEMENT; DIRECT ALGORITHMS; GAME-BASED APPROACHES; MU-CALCULUS; PARITY GAMES;

MODEL CHECKING;

EID: 84855193509     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2006.10.009     Document Type: Article

References (31)

1. E. Clarke, O. Grumberg, D. Peled, Model Checking, MIT Press, Cambridge, 1999.
2. G. Bruns, P. Godefroid, Model checking partial state spaces with 3-valued temporal logics, in: in: N. Halbwachs, D. Peled (Eds.), Computer Aided Verification, 11th International Conference, CAV'99, vol. 1633 of Lecture Notes in Computer Science, Springer, Berlin, 1999, pp. 274-287.
3. M. Huth, R. Jagadeesan, D. Schmidt, Modal transition systems: A foundation for three-valued program analysis. in: European Symposium on Programming (ESOP), vol. 2028 of Lecture Notes in Computer Science, 2001, pp. 155-169. (Pubitemid 33256357)
4. P. Godefroid, R. Jagadeesan. On the expressiveness of 3-valued models. in: Verification, Model Checking and Abstract Interpretation (VMCAI), vol. 2575 of Lecture Notes in Computer Science, 2003, pp. 206-222.
5. S. Shoham, O. Grumberg. A game-based framework for CTL counterexamples and 3-valued abstraction-refinemnet. in: Computer Aided Verification (CAV), vol. 2725 of Lecture Notes in Computer Science, 2003, pp. 275-287.
6. O. Grumberg, M. Lange, M. Leucker, S. Shoham. Don't know in the μ-calculus. in: 6th international conference on Verification, Model Checking and Abstract Interpretation (VMCAI'05), vol. 3385 of Lecture Notes in Computer Science, Paris, France, 2005, pp. 233-249.
7. E. A. Emerson, C. S. Jutla, A. P. Sistla. On model-checking for fragments of mu-calculus. in: Computer-Aided Verification, vol. 697 of Lecture Notes in Computer Science, 1993, pp. 385-396.
8. M. Jurdzinski. Small progress for solving parity games. in: STACS, vol. 1770 of Lecture Notes in Computer Science, 2000, pp. 290-301.
9. D. Kozen, Results on the propositional μ-calculus, Theoretical Computer Science 27(1983) 333-354.
10. 20 states and beyond, Information and Computation 98(2) (1992) 142-170.
11. E. Emerson, C. Lei, Efficient model checking in fragments of the propositional μ-calculus, in: Symposion on Logic in Computer Science (LICS), IEEE Computer Society Press, Washington, D. C., USA, 1986, pp. 267-278. (Pubitemid 17563576)
12. C. Stirling, D. J. Walker. Local model checking in the modal mu-calculus. in: TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, vol. 351 of Lecture Notes in Computer Science, 1989, pp. 369-383.
13. G. Winskel. Model checking in the modal V-calculus. in: International Colloquium on Automata, Languages, and Programming (ICALP), vol. 372 of Lecture Notes in Computer Science, 1989, pp. 761-772.
14. R. Cleaveland, Tableau-based model checking in the propositional mu-calculus, Acta Inf. 27(1990) 725-747.
15. D. Long, A. Browne, E. Clark, S. Jha, W. Marrero. An improved algorithm for the evaluation of fixpoint expressions. in: Computer Aided Verification, (CAV), vol. 818 of Lecture Notes in Computer Science, 1994, pp. 338-350.
16. C. Stirling, Modal and Temporal Properties of Processes, Springer, Berlin, 2001.
17. P. Godefroid, R. Jagadeesan. Automatic abstraction using generalized model checking. in: Computer-Aided Verification (CAV), vol. 2404 of Lecture Notes in Computer Science, 2002, pp. 137-150.
18. P. Cousot, R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction of approximation of fixed points. in: ACM Symposium on Principles of Programming Languages, 1977, pp. 238-252.
19. D. Dams, R. Gerth, O. Grumberg. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems (TOPLAS), 19(2).
20. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, S. Bensalem, Property preserving abstractions for the verification of concurrent systems, Form. Method. Syst. Des. 6(1995) 11-45.
21. A. Tarski, Alattice-theoretical fixpoint theorem and its application, Pacific J. Math. 5(1955) 285-309.
22. C. Stirling. Local model checking games. in: Concurrency Theory (CONCUR), vol. 962 of Lecture Notes in Computer Science, 1995, pp. 1-11.
23. E. Emerson, C. Jutla, Tree automata, mu-calculus and determinacy, in: Proc 32th Symp on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Washington, D. C., USA, 1991, pp. 368-377.
24. E. Clarke, A. Gupta, J. Kukula, O. Strichman. SAT based abstraction-refinement using ILP and machine learning techniques. in: Computer-Aided Verification (CAV), vol. 2404 of Lecture Notes in Computer Science, 2002, pp. 265-279.
25. E. Clarke, O. Grumberg, S. Jha, Y. Lu, H. Veith. Counterexample-guided abstraction refinement. in: Computer Aided Verification (CAV), vol. 1855 of Lecture Notes in Computer Science, 2000 pp. 154-169.
26. K. Namjoshi. Abstraction for branching time properties. in: Computer Aided Verification (CAV'03), vol. 2725 of LNCS, 2003, pp. 288-300.
27. S. Shoham, O. Grumberg. Monotonic abstraction-refinement for CTL. in: Tools and Algorithms for the Construction and Analysis of Systems (TACAS), vol. 2988 of LNCS 2004, pp. 546-560.
28. D. Dams, K. Namjoshi. The existence of finite abstractions for branching time model checking. in: IEEE Symposium on Logic in Computer Science (LICS), 2004, pp. 335-344.
29. L. de Alfaro, P. Godefroid, R. Jagadeesan. Three-valued abstractions of games: uncertainty, but with precision. in: IEEE Symposium on Logic in Computer Science (LICS), 2004, pp. 170-179.
30. D. Dams, K. S. Namjoshi. Automata as abstractions. in: Verification, Model Checking and Abstract Interpretation (VMCAI'05), vol. 3385 of Lecture Notes in Computer Science, 2005, pp. 216-232. (Pubitemid 41231363)
31. K. Larsen, L. Xinxin. Equation solving using modal transition systems. in: IEEE Symp. on Logic in Computer Science (LICS), 1990, pp. 108-117.