Refining Model Checking by Abstract Interpretation

Automated Software Engineering

Volumn 6, Issue 1, 1999, Pages 69-95

  Cousot, Patrick ^a,b   Cousot, Radhia ^a,b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Abstract interpretation; Model checking; Static analysis; Transition system; Universal safety

Indexed keywords

COMPUTER SOFTWARE SELECTION AND EVALUATION; LINGUISTICS;

ABSTRACT INTERPRETATION; ABSTRACT TRANSITION SYSTEMS; MODEL CHECKING;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 0032672388     PISSN: 09288910     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008649901864     Document Type: Article

References (44)

1. Akers, S., 1978. Binary decision diagrams. IEEE Trans. Comput. C-27, 6, 509-516.
2. Bouajjani, A., Fernandez, J.-C., Halbwachs, N., Raymond, P., and Ratel, C., 1992. Minimal state graph generation. Sci. Comput. Prog. 18, 247-269.
3. Bourdoncle, F., 1993. Abstract Debugging of Higher-Order Imperative Languages. In Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM Press, 46-55.
4. Bryant, R., 1986. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. C-35, 8, 677-691.
5. 20 states and beyond. Inf. & Comp. 98, 2, 142-170.
6. Campos, S., Clarke, E., Marrero, W., and Minea, M., 1995. Verus: A tool for quantitative analysis of finite-state real-time systems. In Proc. ACM SIGPLAN 1995 Workshop on Languages, Compilers & Tools for Real-Time Systems, 75-83.
7. Clarke, E., and Emerson, E., 1981. Synthesis of synchronization skeletons for branching time temporal logic. In Logics of Programs: Workshop, LNCS 131, Springer-Verlag.
8. Clarke, E., Emerson, E., and Sistla, A., 1983. Automatic verification of finite-state concurrent systems using temporal logic specifications. In 10th POPL (1983) and Trans. Prog. Lang. Sys., 8:244-263 (1986). ACM Press.
9. Clarke, E., Grumberg, O., and Long, D., 1992. Model checking abstraction. In 19th POPL, 343-354. ACM Press.
10. Cleaveland, R., Iyer, P., and Yankelevitch, D., 1995. Optimality in abstractions of model-checking. In A. Mycroft Ed., Proc. SAS '95, LNCS 983, 51-63. Springer-Verlag.
11. Coudert, O., Berthet, C., and Madre, J., 1990. Verification of synchronous sequential machines based on symbolic execution. In J. Sifakis Ed., Proc. Int. Work. on Automatic Verification Methods for Finite State Systems, LNCS 407, 365-373. Springer-Verlag.
12. Coudert, O., Madre, J., and Berthet, C., 1990. Verifying temporal properties of sequential machines without building their state diagrams. In E. Clarke and R. Kurshan, Eds., Computer Aided Verification '90, Number 3 in DIMACS Volume Series, 75-84. AMS.
13. Cousot, P., 1978. Méthodes itératives de construction et d'approximation de points fixes d'opérateurs monotones sur un treillis, analyse sémantique de programmes. Ph. D. thesis, Université scientifique et médicale de Grenoble, Grenoble, FRA.
14. Cousot, P., 1981. Semantic foundations of program analysis. In S. Muchnick and N. Jones Eds., Program Flow Analysis: Theory and Applications, Chapter 10, 303-342. Prentice-Hall.
15. Cousot, P., 1995. Abstract model-checking, invited lecture. In 7th Int. Conf. CAV '95 (Liège, BEL, 5 jul 1995).
16. Cousot, P., 1996. Abstract interpretation. Symposium on Models of Programming Languages and Computation, ACM Comput. Surv. 28, 2, 324-328.
17. Cousot, P. and Cousot, R., 1977. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th POPL, 238-252. ACM Press.
18. Cousot, R and Cousot, R., 1979. Systematic design of program analysis frameworks. In 6th POPL, 269-282. ACM Press.
19. Cousot, P. and Cousot, R., 1992a.* Abstract interpretation and application to logic programs. J. Logic Prog. 13, 2-3, 103-179.
20. Cousot, P. and Cousot, R., 1992b. Abstract interpretation frameworks. J. Logic and Comp. 2, 4 (aug), 511-547.
21. Cousot, P. and Cousot, R., 1992c. Comparing the Galois connection and widening/narrowing approaches to abstract interpretation, invited paper. In M. Bruynooghe and M. Wirsing Eds., Proc. Int. Work. PLILP '92, LNCS 631, 269-295. Springer-Verlag.
22. Cousot, P. and Halbwachs, N., 1978. Automatic discovery of linear restraints among variables of a program. In 5th POPL, 84-97. ACM Press.
23. Cridlig, R., 1995. Semantic analysis of shared-memory concurrent languages using abstract model-checking. In Proc. PEPM '95. ACM Press.
24. Cridlig, R., 1996. Semantic analysis of concurrent ML by abstract model-checking. In B. Steffen and T. Margaria, Eds., Proc. Int. Work. on Verification of Infinite State Systems, vol. MIP-9614. Universität Passau, GER.
25. Dams, D., Gerth, R., and Grumberg, O., 1997. Abstract interpretation of reactive systems. Trans. Prog. Lang. Sys., 19(2):253-291. ACM Press.
26. Daws, C., Olivero, A., Tripakis, S., and Yovine, S., 1996. The tool KRONOS. In R. Alur, T. Henzinger, and E. Sontag, Eds., Hybrid Systems III, Verification and Control, LNCS 1066, 208-219. Springer-Verlag.
27. Dill, D.L., and Wong-Toi, H., 1995. Verification of real-time systems by successive over and under approximations. In P. Wolper, Ed., Proc. 7th Int. Conf. CAV '95, LNCS 939, 409-422. Springer-Verlag.
28. Fernandez, J.-C., 1993. Abstract interpretation and verification of reactive systems. In P. Cousot, P. Falaschi, G. Filé, and A. Rauzy, Eds., Proc. 3rd Int. Work. WSA'93 on Static Analysis, LNCS 724, 60-71. Springer-Verlag.
29. Graf, S. and Loiseaux, C., 1993. A tool for symbolic program verification and abstraction. In C. Courcoubatis, Ed., Proc. 5th Int. Conf. CAV '93, LNCS 697, 71-84. Springer-Verlag.
30. Halbwachs, N., 1993. Delays analysis in synchronous programs. In C. Courcoubatis, Ed., Proc. 5th Int. Conf. CAV '93, LNCS 697, 333-346. Springer-Verlag.
31. Halbwachs, N., 1994. About synchronous programming and abstract interpretation. In B. Le Charlier, Ed., Proc. SAS '94, LNCS 864, 179-192. Springer-Verlag.
32. Halbwachs, N., Proy, J.-É., and Raymond, P., 1994. Verification of linear hybrid systems by means of convex approximations. In B. Le Charlier Ed., Proc. SAS '94, LNCS 864, 223-237. Springer-Verlag.
33. Halbwachs, N. and Raymond, P., 1996. On the use of approximations in symbolic model-checking. Tech. rep. SPECTRE L21 (jan), Verimag laboratory, Grenoble, Fra.
34. Henzinger, T. and Ho, P.-H., 1995. Algorithmic analysis of nonlinear hybrid systems. In P. Wolper, Ed., Proc. 7th Int. Conf. CAV '95, LNCS 939, 225-238. Springer-Verlag.
35. Henzinger, T., Nicollin, X., Sifakis, J., and Yovine, S., 1992. Symbolic model-checking for real-time systems. In Proc. 5th LICS'92. IEEE Comp. Soc. Press.
36. Jackson, D., 1994. Abstract model-checking of infinite specifications. In M. Naftalin, T. Denvir, and M. Bertran Eds., 2nd Int. Symp. of Formal Methods Europe FME '94: Industrial Benefit of Formal Methods, LNCS 873, 519-531. Springer-Verlag.
37. Karr, M., 1976. Affine relationships among variables of a program. Acta Inf. 6, 133-151.
38. Kelb, P., 1994. Model checking and abstraction: A framework approximating both truth and failure information. Technical report, University of Oldenburg.
39. 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, 1.
40. Mauborgne, L., 1998. Abstract interpretation using typed decision graphs. Sci. Comput. Prog., 31(1):91-112.
41. Queille, J.P. and Sifakis, J., 1982. Specification and verification of concurrent systems in Cesar. In Int. Symp. on Programming, LNCS 137. Springer-Verlag.
42. Steffen, B., 1991. Data flow analysis as model-checking. In T. Ito and A. Meyer Eds., Proc. Int. Conf. TACS '91, 346-364. Springer-Verlag.
43. Touati, H., Savoj, H., Lin, B., Brayton, R., and Sangiovanni-Vincentelli, S., 1990. Implicit state enumeration of finite state machines using BDDs. In A. Sangiovanni-Vincentelli and S. Goto, Eds., Proc. Int. Conf. ICCAD '90, 130-133. IEEE Comp. Soc. Press.
44. Valmari, A., 1993. On-the-fly verification with stubborn sets. In C. Courcoubatis, Ed.,Proc. 5th Int. Conf. CAV '93, LNCS 697, 397-96. Springer-Verlag.