Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Region-based Memory Management
A region-based dynamic semantics for a skeletal programming language extracted from Standard ML is defined and the inference system which specifies where regions can be allocated and de-allocated is presented and a detailed proof that the system is sound with respect to a standard semantics is presented.
Implementation of the typed call-by-value λ-calculus using a stack of regions
The translation is proved correct with respect to a store semantics, which models as a region-based run-time system for polymorphically typed call-by-value λ-calculus.
POLYCHRONY for System Design
The aim of the present article is to review and summarize these formal, correct-by-construction, design transformations of system specifications (morphisms) that preserve the intended semantics and stated properties of the architecture under design.
The Type and Effect Discipline
This work defines both a dynamic and a static semantics for an ML-like language and proves that they are consistently related, and presents a reconstruction algorithm that computes the principal type and the minimal observable effect of expressions.
The type and effect discipline
- J. Talpin, P. Jouvelot
- Mathematics, Computer Science Proceedings of the Seventh Annual IEEE…
- 22 June 1992
The type and effect discipline, a framework for reconstructing the principal type and the minimal effect of expressions in implicitly typed polymorphic functional languages that support imperative constructs, is introduced and outperforms other polymorphic type systems.
Polymorphic Type, Region and Effect Inference
A new static system which reconstructs the types, regions and effects of expressions in an implicitly typed functional language that supports imperative operations on reference values, and proves the correctness of the reconstruction algorithm with respect to the static semantics.
A Protocol for Loosely Time-Triggered Architectures
- A. Benveniste, P. Caspi, P. Guernic, H. Marchand, J. Talpin, S. Tripakis
- Computer ScienceEMSOFT
- 7 October 2002
This work proposes a protocol that ensures a coherent system of logical clocks on the top of Loosely Time-Triggered Architectures, and provides several proofs for it, both manual and automatic, based on synchronous languages and associated model checkers.
Affine Data-Flow Graphs for the Synthesis of Hard Real-Time Applications
- A. Bouakaz, J. Talpin, J. Vitek
- Computer Science12th International Conference on Application of…
- 27 June 2012
This paper proposes a model of computation in which the activation clocks of actors are related by affine functions and presents an algorithm that computes affine schedules in a way that minimizes buffering requirements and guarantees the absence of overflow and underflow exceptions over communication channels.
Compositional design of isochronous systems
- J. Talpin, J. Ouy, L. Besnard, P. Guernic
- Computer ScienceDesign, Automation and Test in Europe
- 10 March 2008
This work proposes a formal design methodology that adheres to a weakened global design objective: the non-blocking composition of weakly endochronous processes, while preserving localendochrony objectives, which yields an ad-hoc yet cost- efficient approach to compositional synchronous modeling.
The Synchronous Hypothesis and Synchronous Languages
Synchronous Reactive languages are described, which emerged as early as the 1980’s decade, and are now gaining increasing recognition for their modeling adequacy to embedded systems.