A comparison of three model checkers applied to a distributed database problem

Authors:
Andrew J Currie
Affiliations:
Department of Electronics and Computer Science, University of Southampton, UK
Venue:
IW-FM'00 Proceedings of the 4th Irish conference on Formal Methods
Year:
2000

Citing 7
Cited 0

Communicating sequential processes

Communicating sequential processes
Design and validation of computer protocols

Design and validation of computer protocols
Model-checking CSP

A classical mind
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
A Discipline of Programming

A Discipline of Programming
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
Protocol Verification as a Hardware Design Aid

ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors

Quantified Score

Hi-index	0.00

Visualization

Abstract

Increasingly model checking is being applied to more abstract problem domains than the traditional protocol analysis. The extent to which such an approach is able to provide useful insight into the problem domain depends to a large degree on the nature of the tool used. This paper reports the results of a study using three different model checkers which differ widely in their specification language internal implementation and facilities for specifying correctness properties. An abstract model of an industrial distributed database application has been studied using the three tools. A detailed model of the application using each of the tools is presented and the extent to which each tool allows us to investigate interesting properties of the problem domain is compared. Some conclusions are drawn regarding the usefulness of model checking at an abstract level and the importance of selecting a tool appropriate to the nature of the problem.