| On the verification problem for weak memory models MF Atig, A Bouajjani, S Burckhardt, M Musuvathi Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of …, 2010 | 211 | 2010 |
| Stateless model checking for TSO and PSO PA Abdulla, S Aronis, MF Atig, B Jonsson, C Leonardsson, K Sagonas Acta Informatica 54 (8), 789-818, 2017 | 204 | 2017 |
| String constraints for verification PA Abdulla, MF Atig, YF Chen, L Holík, A Rezine, P Rümmer, J Stenman International Conference on Computer Aided Verification, 150-166, 2014 | 157 | 2014 |
| Context-bounded analysis for concurrent programs with dynamic creation of threads MF Atig, A Bouajjani, S Qadeer Logical Methods in Computer Science 7, 2011 | 134 | 2011 |
| Norn: An SMT solver for string constraints PA Abdulla, MF Atig, YF Chen, L Holík, A Rezine, P Rümmer, J Stenman International conference on computer aided verification, 462-469, 2015 | 133 | 2015 |
| Optimal stateless model checking under the release-acquire semantics PA Abdulla, MF Atig, B Jonsson, TP Ngo Proceedings of the ACM on Programming Languages 2 (OOPSLA), 1-29, 2018 | 108 | 2018 |
| Stateless model checking for POWER PA Abdulla, MF Atig, B Jonsson, C Leonardsson International Conference on Computer Aided Verification, 134-156, 2016 | 89 | 2016 |
| Getting rid of store-buffers in TSO analysis MF Atig, A Bouajjani, G Parlato International Conference on Computer Aided Verification, 99-115, 2011 | 88 | 2011 |
| Dense-timed pushdown automata PA Abdulla, MF Atig, J Stenman 2012 27th Annual IEEE Symposium on Logic in Computer Science, 35-44, 2012 | 82 | 2012 |
| Emptiness of multi-pushdown automata is 2ETIME-complete MF Atig, B Bollig, P Habermehl International Conference on Developments in Language Theory, 121-133, 2008 | 78 | 2008 |
| Counter-example guided fence insertion under TSO PA Abdulla, MF Atig, YF Chen, C Leonardsson, A Rezine International Conference on Tools and Algorithms for the Construction and …, 2012 | 77 | 2012 |
| 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 |
| Optimal stateless model checking for reads-from equivalence under sequential consistency PA Abdulla, MF Atig, B Jonsson, M Lång, TP Ngo, K Sagonas Proceedings of the ACM on Programming Languages 3 (OOPSLA), 1-29, 2019 | 74 | 2019 |
| What’s decidable about weak memory models? MF Atig, A Bouajjani, S Burckhardt, M Musuvathi European Symposium on Programming, 26-46, 2012 | 72 | 2012 |
| 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 |
| Verification of programs under the release-acquire semantics PA Abdulla, J Arora, MF Atig, S Krishna Proceedings of the 40th ACM SIGPLAN Conference on Programming Language …, 2019 | 58 | 2019 |
| On the reachability analysis of acyclic networks of pushdown systems MF Atig, A Bouajjani, T Touili International Conference on Concurrency Theory, 356-371, 2008 | 55 | 2008 |
| The best of both worlds: Trading efficiency and optimality in fence insertion for TSO PA Abdulla, MF Atig, TP Ngo European Symposium on Programming Languages and Systems, 308-332, 2015 | 53 | 2015 |
| 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 |
| Context-bounded analysis for POWER PA Abdulla, MF Atig, A Bouajjani, TP Ngo International Conference on Tools and Algorithms for the Construction and …, 2017 | 46 | 2017 |
Yu-Fang ChenResearch Fellow/Professor, Academia SinicaVerified email at iis.sinica.edu.tw
