Protocol Verification with Heuristic Search

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:1d9d6c23154a10f1d1eaf53319a8f329

EDELKAMP, Stefan, Alberto LLUCH-LAFUENTE, Stefan LEUE, 2001. Protocol Verification with Heuristic Search. AAAI. Stanford, California, 26. Mrz 2001 - 28. Mrz 2001. In: Model-based validation of intelligence : papers from the 2001 AAAI symposium ; March 26 - 28, Stanford, California, 2001. AAAI. Stanford, California, 26. Mrz 2001 - 28. Mrz 2001

@inproceedings{Edelkamp2001Proto-5531, title={Protocol Verification with Heuristic Search}, year={2001}, booktitle={Model-based validation of intelligence : papers from the 2001 AAAI symposium ; March 26 - 28, Stanford, California, 2001}, author={Edelkamp, Stefan and Lluch-Lafuente, Alberto and Leue, Stefan} }

<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/5531"> <dc:format>application/pdf</dc:format> <dc:creator>Edelkamp, Stefan</dc:creator> <dc:contributor>Leue, Stefan</dc:contributor> <dcterms:issued>2001</dcterms:issued> <dc:creator>Leue, Stefan</dc:creator> <dc:contributor>Edelkamp, Stefan</dc:contributor> <dc:creator>Lluch-Lafuente, Alberto</dc:creator> <dcterms:abstract xml:lang="eng">We present an approach to reconcile explicit state model checking and heuristic directed search. We provide experimental evidence that the model checking problem for concurrent systems, such as communications protocols, can be solved more efficiently, since finding a state violating a property can be understood as a directed search problem. In our work we combine the expressive power and implementation efficiency of the SPIN model checker with the HSF heuristic search workbench, yielding the HSF-SPIN tool that we have implemented. We start off from the A* algorithm and some of its derivatives and define heuristics for various system properties that guide the search so that it finds error states faster. In this paper we focus on safety properties and provide heuristics for invariant and assertion violation and deadlock detection. We provide experimental results for applying HSF-SPIN to two toy protocols and one real world protocol, the CORBA GIOP protocol.</dcterms:abstract> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:56:15Z</dc:date> <dc:contributor>Lluch-Lafuente, Alberto</dc:contributor> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dc:language>eng</dc:language> <dc:rights>deposit-license</dc:rights> <dcterms:title>Protocol Verification with Heuristic Search</dcterms:title> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:56:15Z</dcterms:available> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5531"/> <dcterms:bibliographicCitation>First publ. in: Model-based validation of intelligence : papers from the 2001 AAAI symposium ; March 26 - 28, Stanford, California, 2001</dcterms:bibliographicCitation> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Protocol_Verification_with_Heuristic_Search.pdf 133

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto