A transformational approach for generating non-linear invariants

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

Volumn 1824 LNCS, Issue , 2000, Pages 58-72

  Bensalem, S ^a   Bozga, M ^a   Fernandez, J C ^b   Ghirvu, L ^a   Lakhnech, Y ^a  

^a VERIMAG   (France)

^b LSR Laboratory   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; STATIC ANALYSIS;

COMPLEMENTARY TECHNIQUES; INFINITE STATE SYSTEMS; KEY ISSUES; NON LINEAR; PARAMETER SYNTHESIS; SET OF RULES; SYNTHESIZING CONDITIONS; TRANSFORMATIONAL APPROACH;

MATHEMATICAL TRANSFORMATIONS;

EID: 84906099367     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45099-3_4     Document Type: Conference Paper

References (22)

1. P. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly analysis of systems with unbounded, lossy fifb channels. In CAV'98, volume 1427 of LNCS, pages 305-318, 1998
2. P.A. Abdulla, A. Bouajjani, B. Jonsson, and M. Nilsson. Handling Global Conditions in Parameterized System Verification. In N. Halbwachs and D. Peled, editors, CAV '99, volume 1633 of LNCS, pages 134-145. Springer-Verlag, 1999
3. R. Alur and D. Dill. A Theory of Timed Automata. Theoretical Computer Science, 126, 1994
4. K.R. Apt and L.G.L.T. Meertens. Completeness with finite systems of intermediate assertions for recursive program schemes. SIAM J. Comp., 9:665-671, 1980
5. K. Baukus, S. Bensalem, Y. Lakhnech, and K. Stahl. Abstrac ting wsis systems to verify parameterized networks'In TACAS'OO. 59 . B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In CAV'96, volume 1102 of LNCS, pages 1-12, 199 6
6. Bultan, Gerber, and Pugh. Symbolic model checking of infinite state systems using presburger arithmetic. In CAV: International Conference on Computer Aided Verification, 1997
7. P. Cousot and R. Cousot. Static determination of dynamic properties of programs. In Proc. 2nd Int. Symp. on Programming, pages 106-130, 1976
8. 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 symp. of Prog. Lang., pages 238-252. ACM Press, 1977
9. P. Cousot and R. Cousot. Abstract interpretation frameworks. J. Logic and Comp., 2(4):511-547, 1992
10. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among the variables of a program. In 5th ACM symp. of Prog. Lang., pages 84-97. ACM Press, 1978
11. P. Caspi, N. Halbwachs, D. Pilaud, and J. Pla ice. LUSTRE, adclarative language for programming synchronous systems. In 14th Symposium on Principles of Programming Langiages, 1987
12. L. Fribourg and H. Olsen. A decompositional approach for computing least fized-poi nts of datalog programs with z-counters. Constraints, 2(3/ 4) :305-335,1997
13. G. A. Gorelick. A complete axiomatic system for proving assertions about recursive and non-recursive programs. Technical report, Toronto, 1975
14. T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic modelchecking for real-time systems. In Seventh Annual IEEE Symposium on Logic in Computer Science, pages 394-406. IEEE Computer Society Press, 1992.
15. N. Halbwachs Y.-E. Proy P. Raymond, Verification of linear hybrid systems by means of convex approximations, Proceedings of the International Symposium on Static Analysis, volume 818 of LNCS, 223-237. Springer-Verlag, 1994.
16. S. Ivanov and W. O. D. Griffioen. Verification of a biphase mark protocol. Report CSI-R9915, Computing Science Institute, University of Nijmegen, August 1999
17. M. Karr. Affine relationships among variables of a program. Acta Informatica, 6:133-151, 1976
18. K.M. Chandy and J. Misra. Parallel Program Design. Addison-Wesley, Austin, Texas, May 1989
19. Y. Kesten, 0. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic Model Checking with Rich Assertional Languages. In 0. Grumberg, editor, Proceedings of CAV '97, volume 1256 of LNCS, pages 424-435. Sprin ger-Verlag, 1997
20. J. S. Moore. A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol. Formal Aspects of Computing, 3(1), 1993
21. V.F. Vaandrager. Analysis of a biphase mark protocol with uppaal. Presentation at the meeting of the VHS-ESPRIT Project
22. P. Wolper and B. Boigelot. Verifying systems with infinite but regular state spaces. In CAV'98, volume 1427 of LNCS, pages 88-97, 1998