Two Variables per Linear Inequality as an Abstract Domain
- 24 June 2003
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Comparing the Galois connection and widening/narrowing approaches to abstract interpretationPublished by Springer Nature ,2005
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- Inferring argument size relationships with CLP( $$\mathcal{R}$$ )Published by Springer Nature ,1997
- Static analysis of linear congruence equalities among variables of a programPublished by Springer Nature ,1991
- A technique for summarizing data access and its use in parallelism enhancing transformationsPublished by Association for Computing Machinery (ACM) ,1989
- Constraint propagation with interval labelsArtificial Intelligence, 1987
- An amateur's introduction to recursive query processing strategiesPublished by Association for Computing Machinery (ACM) ,1986
- A Fast Algorithm for the Two-Variable Integer Programming ProblemJournal of the ACM, 1984
- On the Average Number of Maxima in a Set of Vectors and ApplicationsJournal of the ACM, 1978
- Algorithm for discovering the set of all the solutions of a linear programming problemUSSR Computational Mathematics and Mathematical Physics, 1968