Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Termination detection in logic programs using argument sizes (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The temporal specification and verification of real-time systems
The temporal specification and verification of real-time systems
Zero-suppressed BDDs for set manipulation in combinatorial problems
DAC '93 Proceedings of the 30th international Design Automation Conference
Theoretical Computer Science
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Verification of Real-Time Systems using Linear Relation Analysis
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
Deriving constraints among argument sizes in logic programs (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Multi-Terminal Binary Decision Diagrams: An Efficient DataStructure for Matrix Representation
Formal Methods in System Design
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Data-Structures for the Verification of Timed Automata
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
CSSV: towards a realistic tool for statically detecting all buffer overflows in C
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
WCRE '01 Proceedings of the Eighth Working Conference on Reverse Engineering (WCRE'01)
Process synchronization by counter variables
ACM SIGOPS Operating Systems Review
Verification of timed circuits with symbolic delays
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Verification of Concurrent Systems with Parametric Delays Using Octahedra
ACSD '05 Proceedings of the Fifth International Conference on Application of Concurrency to System Design
Two variables per linear inequality as an abstract domain
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Scalable analysis of linear systems using mathematical programming
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Verification of Concurrent Systems with Parametric Delays Using Octahedra
Fundamenta Informaticae - The Fourth Special Issue on Applications of Concurrency to System Design (ACSD05)
Generating and Analyzing Symbolic Traces of Simulink/Stateflow Models
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Logahedra: A New Weakly Relational Domain
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Pentagons: A weakly relational abstract domain for the efficient validation of array accesses
Science of Computer Programming
Quadtrees as an Abstract Domain
Electronic Notes in Theoretical Computer Science (ENTCS)
Behavioral cartography of timed automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Interval slopes as a numerical abstract domain for floating-point variables
SAS'10 Proceedings of the 17th international conference on Static analysis
Generalizing the template polyhedral domain
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Synthesis of timing parameters satisfying safety properties
RP'11 Proceedings of the 5th international conference on Reachability problems
Random: r-based analyzer for numerical domains
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Verification of Concurrent Systems with Parametric Delays Using Octahedra
Fundamenta Informaticae - The Fourth Special Issue on Applications of Concurrency to System Design (ACSD05)
TreeKs: A Functor to Make Numerical Abstract Domains Scalable
Electronic Notes in Theoretical Computer Science (ENTCS)
Polyhedral analysis using parametric objectives
SAS'12 Proceedings of the 19th international conference on Static Analysis
| Hi-index | 0.00 |
An interesting area in static analysis is the study of numerical properties. Complex properties can be analyzed using abstract interpretation, provided that an adequate abstract domain is defined. Each domain can represent and manipulate a family of properties, providing a different trade-off between the precision and complexity of the analysis. The contribution of this paper is a new numerical abstract domain called octahedron that represents constraints of the form (@?x"i-@?x"j=k). The implementation of octahedra is based on a new kind of decision diagram called Octahedron Decision Diagrams (OhDD).