Abstract
Incremental design with information flow goals. Designers of secure systems would like to be able to work incrementally. Having designed a fragment of a system—and checked that it establishes some security goal—they would like to be able to design additional portions and combine them. It is, however, very difficult to ensure that the resulting composite system still establishes the security goals that the initial fragment was found to have.
This abstract, which summarizes the motivation and results of [1], is dedicated in warm friendship to Pierpaolo Degano.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Guttman, J.D., Rowe, P.D.: A cut principle for information flow? In: Computer Security Foundations Symposium. IEEE CS Press, July 2015
Sutherland, D.: A model of information. In: 9th National Computer Security Conference. National Institute of Standards and Technology (1986)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Guttman, J.D. (2015). Limited Disclosure and Locality in Graphs. In: Bodei, C., Ferrari, G., Priami, C. (eds) Programming Languages with Applications to Biology and Security. Lecture Notes in Computer Science(), vol 9465. Springer, Cham. https://doi.org/10.1007/978-3-319-25527-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-25527-9_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25526-2
Online ISBN: 978-3-319-25527-9
eBook Packages: Computer ScienceComputer Science (R0)