6 citations · 7 across the 5 of their papers we have counts for
6 papers
An Approximation-based Approach for the Random Exploration of Large Models
Julien Bernard, Pierre-Cyrille Héam, Olga Kouchnarenko
System modeling is a classical approach to ensure their reliability since it is suitable both for a formal verification and for software testing techniques. In the context of model…
Probabilistic Opacity in Refinement-Based Modeling
Béatrice Bérard, Olga Kouchnarenko, John Mullins +1
Given a probabilistic transition system (PTS) partially observed by an attacker, and an -regular predicate over the traces of , measuring the disclosure of t…
The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard
P. -C Héam, V. Hugot, O. Kouchnarenko
The model of tree automata with equality and disequality constraints was introduced in 2007 by Filiot, Talbot and Tison. In this paper we show that if there is at least one disequa…
Component Substitution through Dynamic Reconfigurations
Arnaud Lanoix, Olga Kouchnarenko
Component substitution has numerous practical applications and constitutes an active research topic. This paper proposes to enrich an existing component-based framework--a model wi…
Random Grammar-based Testing for Covering All Non-Terminals
Alois Dreyfus, Pierre-Cyrille Heam, Olga Kouchnarenko
In the context of software testing, generating complex data inputs is frequently performed using a grammar-based specification. For combinatorial reasons, an exhaustive generation…
Enhancing Approximations for Regular Reachability Analysis
Alois Dreyfus, Pierre-Cyrille Heam, Olga Kouchnarenko
This paper introduces two mechanisms for computing over-approximations of sets of reachable states, with the aim of ensuring termination of state-space exploration. The first mecha…