Pentagons: A weakly relational abstract domain for the efficient validation of array accesses

Science of Computer Programming

Volumn 75, Issue 9, 2010, Pages 796-807

  Logozzo, Francesco ^a   Fhndrich, Manuel ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

.NET framework; Abstract domains; Abstract interpretation; Bounds checking; Numerical domains; Static analysis

Indexed keywords

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; BOUNDS CHECKING; NET FRAMEWORK; NUMERICAL DOMAINS;

STATIC ANALYSIS;

ABSTRACTING;

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

References (38)

1. X. Allamigeon, W. Godard, and C. Hymans Static analysis of string manipulations in critical embedded C programs SAS'06 August 2006 Springer-Verlag
2. R. Alur, D.L. Dill, Automata for modeling real-time systems, in: ICALP'90, July 1990
3. R. Bagnara, P.M. Hill, E. Mazzi, and E. Zaffanella Widening operators for weakly-relational numeric abstractions SAS'05 September 2005 Springer-Verlag
4. F. Banterle, R. Giacobazzi, A fast implementation of the octagon abstract domain on graphics hardware, in: SAS'07, August 2007
5. M. Barnett, M. Fähndrich, F. Logozzo, Codecontracts for.net. http://msdn.microsoft.com/en-us/devlabs/dd491992.aspx
6. 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 PLDI'03 June 2003 ACM Press
7. R. Bodk, R. Gupta, and V. Sarkar ABCD: Eliminating array bounds checks on demand PLDI'00 2000 ACM Press
8. R. Claris, and J. Cortadella The octahedron abstract domain Sci. Comput. Program. 64 1 2007
9. E.M. Clarke, O. Grumberg, and D.A. Peled Model Checking 1999 The MIT Press
10. A. Courbot, M. Pavlova, G. Grimaud, and J.-J. Vandewalle A low-footprint java-to-native compilation scheme using formal methods CARDIS'06 LNCS April 2006 Springer-Verlag
11. P. Cousot The calculational design of a generic abstract interpreter Calculational System Design NATO ASI Series F 1999 IOS Press Amsterdam
12. P. Cousot Verification by abstract interpretation Verification: Theory and Practice 2003 Springer-Verlag
13. P. Cousot, and R. Cousot Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints POPL'77 January 1977 ACM Press
14. P. Cousot, and N. Halbwachs Automatic discovery of linear restraints among variables of a program POPL'78 January 1978 ACM Press
15. N. Dor, M. Rodeh, and M. Sagiv CSSV: Towards a realistic tool for statically detecting all buffer overflows in c PLDI'03 2003 ACM Press
16. ECMA. Standard ECMA-335, Common Language Infrastructure (CLI). http://www.ecma-international.org/publications/standards/Ecma-335.htm, Ecma International, 2006
17. S. Gaubert, E. Goubault, A. Taly, S. Zennou, Static analysis by policy iteration on relational domains, in: ESOP'07, April 2007
18. N. Halbwachs, D. Merchat, and L. Gonnord Some ways to reduce the space dimension in polyhedra computations Formal Methods in System Design 29 1 2006 79 95
19. ECMA Int. Standard ECMA-355, Common Language Infrastructure, June 2006
20. M. Karr On affine relationships among variables of a program Acta Informatica 6 2 1976 133 151
21. G.A. Kildall A unified approach to global program optimization POPL'73 October 1973 ACM Press
22. D. Larochelle, D. Evans, Statically detecting likely buffer overflow vulnerabilities, in: 2001 USENIX Security Symposium, August 2001
23. V. Laviron, F. Logozzo, Subpolyhedra: A (more) scalable approach to infer linear inequalities, in: VMCAI'09, January 2009
24. F. Logozzo Cibai: An abstract interpretation-based static analyzer for modular analysis and verification of Java classes VMCAI'07 January 2007 Springer-Verlag
25. F. Logozzo, and M.A. Fhndrich On the relative completeness of bytecode analysis versus source code analysis CC'08 LNCS March 2008 Springer-Verlag
26. A. Min A new numerical abstract domain based on difference-bounds matrices PADO'01 May 2001 Springer-Verlag
27. A. Min The octagon abstract domain WCRE 2001 October 2001 IEEE Computer Society
28. A. Min, A few graph-based relational numerical abstract domains, in: SAS'02, September 2002
29. A. Miné, Weakly relational numerical abstract domains, Ph.D. thesis, cole Polythechnique, 2004
30. J. Navas, Ed. Mera, P. Lpez-Garca, and M.V. Hermenegildo User-definable resource bounds analysis for logic programs ICLP'07 September 2007 Springer-Verlag
31. C. Popeea, D.N. Xu, W.-N. Chin, A practical and precise inference and specializer for array bound checks elimination, in: PEPM'08, 2008
32. P.Z. Revesz, The constraint database approach to software verification, in: VMCAI'07, January 2007
33. S. Sankaranarayanan, F. Ivancic, A. Gupta, Program analysis using symbolic ranges, in: SAS'07, August 2007
34. S. Sankaranarayanan, H.B. Sipma, Z. Manna, Scalable analysis of linear systems using mathematical programming, in: VMCAI'05, January 2005, pp. 2541
35. A. Simon, A. King, and J.M. Howe Two variables per linear inequality as an abstract domain LOPSTR'02 2002 Springer-Verlag
36. A. Venet Nonuniform alias analysis of recursive data structures and arrays SAS'02 September 2002 Springer-Verlag
37. A. Venet, and G.P. Brat Precise and efficient static array bound checking for large embedded c programs PLDI'04 July 2004 ACM Press
38. H. Xi, and F. Pfenning Eliminating array bound checking through dependent types PLDI'98 1998 ACM Press