Polymorphic fractional capabilities

Hirotoshi Yasuoka*, Tachio Terauchi

*Corresponding author for this work

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

5 Citations (Scopus)


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
Number of pages16
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


Other16th International Symposium on Static Analysis, SAS 2009
Country/TerritoryUnited States
CityLos Angeles, CA

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


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

Cite this