Ratan Nalumasu, Ganesh Gopalakrishnan  Home/Search
Context Related
| utah.edu/techreports...UUCS96006.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: utah.edu/techreports/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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,... (Update)
Context of citations to this paper: More
...the others missed in their incomplete search. In this paper, we prove that PV preserves all stutter free safety properties. In (Nalumasu et al. 1996b) we also prove that Two phase preserves liveness properties in a limited setting. We also summarize experimental results on...
Cited by: More
A Partial Order Reduction Algorithm without the Proviso - Nalumasu, Gopalakrishnan (1998) (Correct)
A New Partial Order Reduction Algorithm for Concurrent System .. - Ratan Nalumasu (1997) (Correct)
Similar documents (at the sentence level):
24.3%: Partial Order Reduction without the Proviso - Nalumasu, Gopalakrishnan (1996) (Correct)
14.3%: An Improvement to Partial Order Reductions - Nalumasu, Gopalakrishnan (Correct)
Active bibliography (related documents): More All
0.1: On the Costs and Benefits of using Partial-Order Methods for the .. - Godefroid (1997) (Correct)
0.1: On the Stubborn Set Method in Reduced State Space Generation - Varpaaniemi (1998) (Correct)
0.1: Partial-Order Methods for Temporal - Verification Pierre Wolper (Correct)
Similar documents based on text: More All
0.7: Resume - Nalumasu (Correct)
0.4: Explicit-enumeration based Verification made Memory-efficient - Nalumasu, Gopalakrishnan (1995) (Correct)
0.4: The `Test Model-checking' Approach to the.. - Nalumasu.. (1998) (Correct)
Related documents from co-citation: More All
2: Combining partial order reductions with on--the--fly model checking (context) - Peled - 1994
2: An improvement in formal verification - Holzmann, Peled - 1994
2: The Stanford Murphi verifier (context) - Dill - 1996
BibTeX entry: (Update)
Nalumasu, R. and Gopalakrishnan, G. (1996). Partial order reductions without the proviso. Technical Report UUCS-96-006, University of Utah, Salt Lake City, UT, USA. http://citeseer.ist.psu.edu/nalumasu96partial.html More
@techreport{ nalumasu96partial,
author = "Ratan Nalumasu and Ganesh Gopalakrishnan",
title = "Partial Order Reduction Without the Proviso",
number = "UUCS-96-006",
month = "6,",
year = "1996",
url = "citeseer.ist.psu.edu/nalumasu96partial.html" }
Citations (may not include all citations):207 A stubborn attack on state explosion (context) - Valmari - 1990
135 Partial-Order Methods for the Verification of Concurrent Sys.. - Godefroid - 1994
108 An improvement in formal verification - Holzmann, Peled - 1994
108 Combining partial order reductions with on-the-fly model-che.. (context) - Peled - 1994
108 Combining partial order reductions with on-the-fly model-che.. (context) - Peled - 1996
102 Design and Validation of Computer Protocols (context) - Holzmann - 1991
86 Basic notions of trace theory (context) - Mazurkiewicz - 1989
68 one for all: On model checking using representatives (context) - Peled, one - 1993
56 fly verification with stubborn sets (context) - Valmari - 1993
53 Coverage preserving reduction strategies for reachability an.. - Holzmann, Godefroid et al. - 1992
50 State-space caching revisited - Godefroid, Holzmann et al. - 1992
39 Refining dependencies improves partial-order verification me.. (context) - Godefroid, Pirottin - 1993
2 Developing micropipeline wavefront arbiters using lockable C.. (context) - Gopalakrishnan - 1994
http://www.cs.utah.edu/projects/avalanche
http://www.cs.utah.edu/ratan/verif/two2.html
Documents on the same site (http://www.cs.utah.edu/techreports/): More
Instrumented Sensor System - Practice - Dekhil, Henderson (1997) (Correct)
Notes on Thread Models in Mach3.0 - Ford, Hibler, Lepreau (1993) (Correct)
A Fast Parallel Squarer Based on Divide-and-Conquer - Yoo, Smith, Gopalakrishnan (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC