Andrzej S. Murawski

	2012
40		Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: On the Complexity of the Equivalence Problem for Probabilistic Automata. FoSSaCS 2012: 467-481
	2011
39		Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: Language Equivalence for Probabilistic Automata. CAV 2011: 526-540
38		Andrzej S. Murawski, Nikos Tzevelekos: Algorithmic Nominal Game Semantics. ESOP 2011: 419-438
37		David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong: A Fragment of ML Decidable by Visibly Pushdown Automata. ICALP (2) 2011: 149-161
36		Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang: On Stabilization in Herman's Algorithm. ICALP (2) 2011: 466-477
35		Andrzej S. Murawski, Nikos Tzevelekos: Game Semantics for Good General References. LICS 2011: 75-84
34		Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang: On Stabilization in Herman's Algorithm CoRR abs/1104.3100: (2011)
33		Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: On the Complexity of the Equivalence Problem for Probabilistic Automata CoRR abs/1112.4644: (2011)
	2010
32		Andrzej S. Murawski, Nikos Tzevelekos: Block Structure vs. Scope Extrusion: Between Innocence and Omniscience. FOSSACS 2010: 33-47
31		Andrzej S. Murawski: Full Abstraction Without Synchronization Primitives. Electr. Notes Theor. Comput. Sci. 265: 423-436 (2010)
	2009
30		Andrzej S. Murawski, Nikos Tzevelekos: Full Abstraction for Reduced ML. FOSSACS 2009: 32-47
	2008
29		Andrzej S. Murawski: Reachability Games and Game Semantics: Comparing Nondeterministic Programs. LICS 2008: 353-363
28		Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre: Collapsible Pushdown Automata and Recursion Schemes. LICS 2008: 452-461
27		Axel Legay, Andrzej S. Murawski, Joël Ouaknine, James Worrell: On Automated Verification of Probabilistic Programs. TACAS 2008: 173-187
26		Dan R. Ghica, Andrzej S. Murawski: Angelic semantics of fine-grained concurrency. Ann. Pure Appl. Logic 151(2-3): 89-114 (2008)
25		Andrzej S. Murawski, Igor Walukiewicz: Third-order Idealized Algol with iteration is decidable. Theor. Comput. Sci. 390(2-3): 214-229 (2008)
	2007
24		Andrzej S. Murawski: Bad Variables Under Control. CSL 2007: 558-572
	2006
23		Dan R. Ghica, Andrzej S. Murawski: Compositional Model Extraction for Higher-Order Concurrent Programs. TACAS 2006: 303-317
22		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		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		Andrzej S. Murawski, Joël Ouaknine: On Probabilistic Program Equivalence and Refinement. CONCUR 2005: 156-170
19		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		Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiewicz: Idealized Algol with Ground Recursion, and DPDA Equivalence. ICALP 2005: 917-929
16		Andrzej S. Murawski: About the undecidability of program equivalence in finitary languages with state. ACM Trans. Comput. Log. 6(4): 701-726 (2005)
15		Andrzej S. Murawski: Functions with local state: Regularity and undecidability. Theor. Comput. Sci. 338(1-3): 315-349 (2005)
14		Andrzej S. Murawski: Games for complexity of second-order call-by-name programs. Theor. Comput. Sci. 343(1-2): 207-236 (2005)
	2004
13		Dan R. Ghica, Andrzej S. Murawski: Angelic Semantics of Fine-Grained Concurrency. FoSSaCS 2004: 211-225
12		Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong: Syntactic Control of Concurrency. ICALP 2004: 683-694
11		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		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		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		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		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		Andrzej S. Murawski, C.-H. Luke Ong: Evolving Games and Essential Nets for Affine Polymorphism. TLCA 2001: 360-375
	2000
3		Andrzej S. Murawski, C.-H. Luke Ong: Discreet Games, Light Affine Logic and PTIME Computation. CSL 2000: 427-441
2		Andrzej S. Murawski, C.-H. Luke Ong: Dominator Trees and Fast Verification of Proof Nets. LICS 2000: 181-191
	1999
1		Andrzej S. Murawski, C.-H. Luke Ong: Exhausting Strategies, Joker Games and IMLL with Units. Electr. Notes Theor. Comput. Sci. 29: 209-239 (1999)

Coauthor Index

1	Samson Abramsky	[10] [11]
2	Dan R. Ghica	[10] [11] [12] [13] [21] [23] [26]
3	Matthew Hague	[28]
4	David Hopkins	[37]
5	Stefan Kiefer	[33] [34] [36] [39] [40]
6	Axel Legay	[27]
7	C.-H. Luke Ong	[1] [2] [3] [4] [7] [9] [10] [11] [12] [17] [21] [22] [28] [37]
8	Joël Ouaknine	[20] [27] [33] [34] [36] [39] [40]
9	Olivier Serre	[28]
10	Ian D. B. Stark	[11]
11	Nikos Tzevelekos	[30] [32] [35] [38]
12	Björn Wachter	[33] [39] [40]
13	Igor Walukiewicz	[17] [19] [25]
14	James Worrell	[27] [33] [34] [36] [39] [40]
15	Kwangkeun Yi	[5] [6]
16	Lijun Zhang	[34] [36]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page