Logo eprints

Protocol verification with heuristic search

Edelkamp, Stefan and Lluch-Lafuente, Alberto and Leue, Stefan Protocol verification with heuristic search. In: AAAI Spring Symposium on Model-Based Validation of Intelligence, March 26-28, 2001, Stanford University (Submitted) (2001)

PDF - Accepted Version
Download (263kB) | Preview
Related URLs


We present an approach to reconcile explicit state model checking and heuristic directed search and 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.

Item Type: Conference or Workshop Item (Paper)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Research Area: Computer Science and Applications
Depositing User: Users 30 not found.
Date Deposited: 22 Nov 2011 12:19
Last Modified: 20 Dec 2011 12:00
URI: http://eprints.imtlucca.it/id/eprint/1016

Actions (login required)

Edit Item Edit Item