Gerard J. Holzmann  Home/Search
Context Related
| netlib.org/spin/ws97/gerard.ps.Z belllabs.com/who/gerard/spin97.ps.Z belllabs.com/cm/cs/who/...spin97.ps.gz 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: netlib.org (more) From: belllabs.com/who/gerard/abs (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The verification algorithm of SPIN is based on an explicit enumeration of a subset of the reachable state-space of a system that is obtained through the formalization of a correctness requirement as an w-automaton. This w-automaton restricts the state-space to precisely the subset that may contain the counter-examples to the original correctness requirement, if they exist. This method of verification conforms to the method for automata-theoretic verification outlined in [VW86]. SPIN derives... (Update)
Cited by: More
Typical Structural Properties of State Spaces - Pelánek (Correct)
Model-checking Middleware-based Event-driven.. - Deng, Dwyer.. (2003) (Correct)
Verification of the WAP Transaction Layer - Using The Model (Correct)
Active bibliography (related documents): More All
0.2: Directed Search for the Verification of Communication Protocols - Lafuente (2003) (Correct)
0.2: A Study on Functional-Link Neural Units with Maximum Entropy.. - Fiori, Piazza (1998) (Correct)
0.2: The Cores of Random Hypergraphs with a Given Degree Sequence - Cooper (2003) (Correct)
Similar documents based on text: More All
0.2: A Minimized Automaton Representation of Reachable States - Holzmann, Puri (1999) (Correct)
0.2: On Nested Depth First Search - Holzmann, Peled, Yannakakis (1996) (Correct)
0.1: On Nested Depth First Search (Extended Abstract) - Holzmann, Peled, Yannakakis (1996) (Correct)
Related documents from co-citation: More All
9: IEEE Transactions on Software Engineering (context) - Holzmann, Checker - 1997
6: Formal methods: State of the art and future directions - Clarke, Wing - 1996
6: A Minimized Automaton Representation of Reachable States - Holzmann, Puri - 1997
BibTeX entry: (Update)
G.J. Holzmann, "State Compression in SPIN: Recursive Indexing and Compression Training Runs," Proc. Third SPIN Workshop, Twente Univ., R. Langerak, ed., The Netherlands, Apr. 1997. http://citeseer.ist.psu.edu/holzmann97state.html More
@inproceedings{ holzmann97state,
author = "Gerard J. Holzmann",
title = "State Compression in {SPIN}: {R}ecursive Indexing and Compression Training Runs",
booktitle = "Proc. of the 3th {I}nternational {SPIN} {W}orkshop",
year = "1997",
url = "citeseer.ist.psu.edu/holzmann97state.html" }
Citations (may not include all citations):2003 The Art of Computer Programming (context) - Knuth - 1973
603 Kluwer Academic Publishers (context) - McMillan, checking - 1993
434 An Automata-Theoretic Approach to Automatic Program Verifica.. (context) - Vardi, Wolper - 1986
206 The model checker SPIN - Holzmann - 1997
108 An improvement in formal verification - Holzmann, Peled - 1994
53 Coverage preserving reduction strategies for reachability an.. - Holzmann, Godefroid et al. - 1992
5 A family of perfect hashing methods (context) - Majewski, Wormald et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.netlib.org.html): More
Using PVM 3.0 to Run Grand Challenge Applications on.. - Dongarra, Geist.. (1992) (Correct)
Relative Perturbation Theory: (II) Eigenspace and Singular Subspace .. - Li (1996) (Correct)
Efficient Communication Operations in Reconfigurable.. - Desprez, Ferreira.. (1993) (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