SMT-based verification applied to non-convex optimization problems
This paper presents a novel, complete, and flexible optimization algorithm, which relies on recursive executions that re-constrains a model-checking procedure based on Satisfiability Modulo Theories (SMT). This SMT-based optimization technique is able to optimize a wide range of functions, including...
Հիմնական հեղինակներ: | Araujo, R, Bessa, I, Cordeiro, L, Filho, J |
---|---|
Ձևաչափ: | Conference item |
Հրապարակվել է: |
Institute of Electrical and Electronics Engineers
2017
|
Նմանատիպ նյութեր
-
Predicting SMT Solver Performance for Software Verification
: Andrew Healy, և այլն
Հրապարակվել է: (2017-01-01) -
Modular SMT-Based Verification of Rule-Based Hardware Designs
: Wright, Andrew C.
Հրապարակվել է: (2022) -
SAT and SMT-Based Verification of Security Protocols Including Time Aspects
: Sabina Szymoniak, և այլն
Հրապարակվել է: (2021-04-01) -
Exploiting Hierarchy in the Abstraction-Based Verification of Statecharts Using SMT Solvers
: Bence Czipó, և այլն
Հրապարակվել է: (2017-03-01) -
Applying SMT Solvers to the Test Template Framework
: Maximiliano Cristiá, և այլն
Հրապարակվել է: (2012-02-01)