Separation Logic
By Peter O'Hearn Communications of the ACM, February 2019, Vol. 62 No. 2, Pages 86-95 10.1145/3211968 Comments A fundamental technique in reasoning about programs is the use of logical assertions to describe properties of program states. Turing used assertions to argue about the correctness of a particular program in 1949,40 and they were incorporated into general formal systems for program provin
Separation logic and bi-abduction | Infer
Separation logic Bi-abduction Technical papers Separation logic Separation logic is a novel kind of mathematical logic which facilitates reasoning about mutations to computer memory. It enables scalability by breaking reasoning into chunks corresponding to local operations on memory, and then composing the reasoning chunks together. Separation logic is based on a logical connective \( * \) called
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Separation Logic Foundations
https://www.cs.cmu.edu/~jcr/seplogic.pdf
