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.
|DCC 2019||Regular Expression Search on Compressed Text
‣ arXiv report
|FSTTCS 2018||The Parikh Property for Weighted Context-Free Grammars
|CONCUR 2018||Verification of Immediate Observation Population Protocols
‣ arXiv report
|LICS 2018||Sound up-to techniques and Complete abstract domains|
|TPLP 2017||Tree dimension in verification of constrained Horn clauses
‣ arXiv report of the accepted version
|FCT 2017||Parikh Image of Pushdown Automata
|ATVA 2017||Fixing the State Budget: Approximation of Regular Languages with Small DFAs
|ATVA 2017||A Language-theoretic View on Network Protocols
‣ this arXiv report contains a preliminary version
Complete list (dblp)
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 © 2019 Pierre Ganty