The equivalence problem of multitape finite automata
Theoretical Computer Science
Observable sequentiality and full abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Syntactic control of interference revisited
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
On full abstraction for PCF: I, II, and III
Information and Computation
Theoretical Computer Science
Syntactic control of interference
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Fully Abstract Relational Model of Syntactic Control of Interference
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Full abstraction for functional languages with control
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Game Semantics for General References
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
On Program Equivalence in Languages with Ground-Type References
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The regular-language semantics of second-order idealized ALGOL
Theoretical Computer Science
Computation: finite and infinite machines
Computation: finite and infinite machines
Game semantics and linear CPS interpretation
Theoretical Computer Science - Foundations of software science and computation structures
Decidability and syntactic control of interference
Theoretical Computer Science
On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Finite automata and their decision problems
IBM Journal of Research and Development
Third-order idealized algol with iteration is decidable
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Decidability and syntactic control of interference
Theoretical Computer Science
| Hi-index | 5.23 |
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.