Menu_Home Home   Menu_Latest Latest   Menu_Search Advanced Search   Menu_Browse_by_Year By Year   Menu_Browse_by_Division By Division
  
Screen decoration graphicsLogo

Information Flow for ALGOL-like Languages

Clark, David and Hunt, Sebastian and Hankin, Chris (2002) Information Flow for ALGOL-like Languages. Computer Languages, 28 (1). pp. 3-28.

[img]
Preview
Postscript - Requires a viewer, such as GSview
340Kb

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.

Item Type:Article
Subjects:UNSPECIFIED
ID Code:1104
Deposited By:Dr. David Clark
Deposited On:13 Nov 2007 16:47
Last Modified:13 Nov 2007 16:47

Repository Staff Only: item control page