Benoît Caillaud

Dr. Benoît Caillaud

Inria Centre at Rennes University, Campus Universitaire de Beaulieu, Avenue du Général Leclerc,35042 Rennes cedex, France
orcid

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2019 in Nurse Education Today
Verified
Journal Article
Closed access
MBMarie-Stéphanie Bracq
Marie-Stéphanie Bracq
EMEstelle Michinov
Estelle Michinov
BABruno Arnaldi
Bruno Arnaldi
BCBenoît Caillaud
Benoît Caillaud
BGBernard Gibaud
Bernard Gibaud
PJPierre Jannin
Pierre Jannin

1 May 2012 in Journal of Computer and System Sciences
Verified
Journal Article
Closed access
ABAlbert Benveniste
Albert Benveniste
TBTimothy Bourke
Timothy Bourke
BCBenoît Caillaud
Benoît Caillaud
MPMarc Pouzet
Marc Pouzet

27 September 2004
Verified
Conference Paper
Open access
PDF file
ABAlbert Benveniste
Albert Benveniste
BCBenoît Caillaud
Benoît Caillaud
LCLuca P. Carloni
Luca P. Carloni
PCPaul Caspi
Paul Caspi
AVAlberto Sangiovanni Vincentelli
Alberto Sangiovanni Vincentelli

13 January 2025 in ACM Transactions on Cyber-Physical Systems
Verified
Journal Article
Open access
IIInigo Incer
Inigo Incer
ABApurva Badithela
Apurva Badithela
JGJosefine B. Graebener
Josefine B. Graebener
PMPiergiuseppe Mallozzi
Piergiuseppe Mallozzi
APAyush Pandey
Ayush Pandey
SSSanjit A. Seshia
Sanjit A. Seshia
Contract-based design is a method to facilitate modular design of systems. While there has been substantial progress on the theory of contracts, there has been less progress on practical algorithms for the algebraic operations in the theory. In this article, we present (1) principles to implement a contract-based design tool at scale and (2) Pacti, a tool that can efficiently compute these operations. We illustrate the use of Pacti in a variety of case studies.

17 September 2018 in Proceedings of the IEEE
Verified
Journal Article
Closed access
ABAlbert Benveniste
Albert Benveniste
TBTimothy Bourke
Timothy Bourke
BCBenoît Caillaud
Benoît Caillaud
JCJean-Louis Colaco
Jean-Louis Colaco
CPCedric Pasteur
Cedric Pasteur
MPMarc Pouzet
Marc Pouzet
Hybrid systems modeling languages that mix discrete and continuous time signals and systems are widely used to develop cyber-physical systems where control software interacts with physical devices. Compilers play a central role, statically checking source models, generating intermediate representations for testing and verification, and producing sequential code for simulation and execution on target platforms. This paper presents a novel approach to the design and implementation of a hybrid systems language, built on synchronous language principles and their proven compilation techniques. The result is a hybrid systems modeling language in which synchronous programming constructs can be mixed with ordinary differential equations (ODEs) and zero-crossing events, and a runtime that delegates their approximation to an off-the-shelf numerical solver. We propose an ideal semantics based on nonstandard analysis, which defines the execution of a hybrid model as an infinite sequence of infinitesimally small time steps. It is used to specify and prove correct three essential compilation steps: 1) a type system that guarantees that a continuous-time signal is never used where a discrete-time one is expected and conversely; 2) a type system that ensures the absence of combinatorial loops; and 3) the generation of statically scheduled code for efficient execution. Our approach has been evaluated in two implementations: the academic language Zélus, which extends a language reminiscent of Lustre with ODEs and zero-crossing events, and the industrial prototype Scade Hybrid, a conservative extension of Scade 6.

1 September 2022 in Electronics
Verified
Journal Article
Open access
PDF file
ABAlbert Benveniste
Albert Benveniste
BCBenoît Caillaud
Benoît Caillaud
MMMathias Malandain
Mathias Malandain
JTJoan Thibault
Joan Thibault
Since its 3.3 release, Modelica offers the possibility to specify models of dynamical systems with multiple modes having different DAE-based dynamics. However, the handling of such models by the current Modelica tools is not satisfactory, with mathematically sound models yielding exceptions at runtime. In this article, we propose several contributions to this multifaceted issue, namely: an efficient and scalable multimode extension of the structural analysis of Modelica models; a systematic way of rewriting a multimode Modelica model, based on this analysis, so that the rewritten model is guaranteed to be correctly compiled by state-of-the-art Modelica tools; a proposal for the handling of the consistent initialization of multimode models; multimode structural analysis algorithms that handle both multiple modes and mode change events in a unified framework, coupled with a compile-time algorithm for identifying and quantifying impulsive behaviors at mode changes. Our approach is illustrated on relevant example models, and the performance of our implementations is assessed on a variable dimension large-scale model.