Symbolic verification with gap-order constraints

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

Volumn 1207, Issue , 1997, Pages 20-37

  Fribourg, Laurent ^a   Richardson, Julian ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; AUTOMATA THEORY; COMPUTER CIRCUITS; FORMAL LOGIC;

CONVEX POLYHEDRONS; DISCRETE PARAMETERS; FIXED POINTS; MODELLING SYSTEMS; ORDERING CONSTRAINTS; PROGRAM ANALYSIS; STATE INVARIANTS; SYMBOLIC VERIFICATION;

LOGIC PROGRAMMING;

EID: 84949425938     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62718-9_2     Document Type: Conference Paper

References (10)

1. R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. In Proceedings of 5th IEEE LICS, pages 414-425. IEEE, 1990.
2. B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In Proceedings of conference on Computer-Aided Verification, 1994, pages 55-67, 1994.
3. L. Fribourg and H. Olsén. Datalog programs with arithmetical constraints: hierarchic, periodic and spiralling least fixed points. Research report 95-26, Laboratoire Informatique, École Normale Supérieure, Paris, November 1995.
4. L. Fribourg and J. D. C. Richardson. Symbolic verification with gap-order constraints. Report LIENS - 96-3, Laboratoire d’informatique, École Normale Supérieure (LIENS), Paris, February 1996. Available by ftp from host ftp.ens.frindirectory/pub/reports/liens.
5. L. Fribourg and M. Veloso Peixoto. Bottom-up evaluation of Datalog programs with arithmetic constraints. In Alan Bundy, editor, 12th Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, Vol. 814, pages 311-325, Nancy, France, 1994. Springer-Verlag.
6. N. Halbwachs. Delay analysis in synchronous programs. In Proceedings of conference on Computer-Aided Verification, 1993, pages 333-346, 1993.
7. T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for reed-time systems. In Proceedings 7th LICS Symposium, Santa Cruz, pages 394-406, 1992.
8. A. Kerbrat. Méthodes Symboliques pour la Vérification des Processus Communicants: étude et mise en oeuvre. PhD thesis, L’Université Joseph Fourier - Grenoble I, November 1994. In French.
9. A. Kerbrat. Reachable state space analysis of LOTOS specifications. In Proceedings of the 7th international conference on formal description techniques, pages 161-176, 1994.
10. P. Z. Revesz. A closed-form evaluation for Datalog queries with integer (gap)-order constraints. Theoretical Computer Science, 1993. vol. 116, pages 117-149.