Polymorphic Fractional Capabilities

  • Hirotoshi Yasuoka
  • Tachio Terauchi
Conference paper

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

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5673)
Cite this paper as:
Yasuoka H., Terauchi T. (2009) Polymorphic Fractional Capabilities. In: Palsberg J., Su Z. (eds) Static Analysis. SAS 2009. Lecture Notes in Computer Science, vol 5673. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Hirotoshi Yasuoka
    • 1
  • Tachio Terauchi
    • 1
  1. 1.Tohoku UniversityJapan

Personalised recommendations