Abstract
An on-the-fly algorithm for model checking under fairness is presented. The algorithm utilizes symmetry in the program to reduce the state space, and employs novel techniques that make the on-the-fly model checking feasible. The algorithm uses state symmetry and eliminates parallel edges in the reachability graph. Experimental results demonstrating dramatic reductions in both the running time and memory usage are presented.
Article PDF
Similar content being viewed by others
References
S. Aggarwal, R.P. Kurshan, and K.K. Sabnani, “A calculus for protocol specification and validation,” in H. Ruden and C. West (Eds.), Protocol Specification, Testing and Verification III, pp. 19–34, North-Holland, 1983.
A.V. Aho, J. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
G. Bhat, R. Cleaveland, and O. Grumberg, “Efficient on-the-fly modelchecking for CTL,” in Proceedings of the International Conference on Logic in Computer Science, San Diego, California, 1995.
E.M. Clarke, E.A. Emerson, and A.P. Sistla, “Automatic verification of finite state concurrent programs using temporal logic: A practical approach,” in Proceedings of the ACM Symposium on Principles of Programming Languages, Austin, Texas, January 1983. Also appeared in ACM TOPLAS, April 1986.
E.M. Clarke, T. Filkorn, and S. Jha, “Exploiting symmetry in temporal logic model checking,” in Proceedings of the 5th International Conference on Computer Aided Verification, Crete, Greece, June 1993.
R. Cleaveland, “Analyzing concurrent systems using the concurrency workbench, functional programming, concurrency, simulation, and automated reasoning,” LNCS 693, Springer-Verlag, pp. 129–144, 1993.
T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, The MIT Press, 1990.
D. Dams, O. Grumberg, and R. Gerth, “Generation of reduced models for checking fragments of CTL,” CAV93, LNCS 697, Springer-Verlag, 1993.
E.A. Emerson and A.P. Sistla, “Symmetry and model checking,” in Proceedings of the 5th International Conference on Computer Aided Verification, Crete, Greece, June 1993.
E.A. Emerson and A.P. Sistla, “Utilizing symmetry when model checking under fairness assumptions: An automata-theoretic approach,” in Proceedings of the 7th International Conference on Computer Aided Verification, Leige, Belgium, July 1995.
P. Godefroid, “Partial-order methods for the verification of concurrent systems,” LNCS 1032, Springer-Verlag, 1996.
G.J. Holzmann and D. Peled, “The state of SPIN,” in Proceedings of the 8th International Conference on Computer Aided Verification, July 1996.
C.N. Ip and D.L. Dill, “Better verification through symmetry,” Intl. Symposium on Computer Hardware Description Languages and their Application, April 1993. Also in Formal Methods in System Design 9 1/2, pp. 41–75, 1996.
K. Jensen, “Colored petri nets: Basic concepts, analysis methods, and practical use,” Vol. 2: Analysis Methods, EATCS Monographs, Springer-Verlag, 1994.
K. Jensen and G. Rozenberg (Eds.), “High-level petri nets: Theory and application,” Springer-Verlag, 1991.
R.P. Kurshan, “Testing containment of omega-regular languages,” Bell Labs. Tech. Report 1121–861010–33 (1986); conference version in R.P. Kurshan, “Reducibility in analysis of coordination,” LNCS 103, Springer-Verlag, pp. 19–39, 1987.
R.P. Kurshan, “Computer aided verification of coordinated processes: The automata theoretic approach,” Princeton Univerity Press, Princeton NJ, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gyuris, V., Sistla, A.P. On-the-Fly Model Checking Under Fairness that Exploits Symmetry. Formal Methods in System Design 15, 217–238 (1999). https://doi.org/10.1023/A:1008701202999
Issue Date:
DOI: https://doi.org/10.1023/A:1008701202999