Improving Automation for Higher-Order Proof Steps - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

Improving Automation for Higher-Order Proof Steps

Abstract

We have extended the TLA+ proof system TLAPS with a new backend to improve the automation of proof steps that involve higher-order reasoning. The current support for such steps is poor, requiring the user to break down proofs into unnecessarily small steps. We defined a translation from TLA+ to THF, the TPTP dialect for higher-order logic, and evaluated several higher-order solvers on proof obligations generated from the standard library of TLA+. Our results demonstrate that the solvers are able to handle much coarser proof steps than the other strategies provided by TLAPS, reducing the amount of necessary user interactions by a significant margin.
Fichier principal
Vignette du fichier
improving_automation_ho_proof_steps_frocos_2021.pdf (388.88 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03528009 , version 1 (17-01-2022)

Identifiers

Cite

Antoine Defourné. Improving Automation for Higher-Order Proof Steps. FroCos 2021 - 13th International Symposium on Frontiers of Combining Systems, Sep 2021, Birmingham, United Kingdom. pp.139-153, ⟨10.1007/978-3-030-86205-3_8⟩. ⟨hal-03528009⟩
72 View
65 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More