Supported by NSF Grants CCR-9987516 and CCR-0081406, and a gift from the Intel Corporation.
Chapter PDF
Similar content being viewed by others
References
Jiri Barnat, Lubos Brim, and Jitka Stribrna. Distributed ltl model-checking in spin. In Proceedings of the 7th International SPIN Workshop, pages 200–216, 2001. LNCS 2057.
Hubert Garavel, Radu Mateescu, and Irina Smarandache. Parallel state space construction for model-checking. In Proceedings of the 7th International SPINWorkshop, pages 217–234, 2001. LNCS 2057.
Richard J. Lipton. Reduction:A method of proving properties of parallel programs. Communications of the ACM, 18(12), December 1975.
Ratan Nalumasu and Ganesh Gopalakrishnan. An efficent partial order reduction algorithm with an alternative proviso implementation. Formal Methods in System Design, 20(3):231–247, May 2002.
Robert Palmer and Ganesh Gopalakrishnan. Partial order reduction assisted parallel modelchecking (full version). Technical report, University of Utah, August 2002.
Ulrich Stern and David Dill. Parallelizing the Murö verifier. Formal Methods in System Design, 18(2):117–129, 2001. (Journal version of their CAV 1997 paper).
The Utah Verifier group website. http://www.cs.utah.edu/formal verification.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Palmer, R., Gopalakrishnan, G. (2002). A Distributed Partial Order Reduction Algorithm. In: Peled, D.A., Vardi, M.Y. (eds) Formal Techniques for Networked and Distributed Sytems — FORTE 2002. FORTE 2002. Lecture Notes in Computer Science, vol 2529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36135-9_26
Download citation
DOI: https://doi.org/10.1007/3-540-36135-9_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00141-6
Online ISBN: 978-3-540-36135-0
eBook Packages: Springer Book Archive