Pierre Ganty

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 47

Top Topics

Integer Program

Network Protocols

Artifact Centric

Top Venues

Publications

Kyveli Doveri, Pierre Ganty, Chana Weil-Kennedy
A Uniform Framework for Language Inclusion Problems. Taming the Infinities of Concurrency (2024)
Kyveli Doveri, Pierre Ganty, Chana Weil-Kennedy
A Uniform Framework for Language Inclusion Problems. CoRR (2024)
Kyveli Doveri, Pierre Ganty, Luka Hadzi-Dokic
Antichains Algorithms for the Inclusion Problem Between ømega-VPL. TACAS (1) (2023)
Kyveli Doveri, Pierre Ganty, Nicolas Mazzocchi
FORQ-based Language Inclusion Formal Testing. CoRR (2022)
Kyveli Doveri, Pierre Ganty, Nicolas Mazzocchi
FORQ-Based Language Inclusion Formal Testing. CAV (2) (2022)
Pierre Ganty, Nicolas Manini, Francesco Ranzato
Online Simulation Reduction. CoRR (2022)
Kyveli Doveri, Pierre Ganty, Francesco Parolini, Francesco Ranzato
Inclusion Testing of Büchi Automata Based on Well-Quasiorders. CONCUR (2021)
Pierre Ganty, Elena Gutiérrez, Pedro Valero
A Congruence-Based Perspective on Finite Tree Automata. CoRR (2021)
Pierre Ganty, Francesco Ranzato, Pedro Valero
Complete Abstractions for Checking Language Inclusion. ACM Trans. Comput. Log. 22 (4) (2021)
Pierre Ganty, Elena Gutiérrez, Pedro Valero
A Congruence-Based Perspective on Finite Tree Automata. Fundam. Informaticae 184 (1) (2021)
Pierre Ganty, Elena Gutiérrez, Pedro Valero
A Quasiorder-based Perspective on Residual Automata. CoRR (2020)
Pierre Ganty, Elena Gutiérrez, Pedro Valero
A Quasiorder-Based Perspective on Residual Automata. MFCS (2020)
Pepe Vila, Pierre Ganty, Marco Guarnieri, Boris Köpf
CacheQuery: learning replacement policies from hardware caches. PLDI (2020)
Pierre Ganty, Pedro Valero
Regular Expression Search on Compressed Text. CoRR (2019)
Pierre Ganty, Elena Gutiérrez, Pedro Valero
A Congruence-based Perspective on Automata Minimization Algorithms. MFCS (2019)
Pierre Ganty, Francesco Ranzato, Pedro Valero
Complete Abstractions for Checking Language Inclusion. CoRR (2019)
Pepe Vila, Pierre Ganty, Marco Guarnieri, Boris Köpf
CacheQuery: Learning Replacement Policies from Hardware Caches. CoRR (2019)
Pierre Ganty, Elena Gutiérrez, Pedro Valero
A Congruence-based Perspective on Automata Minimization Algorithms. CoRR (2019)
Pierre Ganty, Francesco Ranzato, Pedro Valero
Language Inclusion Algorithms as Complete Abstract Interpretations. SAS (2019)
Pierre Ganty, Pedro Valero
Regular Expression Search on Compressed Text. DCC (2019)
Filippo Bonchi, Pierre Ganty, Roberto Giacobazzi, Dusko Pavlovic
Sound up-to techniques and Complete abstract domains. CoRR (2018)
Filippo Bonchi, Pierre Ganty, Roberto Giacobazzi, Dusko Pavlovic
Sound up-to techniques and Complete abstract domains. LICS (2018)
Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy
Verification of Immediate Observation Population Protocols. CONCUR (2018)
Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy
Verification of Immediate Observation Population Protocols. CoRR (2018)
Pierre Ganty, Elena Gutiérrez
The Parikh Property for Weighted Context-Free Grammars. FSTTCS (2018)
Pierre Ganty, Elena Gutiérrez
The Parikh Property for Weighted Context-Free Grammars. CoRR (2018)
Bishoksan Kafle, John P. Gallagher, Pierre Ganty
Tree dimension in verification of constrained Horn clauses. Theory Pract. Log. Program. 18 (2) (2018)
Bishoksan Kafle, John P. Gallagher, Pierre Ganty
Tree dimension in verification of constrained Horn clauses. CoRR (2018)
Pierre Ganty, Elena Gutiérrez
Parikh Image of Pushdown Automata. CoRR (2017)
Pierre Ganty, Elena Gutiérrez
Parikh Image of Pushdown Automata. FCT (2017)
Pierre Ganty, Radu Iosif, Filip Konecný
Underapproximation of procedure summaries for integer programs. Int. J. Softw. Tools Technol. Transf. 19 (5) (2017)
Graeme Gange, Pierre Ganty, Peter J. Stuckey
Fixing the State Budget: Approximation of Regular Languages with Small DFAs. ATVA (2017)
Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty, Rupak Majumdar
Model checking parameterized asynchronous shared-memory systems. Formal Methods Syst. Des. 50 (2-3) (2017)
Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar
Verification of population protocols. Acta Informatica 54 (2) (2017)
Pierre Ganty, Boris Köpf, Pedro Valero
A Language-Theoretic View on Network Protocols. ATVA (2017)
Bishoksan Kafle, John P. Gallagher, Pierre Ganty
Solving non-linear Horn clauses using a linear Horn clause solver. HCVS@ETAPS (2016)
Javier Esparza, Pierre Ganty, Rupak Majumdar
Parameterized Verification of Asynchronous Shared-Memory Systems. J. ACM 63 (1) (2016)
Pierre Ganty, Boris Köpf, Pedro Valero
A Language-theoretic View on Network Protocols. CoRR (2016)
Pierre Ganty, Damir Valput
Bounded-oscillation Pushdown Automata. GandALF (2016)
Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar
Model Checking Population Protocols. FSTTCS (2016)
Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty, Rupak Majumdar
Model Checking Parameterized Asynchronous Shared-Memory Systems. CAV (1) (2015)
Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar
Verification of Population Protocols. CONCUR (2015)
Pierre Ganty, Samir Genaim, Ratan Lal, Pavithra Prabhakar
From non-zenoness verification to termination. MEMOCODE (2015)
Bishoksan Kafle, John P. Gallagher, Pierre Ganty
Decomposition by tree dimension in Horn clause verification. VPT@ETAPS (2015)
Michael Emmi, Pierre Ganty, Rupak Majumdar, Fernando Rosa-Velardo
Analysis of Asynchronous Programs with Event-Based Synchronization. ESOP (2015)
Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty, Rupak Majumdar
Model Checking Parameterized Asynchronous Shared-Memory Systems. CoRR (2015)
Pierre Ganty, Radu Iosif
Interprocedural Reachability for Flat Integer Programs. FCT (2015)
Pierre Ganty, Ahmed Rezine
Ordered Counter-Abstraction - Refinable Subword Relations for Parameterized Verification. LATA (2014)
Pierre Ganty, Radu Iosif
Generating Bounded Languages Using Bounded Control Sets. CoRR (2014)
Javier Esparza, Pierre Ganty, Tomás Poch
Pattern-Based Verification for Multithreaded Programs. ACM Trans. Program. Lang. Syst. 36 (3) (2014)
Javier Esparza, Pierre Ganty, Rupak Majumdar
Parameterized Verification of Asynchronous Shared-Memory Systems CoRR (2013)
Javier Esparza, Pierre Ganty, Rupak Majumdar
Parameterized Verification of Asynchronous Shared-Memory Systems. CAV (2013)
Pierre Ganty, Samir Genaim
Proving Termination Starting from the End. CAV (2013)
Pierre Ganty, Samir Genaim
Proving Termination Starting from the End CoRR (2013)
Pierre Ganty, Radu Iosif, Filip Konecný
Underapproximation of Procedure Summaries for Integer Programs. TACAS (2013)
Pierre Ganty, Rupak Majumdar
Algorithmic verification of asynchronous programs. ACM Trans. Program. Lang. Syst. 34 (1) (2012)
Javier Esparza, Pierre Ganty, Rupak Majumdar
A Perfect Model for Bounded Verification CoRR (2012)
Pierre Ganty, Radu Iosif, Filip Konecný
Underapproximation of Procedure Summaries for Integer Programs CoRR (2012)
Javier Esparza, Pierre Ganty, Rupak Majumdar
A Perfect Model for Bounded Verification. LICS (2012)
Pierre Ganty, Rupak Majumdar, Benjamin Monmege
Bounded underapproximations. Formal Methods Syst. Des. 40 (2) (2012)
Javier Esparza, Pierre Ganty
Complexity of pattern-based verification for multithreaded programs. POPL (2011)
Pierre Ganty, Mohamed Faouzi Atig
Approximating Petri Net Reachability Along Context-free Traces CoRR (2011)
Laura Bozzelli, Pierre Ganty
Complexity Analysis of the Backward Coverability Algorithm for VASS. RP (2011)
Pierre Ganty, Mark Marron
Preface. Electron. Notes Theor. Comput. Sci. 279 (1) (2011)
Mohamed Faouzi Atig, Pierre Ganty
Approximating Petri Net Reachability Along Context-free Traces. FSTTCS (2011)
Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger
Parikhʼs theorem: A simple and direct automaton construction. Inf. Process. Lett. 111 (12) (2011)
Pierre Ganty, Rupak Majumdar, Benjamin Monmege
Bounded Underapproximations. CAV (2010)
Pierre Ganty, Rupak Majumdar
Algorithmic Verification of Asynchronous Programs CoRR (2010)
Pierre Ganty, Nicolas Maquet, Jean-François Raskin
Fixed point guided abstraction refinement for alternating automata. Theor. Comput. Sci. 411 (38-39) (2010)
Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger
Parikh's Theorem: A simple and direct construction CoRR (2010)
Pierre Ganty, Nicolas Maquet, Jean-François Raskin
Fixpoint Guided Abstraction Refinement for Alternating Automata. CIAA (2009)
Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko
Verifying liveness for asynchronous programs. POPL (2009)
Pierre Ganty, Rupak Majumdar
Analyzing Real-Time Event-Driven Programs. FORMATS (2009)
Pierre Ganty, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
Le problème de couverture pour les réseaux de Petri. Résultats classiques et développements récents. Tech. Sci. Informatiques 28 (9) (2009)
Pierre Ganty, Jean-François Raskin, Laurent Van Begin
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets. Fundam. Informaticae 88 (3) (2008)
Pierre Ganty, Rupak Majumdar, Benjamin Monmege
Parikh-Equivalent Bounded Underapproximations CoRR (2008)
Pierre Ganty, Jean-François Raskin, Laurent Van Begin
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets. ICATPN (2007)
Patrick Cousot, Pierre Ganty, Jean-François Raskin
Fixpoint-Guided Abstraction Refinements. SAS (2007)
Pierre Ganty, Jean-François Raskin, Laurent Van Begin
A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. VMCAI (2006)
Javier Esparza, Pierre Ganty, Stefan Schwoon
Locality-Based Abstractions. SAS (2005)
Giorgio Delzanno, Pierre Ganty
Automatic Verification of Time Sensitive Cryptographic Protocols. TACAS (2004)
Alessandro Armando, Luca Compagna, Pierre Ganty
SAT-Based Model-Checking of Security Protocols Using Planning Graph Analysis. FME (2003)