• Corpus ID: 17625701

The Regular-Language Semantics of First-Order Idealized Algol

  title={The Regular-Language Semantics of First-Order Idealized Algol},
  author={Dan R. Ghica and Guy McCusker},
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of complete plays as regular languages. Being derived directly from the fully abstract game semantics for IA, our model inherits its good theoretical properties; in fact, for first order IA taken as a stand-alone language the regular language model is fully abstract. The method is algorithmic and formal, which makes it… 

Figures from this paper

Low-Latency Synchronous Representations of Asynchronous Processes

This work proposes a framework for round abstraction that is totally correct when applied to asynchronous behaviours, and derives a synchronous game semantics from a conventional sequential one using a round abstraction algorithm.

Applying Game Semantics to Compositional Software Modeling and Verification

A software model checking tool founded on game semantics, based on an interpretation algorithm defined compositionally on syntax and thus can also handle open programs, which turns out to lead to very compact models of programs.

Algorithmic Game Semantics and Component−Based Verification

A prototypical software modeling and verification tool is described that can handle open programs and the fact that the models it produces are observationally fully abstract is essential in the modeling and verify of software components such as modules.

SAVCBS 2003: Specification and Verification of Component-Based Systems

This paper presents a meta-modelling framework called Ontology-based Description and Reasoning for Component-based Development on the Web that automates the very labor-intensive and therefore time-heavy and expensive process of designing and testing software components.



Reasoning about Idealized ALGOL Using Regular Languages

It is shown that reasoning can be carried out using only a meta-language of extended regular expressions, a language for which equivalence is formally decidable, which makes it uniquely suitable for automation.

Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions

A fully abstract game semantics for finite nondeterminism

This model is shown to be fully abstract, with respect to an equivalence based on both safety and liveness properties, by means of a factorization theorem which states that every nondeterministic strategy is the composite of a deterministic strategy with a nondetergetic oracle.

Full abstraction for a shared variable parallel language

  • S. Brookes
  • Computer Science
    [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science
  • 1993
It is shown how to modify the semantics to incorporate new program constructs, to allow for different levels of granularity or atomicity, and to model fair infinite computation, in each case achieving full abstraction with respect to an appropriate notion of program behavior.

Full Abstraction for the Second Order Subset of an Algol-Like Language

  • K. Sieber
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 1994

Games and Full Abstraction for a Functional Metalanguage with Recursive Types

This book discusses FPC and its Models, Rational Categories and Recursive Types, and Semantics of the Recursion Combinator, as well as games and Strategies, and the author's own contributions.

From Algol to polymorphic linear lambda-calculus

This work translates two variations on Algol 60 into a purely functional language with polymorphic linear types, and demonstrates that a linearly-typed functional language can be at least as expressive as AlGol.

Reasoning about local variables with operationally-based logical relations

  • A. Pitts
  • Computer Science
    Proceedings 11th Annual IEEE Symposium on Logic in Computer Science
  • 1996
A parametric logical relation between the phrases of an Algol-like language is presented and provides an applicative characterisation of contextual equivalence for the language and provides a useful (and complete) method for proving equivalences.