Research

Decidability and syntactic control of interference


Reference:

Laird, J., 2008. Decidability and syntactic control of interference. Theoretical Computer Science, 394 (1-2), pp. 64-83.

Related documents:

This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below. (Contact Author)

Official URL:

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

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.

Details

Item Type Articles
CreatorsLaird, J.
DOI10.1016/j.tcs.2007.10.045
DepartmentsFaculty of Science > Computer Science
RefereedYes
StatusPublished
ID Code5259
Additional InformationID number: ISI:000255221900003

Export

Actions (login required)

View Item