| Expressive languages for path queries over graph-structured data P Barceló, L Libkin, AW Lin, PT Wood ACM Transactions on Database Systems (TODS) 37 (4), 1-46, 2012 | 271 | 2012 |
| Decision procedures for path feasibility of string-manipulating programs with complex operations T Chen, M Hague, AW Lin, P Rümmer, Z Wu Proceedings of the ACM on Programming Languages 3 (POPL), 1-30, 2019 | 125 | 2019 |
| String solving with word equations and transducers: towards a logic for analysing mutation XSS AW Lin, P Barceló Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2016 | 105 | 2016 |
| String constraints with concatenation and transducers solved efficiently L Holík, P Janků, AW Lin, P Rümmer, T Vojnar Proceedings of the ACM on Programming Languages 2 (POPL), 1-32, 2017 | 91 | 2017 |
| Parikh images of grammars: Complexity and applications E Kopczynski, AW To 2010 25th Annual IEEE Symposium on Logic in Computer Science, 80-89, 2010 | 90 | 2010 |
| Model checking recursive programs with numeric data types M Hague, AW Lin International Conference on Computer Aided Verification, 743-759, 2011 | 76 | 2011 |
| What is decidable about string constraints with the replaceall function T Chen, Y Chen, M Hague, AW Lin, Z Wu Proceedings of the ACM on Programming Languages 2 (POPL), 1-29, 2017 | 74 | 2017 |
| Solving string constraints with regex-dependent functions through transducers with priorities and variables T Chen, A Flores-Lamas, M Hague, Z Han, D Hu, S Kan, AW Lin, ... Proceedings of the ACM on Programming Languages 6 (POPL), 1-31, 2022 | 64 | 2022 |
| Unary finite automata vs. arithmetic progressions AW To Information Processing Letters 109 (17), 1010-1014, 2009 | 60 | 2009 |
| Model checking infinite-state systems: generic and specific approaches AW To The University of Edinburgh, 2010 | 54 | 2010 |
| Quadratic word equations with length constraints, counter systems, and presburger arithmetic with divisibility AW Lin, R Majumdar Logical Methods in Computer Science 17, 2021 | 50 | 2021 |
| Learning to prove safety over parameterised concurrent systems YF Chen, CD Hong, AW Lin, P Rümmer 2017 Formal Methods in Computer Aided Design (FMCAD), 76-83, 2017 | 48 | 2017 |
| Algorithmic metatheorems for decidable LTL model checking over infinite systems AW To, L Libkin International Conference on Foundations of Software Science and …, 2010 | 46 | 2010 |
| On the computational complexity of verifying one-counter processes S Goller, R Mayr, AW To 2009 24th Annual IEEE Symposium on Logic In Computer Science, 235-244, 2009 | 42 | 2009 |
| Liveness of randomised parameterised systems under arbitrary schedulers AW Lin, P Rümmer International Conference on Computer Aided Verification, 112-133, 2016 | 37 | 2016 |
| Synchronisation-and reversal-bounded analysis of multithreaded programs with counters M Hague, AW Lin International Conference on Computer Aided Verification, 260-276, 2012 | 37 | 2012 |
| A decision procedure for path feasibility of string manipulating programs with integer data type T Chen, M Hague, J He, D Hu, AW Lin, P Rümmer, Z Wu International Symposium on Automated Technology for Verification and …, 2020 | 36 | 2020 |
| Logical languages accepted by transformer encoders with hard attention P Barceló, A Kozachinskiy, AW Lin, V Podolskii arXiv preprint arXiv:2310.03817, 2023 | 33 | 2023 |
| Fair termination for parameterized probabilistic concurrent systems O Lengál, AW Lin, R Majumdar, P Rümmer International Conference on Tools and Algorithms for the Construction and …, 2017 | 33 | 2017 |
| Certistr: a certified string solver S Kan, AW Lin, P Rümmer, M Schrader Proceedings of the 11th ACM SIGPLAN International Conference on Certified …, 2022 | 32 | 2022 |
Philipp RuemmerProfessor in Computer Science, University of RegensburgVerified email at ur.de
