Frédéric Boussinot

Frédéric Boussinot
MINES ParisTech | ParisTech · Centre de Mise en Forme des Matériaux (CEMEF)

PhD

About

59
Publications
3,979
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
1,039
Citations
Citations since 2016
1 Research Item
128 Citations
2016201720182019202020212022051015202530
2016201720182019202020212022051015202530
2016201720182019202020212022051015202530
2016201720182019202020212022051015202530

Publications

Publications (59)
Preprint
United-Atom (UA) force fields are usually constructed using a Boltzmann-inverse method based on distributions obtained from Monte-Carlo simulations. A new method of constructing UA force fields from All-Atom (AA) molecular dynamics simulations is proposed. In this method, one determines time correlations between oscillators of the same type: betwee...
Article
Full-text available
We consider the Reactive Programming (RP) approach to simulate physical systems. The choice of RP is motivated by the fact that RP genuinely offers logical parallelism, instantaneously broadcast events, and dynamic creation/destruction of parallel components and events. To illustrate our approach, we consider the implementation of a system of Molec...
Article
Full-text available
In Molecular Dynamics (MD), the forces applied to atoms derive from potentials which describe the energy of bonds, valence angles, torsion angles, and Lennard-Jones interactions of which molecules are made. These de finitions are classic; on the contrary, their implementation in a MD system which respects local equilibrium of mechanical conditions...
Article
We implement in a reactive programming framework a system mimicking three aspects of quantum mechanics: self-interference, state superposition, and entanglement. The system basically consists in a cellular automaton embedded in a synchronous environment which defines global discrete instants and broadcast events. The implementation shows how a simu...
Article
We present DSL, an orchestration language based on the synchronous/reactive model. In DSL, systems are composed of several sites executed asynchronously. Within each site, scripts are run in a synchronous parallel way. Scripts may call functions that are treated in an abstract way: their effect on the memory is not considered, but only their "orche...
Article
Full-text available
We propose a new scripting language called DSL bas-ed on the synchronous/reactive model. In DSL, sys-tems are composed of several sites executed asyn-chronously, and each site is running scripts in a syn-chronous parallel way. Scripts may call functions that are considered in an abstract way: their effect on the memory is not considered, but only t...
Article
Full-text available
We implement in a reactive programming framework a simulation of three aspects of quantum mechanics: self-interference, state superposition, and entanglement. The simulation basically consists in a cellular automaton embedded in a synchronous environment which defines global discrete instants and broadcast events. The implementation shows how a sim...
Article
Full-text available
Description of the FunLoft language for safe reactive programming (using the version v0.2 of the compiler)
Article
Full-text available
SugarCubes is a set of Java classes used to implement reactive, event based, concurrent systems. It is a low-level basis upon which more complex reactive formalisms can be implemented. SugarCubes introduces the notion of a global logical instant of execution, which is used to define synchronous parallelism and concurrency. It is also used to define...
Article
Full-text available
We propose a multicore-ready programming language based on a two-level shared memory model. Concurrency units are schedulers and threads which are dispatched on available cores in a preemptive way. Each scheduler is in charge of its own portion of the memory. At runtime, several threads may link to a common scheduler. In this case, they enter a coo...
Article
Full-text available
Simulation of collision of particles is proposed as a benchmark pro- gram for multicore machines. The focus is put on synchronisation and communication of threads. Some results obtained on a dual-core machine are presented.
Article
Full-text available
We formalise a thread-based concurrent language which makes resource control possible. Concurrency is based on a two-level model: threads are executed cooperatively when linked to a scheduler, and unlinked threads and schedulers are executed preemptively, under the control of the OS. We present a type and effect system to enforce a logical separati...
Article
Full-text available
A two-level model for reactive systems programming is introduced in which threads linked to the same scheduler are run cooperatively and have the possibility to escape from the scheduler control to run preemptively. We present a type and effect system to enforce a logical separation of the memory which ensures that, when running in preemptive mode,...
Article
FairThreads introduces fair threads which are executed in a cooperative way when linked to a scheduler, and in a preemptive way otherwise. Constructs exist for programming the dynamic linking/unlinking of threads during execution. Users can profit from the cooperative scheduling when threads are linked. For example, data only accessed by the thread...
Article
Full-text available
In this note we revisit the so-called reactive programming style, which evolves from the synchronous programming model of the Esterel language by weakening the assumption that the absence of an event can be detected instantaneously. We review some research directions that have been explored since the emergence of the reactive model ten years ago. W...
Article
Full-text available
This paper reports on an experiment to add concurrency to the Cyclone programming language, in order to get a safe concurrent language. The basic model considered is that of FairThreads in which synchronous and asynchronous aspects are mixed. The language Loft implements the FairThreads model in C. In this paper, one uses Cyclone instead of C in th...
Article
Implementation of cellular automata using reactive programming,gives a way to code cell behaviors in an abstract and modular way. Multiprocessing also becomes possible. The paper describes the implementation of cellular automata with the reactive programming language LOFT, a thread-based extension of C. Self replicating loops considered in artifici...
Conference Paper
This paper presents Fair Threads, a new model for concurrent programming. This multi-threading model combines preemptive and cooperative scheduling. User threads execute according to a cooperative strategy. Service threads execute according to a preemptive strategy. User threads may ask services from service threads in order to improve performance...
Article
Full-text available
One describes how to create and simulate self-replicating loops in the context of cellular automata spaces and of reactive programming. Cell behaviors are programs instead of standard look-up tables. A destruction mechanism is implemented and walls are introduced in order to contain loops in closed areas.
Article
One considers systems made of synchronizers to which distributed reactive machines are connected. The corresponding model is described with its implementation in Java, using SugarCubes and the RMI mechanism.
Article
Full-text available
Fair threads are cooperative threads run by a fair scheduler which gives them equal access to the processor. Fair threads can communicate using broadcast events, and are fully portable as their semantics does not depends on the executing platform. Fine control over fair threads execution is possible allowing the programming of specific user-defined...
Conference Paper
Full-text available
This paper presents a Java-based reactive programming framework well adapted to the construction of complex behaviors for CG ob- jects within virtual environments. This reactive approach is based on an instantaneously broadcast event model and a semantically- sound synchronous/reactive formalism. The reactive framework de- gree of expressiveness is...
Article
SugarCubes is a set of Java classes which provides a simple and structured approach to concurrency. It offers a powerful and modular communication mechanism based on instantaneously broadcast events. The semantics of SugarCubes code is deterministic and does not depend on arbitrary choices made by the execution platform. SugarCubes gives programmer...
Article
Full-text available
This paper describes the basic formal semantics of Junior, a formalism for reactive programming in Java. Semantics consists in rewriting rules given for Junior reactive instructions.
Article
Full-text available
{\Junior est un langage construit au dessus de Java pour programmer des comportements réactifs. Il autorise la concurrence, les événements diffusés et définit plusieurs primitives permettant d'obtenir un contrôle fin sur l'exécution des programmes réactifs. Il est utilisé au travers d'une API, nommée Jr, qui masque les implémentations existantes.
Article
Full-text available
One describes the way to produce finite states machines from programs written in Junior, a formalism for reactive programming in Java. The paper proposes the notion of a partial automaton for dealing with large size numbers of states.
Article
Full-text available
We define Junior as a Java framework kernel for reactive programming with broadcast events. We give Junior a formal semantics based on rewriting rule. We also describe three implementations of Junior. The first one, called REWRITE, is the direct implementation of the semantics rules. The second one is called REPLACE; it is more efficient than REWRI...
Article
SugarCubes is a set of Java classes used to implement dynamic, reactive, event-based, parallel systems. SugarCubes can be seen as a low-level basis upon which more complex reactive formalisms can be implemented. It also provides a convenient framework for prototyping experimental extensions to various reactive formalisms. SugarCubes is freely avail...
Conference Paper
Full-text available
We extend the reactive approach to distributed computing. Reactive systems allow one to use instantaneous broadcast events, which is a very powerful communication means between parallel components, in addition to implicit synchronization. Extension to distribution implies that instantaneous broadcast becomes available over the network between local...
Article
Full-text available
Causality problems appear in synchronous formalisms basically when one emits an absent signal. Several strategies have been developed to reject programs with causality problems. Strategies based on potential functions are studied, and several formal semantics using these functions are defined for a fragment of the synchronous language Esterel. Impl...
Article
Full-text available
SugarCubes are a set of Java classes for implementing software systems such as: $\bullet$ Event based systems, especially those where events are instantly broadcast throughout the system. Communicating in this framework is like in radio transmissions, where emitters send information that is immediately received by all receivers. $\bullet$ Concurren...
Article
Full-text available
Contents 1 Introduction 1 2 Reactive Nets 3 2.1 Empty Channel Test . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3 Implementation in RC 6 4 Examples 8 4.1 Empty Channel Test . . . . . . . . . . . . . ....
Article
This paper describes an extension of the C programming language called RC (for `Reactive C') to program reactive systems. The language RC is described, then some programming examples are given to illustrate the reactive approach. The main RC notions come directly from the Esterel synchronous programming language. Finally, the Esterel and RC languag...
Article
Full-text available
A simple and fully graphical programming method is presented, using a powerful means to combine behaviors. This programming is based on the notion of an "icobj" which has a behavioral aspect ("object" part), a graphical aspect ("icon" part), with an ianimationj aspect. Icobj programming provides parallelism, broadcast event communication and migrat...
Article
Full-text available
A simple and fully graphical programming method is presented, using a powerful means to combine behaviors. This programming is based on the notion of an «icobj» which has a behavioral aspect («object» part), a graphical aspect («icon» part), with an «animation» aspect. Icobj programming provides parallelism, broadcast event communication and migrat...
Article
L’approche réactive suppose que les composants d’un système parallèle ne s’exécutent pas à leur propre rythme, mais sont dirigés par une horloge logique qui définit des instants globaux. Le modèle des objets réactifs introduit dans cet article est un formalisme basé-objets fondé sur le paradigme réactif. Dans ce modèle, les méthodes sont appelées p...
Conference Paper
Full-text available
Reactive scripts are designed to get a flexible approach for responsive systems; they are based on the reactive/synchronous approach, well suited to real time programming. A reactive script interpretor is a broadcast event-driven interpreter which can react to several commands in parallel. Generating events and waiting for occurrence of events are...
Article
Full-text available
We present SL, a new programming language of the synchronous reactive family in which hypotheses about signal presence/absence are disallowed. One can decide that a signal is absent during an instant only at the end of this instant, and so reaction to this absence is delayed to the next instant. Sources of causal circularities are avoided, while on...
Article
In this paper, we use perfectly synchronous languages such asEsterel, for modelling Futurebus arbitration protocol. We show that the perfect synchrony aids in the formalization, testing, validating and verifying the protocol. We discuss solutions to the above protocol and show that properties such as mutual exclusion and deadlock-freedom can be est...
Article
Full-text available
: In the reactive approach, system components are not supposed to execute at their own rate, but are instead driven by a logical common clock, defining global instants. The Reactive Object Model introduced in this paper, is an object based formalism matching the reactive paradigm. In this model, methods can be invoked using instantaneous non-blocki...
Article
Full-text available
: We are studying semantics of a small object-based language, with the following main characteristics: parallelism, dynamicity, high order parameters, notion of a global instant, and reactivity. We give formal semantics using two related formalisms , namely ß-calculus and the so-called "Chemical Abstract Machine " (CHAM). These formalisms are both...
Article
Full-text available
Disponible dans les fichiers attachés à ce document
Article
This paper describes a formal semantics for a new programming language called "reactive C". This language is an extension of C to program reactive systems i.e. systems that react to sequences of activations from the external world. Reactive statements are introduced to code these systems. The semantics of reactive statements is described in an oper...
Article
Full-text available
On introduit le modèle des réseaux de processus réactifs, on décrit une implémentation de ces réseaux et on leur donne une sémantique mathématique dans le cadre dénotationnel. On étudie l'implémentation des langages synchrones Lustre et Signal en considérant leurs programmes comme des exemples de réseaux réactifs.
Article
Full-text available
The authors present the basics of the ESTEREL reactive model of synchronous parallel systems. The ESTEREL programming style, based on instantaneous communications and decisions, is illustrated through the example of a mouse handler. The ESTEREL formal semantics is described, and it is shown how programs can be compiled into finite state sequential...
Article
Reactive systems are interactive programs that react continuously to sequences of activations coming from the external world. Reactive programming leads to a new programming style where one programs in terms of reactions to activations and reasons in a logic of instants. This paper describes an extension of the C programming language called RC (for...
Article
Full-text available
Disponible dans les fichiers attachés à ce document
Article
Full-text available
Disponible dans les fichiers attachés à ce document
Chapter
A new language for formal description of large real time systems is presented. It is developed in the Central Research Laboratory of Thomson CSF (1). Its temporary name is L.
Article
A new language for formal description of large real time systems is presented. It is developed in the Central Research Laboratory of Thomson CSF (1). Its temporary name is L.
Article
R esum e. Nous pr esentons dans ce document, un mod ele de programmation fond e sur l'approche ob-jet, l'approche r eactive e t l a c o m m unication par diiusion. Ce nouveau mod ele permet de d ecrire na-turellement les interactions pouvant appara^ entre les objets. Nous pr esentons ennn bri evement u n e impl ementation r ealis ee avec les langag...
Article
Full-text available
We consider a process calculus that combines reactivity and atomicity. R e -activity means that process behaviors are made of reactions that are sequences of rewritings. Atomicity means that there exists an operator to deal with non terminating reactions. Processes can make or forbid actions. Reaction does not terminate when a process tries to make...
Article
Systems made of distributed reactive processes communicating with shared variables are described. Execution of these systems is in two phases: vari-ables are written, then read. Couples of these two phases deene system instants, and during one instant, all readers of a given shared variables read the same value. One thus get deterministic systems w...

Network

Cited By