Abstract
The intrinsic complexity of most protocol specifications in particular, and of asynchronous systems in general, lead us to study combinations of static analysis with classical model-checking techniques as a way to enhance the performances of automated validation tools.
The goal of this paper is to point out that an equivalence on our model derived from the information on live variables is stronger than the strong bisimulation. This equivalence, further called live bisimulation, exploits the unused dead values stored either in variables or in queue contents and allow to simplify the state space with a rather important factor. Furthermore, this reduction comes almost for free and is always possible to directly generate the quotient model without generating the initial one.
This work was partially supported by Région Rhône Alpes
VERIMAG is a joint laboratory of CNRS, UJF and INPG Grenoble
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
P. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly Analysis of Systems with Unbounded, Lossy Fifo Channels. In Proceedings of CAV’98, Vancouver, Canada, volume 1427 of LNCS, 1998.
A. Aho, R. Sethi, and J.D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, Readings, MA, 1986.
S. Bensalem, Y. Lakhnech, and S. Owre. Computing Abstractions of Infinite State Systems Compositionally and Automatically. In Proceedings of CAV’98 (Vancouver, Canada), volume 1427 of LNCS, 1998.
B. Boigelot and P. Godefroid. Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs. In Proceedings of CAV’96, New Brunswick, USA, volume 1102 of LNCS, 1996.
M. Bozga, J.-C. Fernandez, L. Ghirvu, S. Graf, J.P. Krimm, L. Mounier, and J. Sifakis. IF: An Intermediate Representation for SDL and its Applications. In Proceedings of SDL-FORUM’99, Montreal, Canada, 1999.
M. Bozga, J.-C. Fernandez, L. Ghirvu, C. Jard, T. Jéron, A. Kerbrat, P. Morel, and L. Mounier. Verification and Test Generation for the SSCOP Protocol. SCP, 1998. to appear.
M. Bozga, J.-C. Fernandez, A. Kerbrat, and L. Mounier. Protocol Verification with the Aldebaran Toolset. Springer International Journal on Software Tools for Technology Transfer, 1(1+2):166–183, December 1997.
E.M. Clarke, E.A. Emerson, and E. Sistla. Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications: A Practical Approach. In Proceedings of 10th ACM Symposium on Programming Languages, 1983.
C. Colby, P. Godefroid, and L.J. Jagadeesan. Automatically Closing Open Reactive Systems. In Proceedings of ACM SIGPLAN on PLDI, June 1998.
C. Daws and S. Yovine. Reducing the Number of Clock Variables of Timed Automata. In Proceedings of RTSS’96, 1996.
J.-C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu. CADP: A Protocol Validation and Verification Toolbox. In Proceedings of CAV’96, New Brunswick, USA, volume 1102 of LNCS, 1996.
J.-C. Fernandez, C. Jard, T. Jéron, and L. Mounier. “On the Fly” Verification of Finite Transition Systems. Formal Methods in System Design, 1992.
J.-C. Fernandez, C. Jard, T. Jéron, and C. Viho. An Experiment in Automatic Generation of Test Suites for Protocols with Verification Technology. SCP, 29, 1997.
J.-C. Fernandez, A. Kerbrat, and L. Mounier. Symbolic Equivalence Checking. In Proceedings of CAV’93, Heraklion, Greece, volume 697 of LNCS, 1993.
P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems–An Approach to the State Explosion Problem. volume 1032 of LNCS, 1996.
ISO/IEC. LOTOS–A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour. Technical Report 8807, International Organization for Standardization–Information Processing Systems–Open Systems Interconnection, 1988.
ITU-T. Recommendation Z-100. Specification and Description Language (SDL). 1994.
R. Kurshan, V. Levin, M. Minea, D. Peled, and H. Yenigün. Static Partial Order Reduction. In Proceedings of TACAS’98, Lisbon, Portugal, volume 1384 of LNCS, 1998.
K.L. McMillan. Symbolic Model Checking: an Approach to the State Explosion Problem. Kluwer Academic Publisher, 1993.
R. Milner. A Calculus of Communication Systems. In LNCS, number 92. 1980.
S. Muchnick. Advanced Compiler Design Implementation. Morgan Kaufmann Publishers, San Francisco, CA, 1997.
J.P. Queille and J. Sifakis. Specification and Verification of Concurrent Programs in CESAR. In International Symposium on Programming, volume 137 of LNCS, 1982.
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
Bozga, M., Fernandez, JC., Ghirvu, L. (1999). State Space Reduction Based on Live Variables Analysis. In: Cortesi, A., Filé, G. (eds) Static Analysis. SAS 1999. Lecture Notes in Computer Science, vol 1694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48294-6_11
Download citation
DOI: https://doi.org/10.1007/3-540-48294-6_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66459-8
Online ISBN: 978-3-540-48294-9
eBook Packages: Springer Book Archive