Precondition inference from intermittent assertions and application to contracts on collections

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

Volumn 6538 LNCS, Issue , 2011, Pages 150-168

  Cousot, Patrick ^b,c   Cousot, Radhia ^a,c,d   Logozzo, Francesco ^d  

^a CNRS   (France)

^b NEW YORK UNIVERSITY   (United States)

^c ECOLE NORMALE SUPÉRIEURE   (France)

^d MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT INTERPRETATIONS; DESIGN BY CONTRACTS; INFERENCE PROBLEM; INTERACTIVE INPUT; RUNTIMES; WEAKEST PRECONDITION;

ABSTRACTING; MODEL CHECKING;

STATIC ANALYSIS;

EID: 79251554669     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18275-4_12     Document Type: Conference Paper

References (28)

1. Arnout, K., Meyer, B.: Uncovering hidden contracts: The. NET example. IEEE Computer 36(11), 48-55 (2003)
2. Baier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press, Cambridge (2008)
3. Barnett, M., Fähndrich, M., Garbervetsky, D., Logozzo, F.: Annotations for (more) precise points-to analysis. In: IWACO 2007, Stockholm U. and KTH (2007)
4. Barnett, M., Fähndrich, M., Logozzo, F.: Embedded contract languages. In: SAC 2010, pp. 2103-2110. ACM, New York (2010)
5. Biere, A., Cimatti, A., Clarke, E., Strichman, O., Zhu, Y.: Bounded model checking. Advances in Computers 58, 118-149 (2003)
6. Bourdoncle, F.: Abstract debugging of higher-order imperative languages. In: PLDI 1993, pp. 46-55. ACM, New York (1993)
7. Calcagno, C., Distefano, D., O'Hearn, P., Yang, H.: Compositional shape analysis by means of bi-abduction. In: 36th POPL, pp. 289-300. ACM, New York (2009)
8. Chandra, S., Fink, S., Sridharan, M.: Snugglebug: a powerful approach to weakest preconditions. In: PLDI, pp. 363-374. ACM, New York (2009)
9. Cousot, P.: Méthodes itératives de construction et d'approximation de points fixes d'opérateurs monotones sur un treillis, analyse sémantique de programmes (in French). Thèse d'Étatès sciences mathématiques, Université scientifique et médicale de Grenoble (1978)
10. Cousot, P.: Semantic foundations of program analysis. In: Muchnick, S., Jones, N. (eds.) Program Flow Analysis: Theory and Applications, ch. 10, pp. 303-342. Prentice-Hall, Englewood Cliffs (1981)
11. Cousot, P.: Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. TCS 277(1-2), 47-103 (2002)
12. Cousot, P., Cousot, R.: Static determination of dynamic properties of recursive procedures. In: Neuhold, E. (ed.) IFIP Conf. on Formal Description of Programming Concepts, pp. 237-277. North-Holland, Amsterdam (1977)
13. Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: 6th POPL, pp. 269-282. ACM, New York (1979)
14. Cousot, P., Cousot, R.: Abstract interpretation and application to logic programs. Journal of Logic Programming 13(2-3), 103-179 (1992)
15. Cousot, P., Cousot, R.: Modular static program analysis. In: CC 2002. LNCS, vol. 2304, pp. 159-178. Springer, Heidelberg (2002)
16. Cousot, P., Cousot, R., Logozzo, F.: A parametric segmentation functor for fully automatic and scalable array content analysis. In: POPL 2011. ACM, New York (2011)
17. Dijkstra, E.: Guarded commands, nondeterminacy and formal derivation of programs. CACM 18(8), 453-457 (1975)
18. Fähndrich, M., Logozzo, F.: Clousot: Static contract checking with abstract interpretation. In: FoVeOOS. Springer, Heidelberg (2010)
19. Flanagan, C., Leino, K., Lillibridge, M., Nelson, G., Saxe, J., Stata, R.: Extended Static Checking for Java. In: PLDI, pp. 234-245. ACM, New York (2002)
20. Gulwani, S., Tiwari, A.: Computing procedure summaries for interprocedural analysis. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 253-267. Springer, Heidelberg (2007)
21. Hecht, M.: Flow Analysis of Computer Programs. Elsevier, North-Holland (1977)
22. King, J.: Symbolic execution and program testing. CACM 19(7), 385-394 (1976)
23. Meyer, B.: Eiffel: The Language. Prentice-Hall, Englewood Cliffs (1991)
24. Meyer, B.: Applying "Design by Contract". IEEE Computer 25(10), 40-51 (1992)
25. Moy, Y.: Sufficient preconditions for modular assertion checking. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol. 4905, pp. 188-202. Springer, Heidelberg (2008)
26. Park, D.: Fixpoint induction and proofs of program properties. In: Meltzer, B., Michie, D. (eds.) Machine Intelligences, vol. 5, pp. 59-78. Edinburgh University Press, Edinburgh (1969)
27. Rival, X.: Understanding the origin of alarms in ASTRÉE. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 303-319. Springer, Heidelberg (2005)
28. Lev-Ami, T., Sagiv, M., Reps, T., Gulwani, S.: Backward analysis for inferring quantified preconditions. Tr-2007-12-01, Tel Aviv University (2007)