论文与出版物
Concurrent zero-knowledge
论文与出版物
Mixing with Mozart
视频
Transition Invariants
Proof rules for the temporal verification of concurrent programs rely on auxiliary assertions. We propose a (sound and relatively complete) proof rule whose auxiliary assertions are transition invariants. A transition invariant of a program is…