A reachability predicate for analyzing low-level software

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

Volumn 4424 LNCS, Issue , 2007, Pages 19-33

  Chatterjee, Shaunak ^a   Lahiri, Shuvendu K ^b   Qadeer, Shaz ^b   Rakamarić, Zvonimir ^c  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

^b MICROSOFT RESEARCH   (United States)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTER PROGRAMMING; DATA STRUCTURES; DIGITAL ARITHMETIC; SOFTWARE PROTOTYPING; COMPUTATIONAL LINGUISTICS;

PROTOTYPE VERIFIER; SYSTEMS SOFTWARE; WINDOWS KERNEL; ANNOTATION LANGUAGES; C PROGRAMS; LOW LEVEL SOFTWARES; POINTER ARITHMETIC; PRECISE ANALYSIS; REACHABILITY; TYPE-SAFE LANGUAGES;

COMPUTER SOFTWARE; C (PROGRAMMING LANGUAGE);

EID: 37149032314     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71209-1_4     Document Type: Conference Paper

References (23)

1. I. Balaban, A. Pnueli, and L. D. Zuck. Shape analysis by predicate abstraction. In Verification, Model checking, and Abstract Interpretation (VMCAI '05), LNCS 3385, pages 164-180, 2005.
2. T. Ball, R. Majumdar, T. Millstein, and S. K. Rajamani. Automatic predicate abstraction of C programs. In Programming Language Design and Implementation (PLDI '01), pages 203-213, 2001.
3. M. Barnett and K. R. M. Leino. Weakest-precondition of unstructured programs. In ACM SIGPLAN-SIGSOFT Workshop on Program Analysis For Software Tools and Engineering (PASTE '05), pages 82-87, 2005.
4. M. Barnett, K. R. M. Leino, and W. Schulte. The Spec# programming system: An overview. In Construction and Analysis of Safe, Secure and Interoperable Smart Devices, LNCS 3362, pages 49-69, 2005.
5. J. Bingham and Z. Rakamaric. A logic and decision procedure for predicate abstraction of heap-manipulating programs. In Verification, Model Checking, and Abstract Interpretation (VMCAI '06), LNCS 3855, pages 207-221, 2006.
6. E. Borger, E. Gradei, and Y. Gurevich. The Classical Decision Problem. SpringerVerlag, 1997.
7. C. Calcagno, D. Distefano, P. W. O'Hearn, and H. Yang. Beyond reachability: Shape abstraction in the presence of pointer arithmetic. In Static Analysis Symposium (SAS '06), LNCS 4134, pages 182-203, 2006.
8. S. Chatterjee, S. K. Lahiri, S. Qadeer, and Z. Rakamaric. A reachability predicate for analyzing low-level software. Technical Report MSR-TR-2006-154, Microsoft Research, 2006.
9. E. Clarke, D. Kroening, N. Sharygina, and K. Yorav. Predicate abstraction of ANSI-C programs using SAT. Formal Methods in System Design (FMSD), 25:105127, September-November 2004.
10. M. Das, S. Lerner, and M. Seigle. ESP: Path-sensitive program verification in polynomial time. In Programming Language Design and Implementation (PLDI '02), pages 57-68, 2002.
11. R. DeLine and K. R. M. Leino. BoogiePL: A typed procedural language for checking object-oriented programs. Technical Report MSR-TR-2005-70, Microsoft Research, 2005.
12. D. L. Detlefs, G. Nelson, and J. B. Saxe. Simplify: A theorem prover for program checking. Technical report, HPL-2003-148, 2003.
13. E. W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. Communications of the ACM, 18:453-457, 1975.
14. J. Pilliâtre and C. Marché. Multi-prover verification of C programs. In International Conference on Formal Engineering Methods (ICFEM '04), LNCS 3308, pages 15-29, 2004.
15. C. Flanagan, K. R. M. Leino, M. Lillibridge, G. Nelson, J. B. Saxe, and R. Stata. Extended static checking for Java. In Programming Language Design and Implementation (PLDI'02), pages 234-245, 2002.
16. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Principles of Programming Languages (POPL '02), pages 58-70, 2002.
17. S. K. Lahiri and S. Qadeer. Verifying properties of well-founded linked lists. In Principles of Programming Languages (POPL '06), pages 115-126, 2006.
18. T. Lev-Ami, N. Immerman, T. W. Reps, S. Sagiv, S. Srivastava, and G. Yorsh. Simulating reachability using first-order logic with applications to verification of linked data structures. In Conference on Automated Deduction (CADE '05), LNCS 3632, pages 99-115, 2005.
19. T. Lev-Ami and S. Sagiv. TVLA: A system for implementing static analyses. In Static Analysis Symposium (SAS '00), LNCS 1824, pages 280-301, 2000.
20. S. McPeak and G. C. Necula. Data structure specifications via local equality axioms. In Computer-Aided Verification (CAV '05), LNCS 3576, pages 476-490, 2005.
21. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems (TOPLAS), 2(1):245-257, 1979.
22. S. Sagiv, T. W. Reps, and R. Wilhelm. Solving shape-analysis problems in languages with destructive updating. ACM Transactions on Programming Languages and Systems (TOPLAS), 20(1):1-50, 1998.
23. Y. Xie and A. Aiken. Scalable error detection using boolean satisfiability. In Principles of Programming Languages (POPL '05), pages 351-363, 2005.