Partial order reduction without the proviso

Update item information
Publication Type Journal Article
School or College College of Engineering
Department Computing, School of
Creator Gopalakrishnan, Ganesh
Other Author Nalumasu, Ratan
Title Partial order reduction without the proviso
Date 1996
Description In this paper, we present a new partial order reduction algorithm that can help reduce both space and time requirements of on-the-fly explicit enumeration based verifiers. The partial order reduction algorithms described in [God95, HP94, Pel94, Pel96] were observed to yield very little savings in many practical examples. The reason was traced to the proviso in these algorithms that often caused their search to generate many unnecessary states. Our algorithm, called the two-phase algorithm, avoids the proviso, and follows an execution strategy consisting of alternating phases of partial order reduction of deterministic states and depth-first search. In this paper, we describe the two-phase algorithm, prove its correctness, describe a new verification tool employing it, and provide a number of significant examples, including directory based protocols of a multiprocessor, that demonstrate the superior performance of the two-phase algorithm.
Type Text
Publisher University of Utah
First Page 1
Last Page 16
Subject Partial order reduction algorithms
Subject LCSH Computer algorithms
Language eng
Bibliographic Citation Nalumasu, R., & Gopalakrishnan, G. (1996). Partial order reduction without the proviso. 1-16. UUCS-96-008.
Series University of Utah Computer Science Technical Report
Relation is Part of ARPANET
Rights Management ©University of Utah
Format Medium application/pdf
Format Extent 3,807,276 bytes
Identifier ir-main,16228
ARK ark:/87278/s6qv44tk
Setname ir_uspace
Date Created 2012-06-13
Date Modified 2015-04-24
ID 704487
Reference URL
Back to Search Results