(Enter summary)
Abstract: The main limiting factor of the model checker SPIN is currently the amount of available physical memory. This paper explores the possibility of exploiting a distributed-memory execution environment, such as a network of workstations interconnected by a standard LAN, to extend the size of the veri cation problems that can be successfully handled by SPIN. A distributed version of the algorithm used by SPIN to verify safety properties is presented, and its compatibility with the main memory and... (Update)
Cited by: More
Parallel External Directed Model Checking with Linear I/O - Jabbar, Edelkamp (2006)
(Correct)
Directed Search for the Verification of Communication Protocols - Lafuente (2003)
(Correct)
LTL Model Checking - Pelánek (2003)
(Correct)
Active bibliography (related documents): More All
0.1: Automated Parallelization of Discrete State-space Generation - Nicol, Ciardo (1997)
(Correct)
0.1: Unresponsiveness-Tolerant Collective Communication - Pakin
(Correct)
0.1: Exploiting Temporal Uncertainty in Parallel and Distributed.. - Fujimoto (1999)
(Correct)
Similar documents based on text: More All
0.5: Using Process Algebras to Formally Specify Mobile Agent.. - Hannotin, Maggi, Sisto (2001)
(Correct)
0.5: SCARAB: Innovative Services Supporting User and Terminal.. - Ciminiera, Maggi
(Correct)
0.5: A Configurable Mobile Agent Data Protection Protocol - Maggi, Sisto
(Correct)
Related documents from co-citation: More All
23: Distributed LTL model-checking in SPIN
- Barnat, Brim et al. - 2000
15: Model Checking
- Clarke, Grumberg et al. - 1994
12: Achieving scalability in parallel reachability analysis of very large circuits
- Heyman, Geist et al. - 2000
BibTeX entry: (Update)
F. Lerda and R. Sisto. Distributed-memory model checking with spin. In SPIN workshop, number 1680 in LNCS, Berlin, 1999. Springer. http://citeseer.ist.psu.edu/lerda99distributedmemory.html More
@inproceedings{ lerda99distributed,
author = { Flavio Lerda and Riccardo Sisto },
title = { Distributed-memory Model Checking with {SPIN} },
volume = 1680,
year = 1999,
publisher = { Springer-Verlag },
series = { LNCS },
booktitle = { Proc. of the 5th {I}nternational {SPIN} Workshop },
url = {citeseer.ist.psu.edu/lerda99distributedmemory.html} }
Citations (may not include all citations):
206
The model checker spin
- Holzmann - 1997 ACM DBLP
53
Coverage preserving reduction strategies for reachability an..
- Holzmann, Godefroid et al. - 1992 ACM DBLP
15
Distributed reachability analysis for protocol verication en.. (context) - Aggarwal, Alonso et al. - 1987
15
An improvement in formal verication (context) - Holzmann, Peled - 1994
7
Noncommittal barrier synchronization
- Nicol - 1995 ACM DBLP
1
The murphi verication system (context) - Dill - 1996
1
An overview of the PVM software system (context) - Greeneld - 1995
1
Parallelizing the murphi verier (context) - Stern, Dill - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://netlib.bell-labs.com/netlib/spin/ws99a/program99.html): More
Runtime Efficient State Compaction in SPIN - Geldenhuys, de Villiers (1999)
(Correct)
Partial Order Reduction in Presence of Rendez-vous.. - Bosnacki (1999)
(Correct)
Correctness of the Promela models of Manifold programs, I - Fagot, Scutella (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