A type system for observational determinism

Tachio Terauchi

doi:10.1109/CSF.2008.9

A type system for observational determinism

Tachio Terauchi^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

31 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 language	English
Title of host publication	Proceedings - 21st IEEE Computer Security Foundations Symposium, CSF 2008
Pages	287-300
Number of pages	14
DOIs	https://doi.org/10.1109/CSF.2008.9
Publication status	Published - 2008 Sept 19
Externally published	Yes
Event	21st IEEE Computer Security Foundations Symposium, CSF 2008 - Pittsburgh, PA, United States Duration: 2008 Jun 23 → 2008 Jun 25

Publication series

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

Other

Other	21st IEEE Computer Security Foundations Symposium, CSF 2008
Country/Territory	United States
City	Pittsburgh, PA
Period	08/6/23 → 08/6/25

ASJC Scopus subject areas

Engineering(all)

Access to Document

10.1109/CSF.2008.9

Cite this

@inproceedings{874430eb7a934bf3ac96a94fdea23845,

title = "A type system for observational determinism",

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.",

author = "Tachio Terauchi",

year = "2008",

month = sep,

day = "19",

doi = "10.1109/CSF.2008.9",

language = "English",

isbn = "9780769531823",

series = "Proceedings - IEEE Computer Security Foundations Symposium",

pages = "287--300",

booktitle = "Proceedings - 21st IEEE Computer Security Foundations Symposium, CSF 2008",

note = "21st IEEE Computer Security Foundations Symposium, CSF 2008 ; Conference date: 23-06-2008 Through 25-06-2008",

}

TY - GEN

T1 - A type system for observational determinism

AU - Terauchi, Tachio

PY - 2008/9/19

Y1 - 2008/9/19

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=51749098556&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51749098556&partnerID=8YFLogxK

U2 - 10.1109/CSF.2008.9

DO - 10.1109/CSF.2008.9

M3 - Conference contribution

AN - SCOPUS:51749098556

SN - 9780769531823

T3 - Proceedings - IEEE Computer Security Foundations Symposium

SP - 287

EP - 300

BT - Proceedings - 21st IEEE Computer Security Foundations Symposium, CSF 2008

T2 - 21st IEEE Computer Security Foundations Symposium, CSF 2008

Y2 - 23 June 2008 through 25 June 2008

ER -

A type system for observational determinism

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this