Counterexample guided inductive optimization based on satisfiability modulo theories
This paper describes three variants of a counterexample guided inductive optimization (CEGIO) approach based on Satisfiability Modulo Theories (SMT) solvers. In particular, CEGIO relies on iterative executions to constrain a verification procedure, in order to perform inductive generalization, based...
Main Authors: | Araújo, R, Albuquerque, H, Bessa, d, Cordeiro, L, Chaves Filho, J |
---|---|
Format: | Journal article |
Published: |
Elsevier
2017
|
Similar Items
-
OptCE: A counterexample-guided inductive optimization solver
by: Albuquerque, H, et al.
Published: (2017) -
Counterexample guided inductive optimization applied to mobile robots path planning
by: Araújo, R, et al.
Published: (2017) -
Counterexample guided inductive synthesis modulo theories
by: Abate, A, et al.
Published: (2018) -
Inductive logic programming as satisfiability modulo theories
by: Morel, R
Published: (2023) -
A framework for Satisfiability Modulo Theories.
by: Kroening, D, et al.
Published: (2009)