Verifying an Incremental Theory Solver for Linear Arithmetic in Isabelle/HOL-Reference-Cited by-同舟云学术

Verifying an Incremental Theory Solver for Linear Arithmetic in Isabelle/HOL

Published:2019 Issue: Volume: Page:223-239
ISSN:0302-9743
Container-title:Frontiers of Combining Systems
language:
Short-container-title:

Author:

Bottesch Ralph,Haslbeck Max W.^ORCID,Thiemann René^ORCID

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-29007-8_13

Reference17 articles.

1. Lecture Notes in Computer Science;X Allamigeon,2017

2. Blanchette, J.C., Fleury, M., Lammich, P., Weidenbach, C.: A verified SATsolver framework with learn, forget, restart, and incrementality. J. Autom. Reasoning 61(1–4), 333–365 (2018). https://doi.org/10.1007/s10817-018-9455-7

3. Lecture Notes in Computer Science;S Böhme,2010

4. Bonacina, M.P., Graham-Lengrand, S., Shankar, N.: Proofs in conflict-driven theory combination. In: 7th ACM SIGPLAN International Conference Certified Programs and Proofs, CPP 2018, pp. 186–200. ACM (2018). https://doi.org/10.1145/3167096

5. Bottesch, R., Haslbeck, M.W., Thiemann, R.: Farkas’ Lemma and Motzkin’s Transposition Theorem. Archive of Formal Proofs, January 2019. http://isa-afp.org/entries/Farkas.html . Formal proof development

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Formalizing the Face Lattice of Polyhedra;Logical Methods in Computer Science;2022-05-18

2. Verified Approximation Algorithms;Logical Methods in Computer Science;2022-03-01

3. Correction to: NASA Formal Methods;Lecture Notes in Computer Science;2020

4. Verified Approximation Algorithms;Automated Reasoning;2020

5. Formalizing the Face Lattice of Polyhedra;Automated Reasoning;2020