Unifying type checking and property checking for low-level code

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2009, Pages 302-314

  Condit, Jeremy ^a   Hackett, Brian ^b   Lahiri, Shuvendu K ^a   Qadeer, Shaz ^a  

^a MICROSOFT RESEARCH   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Languages; Verification

Indexed keywords

C CODES; C PROGRAMS; DECISION PROCEDURE; DEVICE DRIVER; LANGUAGES; PROPERTY CHECKING; SUBTYPING; TYPE CHECKER; TYPE SAFETY; TYPE SYSTEMS; TYPECHECKING; UNIFIED APPROACH;

LINGUISTICS;

OBJECT ORIENTED PROGRAMMING;

EID: 67649851003     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1480881.1480921     Document Type: Conference Paper

References (40)

1. The Coq proof assistant. http://coq.inria.fr/.
2. The HAVOC property checker. http://research.microsoft.com/projects/havoc/ .
3. A. J. Ahmed, A. W. Appel, and R. Virga. A stratified semantics of general references embeddable in higher-order logic. In Logic in Computer Science (LICS), 2002. (Pubitemid 34911798)
4. A.W. Appel. Foundational proof-carrying code. In Logic in Computer Science (LICS), 2001.
5. A. W. Appel and A. P. Felty. A semantic model of types and machine instructions for proof-carrying code. In Principles of Programming Languages (POPL), 2000. (Pubitemid 30881845)
6. A.W. Appel and D. McAllester. An indexed model of recursive types for foundational proof-carrying code. Transactions on Programming Languages and Systems (TOPLAS), 23(5), Sep 2001. (Pubitemid 33609124)
7. T. Ball, B. Hackett, S. K. Lahiri, and S. Qadeer. Annotation-based property checking for systems software. Technical Report MSR-TR- 2008-2082, Microsoft Research, 2008.
8. T. Ball, R. Majumdar, T. D. Millstein, and S. K. Rajamani. Automatic predicate abstraction of C programs. In Programming Language Design and Implementation (PLDI), 2001. (Pubitemid 33723850)
9. M. Barnett, B.-Y. E. Chang, R. DeLine, B. Jacobs, and K. R. M. Leino. Boogie: A modular reusable verifier for object-oriented programs. In Formal Methods for Components and Objects (FMCO), 2005.
10. M. Barnett, K. R. M. Leino, andW. Schulte. The Spec# programming system: An overview. In Construction and Analysis of Safe, Secure, and Interoperable Smart Devices (CASSIS), 2004. (Pubitemid 41228860)
11. M. Barnett and R. Leino. Weakest-precondition of unstructured programs. In Program Analysis for Software Tools and Engineering (PASTE), 2005.
12. R. Bornat. Proving pointer programs in Hoare logic. In Mathematics of Program Construction (MPC), 2000.
13. 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), 2006. (Pubitemid 44561974)
14. B.-Y. E. Chang, A. Chlipala, G. C. Necula, and R. R. Schneck. The Open Verifier framework for foundational verifiers. In Types in Language Design and Implementation (TLDI), 2005.
15. S. Chatterjee, S. K. Lahiri, S. Qadeer, and Z. Rakamaric. A reachability predicate for analyzing low-level software. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2007. (Pubitemid 350259283)
16. B. Chin, S. Markstrum, and T. Millstein. Semantic type qualifiers. In Programming Language Design and Implementation (PLDI), 2005. (Pubitemid 43182891)
17. J. Condit, M. Harren, Z. Anderson, D. Gay, and G. Necula. Dependent types for low-level programming. In European Symposium on Programmig (ESOP), 2007. (Pubitemid 350259513)
18. K. Crary and J. C. Vanderwaart. An expressive, scalable type theory for certified code. In International Conference on Functional Programming (ICFP), 2002.
19. L. de Moura and N. Bjørner. Z3: An efficient SMT solver. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2008.
20. E. W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. Communcations of the ACM, 18, 1975.
21. X. Feng, Z. Ni, Z. Shao, and Y. Guo. An open framework for foundational proof-carrying code. In Types in Language Design and Implementation (TLDI), 2007. (Pubitemid 47338833)
22. J.-C. Filliâtre and C. Marché. The Why/Krakatoa/Caduceus platform for deductive program verification. In Computer Aided Verification (CAV), 2007.
23. 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), 2002. (Pubitemid 34991522)
24. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Principles of Programming Languages (POPL), 2002. (Pubitemid 35009030)
25. T. Jim, G. Morrisett, D. Grossman, M. Hicks, J. Cheney, and Y. Wang. Cyclone: A safe dialect of C. In USENIX Annual Technical Conference, 2002.
26. S. K. Lahiri and S. Qadeer. Back to the future: Revisiting precise program verification using SMT solvers. In Principles of Programming Languages (POPL), 2008.
27. X. Leroy. Formal certification of a compiler back-end, or: Programming a compiler with a proof assistant. In Principles of Programming Languages (POPL), 2006. (Pubitemid 43906957)
28. Microsoft. Windows driver kit. http://www.microsoft.com/whdc/devtools/ wdk/default.mspx.
29. G. Morrisett, D. Walker, K. Crary, and N. Glew. From System F to typed assembly language. Transactions on Programming Languages and Systems (TOPLAS), 21:3, 1999.
30. G. C. Necula. Proof-carrying code. In Principles of Programming Languages (POPL), 1997.
31. G. C. Necula, J. Condit, M. Harren, S. McPeak, and W. Weimer. CCured: Type-safe retrofitting of legacy software. Transactions on Programming Languages and Systems (TOPLAS), 27(3), May 2005. (Pubitemid 43942510)
32. G. C. Necula and P. Lee. The design and implementation of a certifying compiler. In Programming Language Design and Implementation (PLDI), 1998. (Pubitemid 128454809)
33. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. Transactions on Programming Languages and Systems (TOPLAS), 1(2), 1979.
34. Y. Régis-Gianas and F. Pottier. A Hoare logic for call-by-value functional programs. In Mathematics of Program Construction (MPC), 2008.
35. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In Logic in Computer Science (LICS), 2002. (Pubitemid 34911797)
36. Satisfiability Modulo Theories Library (SMT-LIB). Available at http://goedel.cs.uiowa.edu/smtlib/.
37. W. Schulte, S. Xia, J. Smans, and F. Piessens. A glimpse of a verifying C compiler. In C/C++ Verification Workshop, 2007.
38. H. Xi. Imperative programming with dependent types. In Logic in Computer Science (LICS), 2000. (Pubitemid 30914300)
39. H. Xi and F. Pfenning. Dependent types in practical programming. In Principles of Programming Languages (POPL), 1999.
40. H. Yang, O. Lee, J. Berdine, C. Calcagno, B. Cook, D. Distefano, and P. O'Hearn. Scalable shape analysis for systems code. In Computer Aided Verification (CAV), 2008.