| Model checking parameterized asynchronous shared-memory systems A Durand-Gasselin, J Esparza, P Ganty, R Majumdar Computer Aided Verification: 27th International Conference, CAV 2015, San …, 2015 | 19 | 2015 |
| On the use of non-deterministic automata for Presburger arithmetic A Durand-Gasselin, P Habermehl International Conference on Concurrency Theory, 373-387, 2010 | 16 | 2010 |
| From monadic second-order definable string transformations to transducers R Alur, A Durand-Gasselin, A Trivedi 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 458-467, 2013 | 14 | 2013 |
| Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree A Durand-Gasselin, P Habermehl STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 242-253, 2012 | 13 | 2012 |
| Model checking parameterized asynchronous shared-memory systems A Durand-Gasselin, J Esparza, P Ganty, R Majumdar Formal Methods in System Design 50, 140-167, 2017 | 12 | 2017 |
| Regular transformations of data words through origin information A Durand-Gasselin, P Habermehl International Conference on Foundations of Software Science and Computation …, 2016 | 7 | 2016 |
| Automata Based Logics for Program Verification A Durand-Gasselin Université libre de Bruxelles, 2013 | | 2013 |
| Is the generic algorithm for first-order model-checking automatic structures optimal? ADGP Habermehl | | 2013 |
