Language-Oriented Formal Analysis: a Case Study on Protocols and Distributed Systems

Authors:
Carlos Bazilio;Edward Hermann Haeusler;Markus Endler
Affiliations:
Departamento de Informática, PUC-Rio, Rio de Janeiro, Brazil;Departamento de Informática, PUC-Rio, Rio de Janeiro, Brazil;Departamento de Informática, PUC-Rio, Rio de Janeiro, Brazil
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 6
Cited 0

A calculus of mobile processes, I

Information and Computation
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Scientific rigour, an answer to a pragmatic question: a linguistic framework for software engineering

ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Communication and Concurrency

Communication and Concurrency
IF-2.0: A Validation Environment for Component-Based Real-Time Systems

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Correct implementation of network protocols

Correct implementation of network protocols

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main motivation of this paper is to describe an architecture that intends to ease the verification of distributed algorithms and protocols (possibly mobile) through model checking. The core of the architecture is the protocol specification language (LEP), which has constructions, called pronouns, that allows for high-level specification. This means a much less verbose specification, when compared with the general-purpose specification language of the model checker used in our experiments. Through a two-step process, LEP specifications are translated into the language of a model checker and the result is translated back to LEP. A formal communication model is used in the translation process in order to allow the use of different model checkers. Currently the prototype of the architecture uses the model checkers Spin and SMV.