An abstract domain to discover interval linear equalities

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

Volumn 5944 LNCS, Issue , 2010, Pages 112-128

  Chen, Liqian ^a,b   Miné, Antoine ^a,c   Wang, Ji ^b   Cousot, Patrick ^a,d  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

^c CNRS   (France)

^d NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT DOMAINS; FLOATING-POINT ARITHMETIC; INEXACT DATA; LINEAR CONSTRAINTS; LINEAR EQUALITY; LINEAR RELATION; POLYNOMIAL-TIME;

ABSTRACTING; LINEARIZATION; PROGRAM INTERPRETERS;

MODEL CHECKING;

EID: 77949420260     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11319-2_11     Document Type: Conference Paper

References (21)

1. Blanchet, B., Cousot, P., Cousot, R., Feret, J.,Mauborgne, L., Miné, A.,Monniaux, D., Rival, X.: A static analyzer for large safety-critical software. In: ACM PLDI 2003, pp. 196-207. ACM Press, New York (2003)
2. Chen, L., Miné, A., Cousot, P.: A sound floating-point polyhedra abstract domain. In: Ramalingam, G. (ed.) APLAS 2008. LNCS, vol. 5356, pp. 3-18. Springer, Heidelberg (2008)
3. Chen, L., Miné, A., Wang, J., Cousot, P.: Interval polyhedra: An abstract domain to infer interval linear relationships. In: Palsberg, J., Su, Z. (eds.) SAS 2009. LNCS, vol. 5673, pp. 309-325. Springer, Heidelberg (2009)
4. Cousot, P., Cousot, R.: Static determination of dynamic properties of programs. In: Proc. of the 2nd International Symposium on Programming, Dunod, Paris, pp. 106-130 (1976)
5. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: ACM POPL 1977, pp. 238-252. ACM Press, New York (1977)
6. Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: ACM POPL 1978, pp. 84-96. ACM Press, New York (1978)
7. Feret, J.: Occurrence counting analysis for the pi-calculus. In: GETCO 2000. Electr. Notes Theor. Comput. Sci., vol. 39(2), pp. 1-18. Elsevier, Amsterdam (2001)
8. Gaubert, S., Goubault, E., Taly, A., Zennou, S.: Static analysis by policy iteration on relational domains. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 237-252. Springer, Heidelberg (2007)
9. Granger, P.: Static analysis of linear congruence equalities among variables of a program. In: Abramsky, S. (ed.) TAPSOFT 1991. LNCS, vol. 493, pp. 169-192. Springer, Heidelberg (1991)
10. Gulwani, S., Necula, G.: Discovering affine equalities using random interpretation. In: ACM POPL 2003, pp. 74-84. ACM Press, New York (2003)
11. Jeannet, B., Miné, A.: Apron: A library of numerical abstract domains for static analysis. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 661-667. Springer, Heidelberg (2009)
12. Karr, M.: Affine relationships among variables of a program. Acta Inf. 6, 133-151 (1976)
13. Lalire, G., Argoud, M., Jeannet, B.: Interproc, http://pop-art.inrialpes. fr/people/bjeannet/bjeannet-forge/interproc/
14. Laviron, V., Logozzo, F.: Subpolyhedra: A (more) scalable approach to infer linear inequalities. In: Jones, N.D., Müller-Olm, M. (eds.) VMCAI 2009. LNCS, vol. 5403, pp. 229-244. Springer, Heidelberg (2009)
15. Miné, A.: The octagon abstract domain. Higher-Order and Symbolic Computation 19(1), 31-100 (2006)
16. Miné, A.: Symbolic methods to enhance the precision of numerical abstract domains. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 348-363. Springer, Heidelberg (2005)
17. Müller-Olm, M., Seidl, H.: A note on Karr's algorithm. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1016-1028. Springer, Heidelberg (2004)
18. Müller-Olm, M., Seidl, H.: Precise interprocedural analysis through linear algebra. In: ACM POPL 2004, pp. 330-341. ACM Press, New York (2004)
19. Rohn, J.: Solvability of systems of interval linear equations and inequalities. In: Linear Optimization Problems with Inexact Data, pp. 35-77. Springer, Heidelberg (2006)
20. Sankaranarayanan, S., Sipma, H., 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)
21. 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)