The computational complexity of simultaneous diophantine approximation problems
SIAM Journal on Computing
Computational geometry: an introduction
Computational geometry: an introduction
A note on Graham`s convex hull algorithm
Information Processing Letters
A technique for summarizing data access and its use in parallelism enhancing transformations
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Algorithms in C
The implementation of a 2D convex hull algorithm using perturbation
Computer Graphics Forum
A practical algorithm for exact array dependence analysis
Communications of the ACM
Abstract interpretation and application to logic programs
Journal of Logic Programming
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
SIAM Journal on Computing
Improving abstract interpretations by combining domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
Verification of Real-Time Systems using Linear Relation Analysis
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
Handbook of discrete and computational geometry
A polynomial combinatorial algorithm for generalized minimum cost flow
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the SUP-INF Method for Proving Presburger Formulas
Journal of the ACM (JACM)
On the Average Number of Maxima in a Set of Vectors and Applications
Journal of the ACM (JACM)
Deciding Linear Inequalities by Computing Loop Residues
Journal of the ACM (JACM)
Computing Two-Dimensional Integer Hulls
SIAM Journal on Computing
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
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
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Introduction to Algorithms
A New Numerical Abstract Domain Based on Difference-Bound Matrices
PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
In-Place Planar Convex Hull Algorithms
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Orthogonal Polyhedra: Representation and Computation
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Cleanness Checking of String Manipulations in C Programs via Integer Analysis
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Automatic Removal of Array Memory Leaks in Java
CC '00 Proceedings of the 9th International Conference on Compiler Construction
A static analyzer for large safety-critical software
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
An $n^{log n}$ algorithm for the two-variable-per-constraint linear programming satisfiability problem
Techniques for program verification
Techniques for program verification
Static analysis and computer security: new techniques for software assurance
Static analysis and computer security: new techniques for software assurance
Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems
Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems
A class of polynomially solvable range constraints for interval analysis without widenings
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Higher-Order and Symbolic Computation
Some ways to reduce the space dimension in polyhedra computations
Formal Methods in System Design
Splitting the Control Flow with Boolean Flags
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Two variables per linear inequality as an abstract domain
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Efficient strongly relational polyhedral analysis
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Symbolic methods to enhance the precision of numerical abstract domains
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Exploiting sparsity in polyhedral analysis
SAS'05 Proceedings of the 12th international conference on Static Analysis
Widening polyhedra with landmarks
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Monotonizing linear programs with up to two nonzeroes per column
Operations Research Letters
A fast implementation of the octagon abstract domain on graphics hardware
SAS'07 Proceedings of the 14th international conference on Static Analysis
Program analysis using symbolic ranges
SAS'07 Proceedings of the 14th international conference on Static Analysis
Transfer function synthesis without quantifier elimination
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
Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstract interpretation of microcontroller code: Intervals meet congruences
Science of Computer Programming
| Hi-index | 0.00 |
This article presents the Two-Variable-Per-Inequality abstract domain (TVPI domain for short). This so-called weakly-relational domain is able to express systems of linear inequalities where each inequality has at most two variables. The domain represents a sweet-point in the performance-cost tradeoff between the faster Octagon domain and the more expressive domain of general convex polyhedra. In particular, we detail techniques to closely approximate integral TVPI systems, thereby finessing the problem of excessively growing coefficients, yielding--to our knowledge--the only relational domain that combines linear relations with arbitrary coefficients and strongly polynomial performance.