Pierre Ganty

	2012
25		Pierre Ganty, Rupak Majumdar: Algorithmic verification of asynchronous programs. ACM Trans. Program. Lang. Syst. 34(1): 6 (2012)
24		Javier Esparza, Pierre Ganty, Rupak Majumdar: A Perfect Model for Bounded Verification CoRR abs/1201.3194: (2012)
23		Pierre Ganty, Rupak Majumdar, Benjamin Monmege: Bounded underapproximations. Formal Methods in System Design 40(2): 206-231 (2012)
	2011
22		Mohamed Faouzi Atig, Pierre Ganty: Approximating Petri Net Reachability Along Context-free Traces. FSTTCS 2011: 152-163
21		Javier Esparza, Pierre Ganty: Complexity of pattern-based verification for multithreaded programs. POPL 2011: 499-510
20		Laura Bozzelli, Pierre Ganty: Complexity Analysis of the Backward Coverability Algorithm for VASS. RP 2011: 96-109
19		Pierre Ganty, Mohamed Faouzi Atig: Approximating Petri Net Reachability Along Context-free Traces CoRR abs/1105.1657: (2011)
18		Pierre Ganty, Mark Marron: Preface. Electr. Notes Theor. Comput. Sci. 279(1): 1 (2011)
17		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)
	2010
16		Pierre Ganty, Rupak Majumdar, Benjamin Monmege: Bounded Underapproximations. CAV 2010: 600-614
15		Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger: Parikh's Theorem: A simple and direct construction CoRR abs/1006.3825: (2010)
14		Pierre Ganty, Rupak Majumdar: Algorithmic Verification of Asynchronous Programs CoRR abs/1011.0551: (2010)
13		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)
	2009
12		Pierre Ganty, Nicolas Maquet, Jean-François Raskin: Fixpoint Guided Abstraction Refinement for Alternating Automata. CIAA 2009: 155-164
11		Pierre Ganty, Rupak Majumdar: Analyzing Real-Time Event-Driven Programs. FORMATS 2009: 164-178
10		Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko: Verifying liveness for asynchronous programs. POPL 2009: 102-113
9		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)
	2008
8		Pierre Ganty, Rupak Majumdar, Benjamin Monmege: Parikh-Equivalent Bounded Underapproximations CoRR abs/0809.1236: (2008)
7		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)
	2007
6		Pierre Ganty, Jean-François Raskin, Laurent Van Begin: From Many Places to Few: Automatic Abstraction Refinement for Petri Nets. ICATPN 2007: 124-143
5		Patrick Cousot, Pierre Ganty, Jean-François Raskin: Fixpoint-Guided Abstraction Refinements. SAS 2007: 333-348
	2006
4		Pierre Ganty, Jean-François Raskin, Laurent Van Begin: A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. VMCAI 2006: 49-64
	2005
3		Javier Esparza, Pierre Ganty, Stefan Schwoon: Locality-Based Abstractions. SAS 2005: 118-134
	2004
2		Giorgio Delzanno, Pierre Ganty: Automatic Verification of Time Sensitive Cryptographic Protocols. TACAS 2004: 342-356
	2003
1		Alessandro Armando, Luca Compagna, Pierre Ganty: SAT-Based Model-Checking of Security Protocols Using Planning Graph Analysis. FME 2003: 875-893

Coauthor Index

1	Alessandro Armando	[1]
2	Mohamed Faouzi Atig	[19] [22]
3	Laurent Van Begin	[4] [6] [7] [9]
4	Laura Bozzelli	[20]
5	Luca Compagna	[1]
6	Patrick Cousot	[5]
7	Giorgio Delzanno	[2]
8	Javier Esparza	[3] [15] [17] [21] [24]
9	Gilles Geeraerts	[9]
10	Stefan Kiefer	[15] [17]
11	Michael Luttenberger	[15] [17]
12	Rupak Majumdar	[8] [10] [11] [14] [16] [23] [24] [25]
13	Nicolas Maquet	[12] [13]
14	Mark Marron	[18]
15	Benjamin Monmege	[8] [16] [23]
16	Jean-François Raskin	[4] [5] [6] [7] [9] [12] [13]
17	Andrey Rybalchenko	[10]
18	Stefan Schwoon	[3]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page