SLAM and static driver verifier: Technology transfer of formal methods inside microsoft

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

Volumn 2999, Issue , 2004, Pages 1-20

  Ball, Thomas ^a   Cook, Byron ^a   Levin, Vladimir ^a   Sriram, K ^a  

^a MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTER PROGRAMMING; FORMAL METHODS; MODEL CHECKING; TECHNOLOGY TRANSFER;

CRITICAL PROBLEMS; DEVICE DRIVER; MICROSOFT RESEARCHES; PRODUCT GROUPS; PROGRAM ANALYSIS; RESEARCH AND DEVELOPMENT; SOURCE CODES; SYMBOLIC MODEL CHECKING;

WINDOWS OPERATING SYSTEM;

EID: 35048871556     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24756-2_1     Document Type: Article

References (37)

1. +02] S. Adams, T. Ball, M. Das, S. Lerner, S. K. Rajamani, M. Seigle, and W. Weimer. Speeding up dataflow analysis using flow-insensitive pointer analysis. In SAS 02: Static Analysis Symposium, LNCS 2477, pages 230246. Springer-Verlag, 2002.
2. [BCDR04] T. Ball, B. Cook, S. Das, and S. K. Rajamani. Refining approximations in software predicate abstraction. In TACAS 04: Tools and Algorithms for the Construction and Analysis of Systems, To appear in LNCS. SpringerVerlag, 2004.
3. [BCLZ04] T. Ball, B. Cook, S. K. Lahiri, and L. Zhang. Zapato: Automatic theorem proving for predicate abstraction refinement. Under review, 2004.
4. 20 states and beyond. Information and Computation, 98(2):142-170, 1992.
5. [BCR01] T. Ball, S. Chaki, and S. K. Rajamani. Parameterized verification of multithreaded software libraries. In TAG AS 01: Tools and Algorithms for Construction and Analysis of Systems, LNCS 2031. Springer-Verlag, 2001.
6. [BLX04] T. Ball, V. Levin, and F. Xei. Automatic creation of environment models via training. In TACAS 04: Tools and Algorithms for the Construction and Analysis of Systems, To appear in LNCS. Springer-Verlag, 2004.
7. [BMMR01] T. Ball, R. Majumdar, T. Millstein, and S. K. Rajamani. Automatic predicate abstraction of C programs. In PLDI 01: Programming Language Design and Implementation, 203-213. ACM, 2001.
8. [BMR01] T. Ball, T. Millstein, and S. K. Rajamani. Polymorphic predicate abstraction. Technical Report MSR-TR-2001-10, Microsoft Research, 2001.
9. [BNR03] T. Ball, M. Naik, and S. K. Rajamani. From symptom to cause: Localizing errors in counterexample traces. In POPL 03: Principles of programming languages, 97-105. ACM, 2003.
10. [BPR01] T. Ball, A. Podelski, and S. K. Rajamani. Boolean and cartesian abstractions for model checking C programs. In TACAS 01: Tools and Algorithms for Construction and Analysis of Systems, LNCS 2031, pages 268-283. Springer-Verlag, 2001.
11. [BPR02] T. Ball, A. Podelski, and S. K. Rajamani. On the relative completeness of abstraction refinement. In TACAS 02: Tools and Algorithms for Construction and Analysis of Systems, LNCS 2280, pages 158-172. SpringerVerlag, April 2002.
12. [BPS00] W. R. Bush, J. D. Pincus, and D. J. Sielaff. A static analyzer for finding dynamic programming errors. Software-Practice and Experience, 30(7):775-802, June 2000.
13. [BR00a] T. Ball and S. K. Rajamani. Bebop: A symbolic model checker for Boolean programs. In SPIN 00: SPIN Workshop, LNCS 1885, pages 113-130. Springer-Verlag, 2000.
14. [BR00b] T. Ball and S. K. Rajamani. Boolean programs: A model and process for software analysis. Technical Report MSR-TR-2000-14, Microsoft Research, January 2000.
15. [BR01a] T. Ball and S. K. Rajamani. Bebop: A path-sensitive interprocedural dataflow engine. In PASTE 01: Workshop on Program Analysis for Software Tools and Engineering, 97-103. ACM, 2001.
16. [BR01b] T. Ball and S. K. Rajamani. SLIC: A specification language for interface checking. Technical Report MSR-TR-2001-21, Microsoft Research, 2001.
17. [BR02a] T. Ball and S. K. Rajamani. Generating abstract explanations of spurious counterexamples in C programs. Technical Report MSR-TR-2002-09, Microsoft Research, January 2002.
18. [BR02b] T. Ball and S. K. Rajamani. The SLAM project: Debugging system software via static analysis. In POPL 02: Principles of Programming Languages, 1-3. ACM, January 2002.
19. [Bry86] R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, 1986.
20. [CC77] P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for the static analysis of programs by construction or approximation of fixpoints. In POPL 77: Principles of Programming Languages, 238-252. ACM, 1977.
21. +03] S. Chaki, E. Clarke, A. Groce, S. Jha, and H. Veith. Modular verification of software components in c. In ICSE 03: International Conference, on Software Engineering, 385-395. ACM, 2003.
22. [CMP] E. Chailloux, P. Manoury, and B. Pagano. Development d'Applications Avec Objective CAML. O'Reilly (Paris).
23. +01] A. Chou, J. Yang, B. Chelf, S. Hallem, and D. Engler. An empirical study of operating systems errors. In SOSP 01: Symposium on Operating System Principles, 73-88. ACM, 2001.
24. [Das00] M. Das. Unification-based pointer analysis with directional assignments. In PLDI 00: Programming Language Design and Implementation, pages 35-46. ACM, 2000.
25. [DF01] R. DeLine and M. Fähndrich. Enforcing high-level protocols in low-level software. In PLDI 01: Programming Language Design and Implementation, 59-69. ACM, 2001.
26. [DF04] R. DeLine and M. Fähndrich. The Fugue protocol checker: Is your software baroque? Technical Report MSR-TR-2004-07, Microsoft Research, 2004.
27. [DLS02] M. Das, S. Lerner, and M. Seigle. ESP: Path-sensitive program verification in polynomial time. In PLDI 02: Programming Language Design and Implementation, 57-68. ACM, June 2002.
28. [DNS03] D. Detlefs, G. Nelson, and J. B. Saxe. Simplify: A theorem prover for program checking. Technical Report HPL-2003-148, HP Labs, 2003.
29. [ES01] J. Esparza and S. Schwoon. A bdd-based model checker for recursive programs. In CAV 01: Computer Aided Verification, LNCS 2102, pages 324-336. Springer-Verlag, 2001.
30. [GS97] S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In CAV97: Computer-aided Verification, LNCS 1254, pages 72-83. SpringerVerlag, 1997.
31. [HJMS02] T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In POPL '02, 58-70. ACM, January 2002.
32. [Kur94] R.P. Kurshan. Computer-aided Verification of Coordinating Processes. Princeton University Press, 1994.
33. +04] J. R. Larus, T. Ball, M. Das, Rob DeLine, M. Fähndrich, J. Pincus, S. K. Rajamani, and R. Venkatapathy. Righting software. IEEE Software (to appear), 2004.
34. [Lei03] K. R. M. Leino. A sat characterization of boolean-program correctness. In SPIN 03: SPIN Workshop, LNCS 2648, pages 104-120. Springer-Verlag, 2003.
35. [RHS95] T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In POPL 95: Principles of Programming Languages, 49-61. ACM, 1995.
36. [Som98] F. Somenzi. Colorado university decision diagram package. Technical Report available from ftp: //vlsi. Colorado. edu/pub, University of Colorado, Boulder, 1998.
37. [SP81] M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications, pages 189-233. Prentice-Hall, 1981.