VanHelsing: A Fast Proof Checker for Debuggable Compiler Verification - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

VanHelsing: A Fast Proof Checker for Debuggable Compiler Verification

(1) , (1, 2) , (2, 1) , (1)
1
2

Abstract

In this paper we present vanHelsing, a fully automatic proof checker for a subset of first-order problemstailored to a class of problems that arise in compiler verification.vanHelsing accepts input problems formulated in a subset of theTPTP language and is optimized to efficiently solve expressionequivalence problems formulated in first-order logic. Being apractical tool vanHelsing provides also graphical debugging helpwhich makes the visualization of problems and localization offailed proofs much easier. The experimental evaluation showedthat this specialized tool performs up to a factor of 3 better thanstate of the art theorem provers.
Not file

Dates and versions

cea-01836303 , version 1 (12-07-2018)

Identifiers

Cite

R. Lezuo, I. Dragan, G. Barany, A. Krall. VanHelsing: A Fast Proof Checker for Debuggable Compiler Verification. 2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), Sep 2015, Timisoara, Romania. pp.167-174, ⟨10.1109/SYNASC.2015.34⟩. ⟨cea-01836303⟩
17 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More