Abstract
We consider the problem of verifying automatically infinite- state systems that are systems of finite machines that communicate by exchanging messages through unbounded lossy fifo channels. In a previous work [1], we proposed an algorithmic approach based on constructing a symbolic representation of the set of reachable configurations of a system by means of a class of regular expressions (SREs). The construction of such a representation consists of an iterative computation with an acceleration technique which enhances the chance of convergence. This technique is based on the analysis of the effect of iterating control loops. In the work we present here, we experiment our approach and show how it can be effectively applied. For that, we developed a tool prototype based on the results in [1]. Using this tool, we provide an automatic verification of (the parameterized version of) the Bounded Retransmission Protocol.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
P. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly Analysis of Systems with Unbounded, Lossy Fifo Channels. In CAV’98. LNCS 1427, 1998.
S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property-preserving simulations. In CAV’92. LNCS 663, 1992.
S. Bensalem, Y. Lakhnech, and S. Owre. Computing Abstractions of Infinite State Systems Compositionally and Automatically. In CAV’98. LNCS 1427, 1998.
B. Boigelot and P. Godefroid. Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs. In CAV’96. LNCS 1102, 1996.
B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. In SAS’97. LNCS 1302, 1997.
B. Boigelot and P. Wolper. Symbolic Verification with Periodic Sets. In CAV’94. LNCS 818, 1994.
A. Bouajjani and P. Habermehl. Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations. In ICALP’97. LNCS 1256, 1997.
Gérard Cécé, Alain Finkel, and S. Purushothaman Iyer. Unreliable Channels Are Easier to Verify Than Perfect Channels. Inf. and Comp., 124(1):20–31, 1996.
P. Cousot and R. Cousot. Static Determination of Dynamic Properties of Recursive Procedures. In IFIP Conf. on Formal Desc. of Prog. Concepts. NH Pub., 1977.
P. D’Argenio, J-P. Katoen, T. Ruys, and G. J. Tretmans. The Bounded Retrans-mission Protocol must be on Time. In TACAS’97. LNCS 1217, 1997.
J-C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu. CADP: A Protocol Validation and Verification Toolbox. In CAV’96. LNCS 1102, 1996.
A. Finkel and O. Marcé. Verification of Infinite Regular Communicating Automata. Technical report, LIFAC, ENS de Cachan, 1996.
S. Graf and H. Saidi. Construction of Abstract State Graphs with PVS. In CAV’97, volume 1254 of LNCS, 1997.
J-F. Groote and J. Van de Pol. A Bounded Retransmission Protocol for Large Data Packets. In AMAST’96. LNCS 1101, 1996.
O. Grumberg and D. Long. Model Checking and Modular Verification. ACM TOPLAS, 16:843–871, 1994.
K. Havelund and N. Shankar. Experiments in Theorem Proving and Model Checking for Protocol Verification. In FME’96. LNCS 1051, 1996.
L. Helmink, M. P. A. Sellink, and F. Vaandrager. Proof checking a Data Link Protocol. In Types for Proofs and Programs. LNCS 806, 1994.
R. M. Karp and R. E. Miller. Parallel Program Schemata: A Mathematical Model for Parallel Computation. In 8th ann. Switch. and Aut. Theo. Symp. IEEE, 1967.
R. Mateescu. Formal Description and Analysis of a Bounded Retransmission Protocol. Technical report no. 2965, INRIA, 1996.
J. K. Pachl. Protocol Description and Analysis Based on a State Transition Model with Channel Expressions. In Protocol Specification, Testing, and Verification VII, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abdulla, P., Annichini, A., Bouajjani, A. (1999). Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol. In: Cleaveland, W.R. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 1999. Lecture Notes in Computer Science, vol 1579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49059-0_15
Download citation
DOI: https://doi.org/10.1007/3-540-49059-0_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65703-3
Online ISBN: 978-3-540-49059-3
eBook Packages: Springer Book Archive