Sciweavers

ESOP
2008
Springer

Inferring Channel Buffer Bounds Via Linear Programming

13 years 7 months ago
Inferring Channel Buffer Bounds Via Linear Programming
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.
Tachio Terauchi, Adam Megacz
Added 19 Oct 2010
Updated 19 Oct 2010
Type Conference
Year 2008
Where ESOP
Authors Tachio Terauchi, Adam Megacz
Comments (0)