Logahedra: A new weakly relational domain

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

Volumn 5799 LNCS, Issue , 2009, Pages 306-320

  Howe, Jacob M ^a   King, Andy ^b,c  

^a CITY UNIVERSITY   (United Kingdom)

^b Portcullis Computer Security Limited   (United Kingdom)

^c UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT INTERPRETATIONS; ALGORITHMIC PROPERTIES; ARBITRARY SYSTEMS; INEQUALITY CONSTRAINT; LINEAR INEQUALITIES;

BOOLEAN FUNCTIONS; CONSTRAINT THEORY; MODEL CHECKING;

GEOMETRY;

EID: 71549151649     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04761-9_23     Document Type: Conference Paper

References (17)

1. Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: Fast Acceleration of Symbolic Transition Systems. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 118-121. Springer, Heidelberg (2003)
2. Charles, P.J., Howe, J.M., King, A.: Integer Polyhedra for Program Analysis. In: AAIM. LNCS, vol. 5564, pp. 85-99. Springer, Heidelberg (2009)
3. Clarisó, R., Cortadella, J.: The Octahedron Abstract Domain. Science of Computer Programming 64, 115-139 (2007)
4. Cousot, P., Halbwachs, N.: Automatic Discovery of Linear Restraints among Variables of a Program. In: POPL, pp. 84-97. ACM Press, New York (1978)
5. Eisenbrand, F., Laue, S.: A Linear Algorithm for Integer Programming in the Plane. Mathematical Programming 102(2), 249-259 (2005)
6. Halbwachs, N.: Détermination Automatique de Relations Linéaires Vérifiées par les Variables d'un Programme. PhD thesis, Université Scientifique et Médicale de Grenoble (1979)
7. Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: HyTech: A Model Checker for Hybrid Systems. Software Tools for Technology Transfer 1, 110-122 (1997)
8. Howe, J.M., King, A.: Closure Algorithms for Domains with Two Variables per Inequality. Technical Report TR/2009/DOC/01, School of Informatics, City University London (2009), http://www.soi.city.ac.uk/organisation/doc/research/ tech-reports/
9. Larsen, K.G., Larsson, F., Pettersson, P., Yi, W.: Efficient Verification of Real-time Systems: Compact Data Structure and State-space Reduction. In: IEEE Real-Time Systems Symposium, pp. 14-24. IEEE Computer Society, Los Alamitos (1997)
10. Logozzo, F., Fähndrich, M.: Pentagons: a Weakly Relational Abstract Domain for the Efficient Validation of Array Accesses. In: ACM Symposium on Applied Computing, pp. 184-188. ACM Press, New York (2008)
11. Miné, A.: The Octagon Abstract Domain. Higher-Order and Symbolic Computation 19(1), 31-100 (2006)
12. lg n Algorithm for the Two-Variable-Per- Constraint Linear Programming Satisfiability Problem. Technical Report STAN-CS-78-689, Stanford University, Computer Science Department (1978)
13. Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Constraint Based Linear Relations Analysis. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol. 3148, pp. 53-68. Springer, Heidelberg (2004)
14. Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Scalable Analysis of Linear Systems Using Mathematical Programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 25-41. Springer, Heidelberg (2005)
15. Simon, A.: Value-Range Analysis of C Programs: Towards Proving the Absence of Buffer Overflow Vulnerabilities. Springer, Heidelberg (2008)
16. Simon, A., King, A.: Exploiting Sparsity in Polyhedral Analysis. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 336-351. Springer, Heidelberg (2005)
17. Simon, A., King, A., Howe, J.M.: Two Variables per Linear Inequality as an Abstract Domain. In: Leuschel, M. (ed.) LOPSTR 2002. LNCS, vol. 2664, pp. 71-89. Springer, Heidelberg (2003)