Publications

Move the mouse pointer over the title to see the corresponding abstract

• A. Legay, A. S. Murawski, J. Ouaknine and J. Worrell , On Automated Verification of Probabilistic Programs, Proceedings of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'08), Lecture Notes in Computer Science 4963, pp 173-187, © Springer-Verlag, 2008.
  
  
• A. S. Murawski, Bad Variables Under Control, Proceedings of the 16th EACSL Annual Conference on Computer Science and Logic (CSL'07), Lecture Notes in Computer Science 4646, pp 558-572, © Springer-Verlag, 2007.
  
  
• D. R. Ghica, A. S. Murawski, Compositional Model Extraction for Higher-Order Concurrent Programs, Proceedings of the 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06), Lecture Notes in Computer Science 3920, pp 303-317, © Springer-Verlag, 2006.
  
  
• A. S. Murawski, Games for complexity of second-order call-by-name programs , Theoretical Computer Science, 343(1/2), pp 207-236, Elsevier, 2005.
  
  
• A. S. Murawski and J. Ouaknine, On Probabilistic Program Equivalence and Refinement, Proceedings of the 16th International Conference on Concurrency Theory (CONCUR'05), Lecture Notes in Computer Science 3653, pp 156-170, © Springer-Verlag, 2005.
  
  
• A. S. Murawski, C.-H. L. Ong and I. Walukiewicz, Idealized Algol with Ground Recursion, and DPDA Equivalence , Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), Lecture Notes in Computer Science 3580, pp 917-929, © Springer-Verlag, 2005.
  
  
• A. S. Murawski and I. Walukiewicz, Third-Order Idealized Algol with Iteration is Decidable, Proceedings of the 8th International Conference on Foundations of Software Science and Computational Structures (FOSSACS'05), Lecture Notes in Computer Science 3411, pp 202-218, © Springer-Verlag, 2005.
  
  
• A. S. Murawski, Functions with local state: regularity and undecidability, Theoretical Computer Science, 338(1/3), pp 315-349, Elsevier, 2005.
  
  
• A. S. Murawski, About the undecidability of program equivalence in finitary languages with state, ACM Transactions on Computational Logic, 6(4), pp 701-726, ACM Press, 2005.
  
  
• A. S. Murawski and C.-H. L. Ong, Fast verification of MLL proof-nets via IMLL,ACM Transactions on Computational Logic, 7(3), pp 473-498, ACM Press, 2006.
  
  
• A. S. Murawski and C.-H. L. Ong, On an interpretation of safe recursion in light affine logic, Theoretical Computer Science, 318(1/2), pp 197-223, Elsevier, 2004.
  
  
• D. R. Ghica, A. S. Murawski and C.-H. L. Ong, Syntactic control of concurrency, Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP'04), Lecture Notes in Computer Science 3142, pp 683-694, © Springer-Verlag, 2004.
  
  
• S. Abramsky, D. R. Ghica, A. S. Murawski, C.-H. L. Ong and I. D. B. Stark, Nominal games and full abstraction for the nu-calculus, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04), pp 150-159, IEEE Computer Society Press, 2004.
  
  
• D. R. Ghica and A. S. Murawski, Angelic semantics of fine-grained concurrency, Proceedings of the 7th International Conference on Foundations of Software Science and Computational Structures (FOSSACS'04), Lecture Notes in Computer Science 2987, pp 211-225, © Springer-Verlag, 2004.
  
  
• S. Abramsky, D. R. Ghica, A. S. Murawski and C.-H. L. Ong, Applying Game Semantics to Compositional Software Modelling and Verification, Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'04), Lecture Notes in Computer Science 2988, pp 421-435, © Springer-Verlag, 2004.
  
  
• A. S. Murawski, On program equivalence in languages with ground-type references. Proceedings of 18th IEEE Annual Symposium on Logic in Computer Science (LICS'03), pp 108-117, IEEE Computer Society Press, 2003.
  
  
• A. S. Murawski and C.-H. L. Ong, Exhausting Strategies, Joker Games and Full Completeness for IMLL with Unit, Theoretical Computer Science 294 (1/2), pp 269-305, Elsevier, 2003.
  
  
• A. S. Murawski and K. Yi, Static monotonicity analysis for lambda-definable functions over lattices, Proceedings of the 3rd International Workshop on Verification, Model Checking and Abstract Interpretation (VMCAI'02), Lecture Notes in Computer Science 2249, pp 139-153, © Springer-Verlag, 2002.
  
  
• A. S. Murawski, On Semantic and Type-Theoretic Aspects of Polynomial-Time Computability , D.Phil. thesis, University of Oxford, 2001. [abstract]
  
  
• A. S. Murawski and C.-H. L. Ong, Evolving Games and Essential Nets for Affine Polymorphism, Proceedings of the 5th International Conference on Typed Lambda Calculi and Applications (TLCA'01), Lecture Notes in Computer Science 2044, pp 360-375, © Springer-Verlag, 2001.
  
  
• A. S. Murawski and C.-H. L. Ong, Discreet Games, Light Affine Logic and PTIME Computation, Proceedings of 14th Annual Conference of the European Association of Computer Science Logic (CSL'00), Lecture Notes in Computer Science 1862, pp 427-441, © Springer-Verlag, 2000.
  
  
• A. S. Murawski and C.-H. L. Ong, Dominator Trees and Fast Verification of Proof Nets. Proceedings of 15th IEEE Annual Symposium on Logic in Computer Science (LICS'00), pp 181-191, IEEE Computer Society Press, 2000.
  
  
• A. S. Murawski and C.-H. L. Ong, A Linear-time Algorithm for Verifying MLL Proof Nets via Essential Nets, in Davis, Roscoe and Woodcock (editors), Millennial Perspectives in Computer Science, Cornerstones of Computing Series, pp 289-302, Palgrave, 2000.
  
  
• A. S. Murawski and C.-H. L. Ong, Exhausting Strategies, Joker Games and Full Completeness for IMLL with Unit (preliminary version), Electronic Notes in Theoretical Computer Science 29, Elsevier, 1999.