Directed explicit model checking with HSF-SPIN

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

EDELKAMP, Stefan, Alberto Lluch LAFUENTE, Stefan LEUE, 2001. Directed explicit model checking with HSF-SPIN. In: DWYER, Matthew, ed.. Model Checking Software. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 57-79. ISBN 978-3-540-42124-5. Available under: doi: 10.1007/3-540-45139-0_5

@inproceedings{Edelkamp2001-05-02Direc-21301, title={Directed explicit model checking with HSF-SPIN}, year={2001}, doi={10.1007/3-540-45139-0_5}, number={2057}, isbn={978-3-540-42124-5}, address={Berlin, Heidelberg}, publisher={Springer Berlin Heidelberg}, series={Lecture Notes in Computer Science}, booktitle={Model Checking Software}, pages={57--79}, editor={Dwyer, Matthew}, author={Edelkamp, Stefan and Lafuente, Alberto Lluch 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:bibliographicCitation>Model checking software : 8th International SPIN Workshop, Toronto, Canada, May 19 - 20, 2001; proceedings / Matthew Dwyer (ed.). - Berlin [u.a.] : Springer, 2001. - S. 57-79. - (Lecture notes in computer science ; 2057). - ISBN 3-540-42124-6</dcterms:bibliographicCitation> <dc:contributor>Lafuente, Alberto Lluch</dc:contributor> <bibo:uri rdf:resource=""/> <dc:language>eng</dc:language> <dspace:isPartOfCollection rdf:resource=""/> <dc:creator>Leue, Stefan</dc:creator> <dc:rights>terms-of-use</dc:rights> <dc:contributor>Edelkamp, Stefan</dc:contributor> <dc:date rdf:datatype="">2013-01-31T08:47:28Z</dc:date> <dcterms:issued>2001-05-02</dcterms:issued> <dc:creator>Edelkamp, Stefan</dc:creator> <dcterms:isPartOf rdf:resource=""/> <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:available rdf:datatype="">2013-01-31T08:47:28Z</dcterms:available> <dcterms:rights rdf:resource=""/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:contributor>Leue, Stefan</dc:contributor> <dc:creator>Lafuente, Alberto Lluch</dc:creator> <dcterms:title>Directed explicit model checking with HSF-SPIN</dcterms:title> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


My Account