Decidability and syntactic control of interference

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We investigate the decidability of observational equivalence and approximation in Reynolds' "Syntactic Control of Interference" (SCI), a prototypical functional-imperative language in which covert interference between functions and their arguments is prevented by the use of an affine typing discipline. By associating denotations of terms in a fully abstract "relational" model of finitary basic SCI (due to Reddy) with multitape finite state automata, we show that observational approximation is not decidable (even at first order), but that observational equivalence is decidable for all terms. We then consider the same problems for basic SCI extended with non-local control in the form of backwards jumps. We show that both observational approximation and observational equivalence are decidable in this "observably sequential" version of the language by describing a fully abstract games model in which strategies are regular languages. (C) 2007 Elsevier B.V. All rights reserved.
Original languageEnglish
Pages (from-to)64-83
Number of pages20
JournalTheoretical Computer Science
Volume394
Issue number1-2
DOIs
Publication statusPublished - 31 Mar 2008

Fingerprint

Computability and decidability
Syntactics
Decidability
Interference
Equivalence
Approximation
Finite State Automata
Relational Model
Formal languages
Regular Languages
Finite automata
Term
Jump
Game
First-order
Syntax
Language

Cite this

Decidability and syntactic control of interference. / Laird, James.

In: Theoretical Computer Science, Vol. 394, No. 1-2, 31.03.2008, p. 64-83.

Research output: Contribution to journalArticle

@article{757da23762204df19615378af8b176ef,
title = "Decidability and syntactic control of interference",
abstract = "We investigate the decidability of observational equivalence and approximation in Reynolds' {"}Syntactic Control of Interference{"} (SCI), a prototypical functional-imperative language in which covert interference between functions and their arguments is prevented by the use of an affine typing discipline. By associating denotations of terms in a fully abstract {"}relational{"} model of finitary basic SCI (due to Reddy) with multitape finite state automata, we show that observational approximation is not decidable (even at first order), but that observational equivalence is decidable for all terms. We then consider the same problems for basic SCI extended with non-local control in the form of backwards jumps. We show that both observational approximation and observational equivalence are decidable in this {"}observably sequential{"} version of the language by describing a fully abstract games model in which strategies are regular languages. (C) 2007 Elsevier B.V. All rights reserved.",
author = "James Laird",
note = "ID number: ISI:000255221900003",
year = "2008",
month = "3",
day = "31",
doi = "10.1016/j.tcs.2007.10.045",
language = "English",
volume = "394",
pages = "64--83",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - Decidability and syntactic control of interference

AU - Laird, James

N1 - ID number: ISI:000255221900003

PY - 2008/3/31

Y1 - 2008/3/31

N2 - We investigate the decidability of observational equivalence and approximation in Reynolds' "Syntactic Control of Interference" (SCI), a prototypical functional-imperative language in which covert interference between functions and their arguments is prevented by the use of an affine typing discipline. By associating denotations of terms in a fully abstract "relational" model of finitary basic SCI (due to Reddy) with multitape finite state automata, we show that observational approximation is not decidable (even at first order), but that observational equivalence is decidable for all terms. We then consider the same problems for basic SCI extended with non-local control in the form of backwards jumps. We show that both observational approximation and observational equivalence are decidable in this "observably sequential" version of the language by describing a fully abstract games model in which strategies are regular languages. (C) 2007 Elsevier B.V. All rights reserved.

AB - We investigate the decidability of observational equivalence and approximation in Reynolds' "Syntactic Control of Interference" (SCI), a prototypical functional-imperative language in which covert interference between functions and their arguments is prevented by the use of an affine typing discipline. By associating denotations of terms in a fully abstract "relational" model of finitary basic SCI (due to Reddy) with multitape finite state automata, we show that observational approximation is not decidable (even at first order), but that observational equivalence is decidable for all terms. We then consider the same problems for basic SCI extended with non-local control in the form of backwards jumps. We show that both observational approximation and observational equivalence are decidable in this "observably sequential" version of the language by describing a fully abstract games model in which strategies are regular languages. (C) 2007 Elsevier B.V. All rights reserved.

UR - http://www.scopus.com/inward/record.url?scp=40049107598&partnerID=8YFLogxK

UR - http://dx.doi.org/10.1016/j.tcs.2007.10.045

U2 - 10.1016/j.tcs.2007.10.045

DO - 10.1016/j.tcs.2007.10.045

M3 - Article

VL - 394

SP - 64

EP - 83

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-2

ER -