Hardening the Hammer: More Integration of Automatic and Interactive Theorem Provers
Hardening the Hammer: More Integration of Automatic and Interactive Theorem Provers
批准号:
226154341
负责人:
Professor Dr. Tobias Nipkow, Ph.D.
金额:
$0.0万
依托单位国家:
德国
项目类别:
Research Grants
财政年份:
2012
资助国家:
德国
项目状态:
已结题
起止时间:
2011-12-31 至 2015-12-31
中文摘要
点击翻译按钮获取中文摘要
英文摘要
Interactive theorem provers (ITPs) are increasingly used for verifying the correctness of complex and safety-critical algorithms and systems. ITPs support expressive logics but are very laborious to use. In contrast, automatic theorem provers (ATPs) focus on simpler logics that can be automated better. This proposal promises to narrow the gap between ITPs and ATPs further to achieve a higher level of automation for ITPs, thus permitting them to perform more complex proofs in less time.The platform for our work is the widely used ITP Isabelle/HOL. Sledgehammer is a subsystem of Isabelle/HOL. It provides an integration with the most powerful ATPs ¿on the market¿ to assist with interactive proof construction. Sledgehammer has been available for nearly five years, and in that time it has become an essential part of the Isabelle user's workflow. It is undoubtedly the only interface between an ITP and ATPs to achieve such popularity with users. It has transformed the way beginners perceive Isabelle.This project will extend the ITP/ATP integration in a number of fundamental respects. Currently Sledgehammer proofs are black boxes one cannot examine; now we want to extract human-readable proofs from the machine-level resolution proofs that ATPs produce. Currently Sledgehammer is restricted to one logic, HOL; now we want to extend it to set theory, the de facto foundation of mathematics and also the foundation of Lamport¿s TLA+, a logic and system for software specification and verification. Currently Sledgehammer performs poorly on sets and other higher-order constructs; now we want to design and evaluate new encodings for higher-order constructs in first-order logic (as supported by the ATPs). Currently Sledgehammer targets untyped first-order logic; now we want to benefit from recent advances in ATP technology in the areas of type systems and built-in theories.Important aspects of our proposal are the large user base for Isabelle that will benefit from the research, the large amount of data in the form of proofs that our empirical evaluations are based on, and our close interaction with the ATP community to guarantee an optimal fit of the logics and type systems of ATPs and ITPs.
期刊论文(4)
专著(0)
科研奖励(0)
会议论文
登录
查看更多内容
DOI:
10.1007/s10817-016-9362-8
发表时间:
2016-10-01
期刊:
JOURNAL OF AUTOMATED REASONING
影响因子:
--
作者:
[Blanchette, Jasmin Christian, Greenaway, David, Urban, Josef]
通讯作者:
Urban, Josef
Extending Sledgehammer with SMT Solvers
使用 SMT 求解器扩展 Sledgehammer
DOI:
10.1007/s10817-013-9278-5
发表时间:
2013
期刊:
Journal of Automated Reasoning
影响因子:
--
作者:
[Jasmin Christian Blanchette, Sascha Böhme, Lawrence C. Paulson]
通讯作者:
Lawrence C. Paulson
Semi-intelligible Isar Proofs from Machine-Generated Proofs
来自机器生成的证明的半可理解的 Isar 证明
DOI:
10.1007/s10817-015-9335-3
发表时间:
2016
期刊:
Journal of Automated Reasoning
影响因子:
--
作者:
[Jasmin Christian Blanchette, Sascha Böhme, Mathias Fleury, Steffen Juilf Smolka, Albert Steckermeier]
通讯作者:
Albert Steckermeier
DOI:
10.6092/issn.1972-5787/4593
发表时间:
2016-01-01
期刊:
JOURNAL OF FORMALIZED REASONING
影响因子:
--
作者:
[Blanchette, Jasmin C., Kaliszyk, Cezary, Urban, Josef]
通讯作者:
Urban, Josef
Verifizierte Algorithmenanalyse
-
批准号:273004067
-
项目类别:Reinhart Koselleck Projects
-
资助金额:$0.0万
-
财政年份:2015
-
负责人:Professor Dr. Tobias Nipkow, Ph.D.
-
依托单位:
Verification of Probabilistic Models in Interactive Theorem Provers
-
批准号:226793109
-
项目类别:Research Grants
-
资助金额:$0.0万
-
财政年份:2013
-
负责人:Professor Dr. Tobias Nipkow, Ph.D.
-
依托单位:
Security Type Systems and Deduction
-
批准号:183816297
-
项目类别:Priority Programmes
-
资助金额:$0.0万
-
财政年份:2010
-
负责人:Professor Dr. Tobias Nipkow, Ph.D.
-
依托单位:
Semantische Modellierung, Analyse und Verifikation von sprachbasierter Software-Sicherheit
-
批准号:47694595
-
项目类别:Research Grants
-
资助金额:$0.0万
-
财政年份:2007
-
负责人:Professor Dr. Tobias Nipkow, Ph.D.
-
依托单位:
Integration der Logik HOL mit den Programmiersprachen ML und Haskell
-
批准号:14516968
-
项目类别:Research Grants
-
资助金额:$0.0万
-
财政年份:2005
-
负责人:Professor Dr. Tobias Nipkow, Ph.D.
-
依托单位:
Exakte Arithmetik für reelle Zahlen als Basis für einen maschinellen Beweis der Keplerschen Vermutung
-
批准号:5443474
-
项目类别:Research Grants
-
资助金额:$0.0万
-
财政年份:2005
-
负责人:Professor Dr. Tobias Nipkow, Ph.D.
-
依托单位:
Formale Definition und Analyse einer idealisierten objektorientierten Programmiersprache
-
批准号:5406711
-
项目类别:Research Grants
-
资助金额:$0.0万
-
财政年份:2003
-
负责人:Professor Dr. Tobias Nipkow, Ph.D.
-
依托单位:
Verified Proof Carrying Code
-
批准号:5396601
-
项目类别:Research Grants
-
资助金额:$0.0万
-
财政年份:2003
-
负责人:Professor Dr. Tobias Nipkow, Ph.D.
-
依托单位:
Verifikation von Zeigerprogrammen
-
批准号:5327582
-
项目类别:Research Grants
-
资助金额:$0.0万
-
财政年份:2001
-
负责人:Professor Dr. Tobias Nipkow, Ph.D.
-
依托单位:
Tutorium zum interaktiven Beweisen in Isabelle/HOL
-
批准号:5273368
-
项目类别:Research Grants
-
资助金额:$0.0万
-
财政年份:2000
-
负责人:Professor Dr. Tobias Nipkow, Ph.D.
-
依托单位:
Verständliche halb-automatische Beweise
-
批准号:5102236
-
项目类别:Research Grants
-
资助金额:$0.0万
-
财政年份:1998
-
负责人:Professor Dr. Tobias Nipkow, Ph.D.
-
依托单位:
Deduktive Modellierung von Java
-
批准号:5292962
-
项目类别:Research Grants
-
资助金额:$0.0万
-
财政年份:1998
-
负责人:Professor Dr. Tobias Nipkow, Ph.D.
-
依托单位:
海外基金