Exploiting sparsity in polyhedral analysis

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

Volumn 3672 LNCS, Issue , 2005, Pages 336-351

  Simon, Axel ^a   King, Andy ^a  

^a UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; LINEAR SYSTEMS; LOGIC PROGRAMMING;

FOURIER-MOTZKIN ALGORITHM; POLYHEDRAL ANALYSIS; SPARSE SYSTEM;

ALGORITHMS;

EID: 33646038616     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11547662_23     Document Type: Conference Paper

References (29)

1. R. Bagnara, E. Ricci, E. Zaffanella, and P. M. Hill. Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library. In Static Analysis Symposium, volume 2477 of LNCS, pages 213-229. Springer-Verlag, 2002.
2. F. Benoy, A. King, and F. Mesnard. Computing Convex Hulls with a Linear Solver. Theory and Practice of Logic Programming, 5(1&2):259-271, 2005.
3. B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, D. Monniaux, and X. Rival. A Static Analyzer for Large Safety-Critical Software. In Programming Language Design and Implementation, pages 196-207. ACM Press, 2003.
4. K.-H. Borgwardt. The average number of pivot steps required by the simplex method is polynomial. Zeitschrift für Operations Research, 26:157-177, 1982.
5. A. Bossi, N. Cocco, arid M. Fabris. Norms on Terms and their Use in Proving Universal Termination of a Logic, Program. TCS, 124:297-328, 1994.
6. V. Chandru, G. Lassez, and J.-L. Lassez. Qualitative Theorem Proving in Linear Constraints. Annals of Math. and Artificial Intelligence, To appear.
7. R. Claris and J. Cortadella. The Octahedron Abstract Domain. In R. Giacobazzi, editor, Static Analysis Symposium, volume 3148 of LNCS, pages 312-327, 2004.
8. P. Cousot and N. Halbwachs. Automatic Discovery of Linear Constraints among Variables of a Program. In POPL, pages 84-97. ACM Press, 1978.
9. D. De Schreye and S. Decorte. Termination of Logic Programs: The Never-Encling Story. The Journal of Logic Programming, 19&20:199-260, 1994.
10. D. De Schreye and K. Verschaetse. Deriving Linear Size Relations for Logic Programs by Abstract Interpretation. New Generat. Comput., 13(2):117-154, 1995.
11. R. J. Duffin. On Fourier's Analysis of Linear Inequality Systems. Mathematical Programming Study, 1:71-95, 1974.
12. R. Giacobazzi, S. K. Debray, and G. Levi. Generalized Semantics and Abstract. Interpretation for Constraint Logic Programs. J. Logic Program., 3(25), 1995.
13. N. Halbwachs, D. Merchat, a.nd C. Parent-Vigonronx. Cartesian Factoring of Polyhedra in Linear Relation Analysis. In Static Analysis Symposium, volume 2694 of LNCS. Springer Verlag, June 2003.
14. T. Huynh, C. Lassez, and J.-L. Lassez. Practical Issues on the Projection of Polyhedral Sets. Annals of Math. and Artificial Intelligence., 6(4):295-315, 1992.
15. J.-L. Imbert. Fourier's Elimination: Which to Choose? In First Workshop on Principles and Practice of Constraint Programming, pages 117-129, 1993.
16. J. Jaffar, M. J. Maher, P. J. Stuckey, and R. H. C. Yap. Output in CLP(R). In Fifth Generation Computer Systems, volume 2, pages 987-995, Tokyo, 1992.
17. A. King and J. C. Martin. Control Generation by Program Transformation. Fundamenta Informaticae. To appear.
18. D. A. Kohler. Projections of Convex Polyhedral Sets. Operations Research Centre Report ORC 67-29, University of California, Berkeley, 1967.
19. J.-L. Lassez. Querying Constraints. In Symposium on Principles of Database. Systems, pages 288-298. ACM Press, 1990.
20. J.-L. Lassez, T. Huynh, and K. McAloon. Simplification and Elimination of Redundant Linear Arithmetic Constraints. In F. Benhamou and A. Colmerauer, editors, Constraint Logic Programming, pages 73-87. The MIT Press, 1993.
21. H. Le Verge. A Note on Chernikova's algorithm. Technical Report, 1662, Institut de Recherche en Informatique, Campus Universitaire de Beaulieu, France, 1992.
22. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.
23. L. Lu and A. King. Determinacy Inference for Logic Programs. In European Symposium on Programming, volume 3444 of LNCS, pages 108-123. Springer, 2005.
24. F. Mesnard and R. Bagnara. cTI: a Constraint-Based Termination Inference Tool for ISO-Prolog. Theory and Practice of Logic Programming, 5(1&2):243-257, 2005.
25. A. Miné. The Octagon Abstract Domain. In Eighth Working Conference on Reverse Engineering, pages 310-319. IEEE Computer Society, 2001.
26. T. S. Motzkin. Beiträge zur Theorie der Linearen Ungleichungen. PhD thesis, Universität Zürich, 1936.
27. A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1986.
28. A. Simon and A. King. Convex Hull of Planar H-Polyhedra. International Journal of Computer Mathematics, 81(4):259-271, March 2004.
29. A. Simon, A. King, and J. M. Howe. Two Variables per Linear Inequality as an Abstract Domain. In Proceedings of Logic-Based Program Development and Transformation, volume 2664 of LNCS, pages 71-89. Springer-Verlag, 2002.