1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.SE2019★ 1 cited
Understanding Counterexamples for Relational Properties with DIbugger
Mihai Herda, Michael Kirsten, Etienne Brunner +6
Software verification is a tedious process that involves the analysis of multiple failed verification attempts, and adjustments of the program or specification. This is especially…
cs.LO2014★ 1 cited
Reducing the Complexity of Quantified Formulas via Variable Elimination
Aboubakr Achraf El Ghazi, Mattias Ulbrich, Mana Taghdiri +1
We present a general simplification of quantified SMT formulas using variable elimination. The simplification is based on an analysis of the ground terms occurring as arguments in…