Inferring Channel Buffer Bounds Via Linear Programming

  • Tachio Terauchi
  • Adam Megacz
Conference paper

DOI: 10.1007/978-3-540-78739-6_22

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4960)
Cite this paper as:
Terauchi T., Megacz A. (2008) Inferring Channel Buffer Bounds Via Linear Programming. In: Drossopoulou S. (eds) Programming Languages and Systems. ESOP 2008. Lecture Notes in Computer Science, vol 4960. Springer, Berlin, Heidelberg

Abstract

We present a static analysis for inferring the maximum amount of buffer space used by a program consisting of concurrently running processes communicating via buffered channels. We reduce the problem to linear programming by casting the analysis as a fractional capability calculus system. Our analysis can reason about buffers used by multiple processes concurrently, and runs in time polynomial in the size of the program.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Tachio Terauchi
    • 1
  • Adam Megacz
    • 2
  1. 1.Tohoku University 
  2. 2.University of CaliforniaBerkeley 

Personalised recommendations