Specifying confidentiality in circus

Authors:
Michael J. Banks;Jeremy L. Jacob
Affiliations:
Department of Computer Science, University of York, UK;Department of Computer Science, University of York, UK
Venue:
FM'11 Proceedings of the 17th international conference on Formal methods
Year:
2011

Citing 7
Cited 0

Mathematical Models of Computer Security

FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
A UTP semantics for Circus

Formal Aspects of Computing
The Shadow Knows: Refinement and security in sequential programs

Science of Computer Programming
Breaking the Model: Finalisation and a Taxonomy of Security Attacks

Electronic Notes in Theoretical Computer Science (ENTCS)
Unifying theories of confidentiality

UTP'10 Proceedings of the Third international conference on Unifying theories of programming
Security specifications

SP'88 Proceedings of the 1988 IEEE conference on Security and privacy
Compositional noninterference from first principles

Formal Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an approach for extending the Circus formalism to accommodate information flow security concerns. Working with the semantics of Circus, we introduce a notation for specifying which aspects of Circus processes are confidential and should not be revealed to low-level users. We also describe a novel procedure for verifying that a process satisfies its confidentiality properties.