The octahedron abstract domain

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

Volumn 3148, Issue , 2004, Pages 312-327

  Clarisó, Robert ^a   Cortadella, Jordi ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS;

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; COMPLEX PROPERTIES; DECISION DIAGRAM; NUMERIC PROPERTIES; NUMERICAL VARIABLES; TRADE OFF;

STATIC ANALYSIS;

EID: 35048865842     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27864-1_23     Document Type: Article

References (24)

1. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
2. G. Behrmann, K. G. Larsen, J. Pearson, C. Weise, and W. Yi. Efficient timed reachability analysis using clock difference diagrams. In Computer Aided Verification, pages 341-353, 1999.
3. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, 1986.
4. R. Clarisó and J. Cortadella. Verification of timed circuits with symbolic delays. In Proc. of Asia and South Pacific Design Automation Conference, pages 628-633, 2004.
5. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. of the ACM Symposium on Principles of Programming Languages, pages 238-252. ACM Press, 1977.
6. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Proc. of the ACM Symposium on Principles of Programming Languages, pages 84-97. ACM Press, New York, 1978.
7. D. L. Dill. Timing assumptions and verification of finite-state concurrent systems. In Automatic Verification Methods for Finite State Systems, LNCS 407, pages 197-212. Springer-Verlag, 1989.
8. N. Dor, M. Rodeh, and M. Sagiv. CSSV: towards a realistic tool for statically detecting all buffer overflows in C. In Proceedings of the ACM SIGPLAN 2003 conference on Programming lan guage design and implementation, pages 155-167. ACM Press, 2003.
9. E. Asarin, M. Bozga, A. Kerbrat, O. Maler, M. Pnueli, and A. Rasse. Data structures for the verification of timed automata. In O. Maler, editor, Hybrid and Real-Time Systems, pages 346-360, Grenoble, France, 1997. Springer Verlag, LNCS 1201.
10. M. Fujita, P. C. McGeer, and J. C.-Y. Yang. Multi-terminal binary decision diagrams: An efficient data structure for matrix representation. Formal Methods in System Design, 10(2/3): 149-169, 1997.
11. 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, 1997.
12. T. A. Henzinger. The Temporal Specification and Verification of Real-Time Systems. PhD thesis, Stanford University, Aug. 1991.
13. C. Mauras. Symbolic simulation of interpreted automata. In 3rd Workshop on Synchronous Programming, Dec. 1996.
14. S. Minato. Zero-supressed BDDs for set manipulation in combinatorial problems. In Proc. ACM/IEEE Design Automation Conference, pages 272-277, 1993.
15. A. Miné. A new numerical abstract domain based on difference-bound matrices. In Programs as Data Objects II, volume 2053 of LNCS, pages 155-172. Springer-Verlag, May 2001.
16. A. Miné. The octagon abstract domain. In Analysis, Slicing and Tranfonnation (in Working Conference on Reverse Engineering), IEEE, pages 310-319. IEEE CS Press, Oct. 2001.
17. J. Møller, J. Lichtenberg, H. R. Andersen, and H. Hulgaard. Difference decision diagrams. In Computer Science Logic, The IT University of Copenhagen, Denmark, 1999.
18. T. Murata. State equation, controllability and maximal matchings of Petri nets. IEEE Transactions on Automatic Control, AC-22(3):412-416, 1977.
19. New Polka: Convex Polyhedra Library, http://www.irisa.fr/prive/bjeannet/ newpolka.html.
20. C. Piguet et al. Memory element of the Master-Slave latch type, constructed by CMOS technology. US Patent 5,748,522,1998.
21. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Proc. International Conf. Computer-Aided Design (ICCAD), pages 42-47, 1993.
22. A. Simon, A. King, and J. M. Howe. Two Variables per Linear Inequality as an Abstract Domain. In M. Leuschel, editor, Proceedings of Logic Based Program Development and Transformation, LNCS 2664, pages 71-89. Springer-Verlag, 2002.
23. F. Somenzi. CUDD: Colorado university decision diagram package. Available online at http://vlsi.colorado.edu/∼fabio/CUDD.
24. F. Wang. Symbolic parametric safety analysis of linear hybrid systems with BDD-like data-structures. In Proceedings of Computer Aided Verification. Springer-Verlag, July 2004.