ACM Home Page
Please provide us with feedback. Feedback
An Axiomatic Approach to Information Flow in Programs
Full text PdfPdf (1.20 MB)
Source ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 2 ,  Issue 1  (January 1980) table of contents
Pages: 56 - 76  
Year of Publication: 1980
ISSN:0164-0925
Authors
Gregory R. Andrews  Department of Computer Science, University of Arizona, Tucson, AZ
Richard P. Reitman  School of Computer and Information Science, 313 Link Hall, Syracuse University, Syracuse, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 68,   Citation Count: 33
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/357084.357088
What is a DOI?

ABSTRACT

A new approach to information flow in sequential and parallel programs is presented. Flow proof rules that capture the information flow semantics of a variety of statements are given and used to construct program flow proofs. The method is illustrated by examples. The applications of flow proofs to certifying information flow policies and to solving the confinement problem are considered. It is also shown that flow rules and correctness rules can be combined to form an even more powerful proof system.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BRINCH HANSEN, P. The programming language Concurrent Pascal. IEEE Trans. Sofiw. Eng. SE-1, 2 (June 1975), 199-207.
2
3
4
 
5
DIZKSTRA, E.W. Cooperating sequential processes. In Programming Languages (F. Genuys, Ed.), Academic Press, New York, 1968.
 
6
FENTON, J.S. Memoryless subsystems. Comput. J. 17, 2 (May 1974), 143-147.
 
7
GAT, I. Security aspects of computer systems. Ph.D. Thesis, Technion--Israel inst. of Technology, June 1976.
8
9
10
11
12
 
13
 
14
MCGRAW, J.R., ANO ANOREWS, G.R. Access control in parallel programs. IEEE Trans. Softw. Eng. SE-5, 1 (Jan. 1979), 1-9.
15
 
16
 
17
NF-UMANN, P.G., ET AL. A provably secure operating system: The system, its applications, and proofs. Final Rep., SRi Proj. 4332, SRI International, Menlo Park, Calif., Feb. 1977.
 
18
OWICKI, S., AND GRIES, D. An axiomatic proof technique for parallel programs. Acta Inf. 6 (1976), 319-340.
19
20
 
21
22
 
23
WEISSMAN, C. Security controls in the Adept-50 time-sharing system. AFIPS 1969 FJCC, Vol. 35, AFIPS Press, Arlington, Va., pp. 119-133.

CITED BY  33

Collaborative Colleagues:
Gregory R. Andrews: colleagues
Richard P. Reitman: colleagues