Multiple counters automata, safety analysis and presburger arithmetic-Reference-Cited by-同舟云学术

Multiple counters automata, safety analysis and presburger arithmetic

Published:1998 Issue: Volume: Page:268-279
ISSN:0302-9743
Container-title:Computer Aided Verification
language:
Short-container-title:

Author:

Comon Hubert,Jurski Yan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0028751

Reference17 articles.

1. R. Alur and D. Dill. Automata for modeling real-time systems. In Proc. 17th 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.

Cited by 134 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Coverability in 2-VASS with One Unary Counter is in NP;Lecture Notes in Computer Science;2023

2. ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses;Static Analysis;2023

3. A calculus for modular loop acceleration and non-termination proofs;International Journal on Software Tools for Technology Transfer;2022-10

4. Warping cache simulation of polyhedral programs;Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2022-06-09

5. CTL$$^*$$ Model Checking for Data-Aware Dynamic Systems with Arithmetic;Automated Reasoning;2022