Compositional Termination Proofs for Multi-threaded Programs

DOI10.1007/978-3-642-28756-5_17zbMath1352.68067OpenAlexW182717014MaRDI QIDQ2894275

Andrey Rybalchenko, Corneliu Popeea

Publication date: 29 June 2012

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28756-5_17

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

May-Happen-in-Parallel Analysis for Actor-Based Concurrency ⋮ Rely-guarantee termination and cost analyses of loops with concurrent interleavings ⋮ Towards a Thread-Local Proof Technique for Starvation Freedom

This page was built for publication: Compositional Termination Proofs for Multi-threaded Programs