DocumentCode
2010114
Title
A Type System for Observational Determinism
Author
Terauchi, Tachio
fYear
2008
fDate
23-25 June 2008
Firstpage
287
Lastpage
300
Abstract
Zdancewic and Myers introduced observational determinism as a scheduler independent notion of security for concurrent programs. This paper proposes a type system for verifying observational determinism. Our type system verifies observational determinism by itself, and does not require the type checked program to be confluent. A polynomial time type inference algorithm is also presented.
Keywords
Application software; Computer security; Data security; Inference algorithms; Information security; Linear programming; Polynomials; Processor scheduling; Signal analysis; Yarn; Linear Programming; Programming Language; Security; Type System;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Security Foundations Symposium, 2008. CSF '08. IEEE 21st
Conference_Location
Pittsburgh, PA, USA
ISSN
1940-1434
Print_ISBN
978-0-7695-3182-3
Type
conf
DOI
10.1109/CSF.2008.9
Filename
4556693
Link To Document