Arnault Lapitre
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
Arnault Lapitre has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Christophe Gaston
Université Paris-Saclay, CEA, List, Palaiseau, France
11 shared publications - Boutheina Bannour
Université Paris-Saclay, CEA, List
9 shared publications - Erwan Mahe
Dpt. PRISME EDF Lab Université Paris Saclay CEA LIST Palaiseau Palaiseau France
5 shared publications - Nikolai Kosmatov
Thales Research and Technology, cortAIx Labs
4 shared publications - Pascale Le Gall
CentraleSupélec, Université Paris-Saclay
4 shared publications - Paul Dubrulle
CEA LIST, Gif-sur-Yvette, France
4 shared publications
Latest Publications
- 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.
- 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.
- 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.
- 22 December 2020
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 23 (3) , 519
Correction to: PolyGraph: a data flow model with frequency arithmetic
- 22 December 2020
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 23 (3) , 519
Correction to: PolyGraph: a data flow model with frequency arithmetic
- Open Access
A small-step approach to multi-trace checking against interactions
Interaction models describe the exchange of messages between the different components of distributed systems. We have previously defined a small-step operational semantics for interaction models. The paper extends this work by presenting 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 have formally proven our approach, studied its complexity, and implemented it in a prototype tool. Finally, we discuss some observability issues when testing distributed systems via the analysis of multi-traces.
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. We have previously defined a small-step operational semantics for interaction models. The paper extends this work by presenting 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 have formally proven our approach, studied its complexity, and implemented it in a prototype tool. Finally, we discuss some observability issues when testing distributed systems via the analysis of multi-traces.
- 2 September 2020
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 23 (3) , 489-517
PolyGraph: a data flow model with frequency arithmetic
- 2 September 2020
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 23 (3) , 489-517
PolyGraph: a data flow model with frequency arithmetic
- 22 November 2019
- Published by Springer Nature
- p. 175-193
Dynamic Reconfigurations in Frequency Constrained Data Flow
- 22 November 2019
- Published by Springer Nature
- p. 175-193
Dynamic Reconfigurations in Frequency Constrained Data Flow
- Open Access
- 4 April 2019
- Published by Springer Nature
- p. 369-385
A Data Flow Model with Frequency Arithmetic
- 4 April 2019
- Published by Springer Nature
- p. 369-385
Open AccessA Data Flow Model with Frequency Arithmetic