(Enter summary)
Abstract: We study the effect of three new reduction strategies for conventional reachability analysis, as used in
automated protocol validation algorithms. The first two strategies are implementations of partial
order semantics rules that attempt to minimize the number of execution sequences that need to be
explored for a full state space exploration. The third strategy is the implementation of a state compression
scheme that attempts to minimize the amount of memory that is used to built a state... (Update)
Cited by: More
Partial-Order Reduction for General State Exploring.. - Bosnacki, Leue, Lafuente (2006)
(Correct)
Partial-Order Reduction and Trail Improvement in.. - Edelkamp.. (2004)
(Correct)
Partial Order Reduction in Directed Model Checking - Lluch-Lafuente, Edelkamp, Leue (2001)
(Correct)
Active bibliography (related documents): More All
0.3: An Improved Protocol Reachability Analysis Technique - Holzmann (1988)
(Correct)
0.3: On Limits and Possibilities of Automated Protocol Analysis - Holzmann (1987)
(Correct)
0.2: Tracing Protocols - Holzmann (1985)
(Correct)
Similar documents based on text: More All
0.6: On the Verification of Temporal Properties - Godefroid (1993)
(Correct)
0.5: Refining Dependencies Improves - Partial-Order Verification Methods
(Correct)
0.4: Nonlinear analysis of cardiac rhythm fluctuations using .. - Absil, Sepulchre.. (1999)
(Correct)
Related documents from co-citation: More All
33: A Stubborn Attack on State Explosion (context) - Valmari - 1990
30: Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safe.. (context) - Godefroid, Wolper
19: Combining partial order reductions with on--the--fly model checking (context) - Peled - 1994
BibTeX entry: (Update)
G. Holzmann, P. Godefroid, and D. Pirottin, "Coverage Preserving Reduction Strategies for Reachability Analysis," presented at 12th International Symposium on Protocol Specification, Testing, and Verification, Lake Buena Vista, Florida, North-Holland, June 1992. http://citeseer.ist.psu.edu/holzmann92coverage.html More
@inproceedings{ holzmann92coverage,
author = "G.J. Holzmann and P. Godefroid and D. Pirottin",
title = "Coverage preserving reduction strategies for reachability analysis",
booktitle = "Proc. 12th Int. Conf on Protocol Specification, Testing, and Verification, {INWG}/{IFIP}",
month = "June",
address = "Orlando, Fl.",
year = "1992",
url = "citeseer.ist.psu.edu/holzmann92coverage.html" }
Citations (may not include all citations):
470
Design and Validation of Computer Protocols (context) - Holzmann - 1991
132
Using partial orders for the efficient verification of deadl.. (context) - Godefroid, Wolper
102
Symbolic model checking, 10 20 states and beyond (context) - Burch - 1990
86
Stubborn sets for reduced state space generation (context) - Valmari - 1989
39
An improved protocol reachability analysis technique
- Holzmann - 1988
21
Algorithms for automated protocol validation
- Holzmann - 1990
20
Verification of concurrent systems: functions and timing (context) - Overman - 1981
20
Automated protocol validation in Argos --- assertion proving..
- Holzmann - 1987
15
Improved failure equivalence for finite state systems with a.. (context) - Valmari, Tienari - 1991
11
Tracing protocols
- Holzmann
6
A synchronization calculus for message oriented programming (context) - Cunha, Maibaum - 1981
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.montefiore.ulg.ac.be/services/verif/po-pack.html): More
State-Space Caching Revisited - Godefroid, Holzmann, al. (1992)
(Correct)
Partial-Order Methods for Temporal - Verification Pierre Wolper
(Correct)
Refining Dependencies Improves - Partial-Order Verification Methods
(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