Abstract. This paper defines the cover of a formula φ with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by ∃V : φ in theory T . Cover exists for several useful theories, including those that do not admit quantifier elimination. This paper describes cover algorithms for the theories of uninterpreted functions and linear arithmetic. In addition, the paper provides a combination algorithm to combine the cover operations for theories that satisfy some general condition. This combination algorithm can be used to compute the cover a formula in the combined theory of uninterpreted functions and linear arithmetic. This paper motivates the study of cover by describing its applications in program analysis and verification techniques, like symbolic model checking and abstract interpretation.
Gulwani and Musuvathi REF defined the "cover problem", which addresses approximate existential quantifier elimination: Given a formula ϕ in logic L, and a set of variables V , find the strongest quantifier-free formula ϕ in L such that [[∃V : ϕ]] ⊆ [[ϕ]].
Cover Algorithms and Their Combination
ESOP
Computer Science