Seguir
Mohamed Faouzi Atig
Mohamed Faouzi Atig
Dirección de correo verificada de it.uu.se - Página principal
Título
Citado por
Citado por
Año
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
2022010
Stateless model checking for TSO and PSO
PA Abdulla, S Aronis, MF Atig, B Jonsson, C Leonardsson, K Sagonas
Acta Informatica 54, 789-818, 2017
1822017
Context-bounded analysis for concurrent programs with dynamic creation of threads
MF Atig, A Bouajjani, S Qadeer
Logical Methods in Computer Science 7, 2011
1252011
String constraints for verification
PA Abdulla, MF Atig, YF Chen, L Holík, A Rezine, P Rümmer, J Stenman
Computer Aided Verification: 26th International Conference, CAV 2014, Held …, 2014
1222014
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
1052015
Getting rid of store-buffers in TSO analysis
MF Atig, A Bouajjani, G Parlato
Computer Aided Verification: 23rd International Conference, CAV 2011 …, 2011
872011
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
822018
Dense-timed pushdown automata
PA Abdulla, MF Atig, J Stenman
2012 27th Annual IEEE Symposium on Logic in Computer Science, 35-44, 2012
812012
Stateless model checking for POWER
PA Abdulla, MF Atig, B Jonsson, C Leonardsson
Computer Aided Verification: 28th International Conference, CAV 2016 …, 2016
782016
Emptiness of multi-pushdown automata is 2ETIME-complete
MF Atig, B Bollig, P Habermehl
International Conference on Developments in Language Theory, 121-133, 2008
752008
Counter-example guided fence insertion under TSO
PA Abdulla, MF Atig, YF Chen, C Leonardsson, A Rezine
Tools and Algorithms for the Construction and Analysis of Systems: 18th …, 2012
722012
What’s decidable about weak memory models?
MF Atig, A Bouajjani, S Burckhardt, M Musuvathi
Programming Languages and Systems: 21st European Symposium on Programming …, 2012
652012
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
572017
On the reachability analysis of acyclic networks of pushdown systems
MF Atig, A Bouajjani, T Touili
International Conference on Concurrency Theory, 356-371, 2008
532008
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
492019
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
472019
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
452018
The best of both worlds: Trading efficiency and optimality in fence insertion for TSO
PA Abdulla, MF Atig, TP Ngo
Programming Languages and Systems: 24th European Symposium on Programming …, 2015
432015
Memorax, a Precise and Sound Tool for Automatic Fence Insertion under TSO
PA Abdulla, MF Atig, YF Chen, C Leonardsson, A Rezine
Tools and Algorithms for the Construction and Analysis of Systems: 19th …, 2013
432013
Context-bounded analysis for POWER
PA Abdulla, MF Atig, A Bouajjani, TP Ngo
International Conference on Tools and Algorithms for the Construction and …, 2017
422017
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20