Share This Author
Statistical Model Checking: An Overview
This tutorial surveys the statistical approach to model checking, and outlines its main advantages in terms of efficiency, uniformity, and simplicity.
Property preserving abstractions for the verification of concurrent systems
- C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, S. Bensalem
- Mathematics, Computer ScienceFormal Methods Syst. Des.
Results are given on the preservation of properties expressed in sublanguages of the branching time μ-calculus when two systemsS andS' are related via (α, γ)-simulations, using simulations parameterized by Galois connections.
Rigorous Component-Based System Design Using the BIP Framework
An autonomous robot case study illustrates the use of the behavior, interaction, priority (BIP) component framework as a unifying semantic model to ensure correctness of essential system design…
An Overview of SAL
This work instantiation of the SAL framework augments PVS with tools for abstraction, invariant generation, program analysis, theorem proving, and model checking to separate concerns as well as calculate properties of concurrent systems.
D-Finder: A Tool for Compositional Deadlock Detection and Verification
D-Finder tool implements a compositional method for the verification of component-based systems described in BIP language encompassing multi-party interaction and applies proof strategies to eliminate potential deadlocks by computing increasingly stronger invariants.
Compositional Verification for Component-Based Systems and Application
A compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interaction without data transfer based on the use of two kinds of invariants.
Dynamic Deadlock Analysis of Multi-threaded Programs
This paper presents a dynamic program analysis algorithm that can detect deadlock potentials in a multi-threaded program by examining a single execution trace, obtained by running an instrumented…
Statistical model checking QoS properties of systems with SBIP
- Ayoub Nouri, S. Bensalem, M. Bozga, Benoît Delahaye, Cyrille Jégourel, Axel Legay
- Computer ScienceInternational Journal on Software Tools for…
- 15 October 2012
This paper shows that the semantics of the entire system is described by a Markov chain, showing that the non-determinism arising from system interactions is automatically eliminated by BIP, and allows us to verify systems described in SBIP with Statistical Model Checking.
EFSMT: A Logical Framework for Cyber-Physical Systems
This paper addresses the challenge with EFSMT, the exists-forall quantified first-order fragment of propositional combinations over constraints, as the logical framework and foundation for analyzing and synthesizing cyber-physical systems and proposes an algorithm for solving EFS MT problems based on the interplay between two SMT solvers.
Allen Linear (Interval) Temporal Logic - Translation to LTL and Monitor Synthesis
It is shown that any ALTL formula can be linearly translated into an equivalent LTL formula, thus enabling the use of LTL techniques on ALTL requirements and implying the NP-completeness of ATL satisfiability.