Verification of Ad Hoc Networks with Node and Communication Failures

Delzanno, Giorgio; Sangnier, Arnaud; Zavattaro, Gianluigi

doi:10.1007/978-3-642-30793-5_15

Cited by 25 publications

(20 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similar in spirit are Gts based models for ad-hoc broadcasting networks, e.g. in [DSZ12], which target complex dynamic topologies of the participating distributed processes but only provide high-level abstractions of the participating processes (e.g. by state machines).…”

Section: Related Workmentioning

confidence: 99%

A semantics comparison workbench for a concurrent, asynchronous, distributed programming language

2018

View full text Add to dashboard Cite

Abstract. A number of high-level languages and libraries have been proposed that offer novel and simple to use abstractions for concurrent, asynchronous, and distributed programming. The execution models that realise them, however, often change over time-whether to improve performance, or to extend them to new language features-potentially affecting behavioural and safety properties of existing programs. This is exemplified by Scoop, a message-passing approach to concurrent object-oriented programming that has seen multiple changes proposed and implemented, with demonstrable consequences for an idiomatic usage of its core abstraction. We propose a semantics comparison workbench for Scoop with fully and semiautomatic tools for analysing and comparing the state spaces of programs with respect to different execution models or semantics. We demonstrate its use in checking the consistency of properties across semantics by applying it to a set of representative programs, and highlighting a deadlock-related discrepancy between the principal execution models of Scoop. Furthermore, we demonstrate the extensibility of the workbench by generalising the formalisation of an execution model to support recently proposed extensions for distributed programming. Our workbench is based on a modular and parameterisable graph transformation semantics implemented in the Groove tool. We discuss how graph transformations are leveraged to atomically model intricate language abstractions, how the visual yet algebraic nature of the model can be used to ascertain soundness, and highlight how the approach could be applied to similar languages.

show abstract

Section: Related Workmentioning

confidence: 99%

A semantics comparison workbench for a concurrent, asynchronous, distributed programming language

2018

View full text Add to dashboard Cite

show abstract

“…Static topology with intermittent nodes, i.e., a topology in which there are no reconfigurations but nodes can crash and restart in the same control state in which it crashed. [12] 2. Static topology with message loss, i.e., a topology in which there are no reconfigurations but messages may get lost arbitrarily.…”

Section: Lemma 11 If S Is Reachable In the Reconfigurable Broadcast mentioning

confidence: 99%

Parameterized Verification of Coverability in Well-Structured Broadcast Networks

Balasubramanian

2018

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Parameterized verification of coverability in broadcast networks with finite state processes has been studied for different types of models and topologies. In this paper, we attempt to develop a theory of broadcast networks in which the processes can be well-structured transition systems. The resulting formalism is called well-structured broadcast networks. We give an algorithm to decide coverability of well-structured broadcast networks when reconfiguration of links between nodes is allowed. Further, for various types of communication topologies, we also prove the decidability of coverability in the static case as well. We do this by showing that for these types of static communication topologies, the broadcast network itself is a well-structured transition system, hence proving the decidability of coverability in the broadcast network.

show abstract

“…Noisy channels are modeled in π-calculus through probabilistic semantics [38,13]. A recent work [18] investigates decidability of control state reachability for ad-hoc networks in the presence of different types of node and communication failures.…”

Section: Related Workmentioning

confidence: 99%

Transducer-Based Algorithmic Verification of Retransmission Protocols over Noisy Channels

Thakkar

Kanade

Alur

2013

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

Abstract. Unreliable communication channels are a practical reality. They add to the complexity of protocol design and verification. In this paper, we consider noisy channels which can corrupt messages. We present an approach to model and verify protocols which combine error detection and error control to provide reliable communication over noisy channels. We call these protocols retransmission protocols as they achieve reliable communication through repeated retransmissions of messages. These protocols typically use cyclic redundancy checks and sliding window protocols for error detection and control respectively. We propose models of these protocols as regular transducers operating on bit strings. Streaming string transducers provide a natural way of modeling these protocols and formalizing correctness requirements. The verification problem is posed as functional equivalence between the protocol transducer and the specification transducer. Functional equivalence checking is decidable for this class of transducers and this makes the transducer models amenable to algorithmic verification. We present case studies based on TinyOS serial communication and the HDLC retransmission protocol.

show abstract

Verification of Ad Hoc Networks with Node and Communication Failures

Cited by 25 publications

References 20 publications

A semantics comparison workbench for a concurrent, asynchronous, distributed programming language

A semantics comparison workbench for a concurrent, asynchronous, distributed programming language

Parameterized Verification of Coverability in Well-Structured Broadcast Networks

Transducer-Based Algorithmic Verification of Retransmission Protocols over Noisy Channels

Contact Info

Product

Resources

About