5 citations · 6 across the 9 of their papers we have counts for
9 papers
A framework for optimisation based stochastic process discovery
Pierre Cry, András Horváth, Paolo Ballarini +1
Process mining is concerned with deriving formal models capable of reproducing the behaviour of a given organisational process by analysing observed executions collected in an even…
Tooling Offline Runtime Verification against Interaction Models : recognizing sliced behaviors using parameterized simulation
Erwan Mahe, Boutheina Bannour, Christophe Gaston +2
Offline runtime verification involves the static analysis of executions of a system against a specification. For distributed systems, it is generally not possible to characterize e…
Efficient Interaction-Based Offline Runtime Verification of Distributed Systems with Lifeline Removal
Erwan Mahe, Boutheina Bannour, Christophe Gaston +1
Runtime Verification (RV) refers to a family of techniques in which system executions are observed and confronted to formal specifications, with the aim of identifying faults. In O…
An Efficient VCGen-based Modular Verification of Relational Properties
Lionel Blatter, Nikolai Kosmatov, Virgile Prevosto +1
Deductive verification typically relies on function contracts that specify the behavior of each function for a single function call. Relational properties link several function cal…
Symbolic Path-guided Test Cases for Models with Data and Time
Boutheina Bannour, Arnault Lapitre, Pascale Le Gall +1
This paper focuses on generating test cases from timed symbolic transition systems. At the heart of the generation process are symbolic execution techniques on data and time. Test…
A Term-based Approach for Generating Finite Automata from Interaction Diagrams
Erwan Mahe, Boutheina Bannour, Christophe Gaston +2
Non-deterministic Finite Automata (NFA) represent regular languages concisely, increasing their appeal for applications such as word recognition. This paper proposes a new approach…
Dealing with observability in interaction-based Offline Runtime Verification of Distributed Systems
Erwan Mahe, Boutheina Bannour, Christophe Gaston +2
Interactions are formal models describing asynchronous communications within a Distributed System (DS). They can be drawn in the fashion of sequence diagrams and executed thanks to…
Static and Dynamic Verification of Relational Properties on Self-Composed C Code
Lionel Blatter, Nikolai Kosmatov, Pascale Le Gall +2
Function contracts are a well-established way of formally specifying the intended behavior of a function. However, they usually only describe what should happen during a single cal…
RPP: Automatic Proof of Relational Properties by Self-Composition
Lionel Blatter, Nikolai Kosmatov, Pascale Le Gall +1
Self-composition provides a powerful theoretical approach to prove relational properties, i.e. properties relating several program executions, that has been applied to compare two…