Results 31 to 40 of about 1,881,310 (251)

Proof Pearl: a Formal Proof of Higman’s Lemma in ACL2 [PDF]

open access: yesJournal of Automated Reasoning, 2005
Ministerio de Ciencia e Innovación MTM2009-13842-C02 ...
Francisco-Jesús Martín-Mateos   +3 more
openaire   +3 more sources

Automatic Formal Specification and Its Verification of Assembly-Level Sequential Statement Blocks [PDF]

open access: yesJisuanji gongcheng, 2019
Formal verification of software is an important means to guarantee the provability,reliability and security of software, but the generation process of traditional formal verification script is complex and requires a lot of manual verification of formal ...
QI Longyun, Lü Xiaoliang, LU Hong, HUANG Hao
doaj   +1 more source

An Evaluation of the Archive of Formal Proofs

open access: yesCoRR, 2021
The Archive of Formal Proofs (AFP) is an online repository of formal proofs for the Isabelle proof assistant. It serves as a central location for publishing, discovering, and viewing libraries of proofs. We conducted an online survey in November 2020 to assess the suitability of the website.
Carlin MacKenzie   +2 more
openaire   +2 more sources

Language Models Are Greedy Reasoners: A Systematic Formal Analysis of Chain-of-Thought [PDF]

open access: yesInternational Conference on Learning Representations, 2022
Large language models (LLMs) have shown remarkable reasoning capabilities given chain-of-thought prompts (examples with intermediate reasoning steps). Existing benchmarks measure reasoning ability indirectly, by evaluating accuracy on downstream tasks ...
Abulhair Saparov, He He
semanticscholar   +1 more source

Lightweight Interactive Proving inside an Automatic Program Verifier [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2018
Among formal methods, the deductive verification approach allows establishing the strongest possible formal guarantees on critical software. The downside is the cost in terms of human effort required to design adequate formal specifications and to ...
Sylvain Dailler   +2 more
doaj   +1 more source

Improving legibility of natural deduction proofs is not trivial [PDF]

open access: yesLogical Methods in Computer Science, 2014
In formal proof checking environments such as Mizar it is not merely the validity of mathematical formulas that is evaluated in the process of adoption to the body of accepted formalizations, but also the readability of the proofs that witness validity ...
Karol Pąk
doaj   +1 more source

ONTOLOGICAL PURITY FOR FORMAL PROOFS

open access: yesThe Review of Symbolic Logic, 2023
AbstractPurity is known as an ideal of proof that restricts a proof to notions belonging to the ‘content’ of the theorem. In this paper, our main interest is to develop a conception of purity for formal (natural deduction) proofs. We develop two new notions of purity: one based on an ontological notion of the content of a theorem, and one based on the ...
openaire   +2 more sources

ObliDC: An SGX-based Oblivious Distributed Computing Framework with Formal Proof

open access: yesACM Asia Conference on Computer and Communications Security, 2019
Data privacy is becoming one of the most critical concerns in cloud computing. Several proposals based on Intel SGX such as VC3 [1] and M2R [2] have been introduced in the literature to protect data privacy during job execution in the cloud.
Pengfei Wu   +5 more
semanticscholar   +1 more source

Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs [PDF]

open access: yesInternational Conference on Learning Representations, 2022
The formalization of existing mathematical proofs is a notoriously difficult process. Despite decades of research on automation and proof assistants, writing formal proofs remains arduous and only accessible to a few experts.
Albert Qiaochu Jiang   +8 more
semanticscholar   +1 more source

Baldur: Whole-Proof Generation and Repair with Large Language Models [PDF]

open access: yesESEC/SIGSOFT FSE, 2023
Formally verifying software is a highly desirable but labor-intensive task. Recent work has developed methods to automate formal verification using proof assistants, such as Coq and Isabelle/HOL, e.g., by training a model to predict one proof step at a ...
Emily First   +3 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy