Rely-guarantee bound analysis of parameterized concurrent shared-memory programs

Thomas Pani, Georg Weissenbacher, Florian Zuleger
2021 Formal methods in system design  
AbstractWe present a thread-modular proof method for complexity and resource bound analysis of concurrent, shared-memory programs. To this end, we lift Jones' rely-guarantee reasoning to assumptions and commitments capable of expressing bounds. The compositionality (thread-modularity) of this framework allows us to reason about parameterized programs, i.e., programs that execute arbitrarily many concurrent threads. We automate reasoning in our logic by reducing bound analysis of concurrent
more » ... ams to the sequential case. As an application, we automatically infer time complexity for a family of fine-grained concurrent algorithms, lock-free data structures, to our knowledge for the first time.
doi:10.1007/s10703-021-00370-8 fatcat:fuaaruuhkfbflnj3pyzjo7khou