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 |
| Volume | 5673 LNCS |
| DOIs | |
| Publication status | Published - 2009 |
| 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 |
Fingerprint
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)
Cite this
Polymorphic fractional capabilities. / Yasuoka, Hirotoshi; Terauchi, Tachio.
Static Analysis - 16th International Symposium, SAS 2009, Proceedings. Vol. 5673 LNCS 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
}
TY - GEN
T1 - Polymorphic fractional capabilities
AU - Yasuoka, Hirotoshi
AU - Terauchi, Tachio
PY - 2009
Y1 - 2009
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
SN - 3642032362
SN - 9783642032363
VL - 5673 LNCS
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
ER -