Search the dblp DataBase
Andrzej S. Murawski :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Andrzej S. Murawski , Kwangkeun Yi Static Monotonicity Analysis for lambda-Definable Functions. over Lattices. [Citation Graph (0, 0)][DBLP ] APLAS, 2001, pp:345-362 [Conf ] Andrzej S. Murawski , Joël Ouaknine On Probabilistic Program Equivalence and Refinement. [Citation Graph (0, 0)][DBLP ] CONCUR, 2005, pp:156-170 [Conf ] Andrzej S. Murawski , C.-H. Luke Ong Discreet Games, Light Affine Logic and PTIME Computation. [Citation Graph (0, 0)][DBLP ] CSL, 2000, pp:427-441 [Conf ] Dan R. Ghica , Andrzej S. Murawski Angelic Semantics of Fine-Grained Concurrency. [Citation Graph (0, 0)][DBLP ] FoSSaCS, 2004, pp:211-225 [Conf ] Andrzej S. Murawski , Igor Walukiewicz Third-Order Idealized Algol with Iteration Is Decidable. [Citation Graph (0, 0)][DBLP ] FoSSaCS, 2005, pp:202-218 [Conf ] Andrzej S. Murawski Functions with local state: from regularity to undecidability. [Citation Graph (0, 0)][DBLP ] GALOP, 2005, pp:124-138 [Conf ] Dan R. Ghica , Andrzej S. Murawski , C.-H. Luke Ong Syntactic Control of Concurrency. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:683-694 [Conf ] Andrzej S. Murawski , C.-H. Luke Ong , Igor Walukiewicz Idealized Algol with Ground Recursion, and DPDA Equivalence. [Citation Graph (0, 0)][DBLP ] ICALP, 2005, pp:917-929 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] LICS, 2004, pp:150-159 [Conf ] Andrzej S. Murawski On Program Equivalence in Languages with Ground-Type References. [Citation Graph (0, 0)][DBLP ] LICS, 2003, pp:108-0 [Conf ] Andrzej S. Murawski , C.-H. Luke Ong Dominator Trees and Fast Verification of Proof Nets. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:181-191 [Conf ] Samson Abramsky , Dan R. Ghica , Andrzej S. Murawski , C.-H. Luke Ong Applying Game Semantics to Compositional Software Modeling and Verification. [Citation Graph (0, 0)][DBLP ] TACAS, 2004, pp:421-435 [Conf ] Dan R. Ghica , Andrzej S. Murawski Compositional Model Extraction for Higher-Order Concurrent Programs. [Citation Graph (0, 0)][DBLP ] TACAS, 2006, pp:303-317 [Conf ] Andrzej S. Murawski , C.-H. Luke Ong Evolving Games and Essential Nets for Affine Polymorphism. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:360-375 [Conf ] Andrzej S. Murawski , Kwangkeun Yi Static Monotonicity Analysis for lambda-definable Functions over Lattices. [Citation Graph (0, 0)][DBLP ] VMCAI, 2002, pp:139-153 [Conf ] Dan R. Ghica , Andrzej S. Murawski , C.-H. Luke Ong Syntactic control of concurrency. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:350, n:2-3, pp:234-251 [Journal ] Andrzej S. Murawski Functions with local state: Regularity and undecidability. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:338, n:1-3, pp:315-349 [Journal ] Andrzej S. Murawski Games for complexity of second-order call-by-name programs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:343, n:1-2, pp:207-236 [Journal ] Andrzej S. Murawski , C.-H. Luke Ong Exhausting strategies, joker games and full completeness for IMLL with Unit. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:294, n:1/2, pp:269-305 [Journal ] Andrzej S. Murawski , C.-H. Luke Ong On an interpretation of safe recursion in light affine logic. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:318, n:1-2, pp:197-223 [Journal ] Andrzej S. Murawski , C.-H. Luke Ong Exhausting Strategies, Joker Games and IMLL with Units. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1999, v:29, n:, pp:- [Journal ] Andrzej S. Murawski About the undecidability of program equivalence in finitary languages with state. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2005, v:6, n:4, pp:701-726 [Journal ] Andrzej S. Murawski , C.-H. Luke Ong Fast verification of MLL proof nets via IMLL. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2006, v:7, n:3, pp:473-498 [Journal ] Andrzej S. Murawski Bad Variables Under Control. [Citation Graph (0, 0)][DBLP ] CSL, 2007, pp:558-572 [Conf ] Full Abstraction for Reduced ML. [Citation Graph (, )][DBLP ] Block Structure vs. Scope Extrusion: Between Innocence and Omniscience. [Citation Graph (, )][DBLP ] Reachability Games and Game Semantics: Comparing Nondeterministic Programs. [Citation Graph (, )][DBLP ] Collapsible Pushdown Automata and Recursion Schemes. [Citation Graph (, )][DBLP ] On Automated Verification of Probabilistic Programs. [Citation Graph (, )][DBLP ] Angelic semantics of fine-grained concurrency. [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.005secs