Widening polyhedra with landmarks

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

Volumn 4279 LNCS, Issue , 2006, Pages 166-182

  Simon, Axel ^a   King, Andy ^a  

^a UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; EXTRAPOLATION; OBJECT ORIENTED PROGRAMMING;

ABSTRACT DOMAINS; COMPLEX LOOPS; LANDMARKS; POLYHEDRA;

DATABASE SYSTEMS;

EID: 33845930073     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11924661_11     Document Type: Conference Paper

References (25)

1. R. Bagnara, P. Hill, E. Ricci, and E. Zaffanella. Precise Widening Operators for Convex Polyhedra. Science of Computer Programming, 58(1-2):28-56, 2005.
2. R. Bagnara, P. M. Hill, and E. Zaffanella. Not necessarily closed convex polyhedra and the double desciption method. Formal Asp. Comput., 17(2):222-257, 2005.
3. P. M. Benoy. Polyhedral Domains for Abstract Interpretation in Logic Programming. PhD thesis, Computing Lab., Univ. of Kent, Canterbury, UK, January 2002.
4. F. Besson, T. P. Jensen, and J.-P. Talpin. Polyhedral Analysis for Synchronous Languages. In SAS, number 1694 in LNCS, pages 51-68, Venice, Italy, 1999.
5. B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Mine, D. Monniaux, and X. Rival. Design and Implementation of a Special-Purpose Static Program Analyzer for Safety-Critical Real-Time Embedded Software. In The Essence of Computation: Complexity, Analysis, Transformation, number 2566 in LNCS, pages 85-108. Springer Verlag, 2002.
6. F. Bourdoncle. Efficient Chaotic Iteration Strategies with Widenings. In International Conference on Formal Methods in Programming and their Applications, volume 735 of LNCS, pages 128-141. Springer Verlag, 1993.
7. P. Cousot and R. Cousot. Static Determination of Dynamic Properties of Programs. In Second International Symposium on Programming, pages 106-130. Dunod, Paris, France, 1976.
8. P. Cousot and R. Cousot. Abstract Interpretation and Application to Logic Programs. Journal of Logic Programming, 13(2-3):103-179, 1992.
9. P. Cousot and R. Cousot. Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation. In M. Bruynooghe and M. Wirsing, editors, International Symposium on Programming Language Implementation and Logic Programming, volume 631 of LNCS, pages 269-295. Springer-Verlag, 1992.
10. P. Cousot and N. Halbwachs. Automatic Discovery of Linear Constraints among Variables of a Program. In Symposium on Principles of Programming Languages, pages 84-97, Tucson, Arizona, 1978. ACM Press.
11. N. Dor, M. Rodeh, and M. Sagiv. Cleanness Checking of String Manipulations in C Programs via Integer Analysis. In P. Cousot, editor, Static Analysis Symposium, number 2126 in LNCS, pages 194-212, Paris, France, 2001. Springer-Verlag.
12. D. Gopan and T. Reps. Lookahead Widening. In CAV, volume 4144. Springer, 2006. To appear.
13. B. S. Gulavani and S. K. Rajamani. Counterexample Driven Refinement for Abstract Interpretation. In TACAS, volume 3920 of LNCS, pages 474-488. Springer, April 2006.
14. ème cicle d'informatique, Université scientifique et médicale de Grenoble, Grenoble, France, March 1979.
15. N. Halbwachs, Y.-E. Proy, and P. Roumanoff. Verification of Real-Time Systems using Linear Relation Analysis. Formal Methods in System Design, 11(2):157-185, August 1997.
16. W. Harvey. Computing Two-Dimensional Integer Hulls. SIAM Journal on Computing, 28(6):2285-2299, 1999.
17. N. Heintze and O. Tardieu. Ultra-fast Aliasing Analysis using CLA: A Million Lines of C Code in a Second. In SIGPLAN Conference on Programming Language Design and Implementation, pages 254-263, 2001.
18. A. Miné. The Octagon Abstract Domain. In Eighth Working Conference on Reverse Engineering, pages 310-319. IEEE Computer Society, 2001.
19. S. Sankaranarayanan, M. Colón, H. B. Sipma, and Z. Manna. Efficient Strongly Relational Polyhedral Analysis. In VMCAI, pages 111-125, 2006.
20. A. Simon and A. King. Analyzing String Buffers in C. In Algebraic Methodology and Software Technology, number 2422 in LNCS, pages 365-379. Springer, 2002.
21. A. Simon and A. King. Exploiting Sparsity in Polyhedral Analysis. In C. Hankin and I. Siveroni, editors, Static Analysis Symposium, number 3672 in LNCS, pages 336-351. Springer Verlag, September 2005.
22. A. Simon, A. King, and J. M. Howe. Two Variables per Linear Inequality as an Abstract Domain. In M. Leuschel, editor, Logic Based Program Development and Transformation, number 2664 in LNCS, pages 71-89. Springer, September 2002.
23. B. Steensgaard. Points-to Analysis in Almost Linear Time. In Symposium on the Principles of Progamming Languages, pages 32-41, 1996.
24. Z. Su and D. Wagner. A Class of Polynomially Solvable Range Constraints for Interval Analysis without Widenings. Theor. Comput. Sci., 345(1):122-138, 2005.
25. D. Wagner. Static analysis and computer security: New techniques for software assurance. PhD thesis, University of California at Berkeley, December 2000.