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

Clément Gillard

dblp:322/9514 · DBLP profile ↗
← Back
1ranked-venue papers
0as 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 · 1 · 1 since 2021Theory of computation · 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.

Theoretical computer science
1 paper
Automata and formal languages · 39% Logic in computer science · 30% Automated reasoning and model checking · 30%

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

TopicWeightPapersLastEvidence papers
Logic in computer science › temporal logic
linear temporal logic
0.612022
From Spot 2.0 to Spot 2.10: What's New? · CAV (2) 2022
Automated reasoning and model checking › synthesis › temporal logic synthesis
LTL synthesis
0.612022
From Spot 2.0 to Spot 2.10: What's New? · CAV (2) 2022
Automata and formal languages
omega-automata
0.612022
From Spot 2.0 to Spot 2.10: What's New? · CAV (2) 2022
Automata and formal languages › omega-automata
acceptance conditions
0.212022
From Spot 2.0 to Spot 2.10: What's New? · CAV (2) 2022

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

alternating automata · 0.6acceptance transformations · 0.6
YearPublicationVenuePosition
2022 From Spot 2.0 to Spot 2.10: What's New?
abstract
Abstract Spot is a C++17 library for LTL and $$\omega $$ ω -automata manipulation, with command-line utilities, and Python bindings. This paper summarizes its evolution over the past six years, since the release of Spot 2.0, which was the first version to support $$\omega $$ ω -automata with arbitrary acceptance conditions, and the last version presented at a conference. Since then, Spot has been extended with several features such as acceptance transformations, alternating automata, games, LTL synthesis, and more. We also shed some lights on the data-structure used to store automata. Artifact: https://zenodo.org/record/6521395 .
Alexandre Duret-Lutz, Etienne Renault, Maximilien Colange, Florian Renkin, Alexandre Gbaguidi Aisse, Philipp Schlehuber-Caissier, Thomas Medioni, Jérôme Dubois, Clément Gillard, Henrich Lauko
CAV (2)10