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 Dive into the research topics of 'Decidability and syntactic control of interference'. Together they form a unique fingerprint.

  • Cite this