Combining widening and acceleration in Linear Relation Analysis

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

Volumn 4134 LNCS, Issue , 2006, Pages 144-160

  Gonnord, Laure ^a   Halbwachs, Nicolas ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; COMPUTER SCIENCE; MATHEMATICAL OPERATORS;

FIXPOINT COMPUTATIONS; LINEAR RELATION ANALYSIS; WIDENING;

LINEAR SYSTEMS;

EID: 33749844063     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11823230_10     Document Type: Conference Paper

References (28)

1. +95] R. Alur, C. Courcoubetis, N. Halbwachs, T. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science B, 138:3-34, January 1995.
2. +00] N. Bjorner, A. Browne, M. Colou, B. Finkbeiner, Z. Manna, H. Sipma, and T. Uribe. Verifying temporal properties of reactive systems: A STeP tutorial. Formal Methods in System Design, 16:227-270, 2000.
3. [BBM97] N. Bjorner, I. Anca Browne, and Z. Manna. Automatic generation of invariants find intermediate assertions. Theoretical Computer Science, 173(1):49-87, February 1997.
4. +03] B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné D. Monnianx, and X. Rival. A static: analyzer for large safety-critical software. In PLDI 2003, ACM SIGPLAN SIGSOFT Conference on Programming Language Design and Implementation, pages 196-207, San Diego (Ca.), June 2003.
5. [BFLP03] S. Bardin, A. Finkel, J. Leroux, and L. Petrucci. Fast: Fast acceleration of symbolic transition systems. In CAV'03, pages 118-121, Boulder (Colorado), July 2003. LNCS 2725, Springer-Verlag.
6. [BHRZ03] R. Bagnara, P. M. Hill, E. Ricci, and E. Zaffauella, Precise widening operators for convex polyhedra. In R. Cousot, editor, Static Analysis: Proceedings of the 10th International Symposiam, volume 2694 of Lecture Notes in Computer Science, pages 337-354, San Diego, California, USA, 2003. Springer-Verlag, Berlin.
7. [Boi99] B. Boigelot. Symbolic methods for exploring infinite state spaces. Phd thesis, Université de Liège, 1999.
8. [Bou92] F. Bourdoncle. Sémantique des langages impératifs d'ordre supérieur et interprétation abstraite. Thesis Ecole Polytechnique, Paris, 1992.
9. [BW94] B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In CAV'94, Stanford (Ca.), 1994. LNCS 818, Springer Verlag.
10. [CC77] P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fix-points. In 4th ACM Symposium on Principles of Programming Languages, POPL'77, Los Angeles, January 1977.
11. [CH78] P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In 5th. ACM Symposium on Principles of Programming Languages, POPL'78, Tucson (Arizona), January 1978.
12. [CHR91] Z. Chaochen, C.A.R. Hoare, and A.P. Ravn. A calculus of durations. Information Processing Letters, 40(5), 1991.
13. [CJ98] H. Comon and Y. Jurski. Multiple counters automata, safety analysis and Presburger arithmetic. In CAV'98, Vancouver (B.C.), 1998. LNCS 1427, Springer Verlag.
14. [DRS01] N. Dor, M. Rodeh, and M. Sagiv. Cleanness checking of string manipulations in C programs via integer analysis. In P. Cousot, editor, SAS'01, Paris, July 2001. LNCS 2126.
15. [FL02] A. Finkel and J. Leroux. How to compose Presburger-accelerations: Applications to broadcast protocols. In Proceedings of the 22nd Conf. Found. of Software Technology and Theor. Comp. Sci. (FSTTCS'2002), volume 2556 of Lecture Notes in Computer Science, pages 145-156, Kanpur, India, December 2002. Springer.
16. [FS00] A. Finkel and G. Sutre. An algorithm constructing the semilinear post* for 2-dim reset/transfer vass. In 25th Int. Symp. Math. Found. Comp. Sci. (MFCS'2000), Bratislava, Slovakia, August 2000. LNCS 1893, Springer Verlag.
17. [GR06] D. Gopan and T. Reps. Lookahead widening. In CAV'06, Seattle, 2006.
18. [Hal79] N. Halbwachs. Détermination automatique de relations linéaires vérifiées par les variables d'un programme. Thèse de troisième cycle, University of Grenoble, March 1979.
19. [Hal97] Vesa Halava. Decidable and undecidable problems in matrix theory. Technical Report TUCS-TR-127, University of Turku, 30, 1997.
20. [HHWT97] T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. Hytech: A model checker for hybrid systems. Software Tools for Technology Transfer, 1:110-122, 1997.
21. [HPR97] N. Halbwachs, Y.E. Proy, and P. Roumanoff. Verification of real-time systems using linear relation analysis. Formal Methods in System Design, 11(2):157-185, August 1997.
22. [IJT91] F. Irigoin, P. Jouvelot, and R. Triolet. Semantical interprocedural parallelization: An overview of the PIPS project. In ACM Int. Conf. on Supercomputing, ICS'91, Köln, 1991.
23. [Iri05] F. Irigoin, Detecting affine loop invariants using modular static analysis. Technical Report A/367/CRI, Centre de Recherche en Informatique, Ecole des Mines de Paris, July 2005.
24. [SSM04] Srirarn Sankaranarayanan, Henny Sipma, and Zohar Manna. Constraint-based linear relations analysis. In International Symposium on Static Analysis, SAS'8004, pages 53-68. LNCS 3148, Springer Verlag, 2004.
25. [SW04] Z. Su and D. Wagner. A class of polynomially solvable range constraints for interval analysis without widenings and narrowings. In TACAS'04, pages 280-295, Barcelona, 2004.
26. [Tar72] R. E. Tar Jan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1:146-160, 1972.
27. [Tiw04] A. Tiwari. Termination of linear programs, In R. Alur and D. Peled, editors, Computer-Aided Verification, CAV, volume 3114 of LNCS, pages 70-82. Springer, July 2004.
28. [WB98] P. Wolper and B. Boigelot. Verifying systems with infinite but regular state spaces. In CAV'98, pages 88-97, Vancouver, June 1998. LNCS 1427, Springer-Verlag.