C. Norris Ip, David L. Dill  Home/Search
Context Related
| stanford.edu/ip/sym2.ps.gz stanford.edu/PAPERS/ID93A.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: stanford.edu/ip/publications (more) From: stanford.edu/papers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Previously, we proposed a reduction technique [ID93] based on symmetries to alleviate the state explosion problem in automatic verification of concurrent systems. This paper describes the results of testing the technique on a wide range of algorithms and protocols, including realistic multiprocessor synchronization algorithms and cache coherence protocols. Memory requirements were reduced by amounts ranging from 83% to over 99%, and time requirements were often reduced as well. We also consider ... (Update)
Context of citations to this paper: More
.... been techniques developed that can find reductions in the state space that needs to be explored without compromising the property check [IpD93], but these also are best applied to protocol verification. An alternative to using an explicit representation to store the set of...
...of states traversed and, therefore, Mur s memory requirements. The first technique uses symmetry to eliminate redundant states [43, 44]. Symmetry in a system allows Mur to find states that are equivalent in their current and future behavior with respect to error checking....
Cited by: More
Formal Specification and Verification of the.. - Layouni, Hooman, Tahar (2003) (Correct)
An Overview and Application of Model Reduction Techniques.. - Baumgartner, Heyman (1998) (Correct)
The Murphi Verification System - Dill (1996) (Correct)
Similar documents (at the sentence level):
11.4%: Better Verification Through Symmetry - Ip, Dill (1996) (Correct)
Active bibliography (related documents): More All
0.3: Verifying Systems with Replicated Components in Murφ - Ip, Dill (1997) (Correct)
0.3: Protocol Verification as a Hardware Design Aid - David Dill Andreas (1992) (Correct)
0.2: Automatic Data Path Abstraction for Verification of Large .. - Viresh Paruthi Nazanin (Correct)
Similar documents based on text: More All
0.4: State Reduction Using Reversible Rules - Ip, Dill (1996) (Correct)
0.3: Efficient Verification with BDDs using Implicitly Conjoined.. - Hu, Dill (1993) (Correct)
0.1: An Executable Specification, Analyzer and Verifier for RMO . . . - Park, al. (1995) (Correct)
Related documents from co-citation: More All
17: Protocol verification as a hardware design aid - Dill, Drexler et al. - 1992
10: Better verification through symmetry - Ip, Dill - 1996
9: Reliable hashing without collision detection - Wolper, Leroy - 1993
BibTeX entry: (Update)
C. Norris Ip and David L. Dill. Efficient verification of symmetric concurrent systems. IEEE International Conference on Computer Design: VLSI in Computers and Processors, pages 230--234, October 1993. http://citeseer.ist.psu.edu/ip93efficient.html More
@inproceedings{ ip93efficient,
author = "C. Norris Ip and David L. Dill",
title = "Efficient Verification of Symmetric Concurrent Systems",
booktitle = "International Conference on Computer Design",
pages = "230-234",
year = "1993",
url = "citeseer.ist.psu.edu/ip93efficient.html" }
Citations (may not include all citations):779 Symbolic Model Checking: 10 20 States and Beyond - Burch, Clarke et al. - 1990
478 The Stanford DASH Multiprocessor (context) - Lenoski, Laudon et al. - 1992
357 The Directory-based Cache Coherence Protocol for the DASH Mu.. (context) - Lenoski, Laudon et al. - 1990
239 Algorithms for Scalable Synchronization on Sharedmemory Mult.. (context) - Mellor-Crummey, Scott - 1991
173 Protocol Verification as a Hardware Design Aid - Dill, Drexler et al. - 1992
115 Exploiting Symmetry In Temporal Logic Model Checking (context) - Clarke, Filkorn et al. - 1993
108 Verification of Synchronous Sequential Machines Based on Sym.. (context) - Coudert, Berthet et al. - 1989
79 Myths About the Mutual Exclusion Problem (context) - Peterson - 1981
49 Protocol Verification Using Reachability Analysis: The State.. (context) - Lin, Chu et al. - 1988
30 Reachability Analysis of Petri Nets Using Symmetries (context) - Starke - 1991
21 Towards Reachability Trees for Highlevel Petri Nets (context) - Huber, Jensen et al. - 1984
7 on Computer Hardware Description Languages and Their Applica.. (context) - Ip, Dill et al. - 1993
6 Automated Protocol Verification (context) - Billing, Wilbur-Ham et al. - 1986
5 Computer Science Press (context) - Holzmann, Validation et al. - 1987
4 Expressing Interesting Properties of Programs (context) - Wolper - 1986
2 Conjunctive Partitioned Invariants for Efficient Verificatio.. (context) - Hu, Dill - 1993
1 Workshop on Computer-Aided Verification (context) - Emerson, Model et al. - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://sprout.stanford.edu/ip/publications.html): More
An online presentation of the work in the paper titled "State.. - Ip (1996) (Correct)
State Reduction Using Reversible Rules - Ip, Dill (1996) (Correct)
State Reduction Methods For Automatic Formal Verification - Ip (1996) (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