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

Amélie Stainer

dblp:63/9299 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

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

Theory of computation · 6Software engineering, systems software and programming languages · 3Artificial intelligence and machine learning · 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
Automata and formal languages · 50% Computational complexity · 50%

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

TopicWeightPapersLastEvidence papers
Computational complexity › decidability › decision problems for automata
emptiness problem
0.112011
Emptiness and Universality Problems in Timed Automata with Positive Frequency · ICALP (2) 2011
Automata and formal languages
timed automata
0.112011
Emptiness and Universality Problems in Timed Automata with Positive Frequency · ICALP (2) 2011
YearPublicationVenuePosition
2018 Synthesising succinct strategies in safety games with an application to real-time scheduling
Gilles Geeraerts, Joël Goossens, Thi-Van-Anh Nguyen, Amélie Stainer
Theor. Comput. Sci.4
2015 A game approach to determinize timed automata
Nathalie Bertrand 0001, Amélie Stainer, Thierry Jéron, Moez Krichen
Formal Methods Syst. Des.2
2013 Reachability of Communicating Timed Processes
Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer, Grégoire Sutre
FoSSaCS3
2012 Monitor-Based Statistical Model Checking for Weighted Metric Temporal Logic
Peter E. Bulychev, Alexandre David, Kim G. Larsen, Axel Legay, Danny Bøgsted Poulsen, Amélie Stainer
LPAR7
2011 A Game Approach to Determinize Timed Automata
Nathalie Bertrand 0001, Amélie Stainer, Thierry Jéron, Moez Krichen
FoSSaCS2
2011 Emptiness and Universality Problems in Timed Automata with Positive Frequency
Nathalie Bertrand 0001, Patricia Bouyer, Thomas Brihaye, Amélie Stainer
ICALP (2)4
2011 Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata
Nathalie Bertrand 0001, Thierry Jéron, Amélie Stainer, Moez Krichen
TACAS3