A type system for observational determinism

Research output: Chapter in Book/Report/Conference proceedingConference contribution

25 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - 21st IEEE Computer Security Foundations Symposium, CSF 2008
Pages287-300
Number of pages14
DOIs
Publication statusPublished - 2008 Sep 19
Event21st IEEE Computer Security Foundations Symposium, CSF 2008 - Pittsburgh, PA, United States
Duration: 2008 Jun 232008 Jun 25

Publication series

NameProceedings - IEEE Computer Security Foundations Symposium
ISSN (Print)1940-1434

Other

Other21st IEEE Computer Security Foundations Symposium, CSF 2008
CountryUnited States
CityPittsburgh, PA
Period08/6/2308/6/25

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Terauchi, T. (2008). A type system for observational determinism. In Proceedings - 21st IEEE Computer Security Foundations Symposium, CSF 2008 (pp. 287-300). [4556693] (Proceedings - IEEE Computer Security Foundations Symposium). https://doi.org/10.1109/CSF.2008.9