By Topic

Using traces based on procedure calls to reason about composability

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
C. Meadows ; US Naval Res. Lab., Washington, DC, USA

Information flow models are usually conceived in terms of requirements on system traces, while verification that a system satisfies information flow requirements is usually done in terms of a state machine specification. The necessary translation from one model to another may result in a loss of understandability and expressiveness. J. McLean (JACM, Vol.31, no.3, pp.600-627, July 1984) showed how a language based on traces of procedure calls may be used to reason about security, and how one may prove that a program satisfies a specification written in that language. The language that he uses, however, does not easily lend itself to specification of composition of communicating processes. The present work modifies the language so that it is possible to specify the composition of systems. Several different information flow properties analogous to properties that have been defined for other systems, along with their composability, are defined and discussed

Published in:

Research in Security and Privacy, 1992. Proceedings., 1992 IEEE Computer Society Symposium on

Date of Conference:

4-6 May 1992