Inferring Channel Buffer Bounds Via Linear Programming

DOI10.1007/978-3-540-78739-6_22MaRDI QIDQ5458404zbMATHOpenAlexFDO

Authors Tachio Terauchi, Adam Megacz

Publication date 11 April 2008

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78739-6_22

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A linear programming approach to general dataflow process network verification and dimensioning
• Process-local static analysis of synchronous processes
• Buffered Communication Analysis in Distributed Multiparty Sessions
• An algorithm for analyzing communicating processes
• Bounded phase analysis of message-passing programs

Cited in

(4)

• Polymorphic Fractional Capabilities
• Model Checking Software
• A linear programming approach to general dataflow process network verification and dimensioning
• Deadlock checking by a behavioral effect system for lock handling

This page was built for publication: Inferring Channel Buffer Bounds Via Linear Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458404)