Conference paper Open Access
Working with first-order proofs and provers
Raskin, Mikhail;
Welzel, Christoph
Verifying software correctness has always been an important and complicated task. Recently, formal proofs of critical properties of algorithms and even implementations are becoming practical. Currently, the most powerful automated proof search tools use first-order logic while popular interactive proof assistants use higher-order logic.
We present our work-in-progress set of tools that aim to eventually provide a usable first-order logic computer-assisted proof environment.
Files
(348.2 kB)
| Name | Size | |
|---|---|---|
|
first-order-proof-handling.pdf
md5:3e0c889375c79d1c8c6da7ec7f041852 |
348.2 kB | Download |
141
56
views
downloads
| All versions | This version | |
|---|---|---|
| Views | 141 | 141 |
| Downloads | 56 | 56 |
| Data volume | 19.5 MB | 19.5 MB |
| Unique views | 132 | 132 |
| Unique downloads | 54 | 54 |
Indexed in
- Publication date:
- April 1, 2019
- DOI:
-
- Keyword(s):
- automated reasoning computer-aided proofs first-order logic verification
- Grants:
-
European Commission:
- PaVeS - Parametrized Verification and Synthesis (787367)
- Meeting:
- 12-th European Lisp Symposium (ELS 2019), Genova, Italy, 1–2 April, 2019
- Related identifiers:
- Identical to
- Communities:
- License (for files):
- Creative Commons Attribution Non Commercial No Derivatives 4.0 International