Catherine Dufourd

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

Demo Data from SIGIR 2026 / reviewers in the wild / expert

dblp:82/5342 · DBLP profile ↗

← Back

8ranked-venue papers

4as first author

0since 2021 · last 2004

—ORCID · none

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

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

3 papers

Automata and formal languages · 84% Computational complexity · 10% Automated reasoning and model checking · 6%

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

Topic	Papers	Last	Evidence papers
Automata and formal languages petri nets	2	1999	Boundedness of Reset P/T Nets · ICALP 1999 Reset Nets Between Decidability and Undecidability · ICALP 1998
Automata and formal languages › petri nets reset petri nets	2	1999	Boundedness of Reset P/T Nets · ICALP 1999 Reset Nets Between Decidability and Undecidability · ICALP 1998
Automata and formal languages timed automata	1	2000	Are Timed Automata Updatable? · CAV 2000
Computational complexity decidability	2	1999	Boundedness of Reset P/T Nets · ICALP 1999 Reset Nets Between Decidability and Undecidability · ICALP 1998
Automated reasoning and model checking real-time verification	1	2000	Are Timed Automata Updatable? · CAV 2000

Year	Publication	Venue	Position
2004	Updatable timed automata Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit 0001	Theor. Comput. Sci.	2
2000	Are Timed Automata Updatable? Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit 0001	CAV	2
2000	Expressiveness of Updatable Timed Automata Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit 0001	MFCS	2
2000	Timed automata and additive clock constraints Béatrice Bérard, Catherine Dufourd	Inf. Process. Lett.	2
1999	Boundedness of Reset P/T Nets Catherine Dufourd, Petr Jancar, Philippe Schnoebelen	ICALP	1
1999	A Polynomial-Bisimilar Normalization for Reset Petri Nets Catherine Dufourd, Alain Finkel	Theor. Comput. Sci.	1
1998	Reset Nets Between Decidability and Undecidability Catherine Dufourd, Alain Finkel, Philippe Schnoebelen	ICALP	1
1997	Polynomial-Time Manz-One Reductions for Petri Nets Catherine Dufourd, Alain Finkel	FSTTCS	1