From AADL Model to LNT Specification

Mkaouar, Hana; Zalila, Béchir; Hugues, Jérôme; Jmaïel, Mohamed

doi:10.1007/978-3-319-19584-1_10

Cited by 13 publications

(17 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We illustrated the method on the parallelization of programs using OpenMP, by proposing an intermediate representation of the concurrent blocks and their synchronizations as a work unit graph, which is transformed into an LNT model. The proposed method could be applied for parallel programs in other languages as well, provided that a suitable translation to LNT is available (e.g., AADL2LNT [31]). Once an abstract LNT model of the parallel program is available, it can be used not only for checking sequentiality constraints and deadlocks as in our analysis flow, but also other properties, both qualitative (safety, liveness, fairness) and quantitative ones [28].…”

Section: Resultsmentioning

confidence: 99%

Hunting Superfluous Locks with Model Checking

Nguyên

Serwe

Mateescu

et al. 2019

From Software Engineering to Formal Methods and Tools, and Back

View full text Add to dashboard Cite

Parallelization of existing sequential programs to increase their performance and exploit recent multi and many-core architectures is a challenging but inevitable effort. One increasingly popular parallelization approach is based on OpenMP, which enables the designer to annotate a sequential program with constructs specifying the parallel execution of code blocks. These constructs are then interpreted by the OpenMP compiler and runtime, which assigns blocks to threads running on a parallel architecture. Although this scheme is very flexible and not (very) intrusive, it does not prevent the occurrence of synchronization errors (e.g., deadlocks) or data races on shared variables. In this paper, we propose an iterative method to assist the OpenMP parallelization by using formal methods and verification. In each iteration, potential data races are identified by applying to the OpenMP program a lockset analysis, which computes the set of shared variables that potentially need to be protected by locks. To avoid the insertion of superfluous locks, an abstract, action-based formal model of the OpenMP program is extracted and analyzed using the ACTL on-the-fly model checker of the CADP formal verification toolbox. We describe the method, compare it with existing work, and illustrate its practical use.

show abstract

Section: Resultsmentioning

confidence: 99%

Hunting Superfluous Locks with Model Checking

Nguyên

Serwe

Mateescu

et al. 2019

From Software Engineering to Formal Methods and Tools, and Back

View full text Add to dashboard Cite

show abstract

“…The analysis of an architecture model is usually based on a model transformation process that translates the architectural model into a tool-specific model used for analysis: transformations have been implemented to translate AADL models into Cheddar ADL and MAST models with the OCARINA tool suite [38]; transformation chains exist to connect AADL models to UPPAAL [39], TINA [36,40] or CADP model checkers [41]; etc. A more exhaustive list of analysis tools and transformations applicable to AADL models is available in [42].…”

Section: Background: Modeling and Analysis Of Real-time Architecturesmentioning

confidence: 99%

Towards the systematic analysis of non-functional properties in Model-Based Engineering for real-time embedded systems

Brau

Hugues

Navet

2018

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

The real-time scheduling theory provides analytical methods to assess the temporal predictability of embedded systems. Nevertheless, their use is limited in a Model-Based Systems Engineering approach. In fact, the large number of applicability conditions makes the use of real-time scheduling analysis tedious and error-prone. Key issues are left to the engineers: when to apply a real-time scheduling analysis? What to do with the analysis results? This article presents an approach to systematize and then automate the analysis of non-functional properties in Model-Based Systems Engineering. First, preconditions and postconditions define the applicability of an analysis. In addition, contracts specify the analysis interfaces, thereby enabling to reason about the analysis process. We present a proof-of-concept implementation of our approach using a combination of constraint languages (REAL for run-time analysis) and specification languages (Alloy for describing interfaces and reasoning about them). This approach is experimented on architectural models written with the Architecture Analysis and Design Language (AADL).

show abstract

“…In the formal context, a well known problem is the state space explosion, when the number of states or transitions explodes. For this reason, the definition of the AADL2LNT transformation was refined several times (since the first proposition [19]) to obtain the smallest state spaces. The Pacemaker LTS counts 5473 states and 5473 transitions which present a small state space compared to the considered AADL model with sporadic/timed threads, event port connections and BA descriptions.…”

Section: Cadp: Formal Analysis and Evaluationmentioning

confidence: 99%

“…Briefly, we describe the considered subset of AADL language and we present the LNT language (more details can be found in [19]). …”

Section: Introductionmentioning

confidence: 99%

An ocarina extension for AADL formal semantics generation

Mkaouar

Zalila

Hugues

et al. 2018

Proceedings of the 33rd Annual ACM Symposium on Applied Computing

Self Cite

View full text Add to dashboard Cite

The formal verification has become a recommended practice in safety-critical software engineering. The hand-written of the formal specification requires a formal expertise and may become complex especially with large systems. In such context, the automatic generation of the formal specification seems helpful and rewarding, particularly for reused and generic mapping such as hardware representations and real-time features. In this paper, we aim to formally verify real-time systems designed by AADL language. We propose an extension AADL2LNT of the Ocarina tool suite allowing the automatic generation of an LNT specification to draw a gateway for the CADP formal analysis toolbox. This work is illustrated with the Pacemaker case study.

show abstract

From AADL Model to LNT Specification

Cited by 13 publications

References 10 publications

Hunting Superfluous Locks with Model Checking

Hunting Superfluous Locks with Model Checking

Towards the systematic analysis of non-functional properties in Model-Based Engineering for real-time embedded systems

An ocarina extension for AADL formal semantics generation

Contact Info

Product

Resources

About