In this paper, we first propose a new simulation technique, which establishes termination-preserving refinement and is a congruence with respect to parallel ...
In this paper, we first propose a new simulation technique, which estab- lishes termination-preserving refinement and is a congruence with respect to parallel ...
Nov 25, 2015 · In this paper, we first propose a new simulation technique, which establishes termination-preserving refinement and is a congruence with respect ...
Compositional Verification of. Termination-Preserving Refinement of Concurrent Programs. Hongjin Liang. Univ. of Science and Technology of China (USTC). Joint ...
This paper presents a flow-sensitive dependent type system for enforcing timing-sensitive value-dependent noninterference for shared memory concurrent programs, ...
We show two key applications of our logic, i.e., verifying linearizability and lock-freedom together for fine-grained concurrent objects, and verifying full ...
However, existing work on verifying refinement of concurrent programs either fails to prove the preservation of termination, allowing a diverging program to ...
This paper presents a flow-sensitive dependent type system for enforcing timing-sensitive value-dependent noninterference for shared memory concurrent programs, ...
Hongjin Liang, Xinyu Feng, Zhong Shao : Compositional verification of termination-preserving refinement of concurrent programs. CSL-LICS 2014: 65:1-65:10.
People also ask
What is compositional reasoning for concurrent programs?
What is concurrent verification?
Compositional verification of termination-preserving refinement of concurrent programs. In CSL-LICS, July 2014. [LNNF16]. Ximeng Li, Flemming Nielson, Hanne ...