C. Norris Ip, David L. Dill  Home/Search
Context Related
Links: ACM DBLP | stanford.edu/ip/symj.ps.gz stanford.edu/PAPERS/ID96B.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/dill/murphi (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A fundamental difficulty in automatic formal verification of finite-state systems is the state explosion problem -- even relatively simple systems can produce very large state spaces, causing great difficulties for methods that rely on explicit state enumeration. We address the problem by exploiting structural symmetries in the description of the system to be verified. We make symmetries easy to detect by introducing a new data type scalarset, a finite and unordered set, to our description... (Update)
Cited by: More
Submitted to the Department of Electrical Engineering and.. - Science In Partial (Correct)
Formal Methods in System Design, 20, 159--186, 2002 c - Verification Of Out-Of-Order (Correct)
AbstractBDDs: - Technique For Using (Correct)
Similar documents (at the sentence level):
36.0%: State Reduction Methods For Automatic Formal Verification - Ip (1996) (Correct)
Active bibliography (related documents): More All
0.7: Efficient Verification of Symmetric Concurrent Systems - Ip, Dill (1993) (Correct)
0.4: Better Verification Through Symmetry - Ip, Dill (1993) (Correct)
0.3: Verifying Systems with Replicated Components in Murφ - Ip, Dill (1997) (Correct)
Similar documents based on text: More All
0.6: State Reduction Using Reversible Rules - Ip, Dill (1996) (Correct)
0.1: Symmetric Spin - Bosnacki, Dams, Holenderski (2000) (Correct)
0.1: Structural Symmetries and Model Checking - Manku, Hojati, Brayton (1998) (Correct)
Related documents from co-citation: More All
33: Exploiting Symmetry in Temporal Logic Model Checking (context) - Clarke, Filkorn et al. - 1993
28: Symmetry and Model Checking - Emerson, Jutla - 1993
24: Protocol verification as a hardware design aid - Dill, Drexler et al. - 1992
BibTeX entry: (Update)
C. Norris Ip and David L. Dill. Better verification through symmetry. Formal Methods in System Design, 9(1/2):41--75, August 1996. http://citeseer.ist.psu.edu/ip96better.html More
@inproceedings{ ip93better,
author = "{C.N. Ip} and {D.L. Dill}",
title = "Better Verification Through Symmetry",
booktitle = "Computer Hardware Description Languages and their Applications",
publisher = "Elsevier Science Publishers B.V., Amsterdam, Netherland",
address = "Ottawa, Canada",
editor = "{D. Agnew} and {L. Claesen} and {R. Camposano}",
pages = "87--100",
year = "1993",
url = "citeseer.ist.psu.edu/ip96better.html" }
Citations (may not include all citations):1097 Automatic Verification of Finite-State Concurrent Systems Us.. (context) - Clarke, Emerson et al. - 1986 ACM DBLP
779 Symbolic Model Checking: 10 20 States and Beyond - Burch, Clarke et al. - 1990
716 Parallel Program Design --- a Foundation (context) - Chandy, Misra - 1988
478 The Stanford DASH Multiprocessor (context) - Lenoski, Laudon et al. - 1992 ACM DBLP
357 The Directory-based Cache Coherence Protocol for the DASH Mu.. (context) - Lenoski, Laudon et al. - 1990 ACM DBLP
239 Algorithms for Scalable Synchronization on Shared-memory Mul.. (context) - Mellor-Crummey, Scott - 1991 ACM DBLP
173 Protocol Verification as a Hardware Design Aid - Dill, Drexler et al. - 1992 ACM DBLP
115 Exploiting Symmetry In Temporal Logic Model Checking (context) - Clarke, Filkorn et al. - 1993 ACM DBLP
108 Verification of Synchronous Sequential Machines Based on Sym.. (context) - Coudert, Berthet et al. - 1989 ACM DBLP
106 Implicit State Enumeration of Finite State Machines Using BD.. (context) - Touati, Savoj et al. - 1990 DBLP
79 Myths About the Mutual Exclusion Problem (context) - Peterson - 1981 DBLP
77 Symmetry and Model Checking - Emerson, Sistla - 1993 ACM DBLP
30 Reachability Analysis of Petri Nets Using Symmetries (context) - Starke - 1991 ACM
22 Efficient Verification of Symmetric Concurrent Systems - Ip, Dill - 1993 DBLP
21 Towards Reachability Trees for High-level Petri Nets (context) - Huber, Jensen et al. - 1984 ACM DBLP
19 An Approach to Automating the Verification of Compact Parall.. (context) - Lubachevsky - 1984
14 A Calculus for Protocol Specification and Validation (context) - Aggarwal, Kurshan et al. - 1983 DBLP
14 IEEE Transactions on Communications (context) - Zafiropulo, West et al. - 1980
7 on Computer Hardware Description Languages and Their Applica.. (context) - Ip, Dill et al. - 1993
5 GeminiII: A Second Generation Layout Validation Program (context) - Ebeling - 1988
5 Computer Science Press (context) - Holzmann, Validation et al. - 1987
4 Expressing Interesting Properties of Programs (context) - Wolper - 1986
3 A Fast Backtrack Algorithm for Graph Isomorphism (context) - Mittal - 1988 ACM DBLP
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)
Efficient Verification of Symmetric Concurrent Systems - Ip, Dill (1993) (Correct)
State Reduction Using Reversible Rules - Ip, Dill (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