TY - GEN
T1 - Inferring channel buffer bounds via linear programming
AU - Terauchi, Tachio
AU - Megacz, Adam
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=47249102161&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=47249102161&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-78739-6_22
DO - 10.1007/978-3-540-78739-6_22
M3 - Conference contribution
AN - SCOPUS:47249102161
SN - 3540787380
SN - 9783540787389
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 284
EP - 298
BT - Programming Languages and Systems - 17th European Symposium on Programming, ESOP 2008 - Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Proceedings
T2 - 17th European Symposium on Programming, ESOP 2008
Y2 - 29 March 2008 through 6 April 2008
ER -