A type system for observational determinism

Tachio Terauchi*

*Corresponding author for this work

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

32 Citations (Scopus)


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
Number of pages14
Publication statusPublished - 2008 Sept 19
Externally publishedYes
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


Other21st IEEE Computer Security Foundations Symposium, CSF 2008
Country/TerritoryUnited States
CityPittsburgh, PA

ASJC Scopus subject areas

  • General Engineering


Dive into the research topics of 'A type system for observational determinism'. Together they form a unique fingerprint.

Cite this