On the Application of Formal Methods for Specifying and Verifying Distributed Protocols

Gelastou, M.; Georgiou, Chryssis; Philippou, Anna

doi:10.1109/nca.2008.24

Cited by 4 publications

(8 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1. In addition, a number of formal methods approaches to MANET analysis also consider the stationary (mobility) model, in which the nodes do not move at all (see, e.g., [8,13,31,28]). Note that the random direction model can be regarded as a special case of the random waypoint model (where the set of possible next destinations are restricted to points on the area boundary).…”

Section: Models Of Node Mobilitymentioning

confidence: 99%

See 1 more Smart Citation

Modeling and analyzing mobile ad hoc networks in Real-Time Maude

Liu

Ölveczky

Meseguer

2016

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

Modeling and analyzing mobile ad hoc networks (MANETs) pose non-trivial challenges to formal methods. Time, geometry, communication delays and failures, mobility, and uni-and bidirectional wireless communication can interact in unforeseen ways that are hard to model and analyze by current process calculi and automatic formal methods. As a consequence, current analyses tend to abstract away these physical aspects, so thatalthough still quite useful in finding various errors-their simplifying assumptions can easily fail to model details of MANET behavior relevant to meet desired requirements. In this work we present a formal framework for the modeling and analysis of MANETS based on Real-Time Maude to address this challenge. Specifically, we show that our framework has good expressive power to model relevant aspects of MANETs, and good compositionality properties, so that a MANET protocol can be easily composed with various models of mobility and with other MANET protocols. We illustrate the use of our framework on two well-known MANET benchmarks: the AODV routing protocol and the leader election protocol of Vasudevan, Kurose, and Towsley. Our formal analysis has uncovered a spurious behavior in the latter protocol that is due to the subtle interplay between communication delays, node movement, and neighbor discovery. This behavior therefore cannot be found by analyses that abstract from node movement and communication delays.

show abstract

Section: Models Of Node Mobilitymentioning

confidence: 99%

“…Although many papers (e.g., [47,13,43,16,42,21,44,45,28,14]) have studied LE, it seems that very little is known by way of formal analysis about how it behaves with unidirectional connections and under realistic mobility scenarios. We analyze LE under four different settings:…”

Section: Formal Analysis Of Lementioning

confidence: 99%

Modeling and analyzing mobile ad hoc networks in Real-Time Maude

Liu

Ölveczky

Meseguer

2016

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

show abstract

“…We consider both static and dynamic topologies, and also analyze a system with two connected components that repeatedly merge and partition because of node movement. Although many papers (e.g., [32,7,27,9,26,12,28,29,16,8]) have studied LE, little is known by way of formal analysis about how it behaves with unidirectional connections or under realistic mobility scenarios. We are also not aware of any study taking into account the joint effects of communication delay and mobility.…”

Section: Formal Analysis Of the Le Protocolmentioning

confidence: 99%

“…Gelastou et al [7] specify and verify LE using both I/O automata and process algebra. They only consider static bidirectional topologies with non-lossy channels, and communication delay is not taken into consideration.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Formal Analysis of Leader Election in MANETs Using Real-Time Maude

Liu

Ölveczky

Meseguer

2015

Software, Services, and Systems

View full text Add to dashboard Cite

Abstract. The modeling and analysis of mobile ad hoc networks (MANETs) pose non-trivial challenges to formal methods. Time, geometry, communication delays and failures, mobility, and uni-and bidirectionality can interact in unforeseen ways that are hard to model and analyze by automatic formal methods. In this work we use rewriting logic and RealTime Maude to address this challenge. We propose a composable formal framework for MANET protocols and their mobility models that can take into account such complex interactions. We illustrate our framework by analyzing a well-studied leader election protocol for MANETs in the presence of both mobility and uni-and bidirectional links.

show abstract

“…The work in [31] presents a semantic-based comparison of the two frameworks; the work in [32] evaluates and compares the applicability and usability of a value-passing version of CCS with I/O automata on specifying and verifying distributed algorithms. Cleaveland et al have developed a series of tools based on the CCS process algebra.…”

Section: Related Workmentioning

confidence: 99%

Automated implementation of complex distributed algorithms specified in the IOA language

Georgiou

Lynch²,

Mavrommatis

et al. 2009

Int J Softw Tools Technol Transfer

Self Cite

View full text Add to dashboard Cite

IOA is a formal language for describing Input/Output automata that serves both as a formal specification language and as a programming language (Garland et al. in http://theory.lcs.mit.edu/tds/ioa/manual.ps, 2004). The IOA compiler automatically translates IOA specifications into Java code that runs on a set of workstations communicating via the Message Passing Interface. This paper describes the process of compiling IOA specifications and our experiences running several distributed algorithms, ranging from simple ones such as the Le Lann, Chang and Roberts (LCR) leader election in a ring algorithm to that of Gallager, Humblet and Spira (GHS) for minimum-weight spanning tree formation in an arbitrary graph ( rithms is significant for two reasons: (a) it is an indication of the capabilities of the IOA compiler and of its advanced state of development, and (b) to the best of our knowledge, these are the first complex, distributed algorithms implemented in an automated way that have been formally and rigorously proved correct. Thus, this work shows that it is possible to formally specify, prove correct, and implement complex distributed algorithms using a common formal methodology.

show abstract

On the Application of Formal Methods for Specifying and Verifying Distributed Protocols

Cited by 4 publications

References 16 publications

Modeling and analyzing mobile ad hoc networks in Real-Time Maude

Modeling and analyzing mobile ad hoc networks in Real-Time Maude

Formal Analysis of Leader Election in MANETs Using Real-Time Maude

Automated implementation of complex distributed algorithms specified in the IOA language

Contact Info

Product

Resources

About