Pascale Le Gall
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
Pascale Le Gall has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Christophe Gaston
Université Paris-Saclay, CEA, List, Palaiseau, France
7 shared publications - Nikolai Kosmatov
Thales Research and Technology, cortAIx Labs
7 shared publications - Erwan Mahe
Dpt. PRISME EDF Lab Université Paris Saclay CEA LIST Palaiseau Palaiseau France
6 shared publications - Virgile Prevosto
Université Paris-Saclay, CEA, List
6 shared publications - Boutheina Bannour
Université Paris-Saclay, CEA, List
5 shared publications - András Horváth
Dipartimento di Informatica, Università di Torino, Torino, Italy
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.
- 2 October 2025
- Published by Springer Nature
- p. 409-428
Statistical Bayesian Inference for Stochastic Process Discovery
- 2 October 2025
- Published by Springer Nature
- p. 409-428
Statistical Bayesian Inference for Stochastic Process Discovery
- 9 September 2025
- Published by Springer Nature
- p. 135-153
Program Synthesis for Geometric Modeling
- Open Access
Statistical process discovery
Stochastic process discovery is concerned with deriving a model capable of reproducing the stochastic character of observed executions of a given process, stored in a log. This leads to an optimisation problem in which the model's parameter space is searched for, driven by the resemblance between the log's and the model's stochastic languages. The bottleneck of such optimisation problem lay in the determination of the model's stochastic language which existing approaches deal with through, hardly scalable, exact computation approaches. In this paper we introduce a novel framework in which we combine a simulation-based Bayesian parameter inference scheme, used to search for the ``optimal'' instance of a stochastic model, with an expressive statistical model checking engine, used (during inference) to approximate the language of the considered model's instance. Because of its simulation-based nature, the payoff is that, the runtime for discovering of the optimal instance of a model can be easily traded in for accuracy, hence allowing to treat large models which would result in a prohibitive runtime with non-simulation based alternatives. We validate our approach on several popular event logs concerning real-life systems.
Open AccessStatistical process discovery
Stochastic process discovery is concerned with deriving a model capable of reproducing the stochastic character of observed executions of a given process, stored in a log. This leads to an optimisation problem in which the model's parameter space is searched for, driven by the resemblance between the log's and the model's stochastic languages. The bottleneck of such optimisation problem lay in the determination of the model's stochastic language which existing approaches deal with through, hardly scalable, exact computation approaches. In this paper we introduce a novel framework in which we combine a simulation-based Bayesian parameter inference scheme, used to search for the ``optimal'' instance of a stochastic model, with an expressive statistical model checking engine, used (during inference) to approximate the language of the considered model's instance. Because of its simulation-based nature, the payoff is that, the runtime for discovering of the optimal instance of a model can be easily traded in for accuracy, hence allowing to treat large models which would result in a prohibitive runtime with non-simulation based alternatives. We validate our approach on several popular event logs concerning real-life systems.
- Open Access
Statistical process discovery
Stochastic process discovery is concerned with deriving a model capable of reproducing the stochastic character of observed executions of a given process, stored in a log. This leads to an optimisation problem in which the model's parameter space is searched for, driven by the resemblance between the log's and the model's stochastic languages. The bottleneck of such optimisation problem lay in the determination of the model's stochastic language which existing approaches deal with through, hardly scalable, exact computation approaches. In this paper we introduce a novel framework in which we combine a simulation-based Bayesian parameter inference scheme, used to search for the "optimal" instance of a stochastic model, with an expressive statistical model checking engine, used (during inference) to approximate the language of the considered model's instance. Because of its simulation-based nature, the payoff is that, the runtime for discovering of the optimal instance of a model can be easily traded in for accuracy, hence allowing to treat large models which would result in a prohibitive runtime with non-simulation based alternatives. We validate our approach on several popular event logs concerning real-life systems.
Open AccessStatistical process discovery
Stochastic process discovery is concerned with deriving a model capable of reproducing the stochastic character of observed executions of a given process, stored in a log. This leads to an optimisation problem in which the model's parameter space is searched for, driven by the resemblance between the log's and the model's stochastic languages. The bottleneck of such optimisation problem lay in the determination of the model's stochastic language which existing approaches deal with through, hardly scalable, exact computation approaches. In this paper we introduce a novel framework in which we combine a simulation-based Bayesian parameter inference scheme, used to search for the "optimal" instance of a stochastic model, with an expressive statistical model checking engine, used (during inference) to approximate the language of the considered model's instance. Because of its simulation-based nature, the payoff is that, the runtime for discovering of the optimal instance of a model can be easily traded in for accuracy, hence allowing to treat large models which would result in a prohibitive runtime with non-simulation based alternatives. We validate our approach on several popular event logs concerning real-life systems.
- 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
- 13 November 2024
- Published by Elsevier in Science of Computer Programming
- Vol. 241
Efficient interaction-based offline runtime verification of distributed systems with lifeline removal
- 13 November 2024
- Published by Elsevier in Science of Computer Programming
- Vol. 241
Efficient interaction-based offline runtime verification of distributed systems with lifeline removal
- 30 October 2024
- Published by Springer Nature
- p. 159-177
High-Level Program Properties in Frama-C: Definition, Verification and Deduction
- 30 October 2024
- Published by Springer Nature
- p. 159-177
High-Level Program Properties in Frama-C: Definition, Verification and Deduction
- 29 August 2024
- Published by Springer Nature
- p. 34-51
A Framework for Optimisation Based Stochastic Process Discovery
- 29 August 2024
- Published by Springer Nature
- p. 34-51
A Framework for Optimisation Based Stochastic Process Discovery
- 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.