Abstract
This paper presents verified quantifier elimination procedures for dense linear orders (two of them novel), for real and for integer linear arithmetic. All procedures are defined and verified in the theorem prover Isabelle/HOL, are executable and can be applied to HOL formulae themselves (by reflection). The formalization of the different theories is highly modular.
| Original language | English |
|---|---|
| Pages (from-to) | 189-212 |
| Number of pages | 24 |
| Journal | Journal of Automated Reasoning |
| Volume | 45 |
| Issue number | 2 |
| DOIs | |
| State | Published - Aug 2010 |
Keywords
- Linear arithmetic
- Quantifier elimination
- Verification