Skip to main content
SpringerLink
Log in

Decidability in Syntactic Control of Interference

  • Conference paper
Automata, Languages and Programming (ICALP 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3580))

Included in the following conference series:

  • 2977 Accesses

Abstract

We investigate the decidability of observational equivalence and approximation in “Syntactic Control of Interference” (SCI). By associating denotations of terms in an inequationally fully abstract model of finitary basic SCI 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 language by describing a fully abstract games model in which strategies are regular languages.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky, S., McCusker, G.: Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions. In: O’Hearn, P.W., Tennent, R. (eds.) Algol-like languages. Birkhauser, Basel (1997)

    Google Scholar 

  2. Cartwright, R., Felleisen, M.: Observable sequentiality and full abstraction. In: Proceedings of POPL 1992 (1992)

    Google Scholar 

  3. Ghica, D., McCusker, G.: The regular language semantics of second-order Idealised Algol. Theoretical Computer Science (2003) (to appear)

    Google Scholar 

  4. Harju, T., Karhumäki, J.: The equivalence problem of multitape finite automata. Theoretical Computer Science 78, 347–355 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hindley, J.R.: Basic Simple Type Theory. Cambridge University Press, Cambridge (1997)

    Book  MATH  Google Scholar 

  6. Hyland, J.M.E., Ong, C.-H.L.: On full abstraction for PCF: I, II and III. Information and Computation 163, 285–408 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kinber, E.: The inclusion problem for some classes of deterministic multitape automata. Theoretical Computer Science 26, 62–73 (1983)

    Article  MathSciNet  Google Scholar 

  8. Laird, J.: Game semantics and Linear CPS interpretation. Theoretical Computer Science 333, 199–224 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  9. Loader, R.: Finitary PCF is undecidable. Annals of Pure and Applied Logic (2000)

    Google Scholar 

  10. McCusker, G.: A fully abstract relational model of Syntactic Control of Interference. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, p. 247. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. McCusker, G.: On the semantics of the bad-variable constructor in Algol-like languages. In: Proceedings of MFPS XIX. ENTCS (2003) (to appear)

    Google Scholar 

  12. McCusker, G., Wall, M.: Categorical and game semantics for SCIR. In: The proceedings of Games for Logics and Programming Languages (2004)

    Google Scholar 

  13. Murawski, A.: On program equivalence in languages with ground-type references. In: Proceedings of LICS 2003. IEEE Press, Los Alamitos (2003)

    Google Scholar 

  14. Murawski, A., Walukiewicz, I.: Third-order Idealized Algol with iteration is decidable. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 202–218. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. O’Hearn, P.W., Power, A.J., Takeyama, M., Tennent, R.D.: Syntactic control of interference revisited. Theoretical Computer Science 228(1-2), 211–252 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  16. Rabin, M., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development 3, 114–125 (1959)

    Article  MathSciNet  Google Scholar 

  17. Reddy, U.S.: Global state considered unnecesary: Object-based semantics for interference-free imperative programs. Lisp and Symbolic Computation 9(1) (1996)

    Google Scholar 

  18. Reynolds, J.: Syntactic Control of Interference. Conf. Record 5th ACM Symposium on Principles of Programming Languages, 39–46 (1978)

    Google Scholar 

  19. Reynolds, J.: The essence of Algol. In: Algorithmic Languages, pp. 345–372. North Holland, Amsterdam (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Informatics, University of Sussex, UK

    J. Laird

Authors
  1. J. Laird
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CITI / Departamento de Informática, Universidade Nova de Lisboa, Portugal

    Luís Caires

  2. Dipartimento di Informatica, Sistemi e Produzione, Università di Roma “Tor Vergata”, via del Politecnico 1, 00133, Roma, Italy

    Giuseppe F. Italiano

  3. Departamento de Informatica, Universidade Nova de Lisboa, 2829-516, Caparica, Portugal

    Luís Monteiro

  4. Ecole Polytechnique, Rue de Saclay, 91128, Palaiseau Cedex, France

    Catuscia Palamidessi

  5. Computer Science Department, Google Inc. and Columbia University, 1214 Amsterdam Avenue, NY 10027, New York, USA

    Moti Yung

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Laird, J. (2005). Decidability in Syntactic Control of Interference. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_73

Download citation

  • DOI: https://doi.org/10.1007/11523468_73

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27580-0

  • Online ISBN: 978-3-540-31691-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation