Boutheina Bannour
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Boutheina Bannour has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Arnault Lapitre
CEA LIST, Gif-sur-Yvette, France
9 shared publications - Christophe Gaston
Université Paris-Saclay, CEA, List, Palaiseau, France
8 shared publications - Erwan Mahe
Dpt. PRISME EDF Lab Université Paris Saclay CEA LIST Palaiseau Palaiseau France
7 shared publications Pascale Le Gall
Université Paris Saclay CentraleSupélec F-91192 Gif-sur-Yvette France
6 shared publications- Pascale Le Gall
CentraleSupélec, Université Paris-Saclay
5 shared publications Arnault Lapitre
Université Paris Saclay CEA F-91120 Palaiseau LIST France
4 shared publications
Latest Publications
- Open Access
- 18 May 2026
- Published by Springer Nature
- p. 440-460
Specializing Anti-unification for Interaction Models Composition via Gate Connections
Interaction models describe distributed systems as algebraic terms, with gates marking interaction points between local views. Composing local models into a coherent global one requires aligning these gates while respecting the algebraic laws of interaction operators. This is achieved via anti-unification techniques. We specialize anti-unification (or generalization) via a special constant-preserving variant, which preserves designated constants while generalizing the remaining structure. We develop a dedicated rule-based procedure, for computing these generalizations, prove its termination, soundness, and completeness, extend it modulo equational theories, and integrate it into a standard anti-unification framework. A prototype tool demonstrates the approach’s ability to recompose global interactions from partial views.
- 18 May 2026
- Published by Springer Nature
- p. 440-460
Open AccessSpecializing Anti-unification for Interaction Models Composition via Gate Connections
Interaction models describe distributed systems as algebraic terms, with gates marking interaction points between local views. Composing local models into a coherent global one requires aligning these gates while respecting the algebraic laws of interaction operators. This is achieved via anti-unification techniques. We specialize anti-unification (or generalization) via a special constant-preserving variant, which preserves designated constants while generalizing the remaining structure. We develop a dedicated rule-based procedure, for computing these generalizations, prove its termination, soundness, and completeness, extend it modulo equational theories, and integrate it into a standard anti-unification framework. A prototype tool demonstrates the approach’s ability to recompose global interactions from partial views.
- 30 March 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Symbolic analysis of scenario based timed models for component based systems : Compositionality results for testing
Analyse symbolique de modèles à base de scénarios temporisés pour les systèmes à composants : résultats de compositionalité pour le test: Dans cette thèse, nous décrivons comment on peut utiliser un diagramme de séquence UML avec des contraintes de temps MARTE pour spécifier complètement le comportement des systèmes à base de composants tout en faisant abstraction des rôles fonctionnels des composants. Nous avons proposé une approche qui permet d'analyser ces spécifications d'une manière modulaire. Pour cela, nous avons attribué une sémantique opérationnelle aux diagrammes de séquence en les traduisant vers les TIOSTS qui sont des automates symbolique et temporisé. Nous avons utilisé des techniques d'exécution symbolique pour calculer les exécutions du système sous la forme d'un arbre symbolique. Nous avons défini des mécanismes de projection pour extraire l'arbre d'exécution associé à un composant sous-jacent. L'arbre résultant de la projection caractérise les comportements attendus du composant et peut être utilisé comme une référence pour valider le système bout par bout. Pour ce faire, nous nous sommes intéressés à des techniques de test. Nous avons présenté un résultat qui ramène la conformité du système à la conformité des composants qui le composent. Sur la base de ces résultats, nous avons proposé une méthodologie incrémentale de test basé sur des spécifications décrites sous la forme de diagrammes de séquence.
- 30 March 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Symbolic analysis of scenario based timed models for component based systems : Compositionality results for testing
Analyse symbolique de modèles à base de scénarios temporisés pour les systèmes à composants : résultats de compositionalité pour le test: Dans cette thèse, nous décrivons comment on peut utiliser un diagramme de séquence UML avec des contraintes de temps MARTE pour spécifier complètement le comportement des systèmes à base de composants tout en faisant abstraction des rôles fonctionnels des composants. Nous avons proposé une approche qui permet d'analyser ces spécifications d'une manière modulaire. Pour cela, nous avons attribué une sémantique opérationnelle aux diagrammes de séquence en les traduisant vers les TIOSTS qui sont des automates symbolique et temporisé. Nous avons utilisé des techniques d'exécution symbolique pour calculer les exécutions du système sous la forme d'un arbre symbolique. Nous avons défini des mécanismes de projection pour extraire l'arbre d'exécution associé à un composant sous-jacent. L'arbre résultant de la projection caractérise les comportements attendus du composant et peut être utilisé comme une référence pour valider le système bout par bout. Pour ce faire, nous nous sommes intéressés à des techniques de test. Nous avons présenté un résultat qui ramène la conformité du système à la conformité des composants qui le composent. Sur la base de ces résultats, nous avons proposé une méthodologie incrémentale de test basé sur des spécifications décrites sous la forme de diagrammes de séquence.
- Open Access
- 20 February 2025
- Published by Elsevier in Science of Computer Programming
- Vol. 243
Path-guided conformance test case generation for models with data and time using symbolic execution techniques
- 20 February 2025
- Published by Elsevier in Science of Computer Programming
- Vol. 243
Open AccessPath-guided conformance test case generation for models with data and time using symbolic execution techniques
- Open Access
- 14 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 12-22
Finite Automata synthesis from Interactions
Interactions are graphical models representing communication flows between actors. Well-known interaction languages include UML Sequence Diagrams or Message Sequence Charts. Even though interactions allow for concise and intuitive specifications, their use remains limited in formal verification, partly because the subsets of formalized languages often lack expressiveness. As many verification methods, such as model-checking or runtime verification, are routinely available for finite automata, we propose a new approach to generate finite automata from an expressive interaction language with operators such as the concurrent region. Our approach leverages an operational semantics to compute derivatives of an interaction and assimilate them to states of a finite automata. In addition, we use term rewriting to merge states on-the-fly so as to obtain small automata without relying on costly a-posteriori minimization techniques.
- 14 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 12-22
Open AccessFinite Automata synthesis from Interactions
Interactions are graphical models representing communication flows between actors. Well-known interaction languages include UML Sequence Diagrams or Message Sequence Charts. Even though interactions allow for concise and intuitive specifications, their use remains limited in formal verification, partly because the subsets of formalized languages often lack expressiveness. As many verification methods, such as model-checking or runtime verification, are routinely available for finite automata, we propose a new approach to generate finite automata from an expressive interaction language with operators such as the concurrent region. Our approach leverages an operational semantics to compute derivatives of an interaction and assimilate them to states of a finite automata. In addition, we use term rewriting to merge states on-the-fly so as to obtain small automata without relying on costly a-posteriori minimization techniques.
- Open Access
Tooling Offline Runtime Verification against Interaction Models : recognizing sliced behaviors using parameterized simulation
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 executions in the form of global traces, given the absence of a global clock. To account for this, we model executions as collections of local traces called multi-traces, with one local trace per group of co-localized actors that share a common clock. Due to the difficulty of synchronizing the start and end of the recordings of local traces, events may be missing at their beginning or end. Considering such partially observed multi-traces is challenging for runtime verification. To that end, we propose an algorithm that verifies the conformity of such traces against formal specifications called Interactions (akin to Message Sequence Charts). It relies on parameterized simulation to reconstitute unobserved behaviors.
Open AccessTooling Offline Runtime Verification against Interaction Models : recognizing sliced behaviors using parameterized simulation
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 executions in the form of global traces, given the absence of a global clock. To account for this, we model executions as collections of local traces called multi-traces, with one local trace per group of co-localized actors that share a common clock. Due to the difficulty of synchronizing the start and end of the recordings of local traces, events may be missing at their beginning or end. Considering such partially observed multi-traces is challenging for runtime verification. To that end, we propose an algorithm that verifies the conformity of such traces against formal specifications called Interactions (akin to Message Sequence Charts). It relies on parameterized simulation to reconstitute unobserved behaviors.
- 13 January 2024
- Published by Springer Nature
- p. 3-22
Symbolic Path-Guided Test Cases for Models with Data and Time
- 13 January 2024
- Published by Springer Nature
- p. 3-22
Symbolic Path-Guided Test Cases for Models with Data and Time
- 30 August 2023
- Published by Springer Nature
- p. 88-103
Interaction-Based Offline Runtime Verification of Distributed Systems
- 30 August 2023
- Published by Springer Nature
- p. 88-103
Interaction-Based Offline Runtime Verification of Distributed Systems
- Open Access
Dealing with observability in interaction-based Offline Runtime Verification of Distributed Systems
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 an operational semantics akin to that of process algebras. Executions of DS can be characterized by tuples of local traces (one per subsystem) called multi-traces. For a given execution, those local traces can be collected via monitoring and the resulting multi-trace can be analysed using offline Runtime Verification (RV). To that end, interactions may serve as formal references. In practice, however, not all subsystems may be observed and, without synchronising the end of monitoring on different subsystems, some events may not be observed, e.g. the reception of a message may be observed but not the corresponding emission. So as to be able to consider all such cases of partial observation, we propose an offline RV algorithm which uses removal operations to restrict the reference interaction on-the-fly, disregarding the parts concerning no longer observed subsystems. We prove the correctness of the algorithm and assess the performance of an implementation.
Open AccessDealing with observability in interaction-based Offline Runtime Verification of Distributed Systems
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 an operational semantics akin to that of process algebras. Executions of DS can be characterized by tuples of local traces (one per subsystem) called multi-traces. For a given execution, those local traces can be collected via monitoring and the resulting multi-trace can be analysed using offline Runtime Verification (RV). To that end, interactions may serve as formal references. In practice, however, not all subsystems may be observed and, without synchronising the end of monitoring on different subsystems, some events may not be observed, e.g. the reception of a message may be observed but not the corresponding emission. So as to be able to consider all such cases of partial observation, we propose an offline RV algorithm which uses removal operations to restrict the reference interaction on-the-fly, disregarding the parts concerning no longer observed subsystems. We prove the correctness of the algorithm and assess the performance of an implementation.
- 7 October 2021
- Published by Springer Nature
- p. 46-60
Deriving Interaction Scenarios for Timed Distributed Systems by Symbolic Execution
- 7 October 2021
- Published by Springer Nature
- p. 46-60
Deriving Interaction Scenarios for Timed Distributed Systems by Symbolic Execution
- Open Access
- 22 March 2021
- Published by Association for Computing Machinery (ACM)
- p. 1815-1822
A small-step approach to multi-trace checking against interactions
Interaction models describe the exchange of messages between the different components of distributed systems. This paper presents an approach for checking the validity of multi-traces against interaction models. A multi-trace is a collection of traces (sequences of emissions and receptions), each representing a local view of the same global execution of the distributed system. We formally prove our approach, study its complexity, and implement it in a prototype tool.
- 22 March 2021
- Published by Association for Computing Machinery (ACM)
- p. 1815-1822
Open AccessA small-step approach to multi-trace checking against interactions
Interaction models describe the exchange of messages between the different components of distributed systems. This paper presents an approach for checking the validity of multi-traces against interaction models. A multi-trace is a collection of traces (sequences of emissions and receptions), each representing a local view of the same global execution of the distributed system. We formally prove our approach, study its complexity, and implement it in a prototype tool.