Model Checking: One Can Do Much More Than You Think!

Katoen, Joost-Pieter

doi:10.1007/978-3-642-29320-7_1

Cited by 4 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The idea of using counters and counter abstraction in model checking was first introduced in [ET99]. However, the term of counter abstraction was first presented in [PXZ02] for the verification of parameterized systems and further used in different studies such as [BMWK09,Kat11].…”

Section: Counter Abstractionmentioning

confidence: 99%

Modeling and efficient verification of wireless ad hoc networks

2017

View full text Add to dashboard Cite

Abstract. Wireless ad hoc networks, in particular mobile ad hoc networks (MANETs), are growing very fast as they make communication easier and more available. However, their protocols tend to be difficult to design due to topology dependent behavior of wireless communication, and their distributed and adaptive operations to topology dynamism. Therefore, it is desirable to have them modeled and verified using formal methods. In this paper, we present an actor-based modeling language with the aim to model MANETs. We address main challenges of modeling wireless ad hoc networks such as local broadcast, underlying topology, and its changes, and discuss how they can be efficiently modeled at the semantic level to make their verification amenable. The new framework abstracts the data link layer services by providing asynchronous (local) broadcast and unicast communication, while message delivery is in order and is guaranteed for connected receivers. We illustrate the applicability of our framework through two routing protocols, namely flooding and AODVv2-11, and show how efficiently their state spaces can be reduced by the proposed techniques. Furthermore, we demonstrate a loop formation scenario in AODV, found by our analysis tool.

show abstract

Section: Counter Abstractionmentioning

confidence: 99%

Modeling and efficient verification of wireless ad hoc networks

2017

View full text Add to dashboard Cite

show abstract

“…Extension -The relation allows for behavioural extension. and theorem proving, such as the B method (Abrial, 1996(Abrial, , 2010, and model checking techniques (Baier and Katoen, 2008;Katoen, 2012). The pragmatical motivations comes from experiences with interactive programming languages, such as the CAML functional language (Bertot and Castéran, 2004;Sagonas, 2013) and also by practical Agile approaches (Ambler, 2008) which enable extensions.…”

Section: Incremental Development: Required Properties Of Idf Relationsmentioning

confidence: 99%

IDF: A framework for the incremental development and conformance verification of UML active primitive components

Lambolais¹,

Courbis²,

Luong³

et al. 2016

Journal of Systems and Software

View full text Add to dashboard Cite

Modelling component behaviour is widely recognised as a complex task during the specification and design phases of reactive systems. Our proposal for treating this problem involves an incremental approach that allows UML state machines to be built using a composition of two types of development: model extension for adding services or behaviours, and refinement for adding details or eliminating non-determinism. At each step of the development process, the current model is verified for compliance with the model obtained during the previous step, in such a way that initial liveness properties are preserved. The novelty of this work lies in the possibility to combine and sequence both refinement and extension developments. This iterative process is usually not taken into account in conventional refinement relations. This set of development techniques and verification means are assembled into a framework called IDF (Incremental Development Framework), which is supported by a tool, under the acronym IDCM (Incremental Development of Compliant Models), developed herein in addition to the Topcased UML tool.

show abstract

“…However, counters were saturated at a static value of c, meaning that c or more processes are at local state s. In [3], counter abstraction is used to achieve efficiency in BDDbased symbolic state space exploration of concurrent Boolean programs while unlike [24] it makes use of exact counters where in a global state only non-zero counters are stored. The idea of counting have also been used in [15] to record the local states of a biological system, in which each local state is represented as a vector of counters, each element denotes to the corresponding number of species.…”

Section: Leader Electionmentioning

confidence: 99%

Modeling and Efficient Verification of Broadcasting Actors

Yousefi

Ghassemi

Khosravi

2015

Fundamentals of Software Engineering

View full text Add to dashboard Cite

Many distributed systems use broadcast communication for various reasons such as saving energy or increasing throughput. However, the actor model for concurrent and distributed systems does not directly support this kind of communication. In such cases, a broadcast must be modeled as multiple unicasts which leads to loss of modularity and state space explosion for any non-trivial system. In this paper, we extend Rebeca, an actor-based model language, to support asynchronous anonymous message broadcasting. Then, we apply counter abstraction for reducing the state space which efficiently bypasses the constructive orbit problem by considering the global state as a vector of counters, one per each local state. This makes the model checking of systems possible without further considerations of symmetry. This approach is efficient for fully symmetric system like broadcasting environments. We use a couple of case studies to illustrate the applicability of our method and the way their state spaces are reduced in size.

show abstract

Model Checking: One Can Do Much More Than You Think!

Cited by 4 publications

References 19 publications

Modeling and efficient verification of wireless ad hoc networks

Modeling and efficient verification of wireless ad hoc networks

IDF: A framework for the incremental development and conformance verification of UML active primitive components

Modeling and Efficient Verification of Broadcasting Actors

Contact Info

Product

Resources

About