Polymorphic fractional capabilities

Hirotoshi Yasuoka; Tachio Terauchi

doi:10.1007/978-3-642-03237-0_5

Polymorphic fractional capabilities

Hirotoshi Yasuoka, Tachio Terauchi

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

4 Citations (Scopus)

Abstract

The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed by Boyland for checking the determinism of parallel reads in multi-thread programs, extend the capability calculus by extending the capabilities to range over the rational numbers. Fractional capabilities have since found numerous applications, including race detection, buffer bound inference, security analyses, and separation logic. However, previous work on fractional capability systems either lacked polymorphism or lacked an efficient inference procedure. Automated inference is important for the application of the calculus to static analysis. This paper addresses the issue by presenting a polymorphic fractional capability calculus that allows polynomial-time inference via a reduction to rational linear programming.

Original language	English
Title of host publication	Static Analysis - 16th International Symposium, SAS 2009, Proceedings
Pages	36-51
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-642-03237-0_5
Publication status	Published - 2009 Oct 29
Externally published	Yes
Event	16th International Symposium on Static Analysis, SAS 2009 - Los Angeles, CA, United States Duration: 2009 Aug 9 → 2009 Aug 11

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5673 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	16th International Symposium on Static Analysis, SAS 2009
Country	United States
City	Los Angeles, CA
Period	09/8/9 → 09/8/11

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-03237-0_5

Fingerprint Dive into the research topics of 'Polymorphic fractional capabilities'. Together they form a unique fingerprint.

Cite this

Yasuoka, H., & Terauchi, T. (2009). Polymorphic fractional capabilities. In Static Analysis - 16th International Symposium, SAS 2009, Proceedings (pp. 36-51). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5673 LNCS). https://doi.org/10.1007/978-3-642-03237-0_5

Polymorphic fractional capabilities. / Yasuoka, Hirotoshi; Terauchi, Tachio.

Static Analysis - 16th International Symposium, SAS 2009, Proceedings. 2009. p. 36-51 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5673 LNCS).

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

Yasuoka, H & Terauchi, T 2009, Polymorphic fractional capabilities. in Static Analysis - 16th International Symposium, SAS 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5673 LNCS, pp. 36-51, 16th International Symposium on Static Analysis, SAS 2009, Los Angeles, CA, United States, 09/8/9. https://doi.org/10.1007/978-3-642-03237-0_5

@inproceedings{a66ca2b4684c46838cdc6dc4fd9d2835,

title = "Polymorphic fractional capabilities",

abstract = "The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed by Boyland for checking the determinism of parallel reads in multi-thread programs, extend the capability calculus by extending the capabilities to range over the rational numbers. Fractional capabilities have since found numerous applications, including race detection, buffer bound inference, security analyses, and separation logic. However, previous work on fractional capability systems either lacked polymorphism or lacked an efficient inference procedure. Automated inference is important for the application of the calculus to static analysis. This paper addresses the issue by presenting a polymorphic fractional capability calculus that allows polynomial-time inference via a reduction to rational linear programming.",

author = "Hirotoshi Yasuoka and Tachio Terauchi",

year = "2009",

month = oct,

day = "29",

doi = "10.1007/978-3-642-03237-0_5",

language = "English",

isbn = "3642032362",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "36--51",

booktitle = "Static Analysis - 16th International Symposium, SAS 2009, Proceedings",

note = "16th International Symposium on Static Analysis, SAS 2009 ; Conference date: 09-08-2009 Through 11-08-2009",

}

TY - GEN

T1 - Polymorphic fractional capabilities

AU - Yasuoka, Hirotoshi

AU - Terauchi, Tachio

PY - 2009/10/29

Y1 - 2009/10/29

N2 - The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed by Boyland for checking the determinism of parallel reads in multi-thread programs, extend the capability calculus by extending the capabilities to range over the rational numbers. Fractional capabilities have since found numerous applications, including race detection, buffer bound inference, security analyses, and separation logic. However, previous work on fractional capability systems either lacked polymorphism or lacked an efficient inference procedure. Automated inference is important for the application of the calculus to static analysis. This paper addresses the issue by presenting a polymorphic fractional capability calculus that allows polynomial-time inference via a reduction to rational linear programming.

AB - The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed by Boyland for checking the determinism of parallel reads in multi-thread programs, extend the capability calculus by extending the capabilities to range over the rational numbers. Fractional capabilities have since found numerous applications, including race detection, buffer bound inference, security analyses, and separation logic. However, previous work on fractional capability systems either lacked polymorphism or lacked an efficient inference procedure. Automated inference is important for the application of the calculus to static analysis. This paper addresses the issue by presenting a polymorphic fractional capability calculus that allows polynomial-time inference via a reduction to rational linear programming.

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

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

U2 - 10.1007/978-3-642-03237-0_5

DO - 10.1007/978-3-642-03237-0_5

M3 - Conference contribution

AN - SCOPUS:70350347943

SN - 3642032362

SN - 9783642032363

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 36

EP - 51

BT - Static Analysis - 16th International Symposium, SAS 2009, Proceedings

T2 - 16th International Symposium on Static Analysis, SAS 2009

Y2 - 9 August 2009 through 11 August 2009

ER -