Daniel Gaffé

dblp:68/4084 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0003-3818-9147ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Requirements engineering and software design · 50% Compilers and program optimization · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization
hardware compilation
0.112008
The Clem Toolkit · ASE 2008
Requirements engineering and software design
model-driven engineering
0.112008
The Clem Toolkit · ASE 2008

Methods — techniques the papers use, named apart from their topics

modular compilation · 0.1constructive semantics · 0.1
YearPublicationVenuePosition
2022 On the use of formal methods to model and verify neuronal archetypes
Elisabetta De Maria, Abdorrahim Bahrami, Thibaud L'Yvonnet, Amy P. Felty, Daniel Gaffé, Annie Ressouche, Franck Grammont
Frontiers Comput. Sci.5
2014 AUTSEG: Automatic Test Set Generator for Embedded Reactive Systems
Mariem Abdelmoula, Daniel Gaffé, Michel Auguin
ICTSS2
2013 Algebraic Framework for Synchronous Language Semantics
abstract
In this article, we study several relevant algebraic frameworks to define synchronous language semantics. Synchronous languages are quite dedicated to design critical embedded applications. Thus, verification and compilation is challenging and should rely on mathematical semantics. We study multi-valued algebras as foundation for semantics definition and we show that a 4-valued algebra with a bilattice structure is well suited to our concern. With this approach we can define semantics offering both the generation of models where verification techniques apply, and separated compilation means.
Daniel Gaffé, Annie Ressouche
TASE1
2008 The Clem Toolkit
abstract
In this demonstration session, we present a toolkit we have designed around a model-driven language fLEJ. This relies on formal methods to ease the development of applications in an efficient and reusable way. Formal methods have been advocated as a means of increasing the reliability of systems, especially those which are safety or business critical. It is still difficult to develop automatic specification and verification tools due to limitations like state explosion, undecidability, etc. To face these problems, we provide LE with a constructive semantic that allows the modular compilation of programs into software and hardware targets (C code, VHDL code, FPGA synthesis, Verification tools). Moreover, we also provide software to design, compile and verify LE programs. Our approach is pertinent according to the two main requirements of critical realistic applications: the modular compilation allows us to deal with large systems, the model-driven approach provides us with formal validation.
Daniel Gaffé, Annie Ressouche
ASE1