Compositional verification of termination-preserving refinement of concurrent programs

DOI10.1145/2603088.2603123zbMATH Open1392.68258OpenAlexW2154642390MaRDI QIDQ4635650FDOQ4635650

Authors: Hongjin Liang, Xinyu Feng, Zhong Shao 

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2603088.2603123

Recommendations

• Refinement for structured concurrent programs
• A higher-order logic for concurrent termination-preserving refinement
• On using temporal logic for refinement and compositional verification of concurrent systems
• Compositional termination proofs for multi-threaded programs
• Using refinement calculus techniques to prove linearizability

zbMATH Keywords

simulationconcurrencyrefinementrely-guarantee reasoningtermination preservation

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (7)

• Compositional Nonblocking Verification Using Generalized Nonblocking Abstractions
• Stabilization-preserving atomicity refinement
• A Higher-Order Logic for Concurrent Termination-Preserving Refinement
• Modular Termination Verification for Non-blocking Concurrency
• CompCertTSO
• Compositional termination proofs for multi-threaded programs
• On the computation of counterexamples in compositional nonblocking verification

This page was built for publication: Compositional verification of termination-preserving refinement of concurrent programs

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