Seuraa
Pierre Ganty
Pierre Ganty
Associate Research Professor, IMDEA Software Institute
Vahvistettu sähköpostiosoite verkkotunnuksessa imdea.org - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Algorithmic verification of asynchronous programs
P Ganty, R Majumdar
ACM Transactions on Programming Languages and Systems 34 (1), 2012
1152012
Verification of Population Protocols
J Esparza, P Ganty, J Leroux, R Majumdar
26th International Conference on Concurrency Theory (CONCUR 2015) 42, 470-482, 2015
842015
Parameterized Verification of Asynchronous Shared-Memory Systems
J Esparza, P Ganty, R Majumdar
International Conference on Computer Aided Verification 8044, 124-140, 2013
802013
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
732011
Automatic verification of time sensitive cryptographic protocols
G Delzanno, P Ganty
International Conference on Tools and Algorithms for the Construction and …, 2004
662004
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
522006
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
512003
Complexity analysis of the backward coverability algorithm for VASS
L Bozzelli, P Ganty
International Workshop on Reachability Problems, 96-109, 2011
492011
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
482020
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
International Static Analysis Symposium, 333-348, 2007
482007
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
Proving termination starting from the end
P Ganty, S Genaim
Computer Aided Verification: 25th International Conference, CAV 2013, Saint …, 2013
362013
A Perfect Model for Bounded Verification
J Esparza, P Ganty, R Majumdar
Symposium on Logic in Computer Science (LICS), 2012
362012
Approximating Petri Net Reachability Along Context-free Traces
P Ganty, MF Atig
IARCS Annual Conference on Foundations of Software Technology and …, 2011
352011
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
352008
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
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
27*2013
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
22*2007
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20