A distributed partial order reduction algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2529 LNCS, Issue , 2002, Pages 370-

  Palmer, Robert ^a   Gopalakrishnan, Ganesh ^a  

^a Department of Electrical and Computer Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 23044533389     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36135-9_26     Document Type: Conference Paper

References (7)

1. 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.
2. Hubert Garavel, Radu Mateescu, and Irina Smarandache. Parallel state space construction for model-checking. In Proceedings of the 7th International SPIN Workshop, pages 217–234, 2001. LNCS 2057.
3. Richard J. Lipton. Reduction: A method of proving properties of parallel programs. Communications of the ACM, 18(12), December 1975.
4. 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.
5. Robert Palmer and Ganesh Gopalakrishnan. Partial order reduction assisted parallel model-checking (full version). Technical report, University of Utah, August 2002.
6. 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).
7. The Utah Verifier group website. http://www.cs.utah.edu/formal verification.