Pierre Ganty

Pierre Ganty, Radu Iosif, Filip Konecný: Underapproximation of Procedure Summaries for Integer Programs. TACAS 2013: 245-259

Pierre Ganty, Samir Genaim: Proving Termination Starting from the End. CoRR abs/1302.4539 (2013)

Javier Esparza, Pierre Ganty, Rupak Majumdar: Parameterized Verification of Asynchronous Shared-Memory Systems. CoRR abs/1304.1185 (2013)

Pierre Ganty, Rupak Majumdar, Benjamin Monmege: Bounded underapproximations. Formal Methods in System Design 40(2): 206-231 (2012)

Pierre Ganty, Rupak Majumdar: Algorithmic verification of asynchronous programs. ACM Trans. Program. Lang. Syst. 34(1): 6 (2012)

Javier Esparza, Pierre Ganty, Rupak Majumdar: A Perfect Model for Bounded Verification. LICS 2012: 285-294

Javier Esparza, Pierre Ganty, Rupak Majumdar: A Perfect Model for Bounded Verification. CoRR abs/1201.3194 (2012)

Pierre Ganty, Radu Iosif, Filip Konecný: Underapproximation of Procedure Summaries for Integer Programs. CoRR abs/1210.4289 (2012)

Pierre Ganty, Mark Marron: Preface. Electr. Notes Theor. Comput. Sci. 279(1): 1 (2011)

Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger: Parikhʼs theorem: A simple and direct automaton construction. Inf. Process. Lett. 111(12): 614-619 (2011)

Mohamed Faouzi Atig, Pierre Ganty: Approximating Petri Net Reachability Along Context-free Traces. FSTTCS 2011: 152-163

Javier Esparza, Pierre Ganty: Complexity of pattern-based verification for multithreaded programs. POPL 2011: 499-510

Laura Bozzelli, Pierre Ganty: Complexity Analysis of the Backward Coverability Algorithm for VASS. RP 2011: 96-109

Pierre Ganty, Mohamed Faouzi Atig: Approximating Petri Net Reachability Along Context-free Traces. CoRR abs/1105.1657 (2011)

Pierre Ganty, Nicolas Maquet, Jean-François Raskin: Fixed point guided abstraction refinement for alternating automata. Theor. Comput. Sci. 411(38-39): 3444-3459 (2010)

Pierre Ganty, Rupak Majumdar, Benjamin Monmege: Bounded Underapproximations. CAV 2010: 600-614

Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger: Parikh's Theorem: A simple and direct construction. CoRR abs/1006.3825 (2010)

Pierre Ganty, Rupak Majumdar: Algorithmic Verification of Asynchronous Programs. CoRR abs/1011.0551 (2010)

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. Technique et Science Informatiques 28(9): 1107-1142 (2009)

Pierre Ganty, Rupak Majumdar: Analyzing Real-Time Event-Driven Programs. FORMATS 2009: 164-178

Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko: Verifying liveness for asynchronous programs. POPL 2009: 102-113

Pierre Ganty, Nicolas Maquet, Jean-François Raskin: Fixpoint Guided Abstraction Refinement for Alternating Automata. CIAA 2009: 155-164

Pierre Ganty, Jean-François Raskin, Laurent Van Begin: From Many Places to Few: Automatic Abstraction Refinement for Petri Nets. Fundam. Inform. 88(3): 275-305 (2008)

Pierre Ganty, Rupak Majumdar, Benjamin Monmege: Parikh-Equivalent Bounded Underapproximations. CoRR abs/0809.1236 (2008)

Pierre Ganty, Jean-François Raskin, Laurent Van Begin: From Many Places to Few: Automatic Abstraction Refinement for Petri Nets. ICATPN 2007: 124-143

Patrick Cousot, Pierre Ganty, Jean-François Raskin: Fixpoint-Guided Abstraction Refinements. SAS 2007: 333-348

Pierre Ganty, Jean-François Raskin, Laurent Van Begin: A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. VMCAI 2006: 49-64

Javier Esparza, Pierre Ganty, Stefan Schwoon: Locality-Based Abstractions. SAS 2005: 118-134

Giorgio Delzanno, Pierre Ganty: Automatic Verification of Time Sensitive Cryptographic Protocols. TACAS 2004: 342-356

Alessandro Armando, Luca Compagna, Pierre Ganty: SAT-Based Model-Checking of Security Protocols Using Planning Graph Analysis. FME 2003: 875-893