Abstract
During the last two decades, an important effort has been devoted to the development of verification techniques and their application. Significant achievements have been obtained, and efficient tools have been developed for automatic verification of finite-state systems (i.e., systems with finitely many configurations), based essentially on reachability analysis algorithms. All major constructors of hardware and software controllers have already created verification groups that use these techniques. This is particularly true after the recent occurrence of costly errors like the Pentium bug and the Ariane crash.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Esparza, A. Finkel and R. Mayr: On the Verification of Broadcast Protocols. Proceedings of LICS’99, IEEE Computer Society, 352–359 (1999).
G. Delzanno, J. Esparza and A. Podelski: Constraint-based Analysis of Broadcast Protocols. Proceedings of CSL’ 99 Lecture Notes in Computer Science 1683, 50–66 (1999).
G. Delzanno and J.-F. Raskin: Symbolic Representation of Upwards Closed Sets. Proceedings of TACAS’ 00. Lecture Notes in Computer Science 1683, 426–440 (2000).
G. Delzanno: Automatic Verification of Parameterized Cache Coherence Protocols. Proceedings of CAV’ 00. Lecture Notes in Computer Science 1683, 53–68 (2000).
G. Delzanno and A. Podelski: Model Checking in CLP. Proceedings of TACAS’ 99, Lecture Notes in Computer Science 1579, 223–239 (1999).
A. Bouajjani, J. Esparza and O. Maler: Reachability Analysis of Pushdown Automata: Application to Model-Checking. Proceedings of CONCUR’ 97, Lecture Notes in Computer Science 1243, 135–150 (1997).
J. Esparza, D. Hansel, P. Rossmanith and S. Schwoon: Efficient Algorithms for Model Checking Pushdown Systems. Lecture Notes in Computer Science 1683, 232–247 (2000).
J. Esparza and J. Knoop: An Automata-theoretic Approach to Interprocedural Dataflow Analysis. Proceedings of FOSSACS’ 99, Lecture Notes in Computer Science 1578, 14–30 (1999)
B. Boigelot and P. Godefroid: Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs. Proceedings of CAV’ 96, Lecture Notes in Computer Science 1102, 1–12 (1996).
A. Bouajjani and P. Habermehl: Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations. Proceedings of ICALP’ 97, Lecture Notes in Computer Science 1256, 560–570 (1998).
P.A. Abdulla and B. Jonsson: Verifying programs with unreliable channels. Information and Computation 127(2):91–101 (1996).
P.A. Abdulla, A. Bouajjani and B. Jonsson: On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels. Proceedings of CAV’ 98, Lecture Notes in Computer Science 1427, 305–318 (1998).
S.M. German and A.P. Sistla: Reasoning about systems with many processes. Journal of the ACM, 39(3):675–735 (1992).
E.A. Emerson and J. Srinivasan. A decidable temporal logic to reason about many processes. In Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 233–246 (1990).
P.A. Abdulla, A. Bouajjani, B. Jonsson and M. Nilsson: Handling Global Conditions in Parametrized System Verification. Proceedings of CAV’ 99, Lecture Notes in Computer Science 1633, 134–145 (1999).
R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183–235 (1994). Fundamental Study.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Esparza, J. (2001). Verification of Systems with an Infinite State Space. In: Cassez, F., Jard, C., Rozoy, B., Ryan, M.D. (eds) Modeling and Verification of Parallel Processes. MOVEP 2000. Lecture Notes in Computer Science, vol 2067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45510-8_8
Download citation
DOI: https://doi.org/10.1007/3-540-45510-8_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42787-2
Online ISBN: 978-3-540-45510-3
eBook Packages: Springer Book Archive