Proof Synthesis and Reflection for Linear Arithmetic-Reference-Cited by-同舟云学术

Proof Synthesis and Reflection for Linear Arithmetic

Published:2008-06-04 Issue:1 Volume:41 Page:33-59
ISSN:0168-7433
Container-title:Journal of Automated Reasoning
language:en
Short-container-title:J Autom Reasoning

Author:

Chaieb Amine,Nipkow Tobias

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computational Theory and Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/s10817-008-9101-x.pdf

Reference54 articles.

1. Barendregt, H., Barendsen, E.: Autarkic computations in formal proofs. J. Autom. Reason. 28(3), 321–336 (2002)

2. Lect. Notes in Comp. Sci;S. Berghofer,2002

3. Berman, L.: Precise bounds for Presburger arithmetic and the reals with addition: preliminary report. In: FOCS, pp. 95–99. IEEE, Piscataway (1977)

4. Berman, L.: The complexitiy of logical theories. Theor. Comput. Sci. 11, 71–77 (1980)

5. Bertot, Y., Castéran, P.: Coq’Art: the calculus of inductive constructions. Volume XXV of Text in Theor. Comp. Science: An EATCS Series. Springer, Heidelberg (2004)

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

1. A Formal Disproof of Hirsch Conjecture;Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs;2023-01-11

2. QED at Large: A Survey of Engineering of Formally Verified Software;Foundations and Trends® in Programming Languages;2019

3. Meta-F $$^\star $$ : Proof Automation with SMT, Tactics, and Metaprograms;Programming Languages and Systems;2019

4. Verifying an Incremental Theory Solver for Linear Arithmetic in Isabelle/HOL;Frontiers of Combining Systems;2019

5. Incorporating quotation and evaluation into Church's type theory;Information and Computation;2018-06