Name
Abstract | ||
|---|---|---|
A common approach to formally checking assertions inserted into a program is to first generate verification conditions, logical sentences that, if then proven, ensure the assertions are correct. Sometimes users provide axioms that get incorporated into verification conditions. Such axioms can capture aspects of the program's specification or can be hints to help automatic provers. There is always the danger of mistakes in these axioms. In the worst case these mistakes introduce inconsistencies and verification conditions become erroneously provable. We discuss here our use of an SMT solver to investigate the quality of user-provided axioms, to check for inconsistencies in axioms and to verify expected relationships between axioms, for example. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-41010-9_11 | FMICS |
Field | DocType | Volume |
Audit,Axiom,Computer science,Automated theorem proving,Theoretical computer science,Armstrong's axioms,Software verification,Satisfiability modulo theories | Conference | 8187 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.37 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul B. Jackson | 1 | 128 | 14.62 |
| Florian Schanda | 2 | 16 | 3.20 |
| Angela Wallenburg | 3 | 26 | 3.46 |