Pierre Ganty

According to our database, Pierre Ganty authored at least 54 papers between 2003 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Antichains Algorithms for the Inclusion Problem Between ømega-VPL.

Kyveli Doveri, Pierre Ganty, Luka Hadzi-Dokic

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

2022

Online Simulation Reduction.

Pierre Ganty, Nicolas Manini, Francesco Ranzato

CoRR, 2022

FORQ-Based Language Inclusion Formal Testing.

Kyveli Doveri, Pierre Ganty, Nicolas Mazzocchi

Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2021

Complete Abstractions for Checking Language Inclusion.

Pierre Ganty, Francesco Ranzato, Pedro Valero

ACM Trans. Comput. Log., 2021

A Congruence-Based Perspective on Finite Tree Automata.

Pierre Ganty, Elena Gutiérrez, Pedro Valero

Fundam. Informaticae, 2021

Inclusion Testing of Büchi Automata Based on Well-Quasiorders.

Kyveli Doveri, Pierre Ganty, Francesco Parolini, Francesco Ranzato

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020

CacheQuery: learning replacement policies from hardware caches.

Pepe Vila, Pierre Ganty, Marco Guarnieri, Boris Köpf

Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

A Quasiorder-Based Perspective on Residual Automata.

Pierre Ganty, Elena Gutiérrez, Pedro Valero

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Language Inclusion Algorithms as Complete Abstract Interpretations.

Pierre Ganty, Francesco Ranzato, Pedro Valero

Proceedings of the Static Analysis - 26th International Symposium, 2019

A Congruence-based Perspective on Automata Minimization Algorithms.

Pierre Ganty, Elena Gutiérrez, Pedro Valero

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Regular Expression Search on Compressed Text.

Pierre Ganty, Pedro Valero

Proceedings of the Data Compression Conference, 2019

2018

Tree dimension in verification of constrained Horn clauses.

Bishoksan Kafle, John P. Gallagher, Pierre Ganty

Theory Pract. Log. Program., 2018

Sound up-to techniques and Complete abstract domains.

Filippo Bonchi, Pierre Ganty, Roberto Giacobazzi, Dusko Pavlovic

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

The Parikh Property for Weighted Context-Free Grammars.

Pierre Ganty, Elena Gutiérrez

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Verification of Immediate Observation Population Protocols.

Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy

Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017

Underapproximation of procedure summaries for integer programs.

Pierre Ganty, Radu Iosif, Filip Konecný

Int. J. Softw. Tools Technol. Transf., 2017

Model checking parameterized asynchronous shared-memory systems.

Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty, Rupak Majumdar

Formal Methods Syst. Des., 2017

Verification of population protocols.

Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar

Acta Informatica, 2017

Parikh Image of Pushdown Automata.

Pierre Ganty, Elena Gutiérrez

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

A Language-Theoretic View on Network Protocols.

Pierre Ganty, Boris Köpf, Pedro Valero

Proceedings of the Automated Technology for Verification and Analysis, 2017

Fixing the State Budget: Approximation of Regular Languages with Small DFAs.

Graeme Gange, Pierre Ganty, Peter J. Stuckey

Proceedings of the Automated Technology for Verification and Analysis, 2017

2016

Parameterized Verification of Asynchronous Shared-Memory Systems.

Javier Esparza, Pierre Ganty, Rupak Majumdar

J. ACM, 2016

Solving non-linear Horn clauses using a linear Horn clause solver.

Bishoksan Kafle, John P. Gallagher, Pierre Ganty

Proceedings of the Proceedings 3rd Workshop on Horn Clauses for Verification and Synthesis, 2016

Bounded-oscillation Pushdown Automata.

Pierre Ganty, Damir Valput

Proceedings of the Seventh International Symposium on Games, 2016

Model Checking Population Protocols.

Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Decomposition by tree dimension in Horn clause verification.

Bishoksan Kafle, John P. Gallagher, Pierre Ganty

Proceedings of the Third International Workshop on Verification and Program Transformation, 2015

From non-zenoness verification to termination.

Pierre Ganty, Samir Genaim, Ratan Lal, Pavithra Prabhakar

Proceedings of the 13. ACM/IEEE International Conference on Formal Methods and Models for Codesign, 2015

Interprocedural Reachability for Flat Integer Programs.

Pierre Ganty, Radu Iosif

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

Analysis of Asynchronous Programs with Event-Based Synchronization.

Michael Emmi, Pierre Ganty, Rupak Majumdar, Fernando Rosa-Velardo

Proceedings of the Programming Languages and Systems, 2015

2014

Pattern-Based Verification for Multithreaded Programs.

Javier Esparza, Pierre Ganty, Tomás Poch

ACM Trans. Program. Lang. Syst., 2014

Generating Bounded Languages Using Bounded Control Sets.

Pierre Ganty, Radu Iosif

CoRR, 2014

Ordered Counter-Abstraction - Refinable Subword Relations for Parameterized Verification.

Pierre Ganty, Ahmed Rezine

Proceedings of the Language and Automata Theory and Applications, 2014

2013

Proving Termination Starting from the End.

Pierre Ganty, Samir Genaim

Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012

Algorithmic verification of asynchronous programs.

Pierre Ganty, Rupak Majumdar

ACM Trans. Program. Lang. Syst., 2012

Bounded underapproximations.

Pierre Ganty, Rupak Majumdar, Benjamin Monmege

Formal Methods Syst. Des., 2012

A Perfect Model for Bounded Verification.

Javier Esparza, Pierre Ganty, Rupak Majumdar

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011

Parikhʼs theorem: A simple and direct automaton construction.

Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger

Inf. Process. Lett., 2011

Preface.

Pierre Ganty, Mark Marron

Proceedings of the Sixth Workshop on Bytecode Semantics, 2011

Complexity Analysis of the Backward Coverability Algorithm for VASS.

Laura Bozzelli, Pierre Ganty

Proceedings of the Reachability Problems - 5th International Workshop, 2011

Complexity of pattern-based verification for multithreaded programs.

Javier Esparza, Pierre Ganty

Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Approximating Petri Net Reachability Along Context-free Traces.

Mohamed Faouzi Atig, Pierre Ganty

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010

Fixed point guided abstraction refinement for alternating automata.

Pierre Ganty, Nicolas Maquet, Jean-François Raskin

Theor. Comput. Sci., 2010

Parikh's Theorem: A simple and direct construction

Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger

CoRR, 2010

2009

Le problème de couverture pour les réseaux de Petri. Résultats classiques et développements récents.

Pierre Ganty, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin

Tech. Sci. Informatiques, 2009

Fixpoint Guided Abstraction Refinement for Alternating Automata.

Pierre Ganty, Nicolas Maquet, Jean-François Raskin

Proceedings of the Implementation and Application of Automata, 2009

Verifying liveness for asynchronous programs.

Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko

Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2009

Analyzing Real-Time Event-Driven Programs.

Pierre Ganty, Rupak Majumdar

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2009

2008

From Many Places to Few: Automatic Abstraction Refinement for Petri Nets.

Pierre Ganty, Jean-François Raskin, Laurent Van Begin

Fundam. Informaticae, 2008

Parikh-Equivalent Bounded Underapproximations

Pierre Ganty, Rupak Majumdar, Benjamin Monmege

CoRR, 2008

2007

Fixpoint-Guided Abstraction Refinements.

Patrick Cousot, Pierre Ganty, Jean-François Raskin

Proceedings of the Static Analysis, 14th International Symposium, 2007

2006

A Complete Abstract Interpretation Framework for Coverability Properties of WSTS.

Pierre Ganty, Jean-François Raskin, Laurent Van Begin

Proceedings of the Verification, 2006

2005

Locality-Based Abstractions.

Javier Esparza, Pierre Ganty, Stefan Schwoon

Proceedings of the Static Analysis, 12th International Symposium, 2005

2004

Automatic Verification of Time Sensitive Cryptographic Protocols.

Giorgio Delzanno, Pierre Ganty

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

2003

SAT-Based Model-Checking of Security Protocols Using Planning Graph Analysis.

Alessandro Armando, Luca Compagna, Pierre Ganty

Proceedings of the FME 2003: Formal Methods, 2003