On abstraction in software verification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2404, Issue , 2002, Pages 37-56

  Cousot, Patrick ^a   Cousot, Radhia ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER AIDED ANALYSIS; SEMANTICS;

PROGRAM MODELING; REACHABILITY ANALYSIS; SOFTWARE VERIFICATION;

VERIFICATION;

EID: 84937570889     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45657-0_3     Document Type: Conference Paper

References (35)

1. th POPL, Boston, USA, ACM Press (2000) 12–25
2. Schmidt, D.: From trace sets to modal-transition systems by stepwise abstract interpretation. Submitted for publication (2001)
3. Cousot, P.: Méthodes itératives de construction et d’approximation de points fixes d’opérateurs monotones sur un treillis, analyse sémantique de programmes. Thèse d’État ès sciences mathématiques, Université scientifique et médicale de Grenoble, Grenoble, France (1978)
4. th POPL, San Antonio, USA, ACM Press (1979) 269–282
5. th POPL, Los Angeles, USA, ACM Press (1977) 238–252
6. Cousot, P.: Semantic foundations of program analysis. In Muchnick, S., Jones, N., eds.: Program Flow Analysis: Theory and Applications. Prentice-Hall (1981) 303–342
7. Bourdoncle, F.: Abstract debugging of higher-order imperative languages. In: Proc. ACM SIGPLAN’93 Conf. PLDI. ACM SIGPLAN Not. 28(6), Albuquerque, USA, ACM Press (1993) 46–55
8. Cousot, P., Cousot, R.: Induction principles for proving invariance properties of programs. In Néel, D., ed.: Tools & Notions for Program Construction. Cambridge U. Press (1982) 43–119
9. Clarke, E., Emerson, E.: Synthesis of synchronization skeletons for branching time temporal logic. In: IBMWorkshop on Logics of Programs. Yorktown Heights, USA, LNCS 131, Springer-Verlag (1981)
10. Clarke, E., Emerson, E., Sistla, A.: Automatic verification of finite-state concurrent systems using temporal logic specifications. TOPLAS 8 (1986) 244–263
11. Queille, J.P., Sifakis, J.: Verification of concurrent systems in Cesar. In: Proc. Int. Symp. on Programming. LNCS 137. Springer-Verlag (1982) 337–351
12. 20 states and beyond. Inform. and Comput. 98 (1992) 142–170
13. th Conf. DAC’99. New Orleans, USA. ACM Press (21–25 June 1999) 317–320
14. th Int. Symp. PLILP’92. Leuven, Belgium, 26–28 Aug. 1992, LNCS 631, Springer-Verlag (1992) 269–295
15. th Int. Symp. SARA’2000. Horseshoe Bay, USA, LNAI 1864. Springer-Verlag (2000) 1–25
16. Clarke, E., Grumberg, O., Long, D.: Model checking and abstraction. TOPLAS 16 (1994) 1512–1542
17. nd Int. Symp. SAS’95. Glasgow, UK, 25–27 Sep. 1995, LNCS 983. Springer-Verlag (1995) 51–63
18. th POPL, Tucson, USA, ACM Press (1978) 84–97
19. Halbwachs, N.: About synchronous programming and abstract interpretation. Sci. Comput. Programming 31 (1998) 75–89
20. th Int. Conf. CAV’93. Elounda, Grece, LNCS 697, Springer-Verlag (1993) 71–84
21. th Int. Conf. TACAS’2002. Grenoble, France, LNCS 2280, Springer-Verlag (2002)
22. Giacobazzi, R., Ranzato, F., Scozzari, F.: Making abstract interpretations complete. J. ACM 47 (2000) 361–416
23. Karr, M.: Affine relationships among variables of a program. Acta Informat. 6 (1976) 133–151
24. th POPL, Portland, USA, ACM Press (2002) 178–190
25. Cousot, P.: The Marktoberdorf’98 generic abstract interpreter. http://www.di.ens.fr/~cousot/Marktoberdorf98.shtml (1998)
26. Cousot, P.: Calculational design of semantics and static analyzers by abstract interpretation. NATO Int. Summer School 1998 on Calculational System Design. Marktoberdorf, DE. Organized by F.L. Bauer, M. Broy, E.W. Dijkstra, D. Gries and C.A.R. Hoare. (1998)
27. Cousot, P., Cousot, R.: Refining model checking by abstract interpretation. Aut. Soft. Eng. 6 (1999) 69–95
28. Berezin, S., Clarke, E., Jha, S., Marrero, W.: Model checking algorithms for the μ-calculus. Tech. rep. tr-cmu-cs-96-180, Carnegie Mellon University, USA, (1996)
29. Cousot, P., Cousot, R.: Abstract interpretation and application to logic programs. J. Logic Programming 13 (1992) 103–179 (The editor of J. Logic Programming has mistakenly published the unreadable galley proof. For a correct version of this paper, see http://www.di.ens.fr/~cousot.).
30. Kaplan, M., Ullman, J.: A general scheme for the automatic inference of variable types. J. ACM 27 (1980) 128–145
31. nd Symp. PADO’2001. Århus, Danmark, 21–23 May 2001, LNCS 2053, Springer-Verlag (2001) 155–172
32. th FST & TCS. New Delhi, India, 18–20 Dec. 1992, LNCS 652, Springer-Verlag (1992) 68–79
33. th Int. Conf. CAV’00. Chicago, USA, LNCS 1855, SPRINGER (2000) 154–169
34. th Int. Symp. SAS’ 01. Paris, France, LNCS 2126, Springer-Verlag (2001) 356–373
35. st Int. Workshop ESOP’2001. Volume 2211 of LNCS. Springer-Verlag (2001) 469Ñ–485