ACM Home Page
Please provide us with feedback. Feedback
A mechanism for information control in parallel systems
Full text PdfPdf (679 KB)
Source ACM Symposium on Operating Systems Principles archive
Proceedings of the seventh ACM symposium on Operating systems principles table of contents
Pacific Grove, California, United States
Pages: 55 - 63  
Year of Publication: 1979
ISBN:0-89791-009-5
Author
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 14,   Citation Count: 2
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/800215.806570
What is a DOI?

ABSTRACT

Denning and Denning have shown how the information security of sequential programs can be certified by a compile-time mechanism [3]. This paper extends their work by presenting a mechanism for certifying parallel programs. The mechanism is shown to be consistent with an axiomatic description of information transmission.


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
2
3
 
4
Fenton, J.S. Memoryless subsystems. Computer Journal 17, 2 (May 1974), 143-147.
5
6
7
 
8
 
9
Owicki, S. and Gries, D. An axiomatic proof technique for parallel programs I. Acta Informatica 6 (1976), 319-340.
10