[Lecture Notes in Computer Science] Automated Deduction - CADE-25 Volume 9195 || Automated Theorem Proving for Assertions in Separation Logic with All Connectives
- 作者Felty, Amy P.; Middeldorp, Aart
- 文件大小925.79KB
- 发表时间2015
- DOI10.1007/978-3-319-21401-6_34
- 页码501-516
[Lecture Notes in Computer Science] Automated Deduction - CADE-25 Volume 9195 ||Felty, Amy P.; Middeldorp, Aart · 2015
[Lecture Notes in Computer Science] Automated Deduction - CADE-25 Volume 9195 || System Description: E.T. 0.1Felty, Amy P.; Middeldorp, Aart · 2015
[Lecture Notes in Computer Science] Automated Deduction - CADE-25 Volume 9195 || Expressing Symmetry Breaking in DRAT ProofsFelty, Amy P.; Middeldorp, Aart · 2015
[Lecture Notes in Computer Science] Automated Deduction - CADE-25 Volume 9195 || SEPIA: Search for Proofs Using Inferred AutomataFelty, Amy P.; Middeldorp, Aart · 2015
[Lecture Notes in Computer Science] Automated Deduction - CADE-25 Volume 9195 || History and Prospects for First-Order Automated DeductionFelty, Amy P.; Middeldorp, Aart · 2015
[Lecture Notes in Computer Science] Automated Deduction - CADE-25 Volume 9195 || Tableaux Methods for Propositional Dynamic Logics with Separating Parallel CompositionFelty, Amy P.; Middeldorp, Aart · 2015
[Lecture Notes in Computer Science] Automated Deduction - CADE-25 Volume 9195 || Automated Theorem Proving for Assertions in Separation Logic with All ConnectivesFelty, Amy P.; Middeldorp, Aart · 2015