Multiple counters automata, safety analysis and presburger arithmetic

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

Volumn 1427 LNCS, Issue , 1998, Pages 268-279

  Comon, Hubert ^a   Jurski, Yan ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; DIGITAL ARITHMETIC;

NUMBER OF ITERATIONS; PRESBURGER ARITHMETIC; SAFETY ANALYSIS;

AUTOMATA THEORY;

EID: 84863901157     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0028751     Document Type: Conference Paper

References (17)

1. R. Alur and D. Dill. Automata for modeling real-time systems. In Proc. 11th Int. Coll. on Automata, Languages and Programming, Warwick, LNCS 443, pages 322-335. Springer-Verlag, 1990.
2. O. Bernholtz, M. Vardi, and P. Wolper. An automata-theoretic approach to branching time model checking. In Proc. Computer Aided Verification, 1994.
3. B. Boigelot. Linear operators and regular languages (ii). Unpublished draft, jan 1997.
4. B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In Computer Aided Verification, Proc. 6th Int. Conerence, LNCS, Stanford, June 1994. Springer-Verlag.
5. T. Bultan, R. Gerber, and W. Pugh. Symbolic model checking of infinite state systems using presburger arithmetic. In O. Grumberg, editor, Proc. Computer Aided Verification, volume 1254 of LNCS, Haifa, Israel, 1997. Springer-Verlag.
6. T. Cormen, C. Leiserson, and R. Rivest. Introduction to algorithms. MIT Press, 1990.
7. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Proc. Int. Conf. on Princinples Of Programming Languages (POPL), 1978.
8. J. Esparza. Decidability of model checking for infinite-state concurrent systems. Acta Informatica, 34:85-107, 1997. (Pubitemid 127359706)
9. L. Fribourg. A closed form evaluation for extending timed automata. Technical Report 1998-02, Laboratoire Spécification et Vérification, ENS Cachan, Mar. 1998.
10. L. Fribourg and H. Olsen. A decompositional approach for computing least fixed-point of datalog programs with z-counters. J. Constraints, 1997.
11. L. Fribourg and J. Richardson. Symbolic verification with gap-order constraints. Research Report LIENS-96-3, Ecole Normale Supérieure, Paris, Feb. 1996.
12. N. Halbwachs. Delay analysis in synchronous programs. In Proc. Computer Aided Verification, LNCS 697, pages 333-346. Springer-Verlag, 1993.
13. M. Minsky. Computation, Finite and Infinite Machines. Prentice Hall, 1967.
14. R. Parikh. On context-free languages. J. ACM, 13, 1966.
15. P. Revesz. A closed form for datalog queries with integer order. In Proc 3rd International Conference on Database Theory, pages 187-201, Paris, 1990.
16. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 134-191. Elsevier, 1990.
17. D. Toman, J. Chomicki, and D. S. Rogers. Datalog with integer periodicity constraints. In Int. Symp. on Logic Programming, 1994.