Thread-modular model checking

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

Volumn 2648, Issue , 2003, Pages 213-224

  Flanagan, Cormac ^a   Qadeer, Shaz ^b  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

CORRECTNESS PROPERTIES; LOOSELY COUPLED; MODEL CHECKING ALGORITHM; MODULAR MODELING; MULTITHREADED SOFTWARES; NOVEL TECHNIQUES; POLYNOMIAL-TIME; SPACE AND TIME;

MODEL CHECKING;

EID: 35248831215     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44829-2_14     Document Type: Article

References (11)

1. A. Bouajjani, J. Esparza, and T. Touili. A generic approach to the static analysis of concurrent programs with procedures. In POPL 03: Principles of Programming Languages, pages 62-73. ACM Press, 2003.
2. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Workshop on Logic of Programs, Lecture Notes in Computer Science 131, pages 52-71. Springer-Verlag, 1981.
3. J. M. Cobleigh, D. Giannakopoulou, and C. S. Pǎsǎreanu. Learning assumptions for compositional verification. In TACAS 03: Tools and Algorithms for the Construction and Analysis of Systems, 2003. To appear.
4. C. Flanagan, S. N. Freund, and S. Qadeer. Thread-modular verification for shared-memory programs. In ESOP 02: European Symposium on Programming, Lecture Notes in Computer Science 2305, pages 262-277. Springer-Verlag, 2002.
5. C. Flanagan, S. Qadeer, and S. A. Seshia. A modular checker for multithreaded programs. In CAV 02: Computer Aided Verification, Lecture Notes in Computer Science 2404, pages 180-194. Springer-Verlag, 2002.
6. D. Giannakopoulou, C. S. Pǎsǎreanu, and H. Barringer. Assumption generation for software component verification. In ASE 02: Automated Software Engineering, pages 3-12. IEEE Computer Society, 2002.
7. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, 1979.
8. C. N. Ip and D. L. Dill. Better verification through symmetry. Formal Methods in System Design, 9(1-2):41-75, 1996.
9. C. B. Jones. Tentative steps toward a development method for interfering programs. ACM Transactions on Programming Languages and Systems, 5(4):596-619, 1983.
10. J. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Fifth International Symposium on Programming, Lecture Notes in Computer Science 137, pages 337-351. Springer-Verlag, 1981.
11. G. Ramalingam. Context-sensitive synchronization-sensitive analysis is undecidable. ACM Transactions on Programming Languages and Systems, 22(2):416-430, 2000.