A parametric segmentation functor for fully automatic and scalable array content analysis

ACM SIGPLAN Notices

Volumn 46, Issue 1, 2011, Pages 105-118

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

^a NEW YORK UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Abstract interpretation; Array abstraction; Array content analysis; Array property inference; Invariant synthesis; Program verification; Static analysis

Indexed keywords

ABSTRACT INTERPRETATIONS; ARRAY ABSTRACTION; ARRAY PROPERTY INFERENCE; CONTENT ANALYSIS; INVARIANT SYNTHESIS; PROGRAM VERIFICATION;

STATIC ANALYSIS;

ABSTRACTING;

EID: 79251591996     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1925844.1926399     Document Type: Conference Paper

References (37)

1. M. Barnett, K. Leino, and W. Schulte. The Spec# programming system: An overview. CASSIS'04, LNCS 3362, 49-69. Springer, 2005.
2. M. Barnett, B.-Y. Chang, R. DeLine, B. Jacobs, and K. Leino. Boogie: A modular reusable verifier for object-oriented programs. FMCO'05, LNCS 4111, 364-387. Springer, 2006.
3. M. Barnett, M. Fähndrich, and F. Logozzo. Embedded contract languages. SAC'10. ACM, 2010.
4. D. Beyer, T. A. Henzinger, R. Majumdar, and A. Rybalchenko. Path invariants. PLDI'07, 300-309. ACM, 2007.
5. P. Chalin, J. Kinirya, G. Leavens, and E. Poll. Beyond assertions: Advanced specification and verification with JML and ESC/Java2. FMCO'05, LNCS 4111, 77-101. Springer, 2006.
6. P. Cousot. Verification by abstract interpretation. Verification - Theory & Practice, LNCS 2772, 243-268. Springer, 2003.
7. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. 4th POPL, 238-252. ACM, 1977.
8. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. 6th POPL, 269-282. ACM, 1979.
9. P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, D. Monniaux, and X. Rival. Combination of abstractions in the Astrée static analyzer. ASIAN, LNCS 4435, 272-300. Springer, 2006.
10. L. de Moura and N. Bjørner. Z3: An efficient SMT solver. TACAS'08, LNCS 4963, 337-340. Springer, 2008.
11. D. Dill. Timing assumptions and verification of finite-state concurrent systems. Automatic Verification Methods for Finite State Systems, LNCS 407, 197-212. Springer, 1989.
12. I. Dillig, T. Dillig, and A. Aiken. Fluid updates: Beyond strong vs. weak updates. ESOP'10, LNCS 6012, 246-266. Springer, 2010.
13. I. Dillig, T. Dillig, and A. Aiken. Precise reasoning for programs using containers. 37th POPL. ACM, 2011.
14. M. Fähndrich and F. Logozzo. Static contract checking with abstract interpretation. FoVeOOS'10, LNCS. Springer, 2010.
15. C. Flanagan and S. Qadeer. Predicate abstraction for software verification. 29th POPL, 191-202. ACM, 2002.
16. Garmin Int. Garmin device interface specification. Technical report, Garmin Int., Inc., Olathe, 2006. www.garmin.com/support/pdf/i op-spec.pdf.
17. D. Gopan, T. Reps, and S. Sagiv. A framework for numeric analysis of array operations. 32nd POPL, 338-350. ACM, 2005.
18. S. Gulwani, B. McCloskey, and A. Tiwari. Lifting abstract interpreters to quantified logical domains. 35th POPL, 235-246. ACM, 2008.
19. N. Halbwachs and M. Péron. Discovering properties about arrays in simple programs. PLDI'2008, 339-348. ACM, 2008.
20. R. Jhala and K. McMillan. Array abstractions from proofs. CAV'07, LNCS 4590, 193-206. Springer, 2007.
21. M. Karr. Affine relationships among variables of a program. Acta Inf., 6:133-151, 1976.
22. G. Kildall. A unified approach to global program optimization. 1st POPL, 194-206. ACM, 1973.
23. L. Kovács and A. Voronkov. Finding loop invariants for programs over arrays using a theorem prover. FASE'2009, LNCS 5503, 470-485. Springer, 2009.
24. V. Laviron and F. Logozzo. Subpolyhedra: A (more) scalable approach to infer linear inequalities. VMCAI, LNCS 5403, 229-244. Springer, 2009.
25. S.-H. Lee and D.-H. Cho. Packet-scheduling algorithm based on priority of separate buffers for unicast and multicast services. Electronics Letters, 39(2):259-260, 2003.
26. F. Logozzo. Class-level modular analysis for object oriented languages. SAS'03, LNCS 2694, 37-54. Springer, 2003.
27. F. Logozzo and M. Fähndrich. On the relative completeness of bytecode analysis versus source code analysis. CC'08, LNCS 4959, 197-212. Springer, 2008.
28. F. Logozzo and M. Fähndrich. Pentagons: a weakly relational abstract domain for the efficient validation of array accesses. SAC, 184-188. ACM, 2008.
29. M. Marron, D. Stefanovic, M. Hermenegildo, and D. Kapur. Heap analysis in the presence of collection libraries. PASTE'07, 31-36. ACM, 2007.
30. K. L. McMillan. Quantified invariant generation using an interpolating saturation prover. TACAS'08, LNCS 4963, 197-212. Springer, 2008.
31. B. Meyer. Eiffel: The Language. Prentice Hall, 1991.
32. A. Miné. The octagon abstract domain. Higher-Order and Symbolic Computation, 19:31-100, 2006.
33. V. Pratt. Two easy theories whose combination is hard. Technical report, MIT, 1977. boole.stanford.edu/pub/sefnp.pdf.
34. B. Roy. Transitivité et connexité. Comptes-Rendus de l'Académie des Sciences de Paris, Sér. A-B, 249:216-218, 1959.
35. M. Seghir, A. Podelski, and T. Wies. Abstraction refinement for quantified array assertions. SAS'09, LNCS 5673, 3-18. Springer, 2009.
36. R. Shostak. Deciding linear inequalities by computing loop residues. JACM, 28(4):769-779, 1981.
37. H. Yang, O. Lee, J. Berdine, C. Calcagno, B. Cook, D. Distefano, and P. W. O'Hearn. Scalable shape analysis for systems code. CAV'98, LNCS 5123, 385-398. Springer, 2008.