Context Aware Model-Checking for Embedded Software

Dhaussy, Philippe; Roger, Jean-Charles; Boniol, Frédéric

doi:10.5772/37975

Cited by 3 publications

(2 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed methodology adopts Colored Petri Nets with some extensions in rules, conditions, and algorithms for timely context-aware service. In [11] authors propose a prototype language CDL (Context Description Language) for formalizing contexts and properties. CDL permits contexts and non-ambiguous properties to be formalized and checked using simulation and model checking techniques.…”

Section: Related Workmentioning

confidence: 99%

Model Checking Pervasive Context-Aware Systems

Djoudi

Bouanaka

Zeghib

2014

2014 IEEE 23rd International WETICE Conference

View full text Add to dashboard Cite

Many approaches on context-aware systems specification have been proposed in the literature. However, the absence or poor representation of contextual information and its relationships with system entities in these approaches usually leads to low-precision and irrelevant results. The aim of this paper is to promote the ability to specify and verify contextaware systems. Our proposed modeling methodology exploits Maude reflection and meta-programming to define a domain specific language for context-aware systems specification and adopts Maude model checker to verify system inherent properties. Moreover, a runtime environment implementing the proposed model is developed for pervasive context-aware systems execution.

show abstract

Section: Related Workmentioning

confidence: 99%

Model Checking Pervasive Context-Aware Systems

Djoudi

Bouanaka

Zeghib

2014

2014 IEEE 23rd International WETICE Conference

View full text Add to dashboard Cite

show abstract

“…To address this issue, the CDL language offers support for property‐pattern specification, inspired by the pattern language introduced by Dwyer . The interested reader should refer to for more details on this aspect, which is beyond the scope of this paper.…”

Section: Past‐free[ze] In Practice: Integration With the Context‐awarmentioning

confidence: 99%

Past‐Free[ze] reachability analysis: reaching further with DAG‐directed exhaustive state‐space analysis

Teodorov

LeźRoux

Drey

et al. 2016

Software Testing Verif & Rel

Self Cite

View full text Add to dashboard Cite

International audienceModel-checking enables the automated formal verification of software systems through the explicit enumeration of all the reachable states. While this technique has been successfully applied to industrial systems, it suffers from the state-space explosion problem because of the exponential growth in the number of states with respect to the number of interacting components. In this paper, we present a new reachability analysis algorithm, named Past-Free[ze], that reduces the state-space explosion problem by freeing parts of the state-space from memory. This algorithm relies on the explicit isolation of the acyclic parts of the system before analysis. The parallel composition of these parts drives the reachability analysis, the core of all model-checkers. During the execution, the past states of the system are freed from memory making room for more future states. To enable counter-example construction, the past states can be stored on external storage. To show the effectiveness of the approach, the algorithm was implemented in the OBP Observation Engine and was evaluated both on a synthetic benchmark and on realistic case studies from automotive and aerospace domains. The benchmark, composed of 50 test cases, shows that in average, 75% of the state-space can be dropped from memory thus enabling the exploration of up to 14 times more states than traditional approaches. Moreover, in some cases, the reachability analysis time can be reduced by up to 25%. In realistic settings, the use of Past-Free[ze] enabled the exploration of a state-space 4.5 times larger on the automotive case study, where almost 50% of the states are freed from memory. Moreover, this approach offers the possibility of analyzing an arbitrary number of interactions between the environment and the system-under-verification; for instance, in the case of the aerospace example, 1000 pilot/system interactions could be analyzed unraveling an 80 GB state-space using only 10 GB of memor

show abstract

Environment-driven reachability for timed systems

Teodorov

Dhaussy

Roux

2015

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

International audienceWith an ever increasing complexity, the verification of critical embedded systems is a challenging and expensive task. Among the available formal methods, model checking offers a high level of automation and would thus lower the cost of this process. But, the scalability of this technique is hindered by the state-space explosion problem, which fuelled the research community since its inception. To address this challenge, in the case of real size systems, the theoretical, the methodological and the algorithmic axes have to be integrated. The context-aware verification (CaV) strives to do this by focusing on the identification, the isolation and the reification of the environment surrounding the studied system. It enables the use of specific algorithms with a major, positive, impact on the scalability of model checking. In this paper, we apply this technique to study a Landing Gear System (LGS) in the presence of failures. The problem has been decomposed in 885 independent verification units (called contexts). The analysis of 163 of these contexts on a 64 GB computer unraveled a 20 TB state space with more than 2.2 billion states. Moreover, using this approach arbitrarily long scenarios have been analysed using less than 10 GB of memory

show abstract

Context Aware Model-Checking for Embedded Software

Cited by 3 publications

References 24 publications

Model Checking Pervasive Context-Aware Systems

Model Checking Pervasive Context-Aware Systems

Past‐Free[ze] reachability analysis: reaching further with DAG‐directed exhaustive state‐space analysis

Environment-driven reachability for timed systems

Contact Info

Product

Resources

About