Information Flow for Algol-like Languages

David Clark, Chris Hankin, Sebastian Hunt

Research output: Contribution to journalArticlepeer-review

41 Citations (Scopus)

Abstract

In this paper we present an approach to information flow analysis for a family of languages. We start with a simple imperative language. We present an information flow analysis using a flow logic. The paper contains detailed correctness proofs for this analysis. We next extend the analysis to a restricted form of Idealised Algol, a call-by-value higher-order extension of the simple imperative language (the key restriction being the lack of recursion). The paper concludes with a discussion of further extensions, including a probabilistic extension of Idealised Algol.
Original languageEnglish
Pages (from-to)3 - 28
Number of pages26
JournalCOMPUTER LANGUAGES SYSTEMS AND STRUCTURES
Volume28
Issue number1
DOIs
Publication statusPublished - Apr 2002

Fingerprint

Dive into the research topics of 'Information Flow for Algol-like Languages'. Together they form a unique fingerprint.

Cite this