rise4funThis site uses cookies for analytics, personalized content and ads. By continuing to browse this site, you agree to this use. Learn more
Formal Verification of Memory Properties
We are interested in the formal verification of low-level software. For this purpose, we have developed in the Coq proof assistant formalizations of Separation logic (as presented in the survey by John C. Reynolds). We have applied these formalizations to several use-cases, including: the verification of the heap manager of the Topsy operating system (paper) the verification of arithmetic function
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Vellvm: Formalizing the LLVM Intermediate Representation for Verified Program Transformations | Lambda the Ultimate
