Relational abstract domain of weighted hexagons

Electronic Notes in Theoretical Computer Science

Volumn 267, Issue 1, 2010, Pages 59-72

  Fulara, Jȩdrzej ^a   Durnoga, Konrad ^a   Jakubczyk, Krzysztof ^a   Schubert, Aleksy ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

abstract interpretation; Numerical abstract domains; static analysis

Indexed keywords

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; GRAPH-BASED ALGORITHMS; INTERVAL CONSTRAINT; NEGATIVE CONSTANTS; NORMAL FORM; SATISFIABILITY; WIDENING OPERATORS;

MATHEMATICAL OPERATORS; STATIC ANALYSIS;

ABSTRACTING;

EID: 77957763478     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2010.09.006     Document Type: Conference Paper

References (13)

1. V. Balasundaram, and K. Kennedy A technique for summarizing data access and its use in parallelism enhancing transformations SIGPLAN Not. 24 1989 41 53
2. Blanchet, B., P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, D. Monniaux and X. Rival, A static analyzer for large safety-critical software, in: PLDI'03 (2003), pp. 196-207.
3. Bourdoncle, F., Abstract debugging of higher-order imperative languages, in: PLDI'93 (1993), pp. 46-55.
4. T.H. Cormen, C.E. Leiserson, and R.L. Rivest Introduction to Algorithms 1990 MIT Press
5. Cousot, P., Design of syntactic program transformations by abstract interpretation of semantic transformations, in: Proceedings of the 17th International Conference on Logic Programming (2001), pp. 4-5.
6. Cousot, P. and R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: POPL'77 (1977), pp. 238-252.
7. Cousot, P. and R. Cousot, Static determination of dynamic properties of recursive procedures, in: E. Neuhold, editor, IFIP Conf. on Formal Description of Programming Concepts, St-Andrews, N.B., CA (1977), pp. 237-277.
8. Cousot, P. and R. Cousot, Systematic design of program analysis frameworks, in: POPL'79 (1979), pp. 269-282.
9. P. Cousot, and R. Cousot Abstract interpretation and application to logic programs J. Log. Program. 13 1992 103 179
10. Cousot, P. and N. Halbwachs, Automatic discovery of linear restraints among variables of a program, in: POPL'78: Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1978), pp. 84-96.
11. Logozzo, F. and M. Fähndrich, Pentagons: a weakly relational abstract domain for the efficient validation of array accesses, in: SAC'08 (2008), pp. 184-188.
12. A. Miné The octagon abstract domain Higher Order Symbolic Computation 19 2006 31 100
13. Simon, A., A. King and J. M. Howe, Two variables per linear inequality as an abstract domain, in: LOPSTR'02: Proceedings of the 12th international conference on Logic based program synthesis and transformation (2003), pp. 71-89.