Inferring channel buffer bounds via linear programming

Tachio Terauchi*, Adam Megacz

*この研究の対応する著者

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトル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
ページ284-298
ページ数15
DOI
出版ステータスPublished - 2008
外部発表はい
イベント17th European Symposium on Programming, ESOP 2008 - Budapest, Hungary
継続期間: 2008 3 292008 4 6

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4960 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other17th European Symposium on Programming, ESOP 2008
国/地域Hungary
CityBudapest
Period08/3/2908/4/6

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Inferring channel buffer bounds via linear programming」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル