Algorithmic Games for Full Ground References
From MaRDI portal
Publication:3167021
DOI10.1007/978-3-642-31585-5_30zbMath1367.68072OpenAlexW63783938MaRDI QIDQ3167021
Andrzej S. Murawski, Nikos Tzevelekos
Publication date: 1 November 2012
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: http://qmro.qmul.ac.uk/xmlui/handle/123456789/25859
Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (5)
Algorithmic games for full ground references ⋮ Reachability in pushdown register automata ⋮ Full abstraction for Reduced ML ⋮ ML and Extended Branching VASS ⋮ Denotational Semantics with Nominal Scott Domains
This page was built for publication: Algorithmic Games for Full Ground References
