Skip to main content

Artigo em periódicoOpen Access

Counterexample guided inductive optimization based on satisfiability modulo theories

ARAÚJO, Rodrigo Farias2018ARAÚJO, Rodrigo Farias; ALBUQUERQUE, Higo Ferreira; BESSA, Iury Valente; CORDEIRO, Lucas Carvalho; CHAVES FILHO, João Edgar

2018 • Science of Computer Programming • 6 citações

Resumo

Resumo

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 on counterexamples extracted from SMT solvers. CEGIO is able to successfully optimize a wide range of functions, including non-linear and non-convex optimization problems based on SMT solvers, in which data provided by counterexamples are employed to guide the verification engine, thus reducing the optimization domain. The present algorithms are evaluated using a large set of benchmarks typically employed for evaluating optimization techniques. Experimental results show the efficiency and effectiveness of the proposed algorithms, which find the optimal solution in all evaluated benchmarks, while traditional techniques are usually trapped by local minima.

Autoria

Autores do grupo (4)

A lista completa de autores está no topo da página. Abaixo, apenas os pesquisadores do e-Controls vinculados a esta publicação.

palavras-chave

Palavras-chave

satisfiability modulo theoriesSMT solverscounterexampleinductive generalizationnon-convex optimizationnonlinear programminglocal optima avoidance

Volume

165

Páginas

3-23

Editora

Elsevier BV

Status

Published

links

Artigo em periódico