Types, bytes, and separation logic

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

Volumn , Issue , 2007, Pages 97-108

  Tuch, Harvey ^a   Klein, Gerwin ^a   Norrish, Michael ^a  

^a CSIRO   (Australia)

Author keywords

C; Interactive theorem proving; Separation logic

Indexed keywords

ABSTRACTING; C (PROGRAMMING LANGUAGE); CODES (SYMBOLS); MATHEMATICAL MODELS; SECURITY OF DATA; THEOREM PROVING;

INTERACTIVE THEOREM PROVING; POINTERS; SEPARATION LOGIC;

FORMAL LOGIC;

EID: 34548205807     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1190216.1190234     Document Type: Conference Paper

References (35)

1. Beyond reachability: Shape abstraction in the presence of pointer arithmetic. In 13th International Symposium on Static Analysis (SAS 2006), volume 4134 of Lecture Notes in Computer Science, pages 182-203. Springer, 2006.
2. T. Ball and S. K. Rajamani. Automatically validating temporal safety properties of interfaces. In SPIN'01, Workshop on Model Checking of Software, volume 2057 of Lecture Notes in Computer Science, pages 103-122, 2001.
3. J. Berdine, C. Calcagno, and P. O'Hearn. A decidable fragment of separation logic. In FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, 2004.
4. W. R. Bevier. Kit: A study in operating system verification. IEEE Transactions on Software Engineering, 15(11):1382-1396, 1989.
5. D. Beyer, T. A. Henzinger, R. Jhala, and R. Majumdar. Checking memory safety with Blast. In Proceedings of the International Conference on Fundamental Approaches to Software Engineering (FASE), volume 3442 of Lecture Notes in Computer Science, pages 2-18. Springer, 2005.
6. J. Bloch. Nearly all binary searches and mergesorts are broken. http://googleresearch.blogspot.com/2006/06/extra-extra-read-all-about-it-nearly. html, June 2006.
7. M. Blume. No-longer-foreign: Teaching an ML compiler to speak C "natively". Electronic Notes in Theoretical Computer Science, 59(1), 2001.
8. R. Bornat. Proving pointer programs in Hoare Logic. In R. Backhouse and J. Oliveira, editors, Mathematics of Program Construction (MPC 2000), volume 1837 of LNCS, pages 102-126. Springer, 2000.
9. R. Bur stall. Some techniques for proving correctness of programs which alter data structures. In B. Meltzer and D. Michie, editors, Machine Intelligence 7, pages 23-50. Edinburgh University Press, 1972.
10. B. Cook, D. Kroening, and N. Sharygina. Cogent: Accurate theorem proving for program verification. In K. Etessami and S. K. Rajamani, editors, Proceedings of CAV 2005, volume 3576 of Lecture Notes in Computer Science, pages 296-300. Springer Verlag, 2005.
11. M. Daum, S. Maus, N. Schirmer, and M. N. Seghir. Integration of a Software model checker into Isabelle. In G. Sutcliffe and A. Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning: 12th International Conference, LPAR 2005, volume 3835 of Lecture Notes in Artificial Intelligence, pages 381-395, Montego Bay, Jamaica, October 2005. Springer.
12. J.-C. Filliâtre and C. Marché. Multi-prover verification of C programs. In Formal Methods and Software Engineering, 6th International Conference on Formal Engineering Methods, ICFEM 2004, Seattle, USA, volume 3308 of LNCS, pages 15-29. Springer, 2004.
13. M. Gargano, M. Hillebrand, D. Leinenbach, and W. Paul. On the correctness of operating system kernels. In Proc. 18th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'05), pages 1-16, Oxford, UK, 2005.
14. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Software verification with Blast. In SPIN'03, Workshop on Model Checking Software, 2003.
15. M. Hohmuth, H. Tews, and S. G. Stephens. Applying source-code verification to a microkernel - the VFiasco project. Technical Report TUD-FI02-03-März, TU Dresden, 2002.
16. S. S. Ishtiaq and P. W. O'Hearn. BI as an assertion language for mutable data structures. In POPZ '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 14-26, New York, NY, USA, 2001. ACM Press.
17. L4Ka Team. L4 eXperimental Kernel Reference Manual Version X.2. University of Karlsruhe, Oct. 2001. http://14ka.org/projects/version4/ 14-x2.pdf.
18. N. Marti, R. Affeldt, and A. Yonezawa. Verification of the heap manager of an operating system using separation logic. In Third workshop on Semantics, Program Analysis, and Computing Environments For Memory Management (SPACE 2006), pages 61-72, Jan. 2006.
19. F. Mehta and T. Nipkow. Proving pointer programs in higher-order logic. Information and Computation, 2005. To appear.
20. A. Møller and M. I. Schwartzbach. The pointer assertion logic engine. In Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '01, June 2001.
21. G. Necula, J. Condit, M. Harren, S. McPeak, and W. Weimer. CCured: type-safe retrofitting of legacy software. ACM Trans. Prog. Lang. Syst., 27(3):477-526, 2005.
22. P. G. Neumann, R. S. Boyer, R. J. Feiertag, K. N. Levitt, and L. Robinson. A provably secure operating system: The system, its applications, and proofs. Technical Report CSL-116, SRI International, 1980.
23. T. Nipkow, L. Paulson, and M. Wenzel. Isabelle/HOL - A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer, 2002.
24. M. Norrish. C formalised in HOL. PhD thesis, Computer Laboratory, University of Cambridge, 1998.
25. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In Proc. 17th IEEE Symposium on Logic in Computer Science, pages 55-74, 2002.
26. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. In POPL '99: Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 105-118. ACM Press, 1999.
27. N. Schirmer. Verification of Sequential Imperative Programs in Isabelle/HOL. PhD thesis, Technische Universität München, 2006.
28. H. Tuch and G. Klein. A unified memory model for pointers. In G. Sutcliffe and A. Voronkov, editors, 12th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR-12), volume 3835 of LNCS, pages 474-488, 2005.
29. H. Tuch, G. Klein, and M. Norrish. Verification of the L4 kernel memory allocator. Formal proof document. http://www.cse.unsw.edu.au/~kleing/papers/ kmalloc.html, July 2006.
30. B. Walker, R. Kemmerer, and G. Popek. Specification and verification of the UCLA Unix security kernel. CACM, 23(2):118-131, 1980.
31. T. Weber. Towards mechanized program verification with separation logic. In J. Marcinkowski and A. Tarlecki, editors, Computer Science Logic - 18th International Workshop, CSL 2004, volume 3210 of Lecture Notes in Computer Science, pages 250-264. Springer, 2004.
32. M. Wenzel. Type classes and overloading in. higher-order logic. In E. L. Gunter and A. Felty, editors, Theorem Proving in Higher Order Logics'97, volume 1275 of LNCS, pages 307-322. Springer, 1997.
33. M. Wildmoser and T. Nipkow. Certifying machine code safety: Shallow versus deep embedding. In. K. Slind, A. Bunker, and G. Gopalakrishnan, editors, Theorem. Proving in Higher Order Logics 2004, volume 3223 of LNCS, pages 305-320. Springer, 2004.
34. H. Yang and P. W. O'Hearn. A semantic basis for local reasoning. In Foundations of Software Science and Computation Structure, pages 402-416, 2002.
35. K. Zee, P. Lam, V. Kuncak, and M. Rinard. Combining theorem proving with static analysis for data structure consistency. In Int. Workshop on Software Verification and Validation, 2004.