Global state considered unnecessary: An introduction to object-based semantics

Reddy, Uday S.

doi:10.1007/bf01806032

Cited by 48 publications

(21 citation statements)

References 69 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reddy formulated the first semantic model for BSCI using 'object spaces' [Red96]. His model was later shown to be fully abstract by McCusker [McC02].…”

Section: Basic Syntactic Control Of Interferencementioning

confidence: 99%

On the Compositionality of Round Abstraction

Ghica

Menaa

2010

CONCUR 2010 - Concurrency Theory

View full text Add to dashboard Cite

Game Semantics is an approach to denotational semantics that has been successful in providing accurate, fully abstract models for various programming languages. It has thereafter been applied, amongst other things, to model checking, access control analysis, information flow analysis, and recently, hardware synthesis.While the roots of modern Game Semantics are sequential, several game models of asynchronous concurrency have since been devised. However, synchronous concurrency has not been considered hitherto.This thesis studies synchronous concurrency in game-like models. The central idea is to investigate deriving such synchronous models from their asynchronous counterparts using round abstraction-a technique that allows aggregating a sequence of computational steps to form a larger, more abstract macro-step.We define round abstraction within a trace-semantic setting that generalises game semantic models. We note that, in general, round abstraction is not compositional. We then identify sufficient conditions to guarantee correct composition, thereby proposing a framework for round abstraction that is sound when applied to synchronous and asynchronous behaviours.

show abstract

“…Reddy formulated the first semantic model for BSCI using 'object spaces' [Red96]. His model was later shown to be fully abstract by McCusker [McC02].…”

Section: Basic Syntactic Control Of Interferencementioning

confidence: 99%

On the Compositionality of Round Abstraction

Ghica

Menaa

2010

CONCUR 2010 - Concurrency Theory

View full text Add to dashboard Cite

show abstract

“…The first model to address this is sue correctly was O'Hearn and Reynolds's interpretation of IA using the polymorphic linear lambda calculus [8]. Reddy also addressed this issue using a novel "object semantics" approach [13], but in a particular flavour of IA known as interference-controlled Algol [6]. A further development of this model, that also satisfies this equivalence, is O'Hearn and Reddy's [7], a model fully abstract for the second order subset.…”

Section: Examples Of Reasoningmentioning

confidence: 99%

“…Intuitively it comes closest to Reddy's "object semantics" [13] and Brookes's trace semantics for sharedvariable concurrent Algol [2]. Identifiers are not interpreted using an environment, variables are not interpreted using a notion of store and functions in the language are not interpreted using a mathematical notion of function.…”

Section: Introductionmentioning

confidence: 99%

Reasoning about Idealized ALGOL Using Regular Languages

Ghica

McCusker

2000

Automata, Languages and Programming

View full text Add to dashboard Cite

Abstract. 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 method of reasoning inherits its desirable theoretical properties. The method is mathematically elementary and formal, which makes it uniquely suitable for automation. We show that reasoning can be carried out using only a meta-language of extended regular expressions, a language for which equivalence is formally decidable.

show abstract

“…Reddy calls this the object-based approach to semantics [3]. From this point of view, Reynolds's analysis of variables simply suggests viewing a variable as an object equipped with a reading-and a writing-method which it uses to communicate with the environment.…”

Section: Introductionmentioning

confidence: 99%

“…Similar philosophy can be found in encodings of imperative programs into process algebras. In denotational semantics this approach was adopted in Abramsky and McCusker's game model of Idealized Algol [4] and Reddy's work on coherence spaces [3].…”

Section: Introductionmentioning

confidence: 99%

Bad Variables Under Control

Murawski

Computer Science Logic

View full text Add to dashboard Cite

Abstract. We give a fully abstract game model for Idealized Algol with non-local control flow. In contrast to most previous papers on game semantics, we do not need to include the bad-variable constructor mkvar to obtain full abstraction. Using the model we show that, unlike in the "control-free" case, the presence of mkvar does affect observational equivalence. We conclude by discussing the effect of mkvar on nondeterministic and probabilistic variants of Idealized Algol.

show abstract

Global state considered unnecessary: An introduction to object-based semantics

Cited by 48 publications

References 69 publications

On the Compositionality of Round Abstraction

On the Compositionality of Round Abstraction

Reasoning about Idealized ALGOL Using Regular Languages

Bad Variables Under Control

Contact Info

Product

Resources

About