Skip to main content
Conference ProceedingsOPEN ACCESS

Inferring channel buffer bounds via linear programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 4960 LNCS 284-298
DOI: 10.1007/978-3-540-78739-6_22
2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Terauchi, T., & Megacz, A. (2008). Inferring channel buffer bounds via linear programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4960 LNCS, pp. 284–298). https://doi.org/10.1007/978-3-540-78739-6_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free