Donut domains: Efficient non-convex domains for abstract interpretation

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

Volumn 7148 LNCS, Issue , 2012, Pages 235-250

  Ghorbal, Khalil ^a   Ivančić, Franjo ^a   Balakrishnan, Gogul ^a   Maeda, Naoto ^b   Gupta, Aarti ^a  

^a NEC LABORATORIES AMERICA   (United States)

^b NEC CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; ABSTRACT OBJECT; CONVEX SET; NUMERICAL PROPERTIES; PRECISE ANALYSIS; PROGRAM ANALYSIS; RUNTIMES; STATE-SPACE;

MODEL CHECKING; PROGRAM DEBUGGING; SET THEORY;

ABSTRACTING;

EID: 84863418682     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-27940-9_16     Document Type: Conference Paper

References (30)

1. Adjé, A., Gaubert, S., Goubault, E.: Coupling Policy Iteration with Semi-definite Relaxation to Compute Accurate Numerical Invariants in Static Analysis. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 23-42. Springer, Heidelberg (2010)
2. Allamigeon, X., Gaubert, S., Goubault, É.: Inferring Min and Max Invariants Using Max-Plus Polyhedra. In: Alpuente, M., Vidal, G. (eds.) SAS 2008. LNCS, vol. 5079, pp. 189-204. Springer, Heidelberg (2008)
3. Bagnara, R.: A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages. In: Science of Computer Programming, pp. 2-119 (1999)
4. Bagnara, R., Hill, P.M., Zaffanella, E.: Not necessarily closed convex polyhedra and the double description method. Form. Asp. Comput., 222-257 (2005)
5. Bagnara, R., Hill, P.M., Zaffanella, E.: Widening operators for powerset domains. STTT 8(4-5), 449-466 (2006)
6. Bagnara, R., Hill, P.M., Zaffanella, E.: Exact join detection for convex polyhedra and other numerical abstractions. Comput. Geom. 43(5), 453-473 (2010)
7. Bemporad, A., Filippi, C., Torrisi, F.D.: Inner and outer approximations of polytopes using boxes. Comput. Geom. 27(2), 151-178 (2004)
8. Bemporad, A., Fukuda, K., Torrisi, F.D.: Convexity recognition of the union of polyhedra. Comput. Geom. 18(3), 141-154 (2001)
9. Chaki, S., Gurfinkel, A., Strichman, O.: Decision diagrams for linear arithmetic. In: FMCAD, pp. 53-60. IEEE (2009)
10. 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)
11. Cousot, P., Cousot, R.: Static determination of dynamic properties of programs. In: 2nd Intl. Symp. on Programming, Dunod, France, pp. 106-130 (1976)
12. Cousot, P., Cousot, R.: Abstract Interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238-252. ACM (1977)
13. Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among the variables of a program. In: POPL, pp. 84-97. ACM (January 1978)
14. Dams, D., Namjoshi, K.S.: Automata as Abstractions. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 216-232. Springer, Heidelberg (2005)
15. Ghorbal, K., Goubault, E., Putot, S.: The Zonotope Abstract Domain Taylor1+. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 627-633. Springer, Heidelberg (2009)
16. Ghorbal, K., Goubault, E., Putot, S.: A Logical Product Approach to Zonotope Intersection. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 212-226. Springer, Heidelberg (2010)
17. Goldsztejn, A., Daney, D., Rueher, M., Taillibert, P.: Modal intervals revisited: a mean-value extension to generalized intervals. In: QCP (2005)
18. Goubault, É., Putot, S.: Static Analysis of Numerical Algorithms. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, pp. 18-34. Springer, Heidelberg (2006)
19. Goubault, É., Putot, S.: Under-Approximations of Computations in Real Numbers Based on Generalized Affine Arithmetic. In: Riis Nielson, H., Filé, G. (eds.) SAS 2007. LNCS, vol. 4634, pp. 137-152. Springer, Heidelberg (2007)
20. Granger, P.: Static Analysis of Linear Congruence Equalities Among Variables of a Program. In: Abramsky, S. (ed.) CAAP 1991 and TAPSOFT 1991. LNCS, vol. 493, pp. 169-192. Springer, Heidelberg (1991)
21. Gurfinkel, A., Chaki, S.: Boxes: A Symbolic Abstract Domain of Boxes. In: Cousot, R., Martel, M. (eds.) SAS 2010. LNCS, vol. 6337, pp. 287-303. Springer, Heidelberg (2010)
22. Halbwachs, N., Proy, Y.-E., Raymond, P.: Verification of Linear Hybrid Systems by Means of Convex Approximations. In: LeCharlier, B. (ed.) SAS 1994. LNCS, vol. 864, pp. 223-237. Springer, Heidelberg (1994)
23. 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)
24. Kanade, A., Alur, R., Ivančić, F., Ramesh, S., Sankaranarayanan, S., Shashidhar, K.C.: Generating and Analyzing Symbolic Traces of Simulink/Stateflow Models. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 430-445. Springer, Heidelberg (2009)
25. Makhorin, A.: The GNU Linear Programming Kit, GLPK (2000), http://www.gnu.org/software/glpk/glpk.html
26. Masdupuy, F.: Array abstractions using semantic analysis of trapezoid congruences. In: ICS, pp. 226-235 (1992)
27. Miné, A.: The octagon abstract domain. In: WCRE, pp. 310-319 (October 2001)
28. Prabhu, P., Maeda, N., Balakrishnan, G., Ivančić, F., Gupta, A.: Interprocedural Exception Analysis for C++. In: Mezini, M. (ed.) ECOOP 2011. LNCS, vol. 6813, pp. 583-608. Springer, Heidelberg (2011)
29. Péron, M., Halbwachs, N.: An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 268-282. Springer, Heidelberg (2007) (Pubitemid 350143500)
30. Rockafellar, R.T.: Convex Analysis. Princeton University Press (1970)