Skip to main content
SpringerLink
Log in

Generalised flowcharts and games

Extended abstract

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1998)

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

Included in the following conference series:

Abstract

We introduce a generalization of the classical notion of flowchart for languages with higher order and object-oriented features. These general flowcharts are obtained by an abstraction of the game semantics for Idealized Algol and as such rely on a solid mathematical basis. We demonstrate how charts may be used as the basis for data flow analysis.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky S., Jagadeesan R. and Malacaria P. Pull abstraction for PCF (extended abstract). In Proc. TACS'94, LNCS 789, pp 1–15, Springer-Verlag, 1994.

    Google Scholar 

  2. Abramsky S. and McCusker G. Linearity, sharing and state: a fully abstract game semantics for Idealised Algol with active expressions. Draft manuscript, 1997.

    Google Scholar 

  3. Aho A. V., Sethi R. and Ullman J. D. Compilers: Principles, Techniques, Tools. Addison-Wesley, 1986.

    Google Scholar 

  4. V. Danos, H. Herbelin and L. Regnier. Game semantics and abstract machines. In Proc. LICS'96, IEEE Press, 1996.

    Google Scholar 

  5. Horwitz S., Reps T. and Sagiv M. Demand Interprocedural Dataflow Analysis. Proc. of the 3rd ACM SIGSOFT Symposium on Foundations of Software Engineering, ACM Press, 1995

    Google Scholar 

  6. Hyland M. and Ong L. On full abstraction for PCF: I, II and III. 130 pages, ftp-able at theory.doc.ic.ac.uk in directory papers/Ong, 1994

    Google Scholar 

  7. Jagannathan S. and Weeks S. A unified treatment of flow analysis in higherorder languages. In Proc. POPL'95, pp 393-407, ACM Press, 1995.

    Google Scholar 

  8. Malacaria P. and Hankin C. A New Approach to Control Flow Analysis. In Proc. CC'98, LNCS 1383, pp 95–108, Springer-Verlag, 1998.

    Google Scholar 

  9. Nielson F. and Nielson H. R. Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis. In Proc. POPL'97, pp 332–345, ACM Press, 1997.

    Google Scholar 

  10. Nielson F., Nielson H. R. and Hankin C. Principles of Program Analysis: Flows and Effects. to appear, 1999.

    Google Scholar 

  11. Reynolds J. C. Syntactic control of interference. In Proc. POPL'78, pp 39–46, ACM Press, 1978.

    Google Scholar 

  12. Reynolds J. C. The essence of Algol. In J. W. de Bakker and J. C. van Vliet (eds), Algorithmic Languages, pp 345–372, North-Holland, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computing, Imperial College, SW7 2BZ, London

    Pasquale Malacaria & Chris Hankin

Authors
  1. Pasquale Malacaria
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chris Hankin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kim G. Larsen Sven Skyum Glynn Winskel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Malacaria, P., Hankin, C. (1998). Generalised flowcharts and games. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055067

Download citation

  • DOI: https://doi.org/10.1007/BFb0055067

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64781-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation