Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 2000: Automata, Languages and Programming pp 103–115Cite as

Reasoning about Idealized ALGOL Using Regular Languages

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1853))

Abstract

We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized AupLGOL (IA) by expressing sets of complete plays as regular languages. Being derived directly from the fully abstract game semantics for IA, our method of reasoning inherits its desirable theoretical properties. The method is mathematically elementary and formal, which makes it uniquely suitable for automation. We show that reasoning can be carried out using only a meta-language of extended regular expressions, a language for which equivalence is formally decidable.

This author acknowledges the support of a PGSB grant from the Natural Sciences and Engineering Research Council of Canada. This paper was written while visiting University of Edinburgh, Laboratory for Foundations of Computer Science.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abramsky and G. McCusker. Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions (extended abstract). In Proceedings of 1996 Workshop on Linear Logic, volume3 of Electronic notes in Theoretical Computer Science. Elsevier, 1996. Also as Chapter 20 of [10].

    Google Scholar 

  2. S. Brookes. Full abstraction for a shared variable parallel language. In Proceedings, 8th Annual IEEE Symposium on Logic in Computer Science, pages 98–109, Montreal, Canada, 1993. IEEE Computer Society Press, Los Alamitos, California.

    Google Scholar 

  3. C. Hankin and P. Malacaria. Generalised flowcharts and games. Lecture Notes in Computer Science, 1443, 1998.

    Google Scholar 

  4. C. Hankin and P. Malacaria. A new approach to control flow analysis. Lecture Notes in Computer Science, 1383, 1998.

    Google Scholar 

  5. A. R. Meyer and K. Sieber. Towards fully abstract semantics for local variables: preliminary report. In Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, pages 191–203, San Diego, California, 1988. ACM, New York. Reprinted as Chapter 7 of [10].

    Google Scholar 

  6. P. W. O’Hearn, A. J. Power, M. Takeyama, and R. D. Tennent. Syntactic control of interference revisited. Theoretical Computer Science, 228:175–210, 1999. Preliminary version reprinted as Chapter 18 of [10].

    Article  MathSciNet  Google Scholar 

  7. P. W. O’Hearn and U. S. Reddy. Objects, interference and the Yoneda embedding. In S. Bookes, M. Main, A. Melton, and M. Mislove, editors, Mathematical Foundations of Programming Semantics, Eleventh Annual Conference, volume 1 of Electronic Notes in Theoretical Computer Science, Tulane University, New Orleans, Louisiana, Mar. 29–Apr. 1 1995. Elsevier Science (http://www.elsevier.nl).

    Google Scholar 

  8. P. W. O’Hearn and J. C. Reynolds. From Algol to polymorphic linear lambda-calculus. Journal of the Association for Computing Machinery, to appear.

    Google Scholar 

  9. P. W. O’Hearn and R. D. Tennent. Relational parametricity and local variables. In Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 171–184, Charleston, South Carolina, 1993. ACM, New York. A version also published as Chapter 16 of [10].

    Chapter  Google Scholar 

  10. P. W. O’Hearn and R. D. Tennent, editors. Algol-like Languages. Progress in Theoretical Computer Science. Birkhäuser, Boston, 1997. Two volumes.

    Google Scholar 

  11. F. J. Oles. A Category-Theoretic Approach to the Semantics of Programming Languages. Ph.D. thesis, Syracuse University, Syracuse, N.Y., 1982.

    Google Scholar 

  12. A. M. Pitts. Reasoning about local variables with operationally-based logical relations. In 11th Annual Symposium on Logic in Computer Science, pages 152–163. IEEE Computer Society Press, Washington, 1996. A version also published as Chapter 17 of [10].

    Chapter  Google Scholar 

  13. U. S. Reddy. Global state considered unnecessary: Introduction to object-based semantics. Lisp and Symbolic Computation, 9(1):7–76, 1996. Published also as Chapter 19 of [10].

    Article  Google Scholar 

  14. J. C. Reynolds. Syntactic control of interference. In Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, pages 39–46, Tucson, Arizona, Jan. 1978. ACM, New York.

    Google Scholar 

  15. J. C. Reynolds. The essence of Algol. In J.W. de Bakker and J. C. van Vliet, editors, Algorithmic Languages, Proceedings of the International Symposium on Algorithmic Languages, pages 345–372, Amsterdam, Oct. 1981. North-Holland, Amsterdam. Reprinted as Chapter 3 of [10].

    Google Scholar 

  16. D. A. Schmidt. On the need for a popular formal semantics. ACM SIGPLAN Notices, 32(1):115–116, Jan. 1997.

    Google Scholar 

  17. D. S. Scott and C. Strachey. Toward a mathematical semantics for computer languages. InJ. Fox, editor, Proceedings of the Symposium on Computers and Automata, volume 21 of Microwave Research Institute Symposia Series, pages 19–46. Polytechnic Institute of Brooklyn Press, New York, 1971. Also Technical Monograph PRG-6, Oxford University Computing Laboratory, Programming Research Group, Oxford.

    Google Scholar 

  18. K. Sieber. Full abstraction for the second order subset of an Algol-like language. In Mathematical Foundations of Computer Science, volume 841 of Lecture Notes in Computer Science, pages 608–617, Kosice, Slovakia, Aug. 1994. Springer-Verlag, Berlin. A version also published as Chapter 15 of [10].

    Google Scholar 

  19. L. J. Stockmeyer. The complexity of decision problems in automata theory and logic. Technical Report MIT/LCS/TR-133, Massachusetts Institute of Technology, Laboratory for Computer Science, July 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing and Information Science, Queen’s University, Kingston, Ontario, Canada, K7L 3N6

    Dan R. Ghica

  2. School of Cognitive and Computing Sciences, University of Sussex at Brighton, Falmer, Brighton, UK, BN1 9QH

    Guy McCusker

Authors
  1. Dan R. Ghica
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guy McCusker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Sciences, University of Pisa, Corso Italia, 40, 56125, Pisa, Italy

    Ugo Montanari

  2. Center for Computer Sciences, University of Geneva, 24, Rue Général Dufour, 1211, Geneva 4, Switzerland

    José D. P. Rolim

  3. Department of Computer Sciences, ETH Zurich, 8092, Zurich, Switzerland

    Emo Welzl

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ghica, D.R., McCusker, G. (2000). Reasoning about Idealized ALGOL Using Regular Languages. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds) Automata, Languages and Programming. ICALP 2000. Lecture Notes in Computer Science, vol 1853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45022-X_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-45022-X_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67715-4

  • Online ISBN: 978-3-540-45022-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation