I am an associate Research Professor at the IMDEA Software Institute doing research in the fields of verification, language theory and automata theory. You can find more about my research output on DBLP, Google Scholar, ORCID, and GitHub.
Venue | Title |
---|---|
TACAS 2023 | Antichains Algorithms for the Inclusion Problem Between
ω-VPL |
CAV 2022 | FORQ-based
Language Inclusion Formal Testing ‣ arXiv report |
Fundamenta Informaticæ | A Congruence-Based Perspective on Finite Tree Automata |
CONCUR 2021 | Inclusion
Testing of Büchi Automata based on Well-quasiorders |
TOCL 2021 | Complete
Abstractions for Checking Language Inclusion ‣ arXiv report |
MFCS 2020 | A
Quasiorder-based Perspective on Residual Automata ‣ arXiv report |
PLDI 2020 | CacheQuery:
Learning Replacement Policies from Hardware Caches ‣ arXiv report |
Pierre joined the IMDEA Software Institute in September 2009 after completing a nearly two years postdoc at the UCLA. He holds a joint PhD degree in Computer Science from the Université Libre de Bruxelles and from the Università Degli Studi di Genova, Italy that he obtained late 2007.
Further details in my CV.
Algorithmic verification techniques: design, complexity study and implementation. Verification of software systems with infinitely many states: unbounded control and/or data. Algorithmic model based bug finding techniques. Abstract Interpretation. Automatic refinement of abstract domains. Automata theory and Formal Languages. Petri nets.
IMDEA Software
Institute
Edificio IMDEA Software
Campus Montegancedo UPM
28223-Pozuelo de Alarcón, Madrid
Telephone: +34-91-101-2202 ext 4106
Copyright © 2023 Pierre Ganty