Polymorphic fractional capabilities

Hirotoshi Yasuoka, Tachio Terauchi

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationStatic Analysis - 16th International Symposium, SAS 2009, Proceedings
Pages36-51
Number of pages16
Volume5673 LNCS
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event16th International Symposium on Static Analysis, SAS 2009 - Los Angeles, CA, United States
Duration: 2009 Aug 92009 Aug 11

Publication series

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

Other

Other16th International Symposium on Static Analysis, SAS 2009
CountryUnited States
CityLos Angeles, CA
Period09/8/909/8/11

Fingerprint

Fractional
Static analysis
Polymorphism
Linear programming
Calculus
Polynomials
Data storage equipment
Multi-thread
Separation Logic
Determinism
Static Analysis
Buffer
Polynomial time
Reasoning
Resources
Range of data

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Yasuoka, H., & Terauchi, T. (2009). Polymorphic fractional capabilities. In Static Analysis - 16th International Symposium, SAS 2009, Proceedings (Vol. 5673 LNCS, 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. 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 proceedingConference contribution

Yasuoka, H & Terauchi, T 2009, Polymorphic fractional capabilities. in Static Analysis - 16th International Symposium, SAS 2009, Proceedings. vol. 5673 LNCS, 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
Yasuoka H, Terauchi T. Polymorphic fractional capabilities. In 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)). https://doi.org/10.1007/978-3-642-03237-0_5
Yasuoka, Hirotoshi ; Terauchi, Tachio. / Polymorphic fractional capabilities. Static Analysis - 16th International Symposium, SAS 2009, Proceedings. Vol. 5673 LNCS 2009. pp. 36-51 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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",
doi = "10.1007/978-3-642-03237-0_5",
language = "English",
isbn = "3642032362",
volume = "5673 LNCS",
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",

}

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 -