Publikation: Directed explicit model checking with HSF-SPIN
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
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.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
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, 2001, pp. 57-79. Lecture Notes in Computer Science. 2057. ISBN 978-3-540-42124-5. Available under: doi: 10.1007/3-540-45139-0_5BibTex
@inproceedings{Edelkamp2001-05-02Direc-21301, year={2001}, doi={10.1007/3-540-45139-0_5}, title={Directed explicit model checking with HSF-SPIN}, number={2057}, isbn={978-3-540-42124-5}, publisher={Springer Berlin Heidelberg}, address={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:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/21301"> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/21301"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-01-31T08:47:28Z</dc:date> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:creator>Edelkamp, Stefan</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:issued>2001-05-02</dcterms:issued> <dc:language>eng</dc:language> <dc:contributor>Edelkamp, Stefan</dc:contributor> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-01-31T08:47:28Z</dcterms:available> <dc:creator>Leue, Stefan</dc:creator> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <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> <dc:contributor>Lafuente, Alberto Lluch</dc:contributor> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:contributor>Leue, Stefan</dc:contributor> <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:rights>terms-of-use</dc:rights> <dc:creator>Lafuente, Alberto Lluch</dc:creator> </rdf:Description> </rdf:RDF>