Distributed LTL Model Checking with Hash Compaction

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F13%3A00065988" target="_blank" >RIV/00216224:14330/13:00065988 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.entcs.2013.07.006" target="_blank" >http://dx.doi.org/10.1016/j.entcs.2013.07.006</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.entcs.2013.07.006" target="_blank" >10.1016/j.entcs.2013.07.006</a>

Result language
angličtina
Original language name
Distributed LTL Model Checking with Hash Compaction
Original language description
We extend a distributed-memory explicit-state LTL model checking algorithm (OWCTY) with hash compaction. We provide a detailed description of the improved algorithm and a correctness argument in the theoretical part of the paper. Additionally, we deliveran implementation of the algorithm as part of out parallel and distributed-memory model checker DiVinE, and use this implementation for a practical evaluation of the approach, on which we report in the experimental part of the paper.
Czech name
—
Czech description
—

Project
<a href="/en/project/GAP202%2F11%2F0312" target="_blank" >GAP202/11/0312: Software Components in Embedded Systems: Development and Verification</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Electronic Notes in Theoretical Computer Science, Volume 296
ISBN
—
ISSN
1571-0661
e-ISSN
—
Number of pages
15
Pages from-to
79-93
Publisher name
Elsevier Science
Place of publication
Neuveden
Event location
Neuveden
Event date
Jan 1, 2013
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—

Similar results(10)