Information flow for Algol-like languages

Authors:
David Clark;Chris Hankin;Sebastian Hunt
Affiliations:
Department of Computer Science, King's College, London WC2R 2LS, UK;Department of Computing, Imperial College, London SW7 2BZ, UK;Department of Computing, City University, London EC1V 0HB, UK
Venue:
Computer Languages, Systems and Structures
Year:
2002

Citing 8
Cited 20

A lattice model of secure information flow

Communications of the ACM
A uniform type structure for secure information flow

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Flow Logic for Imperative Objects

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Probabilistic Game Semantics

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Eliminating Covert Flows with Minimum Typings

CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Probabilistic Noninterference in a Concurrent Language

CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
Probabilistic Noninterference for Multi-Threaded Programs

CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
A New Type System for Secure Information Flow

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations

Abstract non-interference: parameterizing non-interference by abstract interpretation

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On flow-sensitive security types

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fault Evaluation for Security-Critical Communications Devices

Computer
A logic for information flow analysis with an application to forward slicing of simple imperative programs

Science of Computer Programming
Instruction-level security analysis for information flow in stack-based assembly languages

Information and Computation
Optimality and condensing of information flow through linear refinement

Theoretical Computer Science
Static analysis for inference of explicit information flow

Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Mechanized information flow analysis through inductive assertions

Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Integrating hardware and software information flow analyses

Proceedings of the 2009 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
From exponential to polynomial-time security typing via principal types

ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Magic-sets for localised analysis of Java bytecode

Higher-Order and Symbolic Computation
From security protocols to systems security

Proceedings of the 11th international conference on Security Protocols
Timed abstract non-interference

FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Information flow analysis for java bytecode

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Adjoining declassification and attack models by abstract interpretation

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Bridging language-based and process calculi security

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Generalized abstract non-interference: abstract secure information-flow analysis for automata

MMM-ACNS'05 Proceedings of the Third international conference on Mathematical Methods, Models, and Architectures for Computer Network Security
The PER model of abstract non-interference

SAS'05 Proceedings of the 12th international conference on Static Analysis
Information flow is linear refinement of constancy

ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Quantitative program dependence graphs

ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering

Quantified Score

Hi-index	0.00

Visualization

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.