## 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 \emph{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.

• Full text (.pdf)
• Extended abstract (.pdf)
• Bibtex entry:

@article{scidlong,
author = "J. Laird",
title = "Decidability and Syntactic Control of Interference",
journal = "Theoretical Computer Science",
volume = 394,
issue = "2-3",
pages = "64-83",
year = 2008}