Parameterized verification of multithreaded software libraries

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

Volumn 2031 LNCS, Issue , 2001, Pages 158-173

  Ball, Thomas ^a   Chaki, Sagar ^b   Rajamani, Sriram K ^a  

^a MICROSOFT RESEARCH   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; LOGIC CIRCUITS; VERIFICATION;

MICROSOFT RESEARCHES; MODEL CHECKING TOOLS; MULTIPLE THREADS; MULTITHREADED SOFTWARES; PARAMETERIZED MODEL CHECKING; PARAMETERIZED VERIFICATIONS; SAFETY PROPERTY; SOFTWARE LIBRARIES;

MODEL CHECKING;

EID: 35048857405     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45319-9_12     Document Type: Conference Paper

References (20)

1. P. A. Abdulla, K. Ccrans, B. Jonsson, and T. Yih-Kucn. General decidability theorems for infinite-state systems. LIC'S '96: 11th IEEE Symp. Logic in Computer Science, pages 313 321, July 1996.
2. P. A. Abdulla and B. Jonsson. Ensuring completeness of symbolic ver- ificatiom methods for infinite-state systems. Theoretical Computer Science, 1997.
3. Thomas Ball, Sagar Chaki, and Sriram K. Rajamani. Parameterized verification of multithreaded software libraries. Technical Report MSR-TR-2000-116, Microsoft Research, December 2000.
4. T. Ball and S. K. Rajamani. Bebop: A symbolic model checker for boolean programs. SPIN 00: SPIN Workshop, Lecture Notes in Computer Science 1885, pages 113 130. Springer-Vcrlag, 2000.
5. T. Ball and S. K. Rajamani. Boolean programs: A model and process for software analysis. Technical Report MSR-TR-2000-14, Microsoft Research, February 2000.
6. James Corbett, Matthew Dwyer, John Hatcliff, Corina Pasareanu, Robby, Shawn Laubach, and Hongjun Zheng. Bandcra: Extracting finite-state models from Java source code. ICSE 2000: International Conference on Software Engineering, 2000.
7. G. Dclzanno. Automatic Verification of Parameterized Cache Coherence Protocols. CAV 00: Computer Aided Verification, Lecture Notes in Computer Science 1855, pages 53 68. Springer-Vcrlag, 2000.
8. J. Esparza and M. Nielsen. Dccibility issues for pctri nets - a survey. Journal of Informatik Processing and Cybernetics, 30(3): 143 160, 1994.
9. E. A. Emerson and K. S. Namjoshi. Automatic Verification of Param- eterized Synchronous Systems. CAV 96: Computer Aided Verification, Lecture Notes in Computer Science 1102, pages 87 98. Springer-Vcrlag, 1996.
10. A. Finkcl. Reduction and covering of infinite reachability trees. Infor- mation and Computation, 89:144 179, 1990.
11. A. Finkcl. The minimal covcrability graph for pctri nets. Advances in Petri Nets, Lecture Notes in Computer Sccincc, 674:210 243, 1993.
12. A. Finkcl and Ph. Schnocbclcn. Well-structured transition systems ev- erywhere ! Theoretical Computer Science, 2000. To appear.
13. S. M. German and A. P. Sistla. Reasoning about systems with many processes. JACM, 39(3), July 1992.
14. K. Havclund and T. Prcssburgcr. Model checking Java programs using JavaPathFindcr. STTT: International Journal on Software Tools for Technology Transfer, 2(4), April 2000.
15. R. M. Karp and R. E. Miller. Parallel program schemata. Journal of Computer and System Sciences, 3:147 195, 1969.
16. R. J. Lipton. The reachability problem requires exponential space. Tech- nical report, Department of Computer Science, Yale University, 1976.
17. K.L. McMillan, http://www-cad.eecs.berkeley.edu/~kenmcmil.
18. C. Pctri. Fundamentals of a theory of asynchronous information flow. Information Processing 62, Proceedings of the 1962 IFIP Congress, pages 386 390, 1962.
19. C. Rackoff. The covering and boundedness problem for vector addition systems. Theoretical Computer Science, 6:223 231, 1978.
20. G. Ramalingam. Context sensitive synchronization sensitive analysis is undccidablc. Technical Report RC21493, IBM T.J. Watson Research, May 1999.