Automated verification of shape, size and bag properties via user-defined predicates in separation logic

Science of Computer Programming

Volumn 77, Issue 9, 2012, Pages 1006-1036

  Chin, Wei Ngan ^a   David, Cristina ^a   Nguyen, Huu Hai ^a   Qin, Shengchao ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b TEESSIDE UNIVERSITY   (United Kingdom)

Author keywords

Automated verification; Entailment checking; Inductive shape predicates with size and bag properties; Separation logic

Indexed keywords

AUTOMATION; COMPUTER CIRCUITS; SEPARATION;

AUTOMATED VERIFICATION; AUTOMATIC VERIFICATION; ENTAILMENT CHECKING; INDUCTIVE SHAPE PREDICATES WITH SIZE AND BAG PROPERTIES; PROGRAM VERIFICATION; PROTOTYPE SYSTEM; SEPARATION LOGIC; VERIFICATION SYSTEMS;

FORMAL LOGIC;

EID: 84861233209     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2010.07.004     Document Type: Article

References (61)

1. M. Barnett, K.R.M. Leino, and W. Schulte The Spec programming system: an overview Int'l Workshop on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices Lecture Notes in Computer Science vol. 3362 2004 Springer 49 69
2. C. Barrett, A. Stump, C. Tinelli, The SMT-LIB standard: version 2.0, in: International Workshop on Satisfiability Modulo Theories. Informal proceedings, 2010.
3. J. Berdine, C. Calcagno, and P.W. O'Hearn Symbolic execution with separation logic Asian Symposium on Programming Languages and Systems Lecture Notes in Computer Science vol. 3780 2005 Springer 52 68
4. J. Berdine, C. Calcagno, and P.W. O'Hearn Smallfoot: modular automatic assertion checking with separation logic International Symposium on Formal Methods for Components and Objects Lecture Notes in Computer Science vol. 4111 2006 Springer 115 137 (Pubitemid 44543283)
5. J. Bingham, and Z. Rakamaric A logic and decision procedure for predicate abstraction of heap-manipulating programs Verification, Model Checking, and Abstract Interpretation Lecture Notes in Computer Science vol. 3855 2006 Springer 207 221 (Pubitemid 43973668)
6. R.M. Burstall, and J. Darlington A transformation system for developing recursive programs Journal of ACM 24 1 1977 44 67
7. C. Calcagno, D. Distefano, P.W. O'Hearn, and H. Yang Compositional shape analysis by means of bi-abduction ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 2009 ACM 289 300
8. C. Chen, and H. Xi Combining programming with theorem proving ACM SIGPLAN International Conference on Functional Programming 2005 ACM 66 77 (Pubitemid 43907034)
9. W.N. Chin, C. David, H.H. Nguyen, and S. Qin Automated verification of shape, size and bag properties IEEE International Conference on Engineering Complex Computer Systems 2007 IEEE 307 320
10. W.N. Chin, and S.C. Khoo Calculating sized types ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation 2000 ACM 62 72
11. W.N. Chin, S.C. Khoo, S.C. Qin, C. Popeea, and H.H. Nguyen Verifying safety policies with size properties and alias controls ACM SIGSOFT International Conference on Software Engineering 2005 ACM 186 195
12. D.R. Cok Reasoning with specifications containing method calls and model fields Journal of Object Technology 4 8 2005 77 103 (Pubitemid 41596792)
13. D.R. Cok, and J.R. Kiniry ESC/Java2: uniting ESC/Java and JML International Workshop on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices Lecture Notes in Computer Science vol. 3362 2004 Springer 108 128
14. L.M. de~Moura, and N. Bjorner Efficient E-matching for SMT solvers International Conference on Automated Deduction Lecture Notes in Computer Science vol. 4603 2007 Springer 183 198 (Pubitemid 47545110)
15. D. Detlefs, G. Nelson, J.B. Saxe, Simplify: a theorem prover for program checking. Technical Report HPL-2003-148, HP Laboratories Palo Alto, 2003.
16. D. Distefano, P.~W. O'Hearn, and H. Yang A local shape analysis based on separation logic Tools and Algorithms for Construction and Analysis of Systems Lecture Notes in Computer Science vol. 3920 2006 Springer 287 302 (Pubitemid 44019377)
17. J. Elgaard, N. Klarlund, and A. Moller MONA 1.x: new techniques for WS1S and WS2S International Conference on Computer-Aided Verification Lecture Notes in Computer Science vol. 1427 1998 Springer 516 520 (Pubitemid 128092367)
18. C. Flanagan, K.R.M. Leino, M. Lillibridge, G. Nelson, J.~B. Saxe, and R. Stata Extended static checking for Java ACM SIGPLAN Conference on Programming Language Design and Implementation 2002 ACM 234 245 (Pubitemid 34991522)
19. A. Gotsman, J. Berdine, and B. Cook Interprocedural shape analysis with separated heap abstractions Static Analysis Symposium Lecture Notes in Computer Science vol. 4134 2006 Springer 240 260 (Pubitemid 44561977)
20. W. Harwood, A. Cavalcanti, and J. Woodcock A theory of pointers for the UTP International Colloquium on Theoretical Aspects of Computing Lecture Notes in Computer Science vol. 5160 2008 Springer 141 155
21. C.A.R. Hoare An axiomatic basis for computer programming Communications of the ACM 12 10 1969 576 580
22. C.A.R. Hoare, and J. He A trace model for pointers and objects European Conference on Object-Oriented Programming Lecture Notes in Computer Science vol. 1628 1999 Springer 1 17
23. C.A.R. Hoare The verifying compiler: a grand challenge for computing research Journal of ACM 50 1 2003 63 69
24. J. Hughes, L. Pareto, and A. Sabry Proving the correctness of reactive systems using sized types ACM Symposium on Principles of Programming Languages 1996 ACM 410 423
25. S. Ishtiaq, and P.W. O'Hearn BI as an assertion language for mutable data structures ACM Symposium on Principles of Programming Languages 2001 ACM 14 26
26. L. Jia, and D. Walker ILC: a foundation for automated reasoning about pointer programs European Symposium on Programming Lecture Notes in Computer Science vol. 3924 2006 Springer 131 145 (Pubitemid 44019556)
27. C. Jones, P. O'Hearn, and J. Woodcock Verified software: a grand challenge IEEE Computer 39 4 2006 93 95
28. I.T. Kassios Dynamic frames: support for framing, dependencies and sharing without restrictions International Symposium on Formal Methods Lecture Notes in Computer Science vol. 4085 2006 Springer 268 283 (Pubitemid 44502912)
29. D. König Theorie der endlichen und unendlichen Graphen Akademische Verlagsgesellschaft 1936 (in German)
30. N. Klarlund, A. Moller, MONA Version 1.4 - User Manual. BRICS Notes Series, January 2001.
31. N. Klarlund, and M.I. Schwartzbach Graph types ACM Symposium on Principles of Programming Languages 1993 ACM 196 205 (Pubitemid 23631644)
32. V. Kuncak, Modular data structure verification, Ph.D. Thesis, Massachusetts Institute of Technology, 2007.
33. V. Kuncak, P. Lam, K. Zee, and M. Rinard Modular pluggable analyses for data structure consistency IEEE Transactions on Software Engineering 32 12 2006 988 1005 (Pubitemid 46437705)
34. V. Kuncak, H.H. Nguyen, and M. Rinard An algorithm for deciding bapa: boolean algebra with presburger arithmetic International Conference on Automated Deduction Lecture Notes in Computer Science vol. 3632 2005 Springer 260 277
35. S. Lahiri, and S. Qadeer Verifying properties of well-founded linked lists ACM Symposium on Principles of Programming Languages 2006 ACM 115 126
36. P. Lam, The hob system for verifying software design properties, Ph.D. Thesis, Massachusetts Institute of Technology, 2007.
37. G.T. Leavens, A.L. Baker, and C. Ruby Preliminary design of JML: a behavioral interface specification language for java SIGSOFT Software Engineering Notes 31 3 2006 1 38
38. O. Lee, H. Yang, and K. Yi Automatic verification of pointer programs using grammar-based shape analysis European Symposium on Programming Lecture Notes in Computer Science vol. 3444 2005 Springer 124 140 (Pubitemid 41282536)
39. K.R.M. Leino, Specification and verification of object-oriented software, Lecture Notes, Marktoberdorf International Summer School, 2008.
40. Bertrand Meyer Eiffel: The Language 1992 Prentice-Hall, Inc. Upper Saddle River, NJ, USA
41. A. Moeller, and M.I. Schwartzbach The pointer assertion logic engine ACM SIGPLAN Conference on Programming Language Design and Implementation 2001 ACM 221 231
42. G. Necula Proof-carrying code ACM Symposium on Principles of Programming Languages 1997 ACM 106 119
43. G. Nelson, and D.C. Oppen Simplification by cooperating decision procedures ACM Transactions on Programming Languages and Systems 1 2 1979 245 257
44. H.H. Nguyen, C. David, S.C. Qin, and W.N. Chin Automated verification of shape and size properties via separation logic Verification, Model Checking, and Abstract Interpretation Lecture Notes in Computer Science vol. 4349 2007 Springer 251 266 (Pubitemid 350143498)
45. T. Nipkow, L.C. Paulson, and M. Wenzel Isabelle/HOL - A Proof Assistant for Higher-Order Logic Lecture Notes in Computer Science vol. 2283 2002 Springer
46. P.W. O'Hearn, J. Reynolds, and H. Yang Local reasoning about programs that alter data structures Conference of the European Association for Computer Science Logic Lecture Notes in Computer Science vol. 2142 2001 Springer 1 19 (Pubitemid 33332625)
47. B. Pierce Types and Programming Languages 2002 The MIT Press
48. W. Pugh Skip lists: a probabilistic alternative to balanced trees Communications of the ACM 33 6 1990 668 676 (Pubitemid 21672422)
49. W. Pugh A practical algorithm for exact array dependence analysis Communications of the ACM 35 8 1992 102 114
50. C.R. Reddy, and D.W. Loveland Presburger arithmetic with bounded quantifier alternation ACM Symposium on Theory of Computing 1978 ACM 320 325 (Pubitemid 9412048)
51. J. Reynolds Separation logic: a logic for shared mutable data structures IEEE Symposium on Logic in Computer Science 2002 IEEE 55 74
52. R. Rugina Quantitative shape analysis Proceedings of the International Static Analysis Symposium Lecture Notes in Computer Science vol. 3148 2004 Springer 228 245
53. S. Sagiv, T. Reps, and R. Wilhelm Parametric shape analysis via 3-valued logic ACM Transactions on Programming Languages and Systems 24 3 2002 217 298
54. É-J. Sims Extending separation logic with fixpoints and postponed substitution Theoretical Computer Science 351 2 2006 258 275 (Pubitemid 43168329)
55. J.M. Spivey The Z Notation: A Reference Manual 1989 Prentice-Hall
56. A. Stump, C. Barrett, and D. Dill CVC: a cooperating validity checker International Conference on Computer-Aided Verification Lecture Notes in Computer Science vol. 2404 2002 Springer 500 504
57. J. Tschannen, Automatic verification of eiffel programs, Master's Thesis, ETH Zurich, 2009.
58. D. Walker, and G. Morrisett Alias types for recursive data structures International Workshop on Types in Compilation Lecture Notes in Computer Science vol. 2071 2000 Springer 177 206
59. T. Wies, V. Kuncak, P. Lam, A. Podelski, and M. Rinard Field constraint analysis Verification, Model Checking, and Abstract Interpretation Lecture Notes in Computer Science vol. 3855 2006 Springer 157 173 (Pubitemid 43973665)
60. H. Xi, Dependent types in practical programming, Ph.D. Thesis, Carnegie Mellon University, 1998.
61. H. Yang, O. Lee, J. Berdine, C. Calcagno, B. Cook, D. Distefano, and P.W. O'Hearn Scalable shape analysis for systems code International Conference on Computer Aided Verification Lecture Notes in Computer Science vol. 5123 2008 Springer 385 398