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

Cédric Meuter

dblp:43/5937 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none

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

Theory of computation · 3Software engineering, systems software and programming languages · 2Computer networks · 1Databases, data management, data science and information retrieval · 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.

Theoretical computer science
1 paper
Automated reasoning and model checking · 87% Logic in computer science · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems › distributed control
distributed controllers
0.112006
Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check Traces · FM 2006
Automated reasoning and model checking › model checking › temporal logic model checking
LTL model checking
0.112006
Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check Traces · FM 2006
Automated reasoning and model checking
model checking
0.112006
Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check Traces · FM 2006
Logic in computer science › temporal logic
linear temporal logic
0.012006
Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check Traces · FM 2006

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

LTL algorithm · 0.1
YearPublicationVenuePosition
2008 On the complexity of partial order trace model checking
Thierry Massart, Cédric Meuter, Laurent Van Begin
Inf. Process. Lett.2
2007 Testing Distributed Systems Through Symbolic Model Checking
Gabriel Kalyon, Thierry Massart, Cédric Meuter, Laurent Van Begin
FORTE3
2006 Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check Traces
Alexandre Genon, Thierry Massart, Cédric Meuter
FM3
2005 The formal design of distributed controllers with dSL and Spin
abstract
Abstract We study the formal verification of programs written in d SL, an extension of the standard ST language used to program industrial controllers. It proposes a trade off between industrial and formal verification worlds. The main advantage of d SL is to provide a transparent code distribution through low level communication mechanisms. The behavior of the synthesized distributed system can therefore be formally modeled, easily monitored and formally verified. The verification of a d SL program, realized with the Spin tool, is eased by the definition of a lattice of models linked with a simulation relation preserving next-free LTL formulae. We show that, although d SL is an industrial programming language, it gives the possibility to verify systems designed with it. We illustrate the benefit of our approach with a simple control system of two canal locks.
Bram De Wachter, Alexandre Genon, Thierry Massart, Cédric Meuter
Formal Aspects Comput.4
2003 dSL: An Environment with Automatic Code Distribution for Industrial Control Systems
Bram De Wachter, Thierry Massart, Cédric Meuter
OPODIS3