A game-based framework for CTL counterexamples and 3-valued abstraction-refinement

ACM Transactions on Computational Logic

Volumn 9, Issue 1, 2007, Pages

  Shoham, Sharon ^a   Grumberg, Orna ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

3 valued semantics; Abstraction refinement; Counterexamples; CTL; Model checking games; Temporal logic

Indexed keywords

ABSTRACT MODELS; ABSTRACTION-REFINEMENT; COUNTEREXAMPLES; MODEL CHECKING GAMES;

ALGORITHMS; GAME THEORY; OPTIMIZATION; PROBLEM SOLVING; SEMANTICS; TEMPORAL LOGIC;

MODEL CHECKING;

EID: 37049004150     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1297658.1297659     Document Type: Article

References (47)

1. ASTEROTH, A., BAIER, C., AND ASSMANN, U. 2001. Model checking with formula-dependent abstract models. In Proceedings of the International Conference on Computer-Aided Verification (CAV). Lecture Notes in Computer Science, vol. 2102, 155-168.
2. BARNER, S., GEIST, D., AND GRINOAUZE, A. 2002. Symbolic localization reduction with reconstruction layering and backtracking. In Proceedings of the International Conference on Computer-Aided Verification (CAV). Copenhagen, Denmark.
3. BOLLIG, B., LEUCKER, M., AND WEBER, M. 2002. Local parallel model checking for the alternation-free mu-calculus. In Proceedings of the 9th International SPIN Workshop on Model Checking of Software. Springer-Verlag Inc.
4. BRUNS, G. AND GODEFROID, P. 1999. Model checking partial state spaces with 3-valued temporal logics. In Proceedings of the International Conference on Computer-Aided Verification. 274-287.
5. BRUNS, G. AND GODEFROID, P. 2000. Generalized model checking: Reasoning about partial state spaces. In Proceedings of the International Conference on Concurrency Theory (CONCUR'00). Lecture Notes in Computer Science, vol. 1877, 168-182.
6. CHAUHAN, P., CLARKE, E., KUKULA, J., SAPRA, S., VEITH, H., AND D.WANG. 2002. Automated abstraction refinement for model checking large state spaces using sat based conflict analysis. In Proceedings of Formal Methods in Computer-Aided Design (FMCAD).
7. CHECHIK, M., DEVEREUX, B., AND EASTERBROOK, S. 2001. Implementing a multi-valued symbolic model checker. In Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). 404-419.
8. CHECHIK, M., GURPINKEL, A., AND DEVEREUX, B. 2002. chi-chek: A multivalued model-checker. In Proceedings of the International Conference on Computer-Aided Verification (CAV). 505-509.
9. CLARKE, E. AND EMERSON, E. 1981. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Proceedings of the Workshop on Logics of Programs, vol. 131, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 52-71.
10. CLARKE, E., GRUMBERG, O., JHA, S., LU, Y., AND VEITH, H. 2000. Counterexample-guided abstraction refinement. In Proceedings of the 12th International Conference on Computer-Aided Verification (CAV).
11. CLARKE, E., GRUMBERG, O., MCMILLAN, K., AND ZHAO, X. 1995. Efficient generation of counterexamples and witnesses in symbolic model checking. In Proceedings of the 32nd Design Automation Conference (DAC). IEEE Computer Society Press.
12. CLARKE, E., GRUMBERG, O., AND PELED, D. 1999. Model Checking. MIT Press.
13. CLARKE, E., GUPTA, A., KUKULA, J., AND STRICHMAN, O. 2002. SAT based abstraction-refinement using ILP and machine leraning techniques. In Proceedings of the International Conference on Computer-Aided Verification (CAV). Copenhagen, Denmark.
14. CLARKE, E., JHA, S., LU, Y., AND VEITH, H. 2002. Tree-like counterexamples in model checking. In Proceedings of the 17th Annual IEEE Symposium on Logic In Computer Science (LICS). Copenhagen, Denmark.
15. COUSOT, P. AND COUSOT, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the ACM Symposium on Principles of Programming Languages (POPL). Los Angeles, CA, 238-252.
16. DAMS, D., GERTH, R., AND GRUMBERG, O. 1997. Abstract interpretation of reactive systems. ACM Trans. Program. Lang. Syst. 19, 2 (March).
17. DAS, S., DILL, D., AND PARK, S. 1999. Experience with predicate abstraction. In Proceedings of the Conference on Computer-Aided Verification. 160-171.
18. EISNER, C., FISMAN, D., HAVLICEK, J., LUSTIG, Y., MCISAAC, A., AND CAMPENHOUT, D. V. 2003. Reasoning with temporal logic on truncated paths. In Proceedings of the loth International Conference on Computer Aided Verification (CAV). Lecture Notes in Computer Science, vol. 2725. Springer, 27-39.
19. EMERSON, E. AND CLARKE, E. 1982. Using branching time logic to synthesize synchronization skeletons. Sci. Comput. Program. 2, 241-266.
20. GODEFROID, P., HUTH, M., AND JAGADEESAN, R. 2001. Abstraction-based model checking using modal transition systems. In Proceedings of International Conference on Concurrency Theory (CONCUR'01).
21. GODEFROID, P. AND JAGADEESAN, R. 2002. Automatic abstraction using generalized model checking. In Proceedings of the Conference on Computer-Aided Verification (CAV). Lecture Notes in Computer Science, vol. 2404. Springer Verlag, 137-150.
22. GODEFROID, P. AND JAGADEESAN, R. 2003. On the expressiveness of 3-valued models. In Proceedings of the 4th Conference on Verification, Model Checking and Abstract Interpretation (VMCA). Lecture Notes in Computer Science, vol. 2575. Springer-Verlag, 206-222.
23. GOVINDARAJU, S. AND DILL, D. 1998. Verification by approximate forward and backward reachability. In Proceedings of the International Conference on Computer-Aided Design. 366-370.
24. GRAF, S. AND SAIDI, H. 1997. Construction of abstract state graphs with PVS. In Proceedings of the Conference on Computer-Aided Verification (CAV). Lecture Notes in Computer Science, vol. 1254. Springer-Verlag, 72-83.
25. GURFINKEL, A. AND CHECHIK, M. 2003a. Generating counterexamples for multivalued modelchecking. In Proceedings of the IEEE International Symposium on Formal Methods Europe (FME'03). 503-521.
26. GURFINKEL, A. AND CHECHIK, M. 2003b. Proof-like counter-examples. In Proceedings of the Work-shop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'03).
27. HENZINGER, T, JHALA, R., MAJUMDAR, R., AND SUTRE, G. 2002. Lazy abstraction. In Proceedings of the 29th ACM SIOPLAN-SIOACT Symposium on Principles of Programming Languages (POPL). ACM Press, Portland, Oregon, 58-70.
28. HUTH, M., JAGADEESAN, R., AND SCHMIDT, D. 2001. Modal transition systems: A foundation for three-valued program analysis. In Proceedings of the European Symposium on Programming (ESOP). Lecture Notes in Computer Science, vol. 2028, 155-169.
29. KUPFERMAN, O., VARDI, M., AND WOLPER, P. 2000. An automata-theoretic approach to branching-time model checking. J. ACM 47, 2, 312-360.
30. KURSHAN, R. 1994. Computer-Aided-Verification of Coordinating Processes. Princeton University Press.
31. LARSEN, K. AND THOMSEN, B. 1988. A modal process logic. In Proceedings of 3rd Annual Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, 203-210.
32. LARSEN, K. G. 1989. Modal specifications. In Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems. Grenoble, France. J. Sifakis, Ed. Lecture Notes in Computer Science, vol. 407. Springer-Verlag.
33. LEE, W., PARDO, A., JANG, J., HACHTEL, G., AND SOMENZI, F. 1996. Tearing based automatic abstraction for CTL model checking. In Proceedings of the International Conference on Computer-Aided Design (ICCAD). 76-81.
34. LEUCKER, M. 1999. Model checking games for the alternation free mu-calculus and alternating automata. In Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR99).
35. LICHTENSTEIN, O. AND PNUELI, A. 1985. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the 12th Annual ACM Symposium on Principles of Programming Languages. 97-107.
36. LIND-NIELSEN, J. AND ANDERSEN, H. 1999. Stepwise CTL model checking of state/event systems. In Computer Aided Verification. 316-327.
37. LOISEAUX, C., GRAF, S., SIFAKIS, J., BOUAJJANI, A., AND BENSALEM, S. 1995. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design 6, 11-45.
38. NAMJOSHI, K. 2001. Certifying model checkers. In Proceedings of the 13th Conference on Computer Aided Verification (CAV). Lecture Notes in Computer Science, vol. 2102. Springer-Verlag.
39. NAMJOSHI, K. AND KURSHAN, R. 2000. Syntactic program transformations for automatic abstraction. In Proceedings of Conference on Computer-Aided Verification (CAV). Lecture Notes in Computer Science, vol. 1855. Springer, 435-449.
40. PARDO, A. AND HACHTEL, G. 1997. Automatic abstraction techniques for propositional mucalculus model checking. In Computer Aided Verification. 12-23.
41. PARDO, A. AND HACHTEL, G. 1998. Incremental CTL model checking using BDD subsetting. In Proceedings of the Design Automation Conference. 457-462.
42. QUIELLE, J. AND SIFAKIS, J. 1982. Specification and verification of concurrent systems in CESAR. In Proceedings of the International Symposium on Programming. Lecture Notes in Computer Science, vol. 137. Springer Verlag, 337-351.
43. SAIDI, H. 2000. Model checking guided abstraction and analysis. In Proceedings of the 7th International Static Analysis Symposium (SAS). Santa Barbara, CA.
44. SAIDI, H. AND SHANKAR, N. 1999. Abstract and model check while you prove. In Proceedings of the 11th International Conference on Computer-Aided Verification (CAV). Trento, Italy.
45. SHOHAM, S. 2003. A game-based framework for CTL counterexamples and abstractionrefinement. M.S. thesis, Department of Computer Science, Technion-Israel Institute of Technology.
46. STIRLING, C. 2001. Modal and Temporal Properties of Processes. Springer-Verlag.
47. TAN, L. AND CLEAVELAND, R. 2002. Evidence-based model checking. In Proceedings of the 14th Conference on Computer Aided Verification (CAV). Lecture Notes in Computer Science, vol. 2404. Springer Verlag, 455-470.