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

Jean-Claude Fernandez

dblp:f/JeanClaudeFernandez · DBLP profile ↗
← Back
35ranked-venue papers
12as first author
0since 2021 · last 2014
—ORCID · none

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

Software engineering, systems software and programming languages · 22 · 8 first-authorTheory of computation · 10 · 6 first-authorSystems, architecture and hardware · 6 · 1 first-authorComputer networks · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

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
4 papers
Program verification · 74% Software testing · 26%
Theoretical computer science
2 papers
Automated reasoning and model checking · 46% Logic in computer science · 26% Automata and formal languages · 14%

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

TopicWeightPapersLastEvidence papers
Software testing › test generation
test suite generation
0.011996
Using On-The-Fly Verification Techniques for the Generation of test Suites · CAV 1996
Program verification
equivalence checking
0.011993
Symbolic Equivalence Checking · CAV 1993
Program verification
model checking
0.011992
A Toolbox for the Verification of LOTOS Programs · ICSE 1992
Program verification
protocol verification
0.011992
A Toolbox for the Verification of LOTOS Programs · ICSE 1992
Distributed computing theory
asynchronous systems
0.012000
IF: A Validation Environment for Timed Asynchronous Systems · CAV 2000
Automata and formal languages
timed automata
0.012000
IF: A Validation Environment for Timed Asynchronous Systems · CAV 2000
Logic in computer science › temporal logic
safety properties
0.011991
Safety for Branching Time Semantics · ICALP 1991
Logic in computer science
temporal logic
0.011991
Safety for Branching Time Semantics · ICALP 1991

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

satisfiability checking · 0.0formal methods · 0.0branching time semantics · 0.0
YearPublicationVenuePosition
2014 Efficient and Generalized Decentralized Monitoring of Regular Languages
Yliès Falcone, Tom Cornebize, Jean-Claude Fernandez
FORTE3
2012 More testable properties
Yliès Falcone, Jean-Claude Fernandez, Thierry Jéron, Hervé Marchand, Laurent Mounier
Int. J. Softw. Tools Technol. Transf.2
2012 What can you verify and enforce at runtime?
Yliès Falcone, Jean-Claude Fernandez, Laurent Mounier
Int. J. Softw. Tools Technol. Transf.2
2011 Runtime enforcement monitors: composition, synthesis, and enforcement abilities
Yliès Falcone, Laurent Mounier, Jean-Claude Fernandez, Jean-Luc Richier
Formal Methods Syst. Des.3
2010 More Testable Properties
Yliès Falcone, Jean-Claude Fernandez, Thierry Jéron, Hervé Marchand, Laurent Mounier
ICTSS2
2009 Runtime Verification of Safety-Progress Properties
Yliès Falcone, Jean-Claude Fernandez, Laurent Mounier
RV2
2008 Using neural networks for quality management
abstract
We present a method for fine grain QoS control of multimedia applications. This method takes as input an application software composed of actions. The execution times are unknown increasing functions of quality level parameters. Our method allows the construction of a quality manager which computes adequate action quality levels, so as to meet QoS requirements for a given platform. These include requirements for safety (action deadlines are met) as well as optimality (maximization and smoothness of quality levels). In this paper, we use learning techniques for computation of quality management policies. Given input parameters of the actions, a neural network is used to refine online pre-computed average execution times. Using refine average execution times allows a better control of the application, which leads to a reduction of fluctuations of CPU load. We present experimental results including the implementation of the method and benchmarks for an MPEG4 video encoder.
Mohamad Jaber 0001, Jacques Combaz, Loïc Strus, Jean-Claude Fernandez
ETFA4
2008 A fully-non-transparent approach to the code location problem
abstract
In the context of embedded systems such as cell-phones, PDA or cars and planes software, optimizations of code are required because of timing and memory constraints imposed. Many problems arise when trying to debug optimized code. One of them is the irrelevance of the mapping between the source code and the optimized target program: the Code Location Problem. This paper proposes a solution to this problem in the case of highly optimized code in the context of embedded systems.
Hugo Venturini, Frédéric Riss, Jean-Claude Fernandez, Miguel Santana
SCOPES3
2008 Symbolic quality control for multimedia applications
Jacques Combaz, Jean-Claude Fernandez, Joseph Sifakis, Loïc Strus
Real Time Syst.2
2007 Non-transparent debugging for software-pipelined loops
abstract
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Hugo Venturini, Frédéric Riss, Jean-Claude Fernandez, Miguel Santana
CASES3
2007 Using Speed Diagrams for Symbolic Quality Management
abstract
We present a quality management method for multimedia applications. The method takes as input an application software composed of actions. The execution times of actions are unknown increasing junctions of quality level parameters. The method allows the construction of a quality manager which computes adequate action quality levels so as to meet QoS requirements for a given platform. These include deadlines for the actions as well as quality maximization and smoothness. We extend and improve results of a previous paper by focusing on the reduction of overhead due to quality management. We propose a symbolic quality management method using speed diagrams, a representation of the system's dynamics. Instead of numerically computing a quality level for each action, the quality manager changes action quality levels based on the knowledge of constraints characterizing control relaxation regions. These are sets of states in which quality management for a given number of steps can be relaxed without degrading quality. We provide experimental results for quality management of an MPEG encoder, in particular performance benchmarks for both numeric and symbolic quality management.
Jacques Combaz, Jean-Claude Fernandez, Joseph Sifakis, Loïc Strus
IPDPS2
2005 Fine Grain QoS Control for Multimedia Application Software
abstract
We propose a method for fine grain QoS control of dataflow applications. We assume that the application software is described as the composition of actions (C-functions) with quality level parameters. The method allows a QoS controller to be computed from this description, and also average execution times, worst case execution times and deadlines for its actions. The controller computes dynamically feasible schedules and quality assignments for their actions. Furthermore, the control policy ensures optimal time budget utilization. A prototype tool implementing the method is shown, as well as experimental results for a non trivial example. The results show the interest of fine grain QoS control for video encoders.
Jacques Combaz, Jean-Claude Fernandez, Thierry Lepley, Joseph Sifakis
DATE2
2005 QoS control for optimality and safety
abstract
We propose a method for fine grain QoS control of real-time applications. The method allows adapting the overall system behavior by adequately setting the quality level parameters of its actions. The objective of the control policy is to meet QoS requirements including three types of properties: 1) safety that is, no deadline is missed; 2) optimality that is, maximization of the available time budget; 3) smoothness of quality levels. The method takes as input a model of the application software, QoS requirements and platform-dependent timing information, and produces a controlled application software meeting the QoS requirements on the target platform. This paper provides a complete formalization of the quality control problem. It proposes a new control management policy ensuring safety, near-optimality and smoothness. It also describes a prototype tool implementing the quality control algorithm and experimental results about its application to a video encoder.
Jacques Combaz, Jean-Claude Fernandez, Thierry Lepley, Joseph Sifakis
EMSOFT2
2003 State space reduction based on live variables analysis
Jean-Claude Fernandez, Marius Bozga, Lucian Ghirvu
Sci. Comput. Program.1
2003 Using static analysis to improve automatic test generation
Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu
Int. J. Softw. Tools Technol. Transf.2
2002 A Parallel Implementation of H.26L Video Encoder (Research Note)
Jean-Claude Fernandez, Manuel P. Malumbres
Euro-Par1
2000 IF: A Validation Environment for Timed Asynchronous Systems
Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu, Susanne Graf, Jean-Pierre Krimm, Laurent Mounier
CAV2
2000 A Transformational Approach for Generating Non-linear Invariants
Saddek Bensalem, Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu, Yassine Lakhnech
SAS3
2000 Using Static Analysis to Improve Automatic Test Generation
Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu
TACAS2
2000 Verification and test generation for the SSCOP protocol
Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu, Claude Jard, Thierry Jéron, Alain Kerbrat, Pierre Morel, Laurent Mounier
Sci. Comput. Program.2
1999 State Space Reduction Based on Live Variables Analysis
Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu
SAS2
1997 An Experiment in Automatic Generation of Test Suites for Protocols with Verification Technology
Jean-Claude Fernandez, Claude Jard, Thierry Jéron, César Viho
Sci. Comput. Program.1
1997 Protocol Verification with the ALDÉBARAN Toolset
Marius Bozga, Jean-Claude Fernandez, Alain Kerbrat, Laurent Mounier
Int. J. Softw. Tools Technol. Transf.2
1996 CADP - A Protocol Validation and Verification Toolbox
Jean-Claude Fernandez, Hubert Garavel, Alain Kerbrat, Laurent Mounier, Radu Mateescu 0001, Mihaela Sighireanu
CAV1
1996 Using On-The-Fly Verification Techniques for the Generation of test Suites
Jean-Claude Fernandez, Claude Jard, Thierry Jéron, César Viho
CAV1
1995 An Algorithm for Reducing Binary Branchings
Paul Caspi, Jean-Claude Fernandez, Alain Girault
FSTTCS2
1994 Model-Based Verification Methods and Tools (Abstract)
Jean-Claude Fernandez, Joseph Sifakis, Robert de Simone
CONCUR1
1993 Symbolic Equivalence Checking
Jean-Claude Fernandez, Alain Kerbrat, Laurent Mounier
CAV1
1992 A Toolbox for the Verification of LOTOS Programs
abstract
This paper presents the tools ALDEBARAN, CESAR, CESAR.ADT and CLEOPATRE which constitute a tool- box for compiling and verifying LOTOS programs. The principles of these tools are described, as well as their performances and limitations. Finally, the formal verification of the ret/REL atomic multicast protocol is given as an example to illustrate the practical use of the tool- box.
Jean-Claude Fernandez, Hubert Garavel, Laurent Mounier, Anne Rasse, Joseph Sifakis
ICSE1
1992 On-the-fly Verification of Finite Transition Systems
Jean-Claude Fernandez, Laurent Mounier, Claude Jard, Thierry Jéron
Formal Methods Syst. Des.1
1992 Minimal State Graph Generation
Ahmed Bouajjani, Jean-Claude Fernandez, Nicolas Halbwachs, Pascal Raymond
Sci. Comput. Program.2
1991 A Tool Set for deciding Behavioral Equivalences
Jean-Claude Fernandez, Laurent Mounier
CONCUR1
1991 Safety for Branching Time Semantics
Ahmed Bouajjani, Jean-Claude Fernandez, Susanne Graf, Joseph Sifakis
ICALP2
1990 Verifying Bisimulations "On the Fly"
Jean-Claude Fernandez, Laurent Mounier
FORTE1
1989 An Implementation of an Efficient Algorithm for Bisimulation Equivalence
Jean-Claude Fernandez
Sci. Comput. Program.1