Patrice Godefroid, Doron Peled, Mark Staskauskas  Home/Search
Context Related
| belllabs.com/user/god/...ieeetse96.ps 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: belllabs.com/user/god/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Formal validation is a powerful technique for automatically checking that a collection of communicating processes is free from concurrency-related errors. Although validation tools invariably find subtle errors that were missed during thorough simulation and testing, the brute-force search they perform can result in excessive memory usage and extremely long running times. Recently, a number of researchers have been investigating techniques known as partial-order methods that can... (Update)
Context of citations to this paper: More
...on the hierarchical partition. A well known method for reducing state space in asynchronous systems is based on partial order reductions [GPS96] The Next heuristic is incomparable to this method, see [AW99] Join C1 C00 C01 Join Join0 Join1 Join Join00 Join01 C000 C010...
...the other interleaving ( while exploring the system. This kind of reduction has proved valuable in verifying reactive systems [GPS96,Pel96,Val91] In this paper we present partial order reduction technique as it applies to the verification of security protocols. The...
Cited by: More
A Symbolic Partial Order Reduction Algorithm for.. - Bhattacharya.. (2003) (Correct)
Maria: Modular Reachability Analyser For Algebraic System Nets - Mäkelä (2002) (Correct)
Towards Automated Checking of Component-Oriented Enterprise.. - Järvenpää, Mäkelä (2002) (Correct)
Active bibliography (related documents): More All
0.5: Tales from the Front: Industrial Experience with Formal Validation - Staskauskas (1995) (Correct)
0.5: On the Costs and Benefits of using Partial-Order Methods for the .. - Godefroid (1997) (Correct)
0.3: The Virtual Finite-State Machine Design and Implementation.. - Flora-Holquist, al. (Correct)
Similar documents based on text: More All
0.5: On Combining the Stubborn Set Method with the Sleep Set Method - Varpaaniemi (1994) (Correct)
0.3: Model Checking Without a Model: An Analysis of the.. - Godefroid, Hanmer.. (1998) (Correct)
0.3: A New Partial Order Reduction Algorithm for Concurrent System .. - Ratan Nalumasu (1997) (Correct)
Related documents from co-citation: More All
6: Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safe.. (context) - Godefroid, Wolper
6: A Stubborn Attack on State Explosion (context) - Valmari - 1990
5: Symbolic model checking 10 20 states and beyond - Burch, Clarke et al. - 1992
BibTeX entry: (Update)
Patrice Godefroid, Doron Peled, and Mark Staskauskas. Using partial-order methods in the formal validation of industrial concurrent programs. IEEE Transactions on Software Engineering, 22(7):496--507, July 1996. http://citeseer.ist.psu.edu/godefroid96using.html More
@inproceedings{ godefroid96using,
author = "Patrice Godefroid and Doron Peled and Mark G. Staskauskas",
title = "Using Partial-Order Methods in the Formal Validation of Industrial Concurrent Programs",
booktitle = "International Symposium on Software Testing and Analysis",
pages = "261-269",
year = "1996",
url = "citeseer.ist.psu.edu/godefroid96using.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 - 1996
132 Using partial orders for the efficient verification of deadl.. (context) - Godefroid, Wolper - 1993
108 Combining partial order reductions with on-the-fly model-che.. (context) - Peled - 1996
56 fly verification with stubborn sets (context) - Valmari - 1993
39 Refining dependencies improves partial-order verification me.. (context) - Godefroid, Pirottin - 1993
39 An improved protocol reachability analysis technique - Holzmann - 1988
29 Verification of distributed programs using representative in.. (context) - Katz, Peled - 1992
27 Error detection by reduced reachability graph generation (context) - Valmari - 1988
23 Defining conditional independence using collapses (context) - Katz, Peled - 1992
20 Verification of Concurrent Systems: Function and Timing (context) - Overman - 1981
17 Using partial-order methods in the formal validation of indu.. - Godefroid, Peled et al. - 1996
12 All from one, one for all: on model checking using represent.. (context) - Peled - 1993
9 Formal validation of virtual finite state machines (context) - Flora-Holmquist, Staskauskas - 1995
8 VFSM executable specification (context) - Wagner - 1992
7 Telecommunications software design using virtual finite stat.. (context) - Flora-Holmquist, O'Grady et al. - 1995
5 Heuristics for lazy state generation speeds up analysis of c.. (context) - Valmari - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.bell-labs.com/user/god/index.html): More
The Power of QDDs (Extended Abstract) - Boigelot, Godefroid, Willems.. (1997) (Correct)
Symbolic Protocol Verification with Queue BDDs - Godefroid, Long (1997) (Correct)
Model Checking Partial State Spaces with 3-Valued Temporal.. - Bruns, Godefroid (1999) (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