Discovering properties about arrays in simple programs

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2008, Pages 339-348

  Halbwachs, Nicolas ^a   Péron, Mathias ^a  

^a VERIMAG   (France)

Author keywords

"Sentinel"; Abstract interpretation; Arrays; Invariant synthesis; Program verification; Sorting algorithms

Indexed keywords

ABSTRACTING; BASIC (PROGRAMMING LANGUAGE); C (PROGRAMMING LANGUAGE); COMPUTER SOFTWARE; COMPUTERS; INFORMATION THEORY; JAVA PROGRAMMING LANGUAGE; LINGUISTICS; PROGRAM INTERPRETERS;

'SENTINEL'; ABSTRACT INTERPRETATION; ARRAYS; INVARIANT SYNTHESIS; PROGRAM VERIFICATION; SORTING ALGORITHMS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 57349124514     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375581.1375623     Document Type: Conference Paper

References (24)

1. [ACD93] R. Alur, C. Courcoubetis, and D. L. Dill. Model-checking in dense real-time. Information and Computation, 104(1):2-34, 1993. Preliminary version appears in the Proc. of 5th LICS, 1990.
2. +06] A. Bouajjani, M. Bozga, P. Habermehl, R. Iosif, P. Moro, and T. Vojnar. Programs with lists are counter automata. In Computer Aided Verification (CAV 2006), pages 517-531. LNCS 4144, Springer Verlag, July 2006.
3. +03] B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, D. Monniaux, and X. Rival. A static analyzer for large safety-critical software. In PLDI 2003, ACM SIGPLAN SIGSOFT Conference on Programming Language Design and Implementation, pages 196-207, San Diego (Ca.), June 2003.
4. [BHMR07] D. Beyer, T. A. Henzinger, R. Majumdar, and A. Rybalchenko. Path invariants. In J. Ferrante and K. S. McKinley, editors, PLDI2007, pages 300-309. ACM, 2007.
5. [BLP06] S. Bardin, J. Leroux, and G. Point. Tool presentation: Fast extended release. In 18th Conf. Computer Aided Verification (CAV2006), pages 63-66, Seattle (Washington), 2006. LNCS 4144, Springer-Verlag.
6. [BMS061 A. R. Bradley, Z. Manna, and H. B. Sipma. What's decidable about arrays? In E. A. Emerson and K. S. Namjoshi, editors, VMCAI 06, pages 427-442. LNCS 3855, Springer Verlag, 2006.
7. [CC76] P. Cousot and R. Cousot. Static determination of dynamic properties of programs. In 2nd Int. Symp. on Programming. Dunod, Paris, 1976.
8. [CC04] R. C. Claris and J. Cortadella. Verification of parametric timed circuits using octahedra. In Designing correct circuits, DCC'04. Barcelona, March 2004.
9. [CH78] P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In 5th ACM Symposium on Principles of Programming Languages, POPL'78, Tucson (Arizona), January 1978.
10. [Cou03] P. Cousot. Verification by abstract interpretation. In N. Dershowitz, editor, Proc. Int. Symp. on Verification - Theory & Practice - Honoring Zohar Manna's 64th Birthday, pages 243-268, Taormina, Italy, June 29 - July 4 2003. © Springer-Verlag, Berlin, Germany.
11. [Dil89] D. L. Dill. Timing assumptions and verification of finite state concurrent systems. In Workshop on Automatic Verification Methods for Finite State Systems, Grenoble. LNCS 407, Springer Verlag, June 1989.
12. [FQ02] C. Flanagan and S. Qadeer. Predicate abstraction for software verification. In POPL 2002, pages 191-202. ACM, 2002.
13. +04] D. Gopan, F. Di Maio, N. Dor, T. Reps, and M. Sagiv. Numeric domains with summarized dimensions. In TACAS'04, pages 512-529, Barcelona, 2004.
14. [GMT08] S. Gulwani, B. McCloskey, and A. Tiwari. Lifting abstract interpreters to quantified logical domains. In G. C. Necula and P. Wadler. editors, POPL 2008, pages 235-246. ACM, 2008.
15. [Gop07] D. Gopan. Numeric program analysis techniques with applications to array analysis and library summarization. PhD thesis, Computer Science Department, University of Wisconsin, Madison, WI, August 2007.
16. [GRS05] D. Gopan, T. Reps, and M. Sagiv. A framework for numeric analysis of array operations. In Proc. of POPL'2005, pages 338 - 350, Long Beach, CA, 2005.
17. [Hoa71] C. A. R. Hoare. Proof of a program: Find. CACM, 14(1):39-45, 1971.
18. [IHV08] R. Iosif, P. Habermehl, and T. Vojnar. What else is decidable about arrays? In R. Amadio, editor, FOSSACS 2008. LNCS, Springer Verlag, 2008.
19. [JM07] R. Jhala and K. L. McMillan. Array abstractions from proofs. In W. Damm and H. Hermanns, editors, CAV 2007, pages 193-206. LNCS 4590, Springer Verlag, 2007.
20. [LB04] S. K. Lahiri and R. E. Bryant. Indexed predicate discovery for unbounded system verification. In R. Alur and D. Peled, editors, CAV 2004, pages 135-147. LNCS 3114, Springer Verlag, 2004.
21. [LBC03] S. K. Lahiri, R. E. Bryant, and B. Cook. A symbolic approach to predicate abstraction. In W. A. Hunt Jr. and F. Somenzi, editors, CAV 2003, pages 141-153. LNCS 2725, Springer Verlag, 2003.
22. [Mas92] F. Masdupuy. Array abstractions using semantic analysis of trapezoid congruences. In ICS '92: Proceedings of the 6th international conference on Supercomputing, pages 226-235, New York, NY, USA, 1992. ACM.
23. [MinO1] A. Miné. The octagon abstract domain. In AST 2001 in WCRE 2001, IEEE, pages 310-319. IEEE CS Press, October 2001.
24. [PH07] M. Péron and N. Halbwachs. An abstract domain extending Difference-Bound Matrices with disequality constraints. In B. Cook and A. Podelski, editors, 8th International Conference on Verification, Model-checking, and Abstract Intepretation, VMCAI'07, Nice, France, January 2007.