Algorithmic Nominal Game Semantics

Murawski, Andrzej S.; Tzevelekos, Nikos

doi:10.1007/978-3-642-19718-5_22

Cited by 19 publications

(21 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, the examined FRA's do not mix locally with globally fresh transitions, and this is clearly depicted in the partitionΠ = Πinp ⊎ Πout ⊎ Π. A similar observation applies to FRA's describing Reduced ML [19]. There, the states are partitioned in P-states (for Proponent/Program) and O-states (for Opponent/Environment); only P-states are allowed to perform globally fresh transitions, and only O-states can do locally fresh ones.…”

Section: Further Directionssupporting

confidence: 52%

“…The next logical step is to examine concrete applications of FRA's to the description of computation with names, either in the direction of mobile calculi or that of programming languages, relating this approach to existing higher-level approaches. A first such advance has been recently accomplished in [19] by constructing a model of a low-order restriction of Reduced ML (a fragment of ML with ground-type integer references) representable in a variant of FRA's where labels contain store information. This was achieved by representing the fully abstract game semantics of the language [18].…”

Section: Further Directionsmentioning

confidence: 99%

See 1 more Smart Citation

Fresh-register automata

Tzevelekos

2011

Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Self Cite

View full text Add to dashboard Cite

What is a basic automata-theoretic model of computation with names and fresh-name generation? We introduce Fresh-Register Automata (FRA), a new class of automata which operate on an infinite alphabet of names and use a finite number of registers to store fresh names, and to compare incoming names with previously stored ones. These finite machines extend Kaminski and Francez's Finite-Memory Automata by being able to recognise globally fresh inputs, that is, names fresh in the whole current run. We examine the expressivity of FRA's both from the aspect of accepted languages and of bisimulation equivalence. We establish primary properties and connections between automata of this kind, and answer key decidability questions. As a demonstrating example, we express the theory of the pi-calculus in FRA's and characterise bisimulation equivalence by an appropriate, and decidable in the finitary case, notion in these automata.

show abstract

Section: Further Directionssupporting

confidence: 52%

Section: Further Directionsmentioning

confidence: 99%

Fresh-register automata

Tzevelekos

2011

Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Self Cite

View full text Add to dashboard Cite

show abstract

“…Here, documents contain data values whose range is potentially unbounded and queries are allowed to perform comparison tests on such data. A similar scenario occurs in reference-based programming languages, such as object-oriented [6,2,12,17] or ML-like languages [18,19]. In such languages, memory is managed with the help of reference names that can be created afresh and compared for equality but are otherwise abstract.…”

Section: Introductionmentioning

confidence: 97%

Reachability in Pushdown Register Automata

Murawski

Ramsay

Tzevelekos

2014

Mathematical Foundations of Computer Science 2014

Self Cite

View full text Add to dashboard Cite

We investigate reachability in pushdown automata over infinite alphabets. We show that, in terms of reachability/emptiness, these machines can be faithfully represented using only 3r elements of the alphabet, where r is the number of registers. We settle the complexity of associated reachability/emptiness problems. In contrast to register automata, the emptiness problem for pushdown register automata is EXPTIME-complete, independent of the register storage policy used. We also solve the global reachability problem by representing pushdown configurations with a special register automaton. Finally, we examine extensions of pushdown storage to higher orders and show that reachability is undecidable at order 2.

show abstract

“…Since 2004, the nominal approach has led to a series of new full abstraction results. The languages covered are the ν-calculus [3] (purely functional language with names), λν [25] (a higher-order language with storage of untyped names), Reduced ML [31] (a higher-order language with integer-valued storage), RefML [32] (higher-order references) and Middleweight Java [34]. Nominal game semantics has also been used to model Concurrent ML [26] and exceptions [34].…”

Section: Introductionmentioning

confidence: 99%