Modular inference of subprogram contracts for safety checking

Journal of Symbolic Computation

Volumn 45, Issue 11, 2010, Pages 1184-1211

  Moy, Yannick ^a   Marche Claude C ^b,c  

^a AdaCore   (France)

^b INRIA SACLAY   (France)

^c CNRS   (France)

Author keywords

Abstract interpretation; Contracts; Functional behavior; Inference; Quantifier elimination; Specification languages; Weakest precondition

Indexed keywords

EID: 84755160944     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2010.06.004     Document Type: Article

References (57)

1. Aiken A., Foster J.~S., Kodumal J., Terauchi T. Checking and inferring local non-aliasing. PLDI '03: Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation 2003, 129-140. ACM, New York, NY, USA.
2. Assaad, M.G., Leavens, G.T., 2001. Alias-free parameters in C for better reasoning and optimization. Technical Report 01-11, Department of Computer Science, Iowa State University.
3. Barnett M., Leino K.R.M., Schulte W. The Spec# Programming System: An Overview. Lecture Notes in Computer Science 2004, vol. 3362:49-69. Springer.
4. Baudin, P., Filliâtre, J.-C., Marché, C., Monate, B., Moy, Y., Prevosto, V., 2008. ACSL: ANSI/ISO C Specification Language. http://frama-c.cea.fr/acsl.html.
5. Bourdoncle F. Assertion-based debugging of imperative programs by abstract interpretation. ESEC '93: Proceedings of the 4th European Software Engineering Conference on Software Engineering 1993, 501-516. Springer-Verlag, London, UK.
6. Bradley A.R., Manna Z. The Calculus of Computation: Decision Procedures with Applications to Verification 2007, Springer-Verlag New York, Inc., Secaucus, NJ, USA.
7. Burdy L., Cheon Y., Cok D., Ernst M., Kiniry J., Leavens G.T., Leino K.R.M., Poll E. An overview of JML tools and applications. International Journal on Software Tools for Technology Transfer 2004.
8. C99 ISO/IEC 9899:1999: Programming Languages-C 2000, International Organization for Standardization.
9. Calcagno C., Distefano D., O'Hearn P.W., Yang H. Footprint analysis: a shape analysis that discovers preconditions. Lecture Notes in Computer Science 2007, vol. 4634:402-418. Springer-Verlag.
10. Chaki, S., Hissam, S., 2006. Certifying the absence of buffer overflows. Technical Note CMU/SEI-2006-TN-030, Carnegie-Mellon University/Software Engineering Institute.
11. Colon M., Sankaranarayanan S., Sipma H. Linear invariant generation using non-linear constraint solving. Lecture Notes in Computer Science 2003, vol. 2725:420-432.
12. Conchon, S., Contejean, E., 2008. The Alt-Ergo automatic theorem prover http://alt-ergo.lri.fr/.
13. Couchot, J.-F., Hubert, T., 2007. A Graph-based Strategy for the Selection of Hypotheses. In: FTP 2007 - International Workshop on First-Order Theorem Proving. Liverpool, UK.
14. Cousot P., Cousot R. Systematic design of program analysis frameworks. POPL'79: Proceedings of the 6th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages 1979, 269-282. ACM, New York, NY, USA.
15. Cousot P., Halbwachs N. Automatic discovery of linear restraints among variables of a program. POPL'78: Proceedings of the 5th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages 1978, 84-96. ACM, New York, NY, USA.
16. Dahlweid M., Moskal M., Santen T., Tobies S., Schulte W. VCC: Contract-based modular verification of concurrent C. 31st International Conference on Software Engineering 2009, 429-430. Companion Volume. IEEE.
17. Dijkstra E.W. A Discipline of Programming. Series in Automatic Computation 1976, Prentice Hall Int.
18. Dill D.L. Trace Theory for Automatic Hierarchical Verification of Speed-independent Circuits 1989, MIT Press, Cambridge, MA, USA.
19. Filliâtre J.-C. Verification of non-functional programs using interpretations in type theory. Journal of Functional Programming 2003, 13(4):709-745.
20. Filliâtre J.-C., Marché C. The Why/Krakatoa/Caduceus platform for deductive program verification. Lecture Notes in Computer Science 2007, vol. 4590:173-177. Springer, Berlin, Germany, URL http://www.lri.fr/~filliatr/ftp/publis/cav07.pdf. W. Damm, H. Hermanns (Eds.).
21. Flanagan C., Leino K.R.M. Houdini, an annotation assistant for ESC/Java. FME'01: Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity 2001, 500-517. Springer-Verlag, London, UK.
22. Gulwani S., Tiwari A. Combining abstract interpreters. Annual ACM Conference on Programming Language Design and Implementation 2006, ACM.
23. Gulwani S., Tiwari A. Assertion checking unified. The 8th International Conference on Verification, Model Checking and Abstract Interpretation 2007, 363-377. Springer.
24. Hackett B., Das M., Wang D., Yang Z. Modular checking for buffer overflows in the large. ICSE'06: Proceedings of the 28th International Conference on Software Engineering 2006, 232-241. ACM, New York, NY, USA.
25. Hart, T.E., Ku, K., Lie, D., Chechik, M., Gurfinkel, A., 2008. Ptyasm: Software model checking with proof templates. In: Proceedings of the 23rd IEEE/ACM International Conference on Automated Software Engineering, ASE'08.
26. Hatcliff, J., Leavens, G.T., Leino, K.R.M., Miller, P., Parkinson, M., 2009. Behavioral interface specification languages. Technical Report CS-TR-09-01, University of Central Florida, School of EECS, a survey paper, Draft.
27. Hubert, T., Marché, C., Mar. 2007. Separation analysis for deductive verification. In: Heap Analysis and Verification, HAV'07. Braga, Portugal, pp. 81-93, http://www.lri.fr/~marche/hubert07hav.pdf.
28. Janota, M., 2007. Assertion-based loop invariant generation. In: Proceedings of the 1st International Workshop on Invariant Generation, WING'07. Hagenberg, Austria, workshop at CALCULEMUS, 2007.
29. Jim T., Morrisett J.G., Grossman D., Hicks M.W., Cheney J., Wang Y. Cyclone: A safe dialect of C. Proc. 2002 USENIX Annual Technical Conference 2002, 275-288. Berkeley, CA, USA.
30. Karr M. Affine relationships among variables of a program. Acta Informatica 1976, 133-151.
31. Kernighan B.W., Ritchie D.M. The C Programming Language 1978, Prentice-Hall, Englewood Cliffs, New Jersey.
32. Koes D., Budiu M., Venkataramani G. Programmer specified pointer independence. MSP'04: Proceedings of the 2004 Workshop on Memory System Performance 2004, 51-59. ACM, New York, NY, USA.
33. Ku K., Hart T.E., Chechik M., Lie D. A buffer overflow benchmark for software model checkers. ASE'07: Proceedings of the Twenty-second IEEE/ACM International Conference on Automated Software Engineering 2007, 389-392. ACM, New York, NY, USA.
34. Lattner C., Lenharth A., Adve V. Making context-sensitive points-to analysis with heap cloning practical for the real world. SIGPLAN Notices 2007, 42(6):278-289.
35. Leino K.R.M., Logozzo F. Loop invariants on demand. LNCS 2005, 119-134. Springer-Verlag.
36. Leino, K.R.M., Logozzo, F., 2007. Using widenings to infer loop invariants inside an SMT solver, or: a theorem prover as abstract domain. Tech. Rep. RISC-Linz Report Series No. 07-07, RISC, Hagenberg, Austria, proc. WING'07.
37. Leino K.R.M., Saxe J.B., Stata R. Checking Java programs via guarded commands. Proceedings of the Workshop on Object-Oriented Technology 1999, 110-111. Springer-Verlag, London, UK.
38. Liang D., Harrold M.J. Efficient computation of parameterized pointer information for interprocedural analyses. SAS'01: Proceedings of the 8th International Symposium on Static Analysis 2001, 279-298. Springer-Verlag, London, UK.
39. Marché C. Jessie: an intermediate language for Java and C verification. Programming Languages meets Program Verification (PLPV) 2007, 1-2. ACM, Freiburg, Germany, URL http://doi.acm.org/10.1145/1292597.1292602.
40. Miné A. The octagon abstract domain. Higher Order Symbolic Computation 2006, 19(1):31-100.
41. Monniaux, D., 2008. A quantifier elimination algorithm for linear real arithmetic. CoRR abs/0803.1575, informal publication.
42. Moy, Y., 2009. Automatic modular static safety checking for C programs. Ph.D. Thesis, Université Paris-Sud.
43. Norrish, M., 1998. C formalised in HOL. Ph.D. Thesis, University of Cambridge.
44. Popeea C., Xu D.N., Chin W.-N. A practical and precise inference and specializer for array bound checks elimination. PEPM'08: Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation 2008, 177-187. ACM, New York, NY, USA.
45. Reynolds J.C. Syntactic control of interference. POPL'78: Proceedings of the 5th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages 1978, 39-46. ACM, New York, NY, USA.
46. Rival X. Understanding the origin of alarms in astrée. LNCS 2005, vol. 3672:303-319. Springer-Verlag, London, UK.
47. Rousset, N., 2008. Automatisation de la spécification et de la vérification d'applications Java Card. Thèse de doctorat, Université Paris-Sud.
48. Starostin, A., 2006. Formal verification of a C-library for strings. Master's Thesis, Saarland University.
49. Steensgaard B. Points-to analysis in almost linear time. POPL'96: Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 1996, 32-41. ACM, New York, NY, USA.
50. Suzuki N., Ishihata K. Implementation of an array bound checker. POPL'77: Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages 1977, 132-143. ACM, New York, NY, USA.
51. Talpin, J.-P., Jouvelot, P., 1991. Polymorphic type region and effect inference. Tech. Rep. EMP-CRI E/150.
52. Talpin J.-P., Jouvelot P. The type and effect discipline. Seventh Annual IEEE Symposium on Logic in Computer Science 1992, 162-173. IEEE Computer Society Press, Los Alamitos, California.
53. Tofte, M., Talpin, J.-P., 1997. Region-based memory management. Information and Computation.
54. Weispfenning V. Complexity and uniformity of elimination in presburger arithmetic. ISSAC'97: Proceedings of the 1997 International Symposium on Symbolic and Algebraic computation 1997, 48-53. ACM, New York, NY, USA.
55. Xu, Z., 2000. Safety checking of machine code. Ph.D. Thesis, Univ. of Wisconsin, Madison.
56. Xu Z., Miller B.P., Reps T. Safety checking of machine code. ACM SIGPLAN Notices 2000, 35(5):70-82.
57. Zitser M., Lippmann R., Leek T. Testing static analysis tools using exploitable buffer overflows from open source code. SIGSOFT Software Engineering Notes 2004, 29(6):97-106.