| Flatten and conquer: a framework for efficient analysis of string constraints PA Abdulla, MF Atig, YF Chen, BP Diep, L Holík, A Rezine, P Rümmer ACM SIGPLAN Notices 52 (6), 602-617, 2017 | 75 | 2017 |
| Trau: SMT solver for string constraints PA Abdulla, MF Atig, YF Chen, BP Diep, L Holík, A Rezine, P Rümmer 2018 Formal Methods in Computer Aided Design (FMCAD), 1-5, 2018 | 64 | 2018 |
| Chain-free string constraints PA Abdulla, MF Atig, BP Diep, L Holík, P Janků International Symposium on Automated Technology for Verification and …, 2019 | 47 | 2019 |
| Efficient handling of string-number conversion PA Abdulla, MF Atig, YF Chen, BP Diep, J Dolby, P Janků, HH Lin, L Holík, ... Proceedings of the 41st ACM SIGPLAN Conference on Programming Language …, 2020 | 45 | 2020 |
| Solving Not-Substring Constraint withFlat Abstraction PA Abdulla, MF Atig, YF Chen, BP Diep, L Holík, D Hu, WL Tsai, Z Wu, ... Asian Symposium on Programming Languages and Systems, 305-320, 2021 | 15 | 2021 |
| Trau: SMT solver for string constraints. In 2018 Formal Methods in Computer Aided Design, FMCAD 2018, Austin, TX, USA, October 30-November 2, 2018, Nikolaj Bjørner and Arie … PA Abdulla, MF Atig, YF Chen, BP Diep, L Holík, A Rezine, P Rümmer IEEE, 1ś5. https://doi. org/10.23919/FMCAD, 2018 | 13 | 2018 |
| Distributed Bounded Model Checking. P Chatterjee, S Roy, BP Diep, A Lal FMCAD, 47-56, 2020 | 12 | 2020 |
| Distributed bounded model checking P Chatterjee, S Roy, BP Diep, A Lal Formal Methods in System Design 64 (1), 50-72, 2024 | 6 | 2024 |
| Counter-example guided program verification PA Abdulla, MF Atig, BP Diep International Symposium on Formal Methods, 25-42, 2016 | 4 | 2016 |
| Solving Not-Substring Constraint with Flat Abstraction BP Diep, L Holık, D Hu, WL Tsai, Z Wu, DD Yen Programming Languages and Systems, 305, 0 | | |
| Flatten and Conquer PA Abdulla, MF Atig, YF Chen, BP Diep, L Holık, A Rezine, P Rümmer | | |
Lukas HolikBrno University of TehcnologyVerified email at fit.vutbr.cz
