Winning Regions of Pushdown Parity Games: A Saturation Method Matthew Hague and C.-H. Luke Ong Oxford University Computing Laboratory Abstract. We present a new algorithm for computing the winning region of a parity gam

Source URL: www.cs.rhul.ac.uk

A Saturation Method for the Modal Mu-Cal ulus with Ba kwards Modalities over Pushdown Systems M. Hague and C.-H. L. Ong Oxford University Computing Laboratory

Source URL: www.cs.rhul.ac.uk

Model Checking Recursive Programs with Numeric Data Types Matthew Hague and Anthony Widjaja Lin Oxford University Computing Laboratory Abstract. Pushdown systems (PDS) naturally model sequential recursive programs. Nume

Source URL: www.cs.rhul.ac.uk

Unboundedness and Downward Closures of Higher-Order Pushdown Automata Matthew Hague Jonathan Kochems

Source URL: www.cs.rhul.ac.uk

Monadic Quantifiers Recognized by Deterministic Pushdown Automata: Corrigendum (January 1, 2014) Makoto Kanazawa National Institute of Informatics, Tokyo, Japan

Source URL: research.nii.ac.jp

Saturation of Concurrent Collapsible Pushdown Systems Matthew Hague Royal Holloway University of London, UK / LIGM, Marne-la-Vallée, France

Source URL: drops.dagstuhl.de

Winning Regions of Pushdown Parity Games: A Saturation Method M. Hague and

Source URL: www.cs.rhul.ac.uk

Reachability analysis of first-order definable pushdown systems (= pushdown systems in sets with atoms) Sławomir Lasota University of Warsaw

Source URL: www.mimuw.edu.pl

Dense-Timed Pushdown Automata Parosh Aziz Abdulla Mohamed Faouzi Atig Jari Stenman

Source URL: user.it.uu.se

• Models of computation
• Pushdown automaton
• Software engineering
• Theoretical computer science
• Timed automaton
• Stack
• Petri net
• Clock
• Exponentiation
• Abstraction
• Nested word
• Nested stack automaton

Parameterised Pushdown Systems with Non-Atomic Writes M. Hague Oxford University, Department of Computer Science and Laboratoire d’Informatique Gaspard-Monge, Universit´e Paris-Est

Source URL: www.cs.rhul.ac.uk