Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Annie Ressouche

dblp:06/2488 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none

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

Software engineering, systems software and programming languages · 5Theory of computation · 2Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author

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
2 papers
Requirements engineering and software design · 44% Compilers and program optimization · 44% Programming languages and type systems · 13%
Theoretical computer science
2 papers
Automated reasoning and model checking · 100%

Topics — the 8 heaviest of 8, 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
Automated reasoning and model checking
model checking
0.011996
The FC2TOOLS Set · CAV 1996
Programming languages and type systems › language semantics
compositional semantics
0.011994
Compositional Semantics of ESTEREL and Verification by Compositional Reductions · CAV 1994
Programming languages and type systems
language semantics
0.011994
Compositional Semantics of ESTEREL and Verification by Compositional Reductions · CAV 1994
Automated reasoning and model checking
compositional verification
0.011994
Compositional Semantics of ESTEREL and Verification by Compositional Reductions · CAV 1994
Automated reasoning and model checking
program verification
0.011994
Compositional Semantics of ESTEREL and Verification by Compositional Reductions · CAV 1994
Embedded and real-time systems
synchronous programming
0.011994
Compositional Semantics of ESTEREL and Verification by Compositional Reductions · CAV 1994

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.6
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
TASE2
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
ASE2
2004 Towards Formalizing Behavioral Substitutability in Component Frameworks
Sabine Moisan, Annie Ressouche, Jean-Paul Rigault
SEFM2
2003 SAS architecture: verification oriented formal modeling of concrete critical systems
abstract
Concrete critical systems validation is a major challenge in any development process. Model checking verification offers exhaustive and automated validation. To apply this methodology, the specification of critical systems must be supported by a formal mathematical well-sounded model. To this end, we rely on synchronous language to model such systems and to ensure model existence we consider systems falling into a particular SAS architecture. SAS systems are composed by a synchronous main controller that manages autonomic asynchronous tasks. Abstraction methods provide us with the required synchronous model. We show how our approach suits wearable computer applications designing and how the modeling we propose meets the requirements of wearable computer validation.
Annie Ressouche, Jean-Yves Tigli, Valine Roy, Daniel Cheung-Foo-Wo
SMC1
1996 The FC2TOOLS Set
Amar Bouali, Annie Ressouche, Valérie Roy, Robert de Simone
CAV2
1994 Compositional Semantics of ESTEREL and Verification by Compositional Reductions
Robert de Simone, Annie Ressouche
CAV2