Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery-Reference-Cited by-同舟云学术

Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery

Published:2010 Issue: Volume: Page:102-116
ISSN:0302-9743
Container-title:Verification, Induction, Termination Analysis
language:
Short-container-title:

Author:

Johansson Moa,Dixon Lucas,Bundy Alan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-17172-7_6

Reference23 articles.

1. Lecture Notes in Artificial Intelligence;M. Aderhold,2007

2. Armando, A., Smaill, A., Green, I.: Automatic synthesis of recursive programs: the proof-planning paradigm. In: ASE 1997, pp. 2–9. IEEE Computer Society Press, Los Alamitos (1997)

3. Basin, D., Walsh, T.: A calculus for and termination of rippling. Journal of Automated Reasoning 16(1-2), 147–180 (1996)

4. Buchberger, B., Craciun, A., Jebelean, T., Kovacs, L., Kutsia, T., Nakagawa, K., Piroi, F., Popov, N., Robu, J., Rosenkrantz, M., Windsteiger, W.: Theorema: Towards computer-aided mathematical theory exploration. Journal of Applied Logic 4(4), 470–504 (2006)

5. Bundy, A.: The automation of proof by mathematical induction. In: Handbook of Automated Reasoning, ch. 13. MIT Press, Cambridge (2001)

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

1. Data-driven lemma synthesis for interactive proofs;Proceedings of the ACM on Programming Languages;2022-10-31

2. CycleQ: an efficient basis for cyclic equational reasoning;Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2022-06-09

3. Who Carries the Burden of Modularity?;Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles;2020

4. Lemma Discovery for Induction;Lecture Notes in Computer Science;2019

5. Automating Inductive Proofs Using Theory Exploration;Automated Deduction – CADE-24;2013