Verifying systems with infinite but regular state spaces

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

Volumn 1427 LNCS, Issue , 1998, Pages 88-97

  Wolper, Pierre ^a   Boigelot, Bernard ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

MODEL CHECKING; SPACE RESEARCH;

FINITE STATE SYSTEMS; INFINITE STATE SPACE; STATE SPACE EXPLORATION; SYMBOLIC REPRESENTATION;

COMPUTER AIDED ANALYSIS;

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

References (22)

1. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-236, 1994.
2. B. Boigelot, L. Bronne, and S. Rassart. An improved reachability analysis method for strongly linear hybrid systems. In Proc. 9th Int. Conf. on Computer Aided Verification, volume 1254 of Lecture Notes in Computer Science, pages 167-178, Haifa, June 1997. Springer-Verlag. (Pubitemid 127088974)
3. A. Boudet and H. Comon. Diophantine equations, Presburger arithmetic and finite automata. In Proceedings of CAAP'96, number 1059 in Lecture Notes in Computer Science, pages 30-43. Springer-Verlag, 1996. (Pubitemid 126064261)
4. 20 states and beyond. Information and Computation, 98(2):142-170, June 1992.
5. B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In Proceedings of Computer-Aided Verification, volume 1102 of Lecture Notes in Computer Science, pages 1-12, New-Brunswick, NJ, USA, July 1996. Springer-Verlag. (Pubitemid 126101265)
6. B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDD's. In Proc. of Int. Static Analysis Symposium, volume 1302 of Lecture Notes in Computer Science, pages 172-186, Paris, September 1997. Springer-Verlag.
7. B. Boigelot. Symbolic Methods for Exploring Infinite State Spaces. PhD thesis, Université de Liège, 1998.
8. B. Boigelot, S. Rassart, and P. Wolper. On the expressiveness of real and integer arithmetic automata, to appear in Proc. ICALP'98, 1998.
9. R.E. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, 1992.
10. O. Burkart and B. Steffen. Composition, decomposition and model checking of pushdown processes. Nordic Journal of Computing, 2(2):89-125, 1995.
11. J. R. Büchi. Weak second-order arithmetic and finite automata. Zeitschrift Math. Logik und Grundlagen der Mathematik, 6:66-92, 1960.
12. O. Bernholtz, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In Computer Aided Verification, Proc. 6th Int. Workshop, volume 818 of Lecture Notes in Computer Science, pages 142-155, Stanford, California, June 1994. Springer-Verlag. full version available from authors.
13. B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In Computer Aided Verification, Proc. 6th Int. Conference, volume 818 of Lecture Notes in Computer Science, pages 55-67, Stanford, California, June 1994. Springer-Verlag.
14. D. Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science, 106:61-86, 1992. (Pubitemid 23605842)
15. A. Cobham. On the base-dependence of sets of numbers recognizable by finite automata. Mathematical Systems Theory, 3:186-192, 1969.
16. J. Esparza and M. Nielsen. Decidability issues for Petri nets - a survey. Bulletin of the EATCS, 52:245-262, 1994.
17. A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems (extended abstract). Presented at Infin-ity'97 (Bologna), Electronic notes in theoretical computer science, August 1997.
18. A. L. Semenov. Presburgerness of predicates regular in two number systems. Siberian Mathematical Journal, 18:289-299, 1977.
19. A. Valmari. A stubborn attack on state explosion. Formal Methods in System Design, 1:297-322, 1992.
20. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the First Symposium on Logic in Computer Science, pages 322-331, Cambridge, June 1986.
21. P. Wolper and B. Boigelot. An automata-theoretic approach to presburger arithmetic constraints. In Proc. Static Analysis Symposium, volume 983 of Lecture Notes in Computer Science, pages 21-32, Glasgow, September 1995. Springer-Verlag.
22. P. Wolper and P. Godefroid. Partial-order methods for temporal verification. In Proc. CONCUR '93, volume 715 of Lecture Notes in Computer Science, pages 233-246, Hildesheim, August 1993. Springer-Verlag.