Not necessarily closed convex polyhedra and the double description method

Formal Aspects of Computing

Volumn 17, Issue 2, 2005, Pages 222-257

  Bagnara, Roberto ^a   Hill, Patricia M ^b   Zaffanella, Enea ^a  

^a UNIVERSITY OF PARMA   (Italy)

^b UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

Abstract interpretation; Convex polyhedra; Data flow analysis; Double description; Strict linear inequalities

Indexed keywords

COMPUTER HARDWARE; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; DATA REDUCTION; MATHEMATICAL MODELS; VECTORS;

ABSTRACT INTERPRETATION; CONVEX POLYHEDRA; DATA-FLOW ANALYSIS; DOUBLE DESCRIPTION; STRICT LINEAR INQUALITIES;

COMPUTER SCIENCE;

EID: 23844440861     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00165-005-0061-1     Document Type: Article

References (34)

1. [BHRZ03] Bagnara R, Hill PM, Ricci E, Zaffanella E (2003) Precise widening operators for convex polyhedra. In Cousot R, (ed), Static analysis: Proceedings of the 10th international symposium, vol 2694 of Lecture Notes in Computer Science, San Diego, 2003. Springer, Berlin Heidelberg New York, pp 337-354
2. [BHRZ05] Bagnara R, Hill PM, Ricci E, Zaffanella E (2005) Precise widening operators for convex polyhedra. Scvi Comput Programming, (To appear)
3. [BHZ03] Bagnara R, Hill PM, Zaffanella E (2003) A new encoding and implementation of not necessarily closed convex polyhedra. In Leuschel M, Gruner S, Lo Presti S, (eds), Proceedings of the 3rd workshop on automated verification of critical systems, Southampton. Published as TR Number DSSE-TR-2003-2, University of Southampton, pp 161-176
4. [BHZ04] Bagnara R, Hill PM, Zaffanella E (2004) The parma polyhedra library user's manual. Department of Mathematics, University of Parma, Parma, Italy, release 0.7 edn. Available at http://www.cs.unipr.it/ppl/.
5. rd edn. American Mathematical Society, Providence, Rhode Island
6. [BJT99] Besson F, Jensen TP, Talpin JP (1999) Polyhedral analysis for synchronous languages. In: Cortesi A, Filé G, (eds)., Static analysis: Proceedings of the 6th international symposium, vol 1694 of Lecture Notes in Computer Science, Venice, Springer, Berlin Heidelberg New York, pp 51-68
7. [BK97] Benoy F, King A (1997) Inferring argument size relationships with CLP(ℛ). In: Gallagher JP, (ed), Logic program synthesis and transformation: proceedings of the 6th international workshop, vol 1207 of Lecture Notes in Computer Science, Stockholm, Sweden, Springer-Verlag, Berlin Heidelberg New York pp 204-223
8. [BRZH02a] Bagnara R, Ricci E, Zaftanella E, Hill PM (2002) Possibly not closed convex polyhedra and the Parma Polyhedra Library. In: Hermenegildo MV, Puebla G, (eds), Static analysis: proceedings of the 9th international symposium, vol 2477 of Lecture Notes in Computer Science, Madrid, Spain Springer, Berlin Heidelberg New York, pp 213-229
9. [BRZH02b] Bagnara R, Ricci E, Zaffanella E, Hill PM (2002) Possibly not closed convex polyhedra and the Parma Polyhedra Library. Quaderno 286, Dipartimento di Matematica, Università di Parma, Italy,.
10. See also [BRZH02c]. Available at http://www.cs.unipr.it/Publications/
11. [BRZH02c] Bagnara R, Ricci E, Zafianella E, Hill PM (2002) Errata for technical report "Quaderno 286". Available at http://www.cs.unipr.it/Publications/, 200. See [BRZH02b]
12. th annual ACM symposium on principles of programming languages, ACM Press, New York pp 238-252
13. th annual ACM symposium on principles of programming languages, ACM Press, Tucson, pp 84-96
14. [Che64] Chernikova NV (1964) Algorithm for finding a general formula for the non-negative solutions of system of linear equations. USSR Comput Math Math Phys, 4(4):151-158
15. [Che65] Chernikova NV (1965) Algorithm for finding a general formula for the non-negative solutions of system of linear inequalities. USSR Comput Math Math Phys, 5(2):228-233
16. [Che68] Chernikova NV (1968) Algorithm for discovering the set of all solutions of a linear programming problem. USSR Comput Math Math Phys, 8(6):282-293
17. [Cou01] Cousot P, (ed.) (2001) In: Static analysis: 8th international symposium, SAS 2001, vol 2126 of Lecture Notes in Computer Science, Paris. Springer, Berlin Heidelberg New York
18. [CS01] Colon MA, Sipma HB (2001) Synthesis of linear ranking functions. In: Margaria T, Yi W, (eds), Tools and algorithms for construction and analysis of systems, 7th international conference, TACAS 2001, vol 2031 of Lecture Notes in Computer Science, Geneva, Springer, Berlin Heidelberg New York pp 67-81
19. [DRS01] Dor N, Rodeh M, Sagiv S Cleanness checking of string manipulations in C programs via integer analysis. In: Cousot [Cou01], pp 194-212
20. [Fea91] Feautrier P (1991) Dataflow analysis of scalar and array references. Int J Parallel Programming 20(1):23-53
21. [Hal93] Halbwachs N (1993) Delay analysis in synchronous programs. In: Courcoubetis C, (ed), Computer Aided Verification: Proceedings of the 5th International Conference, volume 697 of Lecture Notes in Computer Science, Elounda Springer, Berlin Heidelberg New York pp 333-346
22. [HH95] Henzinger TA, Ho PH (1995) A note on abstract interpretation strategies for hybrid automata. In: Antsaklis PJ, Kohn W, Nerode A, Sastry S, (eds), Hybrid systems II, vol 999 of Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York, pp 252-264
23. [HHWT97] Henzinger TA, Ho PH, Wong-Toi H (1997) HyTech: a model checker for hybrid systems. Softw Tools Technol Transfer, 1(1+2):110-122
24. [HKP95] Halbwachs N, Kerbrat A, Proy YE (1995) Polyhedra integrated environment. Verimag, France, version 1.0 of POLINE edition, September. Documentation taken from source code
25. [HPR94] Halbwachs N, Proy YE, Raymond P (1994) Verification of linear hybrid systems by means of convex approximations. In: Le Charlier B, (ed), Static analysis: proceedings of the 1st international symposium, vol 864 of Lecture Notes in Computer Science, Namur Springer, Berlin Heidelberg New York pp 223-237
26. [HPR97] Halbwachs N, Proy YE, Roumanoff P (1997) Verification of real-time systems using linear relation analysis. Formal Methods Sys Des 11(2):157-185
27. [Jea02] Jeannet B (2002) Convex Polyhedra Library, release 1.1.3c (edn), Documentation of the "New Polka" library available at http://www.irisa.fr/prive/Bertrand.Jeannet/newpolka.html.
28. [Kan92] Kannan R (1992) Lattice translates of a polytope and the Frobenius problem. Combinatorica, 12:161-177
29. [Le 92] Le Verge, H (1992) A note on Chernikova's algorithm. Publication interne 635, IRISA, Campus de Beaulieu, Rennes
30. +99] Manna Z, Bjørner NS, Browne A, Colon M, Finkbeiner M, Pichora M, Sipma HB, Uribe TE (1999) An update on STeP: deductive-algorithmic verification of reactive systems. In: Berghammer R, Lakhnech Y, (eds), Tool support for system specification, development and verification, advances in computing sciences, Springer, Berlin Heidelberg New York, pp 174-188
31. [MRTT53] Motzkin TS, Raiffa H, Thompson GL, Thrall GL (1953) The double description method. In: Kuhn HW, Tucker AW, (eds), Contributions to the Theory of Games - Vol II, no 28 in Annals of Mathematics Studies. Princeton University Press, Princeton, pp 51-73
32. [Pug92] Pugh W (1992) A practical algorithm for exact array dependence analysis. Commun ACM 35(8): 102-114
33. [Sch99] Schrijver A (1999) Theory of linear and integer programming. Wiley Interscience Series in Discrete Mathematics and Optimization. Wiley, New York
34. [SW70] Stoer J, Witzgall C (1970) Convexity and Optimization in Finite Dimensions I. Springer, Berlin Heidelberg New York