Travelled to:1 × Austria
1 × Cyprus
1 × Estonia
1 × Hungary
1 × Japan
1 × Poland
1 × Portugal
2 × Canada
2 × Finland
2 × France
2 × Germany
2 × Italy
2 × Spain
2 × Switzerland
4 × United Kingdom
6 × USA
Collaborated with:C.L.Ong N.Tzevelekos D.R.Ghica ∅ S.Kiefer J.Ouaknine J.Worrell C.Cotton-Barratt D.Hopkins I.Walukiewicz B.Wachter K.Yi S.Abramsky S.J.Ramsay P.Clairambault C.Grellois M.Benedikt S.Göller M.Hague O.Serre A.Legay L.Zhang I.D.B.Stark
Talks about:game (12) automata (8) semant (8) program (5) equival (5) ml (5) probabilist (4) refer (4) order (4) algorithm (3)
Person: Andrzej S. Murawski
DBLP: Murawski:Andrzej_S=
Contributed to:
2015
2015
20152014
201420132013
20122012
20122011
201120112011201020092008
2008
200720062005200520042004200420042003
2002
20012000200020172018Wrote 36 papers:
- FoSSaCS-2015-Cotton-BarrattH #automaton #decidability #memory management #ml
- Fragments of ML Decidable by Nested Data Class Memory Automata (CCB, DH, ASM, CHLO), pp. 249–263.
- LATA-2015-Cotton-BarrattMO #automaton #memory management
- Weak and Nested Class Memory Automata (CCB, ASM, CHLO), pp. 188–199.
- LICS-2015-MurawskiRT #automaton #similarity
- Bisimilarity in Fresh-Register Automata (ASM, SJR, NT), pp. 156–167.
- FoSSaCS-2014-MurawskiT #exception #game studies #semantics
- Game Semantics for Nominal Exceptions (ASM, NT), pp. 164–179.
- POPL-2014-MurawskiT #game studies #interface #java #semantics
- Game semantics for interface middleweight Java (ASM, NT), pp. 517–528.
- FoSSaCS-2013-MurawskiT #game studies #semantics
- Deconstructing General References via Game Semantics (ASM, NT), pp. 241–256.
- LICS-2013-BenediktGKM #automaton #similarity
- Bisimilarity of Pushdown Automata is Nonelementary (MB, SG, SK, ASM), pp. 488–498.
- CAV-2012-HopkinsMO #equivalence #higher-order #ml #named
- Hector: An Equivalence Checker for a Higher-Order Fragment of ML (DH, ASM, CHLO), pp. 774–780.
- CAV-2012-KieferMOWW #named #probability #source code
- APEX: An Analyzer for Open Probabilistic Programs (SK, ASM, JO, BW, JW), pp. 693–698.
- FoSSaCS-2012-KieferMOWW #automaton #complexity #equivalence #on the #probability #problem
- On the Complexity of the Equivalence Problem for Probabilistic Automata (SK, ASM, JO, BW, JW), pp. 467–481.
- ICALP-v2-2012-MurawskiT #algorithm #game studies
- Algorithmic Games for Full Ground References (ASM, NT), pp. 312–324.
- CAV-2011-KieferMOWW #automaton #equivalence #probability
- Language Equivalence for Probabilistic Automata (SK, ASM, JO, BW, JW), pp. 526–540.
- ESOP-2011-MurawskiT #algorithm #game studies #semantics
- Algorithmic Nominal Game Semantics (ASM, NT), pp. 419–438.
- ICALP-v2-2011-HopkinsMO #automaton #decidability #ml
- A Fragment of ML Decidable by Visibly Pushdown Automata (DH, ASM, CHLO), pp. 149–161.
- ICALP-v2-2011-KieferMOWZ #algorithm #on the
- On Stabilization in Herman’s Algorithm (SK, ASM, JO, JW, LZ), pp. 466–477.
- LICS-2011-MurawskiT #game studies #semantics
- Game Semantics for Good General References (ASM, NT), pp. 75–84.
- FoSSaCS-2010-MurawskiT
- Block Structure vs. Scope Extrusion: Between Innocence and Omniscience (ASM, NT), pp. 33–47.
- FoSSaCS-2009-MurawskiT #abstraction #ml
- Full Abstraction for Reduced ML (ASM, NT), pp. 32–47.
- LICS-2008-HagueMOS #automaton #recursion
- Collapsible Pushdown Automata and Recursion Schemes (MH, ASM, CHLO, OS), pp. 452–461.
- LICS-2008-Murawski #game studies #nondeterminism #reachability #semantics #source code
- Reachability Games and Game Semantics: Comparing Nondeterministic Programs (ASM), pp. 353–363.
- TACAS-2008-LegayMOW #automation #on the #probability #source code #verification
- On Automated Verification of Probabilistic Programs (AL, ASM, JO, JW), pp. 173–187.
- CSL-2007-Murawski
- Bad Variables Under Control (ASM), pp. 558–572.
- TACAS-2006-GhicaM #composition #concurrent #higher-order #source code
- Compositional Model Extraction for Higher-Order Concurrent Programs (DRG, ASM), pp. 303–317.
- FoSSaCS-2005-MurawskiW #algol #decidability #higher-order
- Third-Order Idealized Algol with Iteration Is Decidable (ASM, IW), pp. 202–218.
- ICALP-2005-MurawskiOW #algol #equivalence #recursion
- Idealized Algol with Ground Recursion, and DPDA Equivalence (ASM, CHLO, IW), pp. 917–929.
- FoSSaCS-2004-GhicaM #concurrent #fine-grained #semantics
- Angelic Semantics of Fine-Grained Concurrency (DRG, ASM), pp. 211–225.
- ICALP-2004-GhicaMO #concurrent
- Syntactic Control of Concurrency (DRG, ASM, CHLO), pp. 683–694.
- LICS-2004-AbramskyGMOS #abstraction #calculus #game studies
- Nominal Games and Full Abstraction for the Nu-Calculus (SA, DRG, ASM, CHLO, IDBS), pp. 150–159.
- TACAS-2004-AbramskyGMO #composition #game studies #modelling #semantics #verification
- Applying Game Semantics to Compositional Software Modeling and Verification (SA, DRG, ASM, CHLO), pp. 421–435.
- LICS-2003-Murawski #equivalence #on the
- On Program Equivalence in Languages with Ground-Type References (ASM), p. 108–?.
- VMCAI-2002-MurawskiY #analysis
- Static Monotonicity Analysis for lambda-definable Functions over Lattices (ASM, KY), pp. 139–153.
- TLCA-2001-MurawskiO #evolution #game studies #morphism #polymorphism
- Evolving Games and Essential Nets for Affine Polymorphism (ASM, CHLO), pp. 360–375.
- CSL-2000-MurawskiO #game studies #logic
- Discreet Games, Light Affine Logic and PTIME Computation (ASM, CHLO), pp. 427–441.
- LICS-2000-MurawskiO #performance #proving #verification
- Dominator Trees and Fast Verification of Proof Nets (ASM, CHLO), pp. 181–191.
- ESOP-2017-Cotton-BarrattM #branch #ml
- ML and Extended Branching VASS (CCB, ASM, CHLO), pp. 314–340.
- POPL-2018-ClairambaultGM #higher-order #recursion
- Linearity in higher-order recursion schemes (PC, CG, ASM), p. 29.