Compositional verification of termination-preserving refinement of concurrent programs

DOI10.1145/2603088.2603123zbMath1392.68258OpenAlexW2154642390MaRDI QIDQ4635650

Zhong Shao, Xinyu Feng, Hongjin Liang

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

zbMATH Keywords

simulationrefinementconcurrencyrely-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)

Related Items (2)

A Higher-Order Logic for Concurrent Termination-Preserving Refinement ⋮ Modular Termination Verification for Non-blocking Concurrency

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