Semantic Analysis of Communicating Sequential Processes (Shortened Version)
暂无分享,去创建一个
[1] Willem P. de Roever,et al. A Proof System for Communicating Sequential Processes , 1980, ACM Trans. Program. Lang. Syst..
[2] Edmund M. Clarke. Proving the correctness of coroutines without history variables , 1978, ACM-SE 16.
[3] P. Cousot,et al. Constructive versions of tarski's fixed point theorems , 1979 .
[4] Jayadev Misra,et al. An Axiomatic Proof Technique for Networks of Communicating Processes , 1979 .
[5] John H. Reif,et al. Data flow analysis of communicating processes , 1979, POPL.
[6] Edmund M. Clarke,et al. Synthesis of resource invariants for concurrent programs , 1979, POPL.
[7] Patrick Cousot,et al. Systematic design of program analysis frameworks , 1979, POPL.
[8] Nicolas Halbwachs,et al. Automatic discovery of linear restraints among variables of a program , 1978, POPL.
[9] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.
[10] Patrick Cousot,et al. Automatic synthesis of optimal invariant assertions: Mathematical foundations , 1977, Artificial Intelligence and Programming Languages.
[11] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.