Abstract
We present an extension to the Murϕ verifier to verify systems with replicated identical components. Verification is by explicit state enumeration in an abstract state space where states do not record the exact numbers of components. Through a new datatype, called RepetitiveID, the user can suggest the use of such an abstraction to verify a system of fixed size. Murϕ automatically checks the soundness of the abstract state graph, and automatically constructs the abstract state graph using the system description.
Using a simple run time check, Murϕ can also determine if it can generalize the verification result of a system with fixed size to systems of larger sizes, including the system with infinite number of components.
This research was supported by Semiconductor Research Corporation under contract 95-DJ-389 and by the Advanced Research Projects Agency through NASA grant NAG-2-891.
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
Krzysztof R. Apt and Dexter C. Kozen. Limits for automatic verification of finitestate concurrent systems. Information Processing Letters, 22:307–309, 1986.
A. Bouajjani, S. Bensalem, S. Graf. C. Loiseaux, and J. Sifakis. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 1993.
F. Balarin and A.L. Sangiovanni-Vincentelli. On the automatic computation of network invariants. 6th Int'l Conf. on Computer-Aided Verification, June 1994.
Patrick Cousot and Radhia Cousot. Abstract interpretation and application to logic programs. Technical report, Ecole Polytechnique, Laboratoire d'Informatique, 1992.
E.M. Clarke and O. Grumberg. Avoiding the state explosion problem in temporal logic model checking algorithms. Proceedings of the 6th Annual ACM Symp. on Priniciple of Distributed Computing, 1987.
E.M. Clarke, O. Grumberg, and S. Jha. Verifying parameterized networks using abstraction and regular languages. CONCUR'95, 1995.
David L. Dill, Andreas J. Drexler, Alan J. Hu, and C. Han Yang. Protocol verification as a hardware design aid. Int'l Conf. on Computer Design: VLSI in Computers and Processors, 1992.
E.J. Dijkstra. Invariance and nondeterminacy. In Mathematical Logic and Programming Languages. Prentice-Hall, 1985.
S. Graf and C. Loiseaux. A tool for symbolic program verification and abstraction. 5th Int'l Conf. on Computer-Aided Verification, April 1993.
Susanne Graf. Verification of a distributed cache memory by using abstractions. 6th Int'l Conf. on Computer-Aided Verification, 1994.
S.M. German and A.P. Sistla. Reasoning about systems with many processes. Journal of Association for Computing Machinery, 39(3):675–735, 1992.
C. Norris Ip and David L. Dill. Better verification through symmetry. 11th Int'l Symp. on Computer Hardware Description Languages and Their Applications, 1993. Extended version with complete proofs and semantic analysis to appear in Formal Methods in System Design.
C. Norris Ip and David L. Dill. Efficient verification of symmetric concurrent systems. Int'l Conf. on Computer Design: VLSI in Computers and Processors, 1993.
C. Norris Ip and David L. Dill. State reduction using reversible rules. 33rd Design Automation Conference, June 1996.
Robert P. Kurshan, Michael Merritt, Ariel Orda, and Sonia R. Sachs. A structural linearization principle for processes. Formal Methods in System Design, 5, 1994.
Daniel Lenoski, James Laudon, Kourosh Gharachorloo, Anoop Gupta, and John Hennessy. The directory-based cache coherence protocol for the dash multiprocessor. 17th Int'l Symp. on Computer Architecture, 1990.
Boris D. Lubachevsky. An approach to automating the verification of compact parallel coordination programs I. Acta Informatica, 21:125–169, 1984.
F. Pong and M. Dubois. Correctness of a directory-based cache coherence protocol: Early experience. 5th Symp. on Parallel Distributed Processing, 1993.
F. Pong and M. Dubois. A new approach for the verification of cache coherence protocols. IEEE Transactions on Parallel and Distributed Systems, 6(2), 1995.
F. Pong, A. Nowatzyk, G. Aybay, and M. Dubois. Verifying distributed directorybased cache coherence protocols: S3.mp, a case study. EurPar'95.
Fong Pong. Symbolic State Model: A New Approach for the Verification of Cache Coherence Protocols. PhD thesis, University of Southern California, 1995.
June-Kyung Rho and Fabio Somenzi. Automatic generation of network invariants for the verification of iterative sequential systems. 5th Int'l Conf. on Computer-Aided Verification, June 1993.
A.P. Sistla and S.M. German. Reasoning with many processes. Symp. on Logic in Computer Science, 1987.
Kenji Shibata, Yutaka Hirakawa, Akira Takura, and Tadashi Ohta. Reachability analysis for specified processes in a behavior description. IEICE Transaction on Communication, E76-B(11), November 1993.
Pierre Wolper and Vinciane Lovinfosse. Verifying properties of large sets of processes with network invariants. In Automatic Verification Methods for Finite State Systems, volume 407 of LNCS, Springer-Verlag, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ip, C.N., Dill, D.L. (1996). Verifying systems with replicated components in murϕ. In: Alur, R., Henzinger, T.A. (eds) Computer Aided Verification. CAV 1996. Lecture Notes in Computer Science, vol 1102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61474-5_65
Download citation
DOI: https://doi.org/10.1007/3-540-61474-5_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61474-6
Online ISBN: 978-3-540-68599-9
eBook Packages: Springer Book Archive