The octahedron abstract domain

Science of Computer Programming

Volumn 64, Issue 1 SPEC. ISS., 2007, Pages 115-139

  Clarisó, Robert ^a   Cortadella, Jordi ^b  

^a UNIVERSITAT OBERTA DE CATALUNYA   (Spain)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Abstract interpretation; Convex polyhedra; Numerical abstract domains; Relational abstract domains

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DECISION THEORY; GRAPHICAL USER INTERFACES; NUMERICAL METHODS;

ABSTRACT INTERPRETATION; CONVEX POLYHEDRA; NUMERICAL ABSTRACT DOMAINS; RELATIONAL ABSTRACT DOMAINS;

ABSTRACTING;

EID: 33751101141     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2006.03.009     Document Type: Article

References (36)

1. Alur R., and Dill D.L. A theory of timed automata. Theoretical Computer Science 126 2 (1994) 183-235
2. Avis D., Fukuda K., and Picozzi S. On canonical representations of convex polyhedra. Proc. Int. Conf on Mathematical Software (2002), World Scientific 350-360
3. R. Bagnara, Data-flow analysis for constraint logic-based languages, Ph.D. Thesis, University of Pisa, 1997
4. G. Behrmann, K.G. Larsen, J. Pearson, C. Weise, W. Yi, Efficient timed reachability analysis using clock difference diagrams, in: Proc. International Conference on Computer Aided Verification, 1999, pp. 341-353
5. Bryant R.E. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35 8 (1986) 677-691
6. Chernikova N. Algoritm for discovering the set of all solutions of a linear programming problem. U.S.S.R. Computational Mathematics and Mathematical Physics 6 8 (1964) 282-293
7. R. Clarisó, J. Cortadella, Verification of timed circuits with symbolic delays, in: Proc. of Asia and South Pacific Design Automation Conference, 2004, pp, 628-633
8. Clarisó R., and Cortadella J. Verification of concurrent systems with parametric delays using octahedra. Proc. International Conference on Application of Concurrency to System Design (2005), IEEE Computer Society Press 122-131
9. Cousot P., and Cousot R. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. Proc. of the ACM Symposium on Principles of Programming Languages (1977), ACM Press 238-252
10. Cousot P., and Halbwachs N. Automatic discovery of linear restraints among variables of a program. Proc. of the ACM Symposium on Principles of Programming Languages (1978), ACM Press 84-97
11. Dill D.L. Timing assumptions and verification of finite-state concurrent systems. Automatic Verification Methods for Finite State Systems. LNCS vol. 407 (1989), Springer-Verlag 197-212
12. Dor N., Rodeh M., and Sagiv M. CSSV: Towards a realistic tool for statically detecting all buffer overflows in C. Proc. of the ACM SIGPLAN Conference on Programming Language Design and Implementation (2003), ACM Press 155-167
13. Asarin E., Bozga M., Kerbrat A., Maler O., Pnueli M., and Rasse A. Data structures for the verification of timed automata. Hybrid and Real-Time Systems. LNCS vol. 1201 (1997), Springer Verlag, Grenoble, France 346-360
14. F. Fernández, P. Quinton, Extension of Chernikova's algorithm for solving general mixed linear programming problems, Technical Report 437, IRISA, 1988
15. Fujita M., McGeer P.C., and Yang J.C.-Y. Multi-terminal binary decision diagrams: An efficient data structure for matrix representation. Formal Methods in System Design 10 2-3 (1997) 149-169
16. Gerber A.J. Process synchronization by counter variables. SIGOPS Operating Systems Review 11 4 (1977) 6-17
17. Halbwachs N., Proy Y.-E., and Roumanoff P. Verification of real-time systems using linear relation analysis. Formal Methods in System Design 11 2 (1997) 157-185
18. T.A. Henzinger, The temporal specification and verification of real-time systems, Ph.D. Thesis, Stanford University, 1991
19. C. Mauras, Symbolic simulation of interpreted automata, in: 3rd Workshop on Synchronous Programming, 1996
20. McMullen P. The maximum number of faces of a convex polytope. Mathematica 17 (1970) 179-184
21. Minato S. Zero-supressed BDDs for set manipulation in combinatorial problems. Proc. ACM/IEEE Design Automation Conference (1993), ACM Press 272-277
22. Miné A. The octagon abstract domain. Proc. of Analysis, Slicing and Tranformation (Working Conference on Reverse Engineering) (2001), IEEE CS Press 310-319
23. J. Møller, J. Lichtenberg, H.R. Andersen, H. Hulgaard, Difference decision diagrams, in: Computer Science Logic, The IT University of Copenhagen, 1999
24. Muller D., and Bartky W. A theory of asynchronous circuits. Proc. International Symposium on the Theory of Switching (1959), Hardware University Press 204-243
25. Murata T. State equation, controllability and maximal matchings of Petri nets. IEEE Transactions on Automatic Control AC-22 3 (1977) 412-416
26. New Polka: Convex Polyhedra Library. http://www.irisa.fr/prive/bjeannet/newpolka.html
27. C. Piguet, Memory element of the Master-Slave latch type, constructed by CMOS technology, US Patent 5,748,522, 1998
28. Rudell R. Dynamic variable ordering for ordered binary decision diagrams. Proc. International Conference on Computer-Aided Design (1993), IEEE Computer Society Press 42-47
29. Sankaranarayanan S., Sipma H., and Manna Z. Scalable analysis of linear systems using mathematical programming. Proc. of International Conference on Verification, Model Checking and Abstract Interpretation. Lecture Notes in Computer Science vol. 3385 (2005), Springer-Verlag 21-47
30. Simon A., King A., and Howe J.M. Two variables per linear inequality as an abstract domain. Proc. of Logic Based Program Development and Transformation. LNCS vol. 2664 (2002), Springer-Verlag 71-89
31. Sohn K., and Van Gelder A. Termination detection in logic programs using argument sizes (extended abstract). Proc. of the ACM Symposium on Principles of Database Systems (1991), ACM Press 216-226
32. Somenzi F. CUDD: Colorado university decision diagram package. Available online at. http://vlsi.colorado.edu/~fabio/CUDD
33. van Gelder A. Deriving constraints among argument sizes in logic programs (extended abstract). Proc. of the ACM Symposium on Principles of Database Systems (1990), ACM Press 47-60
34. H.L. Verge, A note on Chernikova's algorithm, Technical Report 635, IRISA, 1992
35. Wang F. Efficient data structure for fully symbolic verification of real-time software systems. Proc. of Tools and Algorithms for Construction and Analysis of Systems (2000), Springer-Verlag 157-171
36. Wang F. Symbolic parametric safety analysis of linear hybrid systems with BDD-like data-structures. Proc. International Conference on Computer Aided Verification (2004), Springer-Verlag