Inferring Channel Buffer Bounds Via Linear Programming
Abstract elided by the publisher.
Related papers
- Linear type theory for asynchronous session types JFP 2010
- A capability calculus for concurrency and determinism TOPLAS 2008
- Fast and Scalable Channels in Kotlin Coroutines PPoPP 2023
- Probabilistic Resource-Aware Session Types POPL 2023
- Probabilistic Inference for Datalog with Correlated Inputs OOPSLA 2025
- Mixing Metaphors: Actors as Channels and Channels as Actors ECOOP 2017
- Selectively-Amortized Resource Bounding SAS 2021
- Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol TACAS 1999