Inferring channel buffer bounds via linear programming

Tachio Terauchi, Adam Megacz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationProgramming 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
Pages284-298
Number of pages15
DOIs
Publication statusPublished - 2008 Jul 21
Event17th European Symposium on Programming, ESOP 2008 - Budapest, Hungary
Duration: 2008 Mar 292008 Apr 6

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4960 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other17th European Symposium on Programming, ESOP 2008
CountryHungary
CityBudapest
Period08/3/2908/4/6

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

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