Seuraa
Andrzej Murawski
Andrzej Murawski
University of Oxford
Vahvistettu sähköpostiosoite verkkotunnuksessa cs.ox.ac.uk - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
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
183*2008
Angelic semantics of fine-grained concurrency
DR Ghica, AS Murawski
Annals of Pure and Applied Logic 151 (2-3), 89-114, 2008
130*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
1002004
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
972004
Syntactic control of concurrency
DR Ghica, AS Murawski, CHL Ong
Theoretical computer science 350 (2-3), 234-251, 2006
552006
Language equivalence for probabilistic automata
S Kiefer, AS Murawski, J Ouaknine, B Wachter, J Worrell
International Conference on Computer Aided Verification, 526-540, 2011
532011
Third-order Idealized Algol with iteration is decidable
AS Murawski, I Walukiewicz
Theoretical Computer Science 390 (2-3), 214-229, 2008
502008
Algorithmic games for full ground references
AS Murawski, N Tzevelekos
Formal Methods in System Design 52 (3), 277-314, 2018
48*2018
About the undecidability of program equivalence in finitary languages with state
AS Murawski
ACM Transactions on Computational Logic (TOCL) 6 (4), 701-726, 2005
46*2005
On an interpretation of safe recursion in light affine logic
AS Murawski, CHL Ong
Theoretical computer science 318 (1-2), 197-223, 2004
43*2004
On automated verification of probabilistic programs
A Legay, AS Murawski, J Ouaknine, J Worrell
Tools and Algorithms for the Construction and Analysis of Systems: 14th …, 2008
412008
On probabilistic program equivalence and refinement
A Murawski, J Ouaknine
CONCUR 2005–Concurrency Theory, 156-170, 2005
402005
Game semantics for good general references
AS Murawski, N Tzevelekos
Logic in Computer Science (LICS), 2011 26th Annual IEEE Symposium on, 75-84, 2011
392011
Dominator trees and fast verification of proof nets
AS Murawski, CHL Ong
Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science …, 2000
382000
Dominator trees and fast verification of proof nets
AS Murawski, CHL Ong
Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science …, 2000
382000
Compositional model extraction for higher-order concurrent programs
DR Ghica, AS Murawski
International Conference on Tools and Algorithms for the Construction and …, 2006
372006
Algorithmic games for full ground references
AS Murawski, N Tzevelekos
International Colloquium on Automata, Languages, and Programming, 312-324, 2012
362012
Algorithmic nominal game semantics
AS Murawski, N Tzevelekos
European Symposium on Programming, 419-438, 2011
362011
Full abstraction for Reduced ML
AS Murawski, N Tzevelekos
Annals of Pure and Applied Logic 164 (11), 1118-1143, 2013
34*2013
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
332013
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20