| The 4th reactive synthesis competition (SYNTCOMP 2017): Benchmarks, participants & results S Jacobs, N Basset, R Bloem, R Brenguier, M Colange, P Faymonville, ... arXiv preprint arXiv:1711.11439, 2017 | 29 | 2017 |
| A method-based ahead-of-time compiler for android applications CS Wang, G Perez, YC Chung, WC Hsu, WK Shih, HR Hsu Proceedings of the 14th international conference on Compilers, architectures …, 2011 | 27 | 2011 |
| The first reactive synthesis competition (SYNTCOMP 2014) S Jacobs, R Bloem, R Brenguier, R Ehlers, T Hell, R Könighofer, ... International journal on software tools for technology transfer 19 (3), 367-390, 2017 | 26 | 2017 |
| Non-zero sum games for reactive synthesis R Brenguier, L Clemente, P Hunter, GA Pérez, M Randour, JF Raskin, ... Language and Automata Theory and Applications, 3-23, 2016 | 26 | 2016 |
| AbsSynthe: abstract synthesis from succinct safety specifications R Brenguier, GA Pérez, JF Raskin, O Sankur arXiv preprint arXiv:1407.5961, 2014 | 22 | 2014 |
| The Second Reactive Synthesis Competition (SYNTCOMP 2015) AW Swen Jacobs, Roderick Bloem, Romain Brenguier, Robert Könighofer ... Proceedings Fourth Workshop on Synthesis, SYNT 2015, San Francisco, CA, USA …, 2016 | 19* | 2016 |
| A hybrid just-in-time compiler for android: comparing jit types and the result of cooperation GA Perez, CM Kao, YC Chung, WC Hsu Proceedings of the 2012 international conference on Compilers, architectures …, 2012 | 18 | 2012 |
| Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints J Kretinsky, GA Perez, JF Raskin CONCUR, 2018 | 16 | 2018 |
| The 3rd reactive synthesis competition (SYNTCOMP 2016): Benchmarks, participants & results S Jacobs, R Bloem, R Brenguier, A Khalimov, F Klein, R Könighofer, ... arXiv preprint arXiv:1609.00507, 2016 | 16 | 2016 |
| Mean-payoff games with partial observation P Hunter, A Pauly, GA Pérez, JF Raskin Theoretical Computer Science 735, 82-110, 2018 | 14* | 2018 |
| The fixed initial credit problem for partial-observation energy games is Ack-complete GA Pérez Information processing letters 118, 91-99, 2017 | 13* | 2017 |
| When is containment decidable for probabilistic automata? L Daviaud, M Jurdzinski, R Lazic, F Mazowiecki, GA Perez, J Worrell ICALP, 2018 | 11 | 2018 |
| On Delay and Regret Determinization of Max-Plus Automata E Filiot, I Jecker, N Lhote, GA Pérez, JF Raskin LICS, 2017 | 11 | 2017 |
| Admissibility in Quantitative Graph Games R Brenguier, GA Pérez, JF Raskin, O Sankur 36th IARCS Annual Conference FSTTCS, 2016 | 10 | 2016 |
| Compositional algorithms for succinct safety games R Brenguier, GA Pérez, JF Raskin, O Sankur arXiv preprint arXiv:1602.01174, 2016 | 9 | 2016 |
| On the complexity of reachability in parametric Markov decision processes T Winkler, S Junges, GA Pérez, JP Katoen CONCUR, 2019 | 8 | 2019 |
| Looking at mean payoff through foggy windows P Hunter, GA Pérez, JF Raskin Acta Informatica 55 (8), 627-647, 2018 | 6 | 2018 |
| Reactive synthesis without regret P Hunter, GA Pérez, JF Raskin Acta informatica 54 (1), 3-39, 2017 | 6 | 2017 |
| Reduction Techniques for Model Checking and Learning in MDPs S Bharadwaj, S Le Roux, GA Pérez, U Topcu IJCAI, 2017 | 6 | 2017 |
| Weak Cost Register Automata are Still Powerful S Almagor, M Cadilhac, F Mazowiecki, GA Pérez International Journal of Foundations of Computer Science 31 (06), 689-709, 2020 | 5 | 2020 |
Jean-François RaskinUniversité Libre de Bruxelles, U.L.B.Verified email at ulb.ac.be
