| Language inclusion algorithms as complete abstract interpretations P Ganty, F Ranzato, P Valero International Static Analysis Symposium, 140-161, 2019 | 8 | 2019 |
| Regular expression search on compressed text P Ganty, P Valero 2019 Data Compression Conference (DCC), 528-537, 2019 | 6 | 2019 |
| A congruence-based perspective on automata minimization algorithms P Ganty, E Gutiérrez, P Valero arXiv preprint arXiv:1906.06194, 2019 | 5 | 2019 |
| A language-theoretic view on network protocols P Ganty, B Köpf, P Valero Automated Technology for Verification and Analysis: 15th International …, 2017 | 5 | 2017 |
| Complete abstractions for checking language inclusion P Ganty, F Ranzato, P Valero ACM Transactions on Computational Logic (TOCL) 22 (4), 1-40, 2021 | 4 | 2021 |
| A quasiorder-based perspective on residual automata P Ganty, E Gutiérrez, P Valero arXiv preprint arXiv:2007.00359, 2020 | 1 | 2020 |
| A Congruence-Based Perspective on Finite Tree Automata P Ganty, E Gutiérrez, P Valero Fundamenta Informaticae 184 (1), 1-47, 2021 | | 2021 |
| On the Use of Quasiorders in Formal Language Theory P Valero arXiv preprint arXiv:2008.08828, 2020 | | 2020 |
| Regular Expression Search in Compressed Text P Valero, P Ganty, J Esparza | | |
Pierre GantyAssociate Research Professor, IMDEA Software Institute在 imdea.org 的电子邮件经过验证
