| Collapsible pushdown automata and recursion schemes M Hague, AS Murawski, CHL Ong, O Serre 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 452-461, 2008 | 188* | 2008 |
| Angelic semantics of fine-grained concurrency DR Ghica, AS Murawski Annals of Pure and Applied Logic 151 (2-3), 89-114, 2008 | 136* | 2008 |
| Nominal games and full abstraction for the nu-calculus S Abramsky, DR Ghica, AS Murawski, CHL Ong, IDB Stark Logic in Computer Science, 2004. Proceedings of the 19th Annual IEEE …, 2004 | 106 | 2004 |
| Applying game semantics to compositional software modeling and verification S Abramsky, DR Ghica, AS Murawski, CHL Ong International Conference on Tools and Algorithms for the Construction and …, 2004 | 99 | 2004 |
| Syntactic control of concurrency DR Ghica, AS Murawski, CHL Ong Theoretical computer science 350 (2-3), 234-251, 2006 | 57 | 2006 |
| Language equivalence for probabilistic automata S Kiefer, AS Murawski, J Ouaknine, B Wachter, J Worrell International Conference on Computer Aided Verification, 526-540, 2011 | 56 | 2011 |
| Algorithmic games for full ground references AS Murawski, N Tzevelekos Formal Methods in System Design 52 (3), 277-314, 2018 | 52* | 2018 |
| Third-order Idealized Algol with iteration is decidable AS Murawski, I Walukiewicz Theoretical Computer Science 390 (2-3), 214-229, 2008 | 52 | 2008 |
| About the undecidability of program equivalence in finitary languages with state AS Murawski ACM Transactions on Computational Logic (TOCL) 6 (4), 701-726, 2005 | 47* | 2005 |
| On automated verification of probabilistic programs A Legay, AS Murawski, J Ouaknine, J Worrell International Conference on Tools and Algorithms for the Construction and …, 2008 | 46 | 2008 |
| On probabilistic program equivalence and refinement A Murawski, J Ouaknine CONCUR 2005–Concurrency Theory, 156-170, 2005 | 44 | 2005 |
| On an interpretation of safe recursion in light affine logic AS Murawski, CHL Ong Theoretical computer science 318 (1-2), 197-223, 2004 | 44* | 2004 |
| Game semantics for good general references AS Murawski, N Tzevelekos Logic in Computer Science (LICS), 2011 26th Annual IEEE Symposium on, 75-84, 2011 | 41 | 2011 |
| Compositional model extraction for higher-order concurrent programs DR Ghica, AS Murawski International Conference on Tools and Algorithms for the Construction and …, 2006 | 39 | 2006 |
| Algorithmic games for full ground references AS Murawski, N Tzevelekos International Colloquium on Automata, Languages, and Programming, 312-324, 2012 | 38 | 2012 |
| Algorithmic nominal game semantics AS Murawski, N Tzevelekos European Symposium on Programming, 419-438, 2011 | 38 | 2011 |
| Dominator trees and fast verification of proof nets AS Murawski, CHL Ong Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science …, 2000 | 37 | 2000 |
| On the complexity of equivalence and minimisation for Q-weighted automata S Kiefer, A Murawski, J Ouaknine, B Wachter, J Worrell Logical Methods in Computer Science 9, 2013 | 36 | 2013 |
| Full abstraction for Reduced ML AS Murawski, N Tzevelekos Annals of Pure and Applied Logic 164 (11), 1118-1143, 2013 | 34* | 2013 |
| Idealized algol with ground recursion, and DPDA equivalence AS Murawski, CHL Ong, I Walukiewicz International Colloquium on Automata, Languages, and Programming, 917-929, 2005 | 33 | 2005 |
Luke OngDistinguished University Professor, Nanyang Technological UniversityVerified email at ntu.edu.sg
