Inferring Channel Buffer Bounds Via Linear Programming
From MaRDI portal
Publication:5458404
DOI10.1007/978-3-540-78739-6_22zbMath1133.68387OpenAlexW1736097396MaRDI QIDQ5458404
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
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (2)
Deadlock checking by a behavioral effect system for lock handling ⋮ Polymorphic Fractional Capabilities
This page was built for publication: Inferring Channel Buffer Bounds Via Linear Programming