1 / 9

一周小结

一周小结. 2009 年 5 月 25 日 庄重. SmallFoot Compositional Shape Analysis by means of Bi-Abduction (POPL 09) Z3 Coq Libraray. SmallFoot. 证明能力 证明了这样形式的公式是可判定的. 证明方法 Symbolic Execution – VC Gen 与操作语义相关的 rule 替换相等 变量 (switch) Unfold Proof Rule VC Simplication Unfold 包含对内建谓词的 Rule.

Download Presentation

一周小结

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. 一周小结 2009年5月25日 庄重

  2. SmallFoot • Compositional Shape Analysis by means of Bi-Abduction (POPL 09) • Z3 • Coq Libraray

  3. SmallFoot • 证明能力 • 证明了这样形式的公式是可判定的

  4. 证明方法 • Symbolic Execution – VC Gen • 与操作语义相关的rule • 替换相等变量(switch) • Unfold • Proof Rule • VC Simplication • Unfold • 包含对内建谓词的Rule

  5. POPL 09 Paper(BA) • Bi-Abduction • 不需要用户给出规范

  6. 证明相关 • Formula和SmallFoot类似 • 对谓词处理 • 和SmallFoot中处理unfold一样, Cond会先被检查, 之后继续进行证明 • 不同的地方是这里假设会涉及到的公理只有两种形式, 然后根据添加的公理自动生成相应证明需要的Rule

  7. Z3 • 是Verified GC的后续工作 • Automating Separation-Logic Verification with General-Purpose First-Order Theorem Prover • 目前草稿还没..

  8. Coq • Practical Tactics for Separation Logic(PTSL) • Ynot • 语言能力和我们目前对Cminor的限制一样 • 基本的Tactic有simplification, rearranging, splitting, matching, rewriting五类 • Ynot的自动性更强, 提供了很强的tactic, 但是使用的时候需要用户根据所证明性质, 提供相应的tactic

  9. 目前的想法 • Solver • 依照SmallFoot和BA在sml中实现SeparationLogic的证明 • 研究Bi-Abduction的相关Rule,包括目前确定的内建谓词 • 根据Bi-Abduction的Rule, 把相应的Proof Obligation与定理整合部分交互 • Proof Term • 熟悉PTSL的库 • 可能的话, 在Coq上实现更多的定理和Tactic, 简化生成证明的负担

More Related