Inferring Channel Buffer Bounds Via Linear Programming
- 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
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.