Skip to main content
Conference Proceedings

Generalised flowcharts and games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1998) 1443 LNCS 363-374
DOI: 10.1007/bfb0055067
13Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Malacaria, P., & Hankin, C. (1998). Generalised flowcharts and games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1443 LNCS, pp. 363–374). Springer Verlag. https://doi.org/10.1007/bfb0055067

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free