Learning from Tactic Steps in Formal Proofs
نویسندگان
چکیده
منابع مشابه
A Tactic Language for Declarative Proofs
Influenced by the success of the MIZAR system many declarative proof languages have been developed in the theorem prover community, as declarative proofs are more readable, easier to modify and to maintain than their procedural counterparts. However, despite their advantages, many users still prefer the procedural style of proof, because procedural proofs are faster to write. In this paper we s...
متن کاملGeneralization and Reuse of Tactic Proofs
A tactic proof is a tree-structured sequent proof where steps may be justiied by tactic programs. We describe a prototype of a generic interactive theorem-proving system that supports the construction and manipulation of tactic proofs containing metavariables. The emphasis is on proof reuse. Examples of proof reuse are proof by analogy and reconstruction of partial proofs as part of recovering ...
متن کاملDevelopments in Formal Proofs
A proof assistant is interactive computer software that humans use to prepare scripts of mathematical proofs. These proof scripts can be parsed and verified directly from the fundamental rules of logic and the foundational axioms of mathematics. The technology underlying proof assistants and formal proofs has been under development for decades and grew out of efforts in the early twentieth cent...
متن کاملGenerating Unit Tests from Formal Proofs
We present a new automatic test generation method for JAVA CARD based on attempts at formal verification of the implementation under test (IUT). Self-contained unit tests in JUnit format are generated automatically. The advantages of the approach are: (i) it exploits the full information available in the IUT and in its formal model giving very good hybrid coverage; (ii) a non-trivial formal mod...
متن کاملExtensions to the Rippling-Out Tactic for Guiding Inductive Proofs
Citation for published version: Bundy, A, van Harmelen, F, Smaill, A & Ireland, A 1990, Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs. in 10th International Conference on Automated Deduction: Kaiserslautern, FRG, July 24–27, 1990 Proceedings. vol. Lecture Notes in Artificial Intelligence No. 449, Lecture Notes in Computer Science, vol. 449, Springer-Verlag GmbH, pp. 132-146...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2019
ISSN: 2075-2180
DOI: 10.4204/eptcs.301.2