Directed Explicit Model Checking with HSF-SPIN

Cite This

Files in this item

Checksum: MD5:016337342ae1875e221574e0e348f634

EDELKAMP, Stefan, Alberto LLUCH-LAFUENTE, Stefan LEUE, 2001. Directed Explicit Model Checking with HSF-SPIN

@techreport{Edelkamp2001Direc-5578, series={Technical Report Institute for Computer Science, Albert-Ludwigs-University Freiburg;161}, title={Directed Explicit Model Checking with HSF-SPIN}, year={2001}, author={Edelkamp, Stefan and Lluch-Lafuente, Alberto and Leue, Stefan} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dcterms:isPartOf rdf:resource=""/> <dc:date rdf:datatype="">2011-03-24T15:56:34Z</dc:date> <dc:creator>Leue, Stefan</dc:creator> <dcterms:available rdf:datatype="">2011-03-24T15:56:34Z</dcterms:available> <dc:contributor>Lluch-Lafuente, Alberto</dc:contributor> <dc:contributor>Leue, Stefan</dc:contributor> <dspace:isPartOfCollection rdf:resource=""/> <dc:rights>terms-of-use</dc:rights> <dc:format>application/pdf</dc:format> <dc:creator>Edelkamp, Stefan</dc:creator> <dcterms:issued>2001</dcterms:issued> <dc:creator>Lluch-Lafuente, Alberto</dc:creator> <dc:language>eng</dc:language> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:hasPart rdf:resource=""/> <dcterms:rights rdf:resource=""/> <dspace:hasBitstream rdf:resource=""/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:contributor>Edelkamp, Stefan</dc:contributor> <dcterms:abstract xml:lang="eng">We present the explicit state model checker HSF-SPIN which is based on the model checker SPIN and its Promela modeling language. HSF-SPIN incorporates directed search algorithms for checking safety and a large class of LTL-specified liveness properties. We start off from the A* algorithm and define heuristics to accelerate the search into the direction of a specified failure situation. Next we propose an improved nested depth-first search algorithm that exploits the structure of Promela Never-Claims. As a result of both improvements, counterexamples will be shorter and the explored part of the state space will be smaller than with classical approaches, allowing to analyze larger state spaces. We evaluate the impact of the new heuristics and algorithms on a set of protocol models, some of which are real-world industrial protocols.</dcterms:abstract> <dcterms:title>Directed Explicit Model Checking with HSF-SPIN</dcterms:title> <bibo:uri rdf:resource=""/> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

Directed_Explicit_Model_Checking_with_HSF_SPIN.pdf 257

This item appears in the following Collection(s)

terms-of-use Except where otherwise noted, this item's license is described as terms-of-use

Search KOPS


My Account