| 2009 |
|---|
| 30 | EE | Andrzej S. Murawski,
Nikos Tzevelekos:
Full Abstraction for Reduced ML.
FOSSACS 2009: 32-47 |
| 2008 |
|---|
| 29 | EE | Andrzej S. Murawski:
Reachability Games and Game Semantics: Comparing Nondeterministic Programs.
LICS 2008: 353-363 |
| 28 | EE | Matthew Hague,
Andrzej S. Murawski,
C.-H. Luke Ong,
Olivier Serre:
Collapsible Pushdown Automata and Recursion Schemes.
LICS 2008: 452-461 |
| 27 | EE | Axel Legay,
Andrzej S. Murawski,
Joël Ouaknine,
James Worrell:
On Automated Verification of Probabilistic Programs.
TACAS 2008: 173-187 |
| 26 | EE | Dan R. Ghica,
Andrzej S. Murawski:
Angelic semantics of fine-grained concurrency.
Ann. Pure Appl. Logic 151(2-3): 89-114 (2008) |
| 25 | EE | Andrzej S. Murawski,
Igor Walukiewicz:
Third-order Idealized Algol with iteration is decidable.
Theor. Comput. Sci. 390(2-3): 214-229 (2008) |
| 2007 |
|---|
| 24 | EE | Andrzej S. Murawski:
Bad Variables Under Control.
CSL 2007: 558-572 |
| 2006 |
|---|
| 23 | EE | Dan R. Ghica,
Andrzej S. Murawski:
Compositional Model Extraction for Higher-Order Concurrent Programs.
TACAS 2006: 303-317 |
| 22 | EE | Andrzej S. Murawski,
C.-H. Luke Ong:
Fast verification of MLL proof nets via IMLL.
ACM Trans. Comput. Log. 7(3): 473-498 (2006) |
| 21 | EE | Dan R. Ghica,
Andrzej S. Murawski,
C.-H. Luke Ong:
Syntactic control of concurrency.
Theor. Comput. Sci. 350(2-3): 234-251 (2006) |
| 2005 |
|---|
| 20 | EE | Andrzej S. Murawski,
Joël Ouaknine:
On Probabilistic Program Equivalence and Refinement.
CONCUR 2005: 156-170 |
| 19 | EE | Andrzej S. Murawski,
Igor Walukiewicz:
Third-Order Idealized Algol with Iteration Is Decidable.
FoSSaCS 2005: 202-218 |
| 18 | | Andrzej S. Murawski:
Functions with local state: from regularity to undecidability.
GALOP 2005: 124-138 |
| 17 | EE | Andrzej S. Murawski,
C.-H. Luke Ong,
Igor Walukiewicz:
Idealized Algol with Ground Recursion, and DPDA Equivalence.
ICALP 2005: 917-929 |
| 16 | EE | Andrzej S. Murawski:
About the undecidability of program equivalence in finitary languages with state.
ACM Trans. Comput. Log. 6(4): 701-726 (2005) |
| 15 | EE | Andrzej S. Murawski:
Functions with local state: Regularity and undecidability.
Theor. Comput. Sci. 338(1-3): 315-349 (2005) |
| 14 | EE | Andrzej S. Murawski:
Games for complexity of second-order call-by-name programs.
Theor. Comput. Sci. 343(1-2): 207-236 (2005) |
| 2004 |
|---|
| 13 | EE | Dan R. Ghica,
Andrzej S. Murawski:
Angelic Semantics of Fine-Grained Concurrency.
FoSSaCS 2004: 211-225 |
| 12 | EE | Dan R. Ghica,
Andrzej S. Murawski,
C.-H. Luke Ong:
Syntactic Control of Concurrency.
ICALP 2004: 683-694 |
| 11 | EE | Samson Abramsky,
Dan R. Ghica,
Andrzej S. Murawski,
C.-H. Luke Ong,
Ian D. B. Stark:
Nominal Games and Full Abstraction for the Nu-Calculus.
LICS 2004: 150-159 |
| 10 | EE | Samson Abramsky,
Dan R. Ghica,
Andrzej S. Murawski,
C.-H. Luke Ong:
Applying Game Semantics to Compositional Software Modeling and Verification.
TACAS 2004: 421-435 |
| 9 | EE | Andrzej S. Murawski,
C.-H. Luke Ong:
On an interpretation of safe recursion in light affine logic.
Theor. Comput. Sci. 318(1-2): 197-223 (2004) |
| 2003 |
|---|
| 8 | EE | Andrzej S. Murawski:
On Program Equivalence in Languages with Ground-Type References.
LICS 2003: 108- |
| 7 | | Andrzej S. Murawski,
C.-H. Luke Ong:
Exhausting strategies, joker games and full completeness for IMLL with Unit.
Theor. Comput. Sci. 294(1/2): 269-305 (2003) |
| 2002 |
|---|
| 6 | EE | Andrzej S. Murawski,
Kwangkeun Yi:
Static Monotonicity Analysis for lambda-definable Functions over Lattices.
VMCAI 2002: 139-153 |
| 2001 |
|---|
| 5 | | Andrzej S. Murawski,
Kwangkeun Yi:
Static Monotonicity Analysis for lambda-Definable Functions. over Lattices.
APLAS 2001: 345-362 |
| 4 | EE | Andrzej S. Murawski,
C.-H. Luke Ong:
Evolving Games and Essential Nets for Affine Polymorphism.
TLCA 2001: 360-375 |
| 2000 |
|---|
| 3 | EE | Andrzej S. Murawski,
C.-H. Luke Ong:
Discreet Games, Light Affine Logic and PTIME Computation.
CSL 2000: 427-441 |
| 2 | EE | Andrzej S. Murawski,
C.-H. Luke Ong:
Dominator Trees and Fast Verification of Proof Nets.
LICS 2000: 181-191 |
| 1999 |
|---|
| 1 | EE | Andrzej S. Murawski,
C.-H. Luke Ong:
Exhausting Strategies, Joker Games and IMLL with Units.
Electr. Notes Theor. Comput. Sci. 29: (1999) |
