Pierre Ganty

98 papers A* 9A 3B 15C 4Journal 43Unranked 19
YearRankTypeTitle / Venue / Authors
2026 — conf
A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata.
TACAS (1)
Kyveli Doveri, Pierre Ganty, B. Srivathsan
2026 J jnl
A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata.
CoRR
Kyveli Doveri, Pierre Ganty, B. Srivathsan
2026 — ed.
Reachability Problems - 19th International Conference, RP 2025, Madrid, Spain, October 1-3, 2025, Proceedings
RP
Pierre Ganty, Alessio Mansutti
2025 A* conf
How Big is the Automaton? Certified Lower Bounds on the Size of Presburger DFAs.
ASE
Nicolas Amat, Pierre Ganty, Alessio Mansutti
2025 B conf
Temporal Hyperproperties for Population Protocols.
FoSSaCS
Nicolas Waldburger, Chana Weil-Kennedy, Pierre Ganty, César Sánchez
2025 J jnl
The Reachable Simulation Problem.
ACM Trans. Comput. Log.
Pierre Ganty, Nicolas Manini, Francesco Ranzato
2024 — conf
A Myhill-Nerode Style Characterization for Timed Automata with Integer Resets.
FSTTCS
Kyveli Doveri, Pierre Ganty, B. Srivathsan
2024 J jnl
A Myhill-Nerode style Characterization for Timed Automata With Integer Resets.
CoRR
Kyveli Doveri, Pierre Ganty, B. Srivathsan
2024 — conf
A Uniform Framework for Language Inclusion Problems.
Taming the Infinities of Concurrency
Kyveli Doveri, Pierre Ganty, Chana Weil-Kennedy
2024 J jnl
A Uniform Framework for Language Inclusion Problems.
CoRR
Kyveli Doveri, Pierre Ganty, Chana Weil-Kennedy
2024 — conf
Computing Reachable Simulations on Transition Systems.
RP
Pierre Ganty, Nicolas Manini, Francesco Ranzato
2024 — conf
Learning the State Machine Behind a Modal Text Editor: The (Neo)Vim Case Study.
SPIN
Pierre Ganty
2024 J jnl
Temporal Hyperproperties for Population Protocols.
CoRR
Nicolas Waldburger, Chana Weil-Kennedy, Pierre Ganty, César Sánchez
2023 — conf
Antichains Algorithms for the Inclusion Problem Between ømega-VPL.
TACAS (1)
Kyveli Doveri, Pierre Ganty, Luka Hadzi-Dokic
2022 — conf
FORQ-Based Language Inclusion Formal Testing.
CAV (2)
Kyveli Doveri, Pierre Ganty, Nicolas Mazzocchi
2022 J jnl
FORQ-based Language Inclusion Formal Testing.
CoRR
Kyveli Doveri, Pierre Ganty, Nicolas Mazzocchi
2022 J jnl
Online Simulation Reduction.
CoRR
Pierre Ganty, Nicolas Manini, Francesco Ranzato
2022 — ed.
Proceedings of the 13th International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2022, Madrid, Spain, September 21-23, 2022.
GandALF
Pierre Ganty, Dario Della Monica
2021 J jnl
A Congruence-Based Perspective on Finite Tree Automata.
CoRR
Pierre Ganty, Elena Gutiérrez, Pedro Valero
2021 J jnl
A Congruence-Based Perspective on Finite Tree Automata.
Fundam. Informaticae
Pierre Ganty, Elena Gutiérrez, Pedro Valero
2021 J jnl
Complete Abstractions for Checking Language Inclusion.
ACM Trans. Comput. Log.
Pierre Ganty, Francesco Ranzato, Pedro Valero
2021 B conf
Inclusion Testing of Büchi Automata Based on Well-Quasiorders.
CONCUR
Kyveli Doveri, Pierre Ganty, Francesco Parolini, Francesco Ranzato
2021 — ed.
Proceedings 12th International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2021, Padua, Italy, 20-22 September 2021.
GandALF
Pierre Ganty, Davide Bresolin
2020 B conf
A Quasiorder-Based Perspective on Residual Automata.
MFCS
Pierre Ganty, Elena Gutiérrez, Pedro Valero
2020 J jnl
A Quasiorder-based Perspective on Residual Automata.
CoRR
Pierre Ganty, Elena Gutiérrez, Pedro Valero
2020 A* conf
CacheQuery: learning replacement policies from hardware caches.
PLDI
Pepe Vila, Pierre Ganty, Marco Guarnieri, Boris Köpf
2019 B conf
A Congruence-based Perspective on Automata Minimization Algorithms.
MFCS
Pierre Ganty, Elena Gutiérrez, Pedro Valero
2019 J jnl
A Congruence-based Perspective on Automata Minimization Algorithms.
CoRR
Pierre Ganty, Elena Gutiérrez, Pedro Valero
2019 J jnl
CacheQuery: Learning Replacement Policies from Hardware Caches.
CoRR
Pepe Vila, Pierre Ganty, Marco Guarnieri, Boris Köpf
2019 J jnl
Complete Abstractions for Checking Language Inclusion.
CoRR
Pierre Ganty, Francesco Ranzato, Pedro Valero
2019 B conf
Language Inclusion Algorithms as Complete Abstract Interpretations.
SAS
Pierre Ganty, Francesco Ranzato, Pedro Valero
2019 B conf
Regular Expression Search on Compressed Text.
DCC
Pierre Ganty, Pedro Valero
2019 J jnl
Regular Expression Search on Compressed Text.
CoRR
Pierre Ganty, Pedro Valero
2019 C ed.
Verification and Evaluation of Computer and Communication Systems - 13th International Conference, VECoS 2019, Porto, Portugal, October 9, 2019, Proceedings
VECoS
Pierre Ganty, Mohamed Kaâniche
2018 A* conf
Sound up-to techniques and Complete abstract domains.
LICS
Filippo Bonchi, Pierre Ganty, Roberto Giacobazzi, Dusko Pavlovic
2018 J jnl
Sound up-to techniques and Complete abstract domains.
CoRR
Filippo Bonchi, Pierre Ganty, Roberto Giacobazzi, Dusko Pavlovic
2018 — conf
The Parikh Property for Weighted Context-Free Grammars.
FSTTCS
Pierre Ganty, Elena Gutiérrez
2018 J jnl
The Parikh Property for Weighted Context-Free Grammars.
CoRR
Pierre Ganty, Elena Gutiérrez
2018 J jnl
Tree dimension in verification of constrained Horn clauses.
CoRR
Bishoksan Kafle, John P. Gallagher, Pierre Ganty
2018 J jnl
Tree dimension in verification of constrained Horn clauses.
Theory Pract. Log. Program.
Bishoksan Kafle, John P. Gallagher, Pierre Ganty
2018 B conf
Verification of Immediate Observation Population Protocols.
CONCUR
Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy
2018 J jnl
Verification of Immediate Observation Population Protocols.
CoRR
Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy
2017 B conf
A Language-Theoretic View on Network Protocols.
ATVA
Pierre Ganty, Boris Köpf, Pedro Valero
2017 B conf
Fixing the State Budget: Approximation of Regular Languages with Small DFAs.
ATVA
Graeme Gange, Pierre Ganty, Peter J. Stuckey
2017 J jnl
Model checking parameterized asynchronous shared-memory systems.
Formal Methods Syst. Des.
Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty, Rupak Majumdar
2017 B conf
Parikh Image of Pushdown Automata.
FCT
Pierre Ganty, Elena Gutiérrez
2017 J jnl
Parikh Image of Pushdown Automata.
CoRR
Pierre Ganty, Elena Gutiérrez
2017 J jnl
Underapproximation of procedure summaries for integer programs.
Int. J. Softw. Tools Technol. Transf.
Pierre Ganty, Radu Iosif, Filip Konecný
2017 J jnl
Verification of population protocols.
Acta Informatica
Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar
2016 J jnl
A Language-theoretic View on Network Protocols.
CoRR
Pierre Ganty, Boris Köpf, Pedro Valero
2016 — conf
Bounded-oscillation Pushdown Automata.
GandALF
Pierre Ganty, Damir Valput
2016 — conf
Model Checking Population Protocols.
FSTTCS
Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar
2016 J jnl
Parameterized Verification of Asynchronous Shared-Memory Systems.
J. ACM
Javier Esparza, Pierre Ganty, Rupak Majumdar
2016 — conf
Solving non-linear Horn clauses using a linear Horn clause solver.
HCVS@ETAPS
Bishoksan Kafle, John P. Gallagher, Pierre Ganty
2016 — ed.
Trustworthy Global Computing - 10th International Symposium, TGC 2015, Madrid, Spain, August 31 - September 1, 2015 Revised Selected Papers
TGC
Pierre Ganty, Michele Loreti
2015 A conf
Analysis of Asynchronous Programs with Event-Based Synchronization.
ESOP
Michael Emmi, Pierre Ganty, Rupak Majumdar, Fernando Rosa-Velardo
2015 — conf
Decomposition by tree dimension in Horn clause verification.
VPT@ETAPS
Bishoksan Kafle, John P. Gallagher, Pierre Ganty
2015 C conf
From non-zenoness verification to termination.
MEMOCODE
Pierre Ganty, Samir Genaim, Ratan Lal, Pavithra Prabhakar
2015 B conf
Interprocedural Reachability for Flat Integer Programs.
FCT
Pierre Ganty, Radu Iosif
2015 — conf
Model Checking Parameterized Asynchronous Shared-Memory Systems.
CAV (1)
Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty, Rupak Majumdar
2015 J jnl
Model Checking Parameterized Asynchronous Shared-Memory Systems.
CoRR
Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty, Rupak Majumdar
2015 B conf
Verification of Population Protocols.
CONCUR
Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar
2014 J jnl
Generating Bounded Languages Using Bounded Control Sets.
CoRR
Pierre Ganty, Radu Iosif
2014 C conf
Ordered Counter-Abstraction - Refinable Subword Relations for Parameterized Verification.
LATA
Pierre Ganty, Ahmed Rezine
2014 J jnl
Pattern-Based Verification for Multithreaded Programs.
ACM Trans. Program. Lang. Syst.
Javier Esparza, Pierre Ganty, Tomás Poch
2013 J jnl
Parameterized Verification of Asynchronous Shared-Memory Systems
CoRR
Javier Esparza, Pierre Ganty, Rupak Majumdar
2013 A* conf
Parameterized Verification of Asynchronous Shared-Memory Systems.
CAV
Javier Esparza, Pierre Ganty, Rupak Majumdar
2013 J jnl
Proving Termination Starting from the End
CoRR
Pierre Ganty, Samir Genaim
2013 A* conf
Proving Termination Starting from the End.
CAV
Pierre Ganty, Samir Genaim
2013 A conf
Underapproximation of Procedure Summaries for Integer Programs.
TACAS
Pierre Ganty, Radu Iosif, Filip Konecný
2012 J jnl
A Perfect Model for Bounded Verification
CoRR
Javier Esparza, Pierre Ganty, Rupak Majumdar
2012 A* conf
A Perfect Model for Bounded Verification.
LICS
Javier Esparza, Pierre Ganty, Rupak Majumdar
2012 J jnl
Algorithmic verification of asynchronous programs.
ACM Trans. Program. Lang. Syst.
Pierre Ganty, Rupak Majumdar
2012 J jnl
Bounded underapproximations.
Formal Methods Syst. Des.
Pierre Ganty, Rupak Majumdar, Benjamin Monmege
2012 J jnl
Underapproximation of Procedure Summaries for Integer Programs
CoRR
Pierre Ganty, Radu Iosif, Filip Konecný
2011 J jnl
Approximating Petri Net Reachability Along Context-free Traces
CoRR
Pierre Ganty, Mohamed Faouzi Atig
2011 — conf
Approximating Petri Net Reachability Along Context-free Traces.
FSTTCS
Mohamed Faouzi Atig, Pierre Ganty
2011 — conf
Complexity Analysis of the Backward Coverability Algorithm for VASS.
RP
Laura Bozzelli, Pierre Ganty
2011 A* conf
Complexity of pattern-based verification for multithreaded programs.
POPL
Javier Esparza, Pierre Ganty
2011 J jnl
Parikhʼs theorem: A simple and direct automaton construction.
Inf. Process. Lett.
Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger
2011 — conf
Preface.
Bytecode@ETAPS
Pierre Ganty, Mark Marron
2011 — ed.
Proceedings of the Sixth Workshop on Bytecode Semantics, Verification, Analysis and Transformation, Bytecode@ETAPS 2011, Saarbrücken, Germany, March 27, 2011
Bytecode@ETAPS
Pierre Ganty, Mark Marron
2010 J jnl
Algorithmic Verification of Asynchronous Programs
CoRR
Pierre Ganty, Rupak Majumdar
2010 A* conf
Bounded Underapproximations.
CAV
Pierre Ganty, Rupak Majumdar, Benjamin Monmege
2010 J jnl
Fixed point guided abstraction refinement for alternating automata.
Theor. Comput. Sci.
Pierre Ganty, Nicolas Maquet, Jean-François Raskin
2010 J jnl
Parikh's Theorem: A simple and direct construction
CoRR
Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger
2009 — conf
Analyzing Real-Time Event-Driven Programs.
FORMATS
Pierre Ganty, Rupak Majumdar
2009 C conf
Fixpoint Guided Abstraction Refinement for Alternating Automata.
CIAA
Pierre Ganty, Nicolas Maquet, Jean-François Raskin
2009 J jnl
Le problème de couverture pour les réseaux de Petri. Résultats classiques et développements récents.
Tech. Sci. Informatiques
Pierre Ganty, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2009 A* conf
Verifying liveness for asynchronous programs.
POPL
Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko
2008 J jnl
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets.
Fundam. Informaticae
Pierre Ganty, Jean-François Raskin, Laurent Van Begin
2008 J jnl
Parikh-Equivalent Bounded Underapproximations
CoRR
Pierre Ganty, Rupak Majumdar, Benjamin Monmege
2007 B conf
Fixpoint-Guided Abstraction Refinements.
SAS
Patrick Cousot, Pierre Ganty, Jean-François Raskin
2007 — conf
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets.
ICATPN
Pierre Ganty, Jean-François Raskin, Laurent Van Begin
2006 B conf
A Complete Abstract Interpretation Framework for Coverability Properties of WSTS.
VMCAI
Pierre Ganty, Jean-François Raskin, Laurent Van Begin
2005 B conf
Locality-Based Abstractions.
SAS
Javier Esparza, Pierre Ganty, Stefan Schwoon
2004 A conf
Automatic Verification of Time Sensitive Cryptographic Protocols.
TACAS
Giorgio Delzanno, Pierre Ganty
2003 — conf
SAT-Based Model-Checking of Security Protocols Using Planning Graph Analysis.
FME
Alessandro Armando, Luca Compagna, Pierre Ganty