Pierre Ganty
Pierre Ganty
Associate Research Professor, IMDEA Software Institute
Bestätigte E-Mail-Adresse bei imdea.org - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Algorithmic verification of asynchronous programs
P Ganty, R Majumdar
ACM Transactions on Programming Languages and Systems 34 (1), 2012
942012
Parikhʼs theorem: A simple and direct automaton construction
J Esparza, P Ganty, S Kiefer, M Luttenberger
Information Processing Letters 111 (12), 614-619, 2011
642011
Automatic verification of time sensitive cryptographic protocols
G Delzanno, P Ganty
International Conference on Tools and Algorithms for the Construction and …, 2004
622004
Verification of Population Protocols
J Esparza, P Ganty, J Leroux, R Majumdar
26th International Conference on Concurrency Theory (CONCUR 2015) 42, 470-482, 2015
582015
Parameterized Verification of Asynchronous Shared-Memory Systems
J Esparza, P Ganty, R Majumdar
International Conference on Computer Aided Verification 8044, 124-140, 2013
572013
SAT-based model-checking of security protocols using planning graph analysis
A Armando, L Compagna, P Ganty
International Symposium of Formal Methods Europe, 875-893, 2003
512003
A complete abstract interpretation framework for coverability properties of WSTS
P Ganty, JF Raskin, L Van Begin
International Workshop on Verification, Model Checking, and Abstract …, 2006
492006
Fixpoint-guided abstraction refinements
P Cousot, P Ganty, JF Raskin
International Static Analysis Symposium, 333-348, 2007
452007
Complexity of pattern-based verification for multithreaded programs
J Esparza, P Ganty
ACM SIGPLAN Notices 46 (1), 499-510, 2011
442011
Proving termination starting from the end
P Ganty, S Genaim
International Conference on Computer Aided Verification, 397-412, 2013
382013
Verifying liveness for asynchronous programs
P Ganty, R Majumdar, A Rybalchenko
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of …, 2009
372009
Complexity analysis of the backward coverability algorithm for VASS
L Bozzelli, P Ganty
International Workshop on Reachability Problems, 96-109, 2011
362011
A Perfect Model for Bounded Verification
J Esparza, P Ganty, R Majumdar
Symposium on Logic in Computer Science (LICS), 2012
312012
From many places to few: Automatic abstraction refinement for Petri nets
P Ganty, JF Raskin, L Van Begin
Fundamenta Informaticae 88 (3), 275-305, 2008
302008
Approximating Petri Net Reachability Along Context-free Traces
P Ganty, MF Atig
IARCS Annual Conference on Foundations of Software Technology and …, 2011
29*2011
Bounded Underapproximations
P Ganty, R Majumdar, B Monmege
Formal Methods in System Design, 2012
272012
Pattern-based verification for multithreaded programs
J Esparza, P Ganty, T Poch
ACM Transactions on Programming Languages and Systems (TOPLAS) 36 (3), 1-29, 2014
252014
Underapproximation of procedure summaries for integer programs
P Ganty, R Iosif, F Konečný
International Conference on Tools and Algorithms for the Construction and …, 2013
24*2013
Bounded underapproximations
P Ganty, R Majumdar, B Monmege
International Conference on Computer Aided Verification, 600-614, 2010
242010
Symbolic data structure for sets of k-uples
P Ganty, C Meuter, G Delzanno, G Kalyon, JF Raskin, L Van Begin
Technical report, Université Libre de Bruxelles, 2007
19*2007
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20