Folgen
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
1132012
Parameterized Verification of Asynchronous Shared-Memory Systems
J Esparza, P Ganty, R Majumdar
International Conference on Computer Aided Verification 8044, 124-140, 2013
762013
Verification of Population Protocols
J Esparza, P Ganty, J Leroux, R Majumdar
26th International Conference on Concurrency Theory (CONCUR 2015) 42, 470-482, 2015
732015
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
662011
Automatic verification of time sensitive cryptographic protocols
G Delzanno, P Ganty
Tools and Algorithms for the Construction and Analysis of Systems: 10th …, 2004
652004
SAT-based model-checking of security protocols using planning graph analysis
A Armando, L Compagna, P Ganty
FME 2003: Formal Methods: International Symposium of Formal Methods Europe …, 2003
522003
A Complete Abstract Interpretation Framework for Coverability Properties of WSTS
P Ganty, JF Raskin, L Van Begin
Verification, Model Checking, and Abstract Interpretation: 7th International …, 2006
512006
Bounded Underapproximations
P Ganty, R Majumdar, B Monmege
Formal Methods in System Design, 2012
482012
Fixpoint-guided abstraction refinements
P Cousot, P Ganty, JF Raskin
Static Analysis: 14th International Symposium, SAS 2007, Kongens Lyngby …, 2007
472007
Complexity of pattern-based verification for multithreaded programs
J Esparza, P Ganty
ACM SIGPLAN Notices 46 (1), 499-510, 2011
442011
Verifying liveness for asynchronous programs
P Ganty, R Majumdar, A Rybalchenko
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of …, 2009
412009
Complexity analysis of the backward coverability algorithm for VASS
L Bozzelli, P Ganty
Reachability Problems: 5th International Workshop, RP 2011, Genoa, Italy …, 2011
392011
Proving termination starting from the end
P Ganty, S Genaim
Computer Aided Verification: 25th International Conference, CAV 2013, Saint …, 2013
372013
A Perfect Model for Bounded Verification
J Esparza, P Ganty, R Majumdar
Symposium on Logic in Computer Science (LICS), 2012
372012
Approximating Petri Net Reachability Along Context-free Traces
P Ganty, MF Atig
IARCS Annual Conference on Foundations of Software Technology and …, 2011
332011
Parameterized verification of asynchronous shared-memory systems
J Esparza, P Ganty, R Majumdar
Journal of the ACM (JACM) 63 (1), 1-48, 2016
322016
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
322008
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
302014
CacheQuery: Learning replacement policies from hardware caches
P Vila, P Ganty, M Guarnieri, B Köpf
Proceedings of the 41st ACM SIGPLAN Conference on Programming Language …, 2020
292020
Underapproximation of procedure summaries for integer programs
P Ganty, R Iosif, F Konečný
Tools and Algorithms for the Construction and Analysis of Systems: 19th …, 2013
26*2013
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20