| Algorithmic verification of asynchronous programs P Ganty, R Majumdar ACM Transactions on Programming Languages and Systems 34 (1), 2012 | 115 | 2012 |
| Verification of Population Protocols J Esparza, P Ganty, J Leroux, R Majumdar 26th International Conference on Concurrency Theory (CONCUR 2015) 42, 470-482, 2015 | 86 | 2015 |
| Parameterized Verification of Asynchronous Shared-Memory Systems J Esparza, P Ganty, R Majumdar International Conference on Computer Aided Verification 8044, 124-140, 2013 | 82 | 2013 |
| 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 | 73 | 2011 |
| Automatic verification of time sensitive cryptographic protocols G Delzanno, P Ganty International Conference on Tools and Algorithms for the Construction and …, 2004 | 66 | 2004 |
| 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 | 52 | 2020 |
| 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 | 52 | 2006 |
| 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 | 51 | 2003 |
| Fixpoint-guided abstraction refinements P Cousot, P Ganty, JF Raskin International Static Analysis Symposium, 333-348, 2007 | 49 | 2007 |
| Bounded Underapproximations P Ganty, R Majumdar, B Monmege Formal Methods in System Design, 2012 | 48 | 2012 |
| Complexity analysis of the backward coverability algorithm for VASS L Bozzelli, P Ganty International Workshop on Reachability Problems, 96-109, 2011 | 48 | 2011 |
| Complexity of pattern-based verification for multithreaded programs J Esparza, P Ganty ACM SIGPLAN Notices 46 (1), 499-510, 2011 | 45 | 2011 |
| Verifying liveness for asynchronous programs P Ganty, R Majumdar, A Rybalchenko Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of …, 2009 | 41 | 2009 |
| Proving termination starting from the end P Ganty, S Genaim Computer Aided Verification: 25th International Conference, CAV 2013, Saint …, 2013 | 38 | 2013 |
| Approximating Petri Net Reachability Along Context-free Traces P Ganty, MF Atig IARCS Annual Conference on Foundations of Software Technology and …, 2011 | 37 | 2011 |
| A Perfect Model for Bounded Verification J Esparza, P Ganty, R Majumdar Symposium on Logic in Computer Science (LICS), 2012 | 36 | 2012 |
| 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 | 35 | 2008 |
| 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 | 30 | 2014 |
| 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 | 23* | 2007 |
Rupak MajumdarMPI for Software Systemsmpi-sws.org의 이메일 확인됨