EDBT 2026 Demo / reviewers in the wild / expert

Simon Lunel

dblp:184/8477 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

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

Theory of computation · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 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.

Theoretical computer science
1 paper
Logic in computer science · 50% Automated reasoning and model checking · 50%

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

TopicWeightPapersLastEvidence papers
Automated reasoning and model checking
compositional verification		 0.412019
Parallel Composition and Modular Verification of Computer Controlled Systems in Differential Dynamic Logic · FM 2019
Logic in computer science › modal logic › dynamic logic
differential dynamic logic		 0.412019
Parallel Composition and Modular Verification of Computer Controlled Systems in Differential Dynamic Logic · FM 2019
Automated reasoning and model checking
hybrid systems verification		 0.412019
Parallel Composition and Modular Verification of Computer Controlled Systems in Differential Dynamic Logic · FM 2019
Logic in computer science › concurrency theory
parallel composition		 0.412019
Parallel Composition and Modular Verification of Computer Controlled Systems in Differential Dynamic Logic · FM 2019

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

theorem proving · 0.4differential dynamic logic · 0.4
YearPublicationVenuePosition
2019 Parallel Composition and Modular Verification of Computer Controlled Systems in Differential Dynamic Logic
Simon Lunel, Stefan Mitsch, Benoît Boyer, Jean-Pierre Talpin
 FM1
2016 A Sequent Calculus for a Modal Logic on Finite Data Trees
abstract
We investigate the proof theory of a modal fragment of XPath equipped with data (in)equality tests over finite data trees, i.e., over finite unranked trees where nodes are labelled with both a symbol from a finite alphabet and a single data value from an infinite domain. We present a sound and complete sequent calculus for this logic, which yields the optimal PSPACE complexity bound for its validity problem.
David Baelde, Simon Lunel, Sylvain Schmitz
 CSL2