×

zbMATH — the first resource for mathematics

Inferring channel buffer bounds via linear programming. (English) Zbl 1133.68387
Drossopoulou, Sophia (ed.), 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, Budapest, Hungary, March 29–April 6, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78738-9/pbk). Lecture Notes in Computer Science 4960, 284-298 (2008).
Summary: 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.
For the entire collection see [Zbl 1133.68003].

MSC:
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68N30 Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
PDF BibTeX XML Cite
Full Text: DOI