SMC: satisfiability modulo convex optimization

DOI10.1145/3049797.3049819MaRDI QIDQ5275314zbMATH OpenOpenAlexFDO

Authors Yasser Shoukry, Pierluigi Nuzzo, Sanjit A. Seshia, George Pappas, Alberto L. Sangiovanni-Vincentelli, Paulo Tabuada

Publication date 11 July 2017

Published in Proceedings of the 20th International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3049797.3049819

zbMATH Keywords

convex programmingsatisfiability modulo convex optimizationsatisfiability modulo theories

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Convex programming (90C25)

Recommendations

• Satisfiability modulo theories
• dReal: an SMT solver for nonlinear theories over the reals
• Computer Aided Verification
• Verifying industrial hybrid systems with \textsc{MathSAT}
• A non-linear arithmetic procedure for control-command software verification

Cited in

(6)

• Robust control for signal temporal logic specifications using discrete average space robustness
• On the computational complexity of the secure state-reconstruction problem
• Validating numerical semidefinite programming solvers for polynomial invariants
• Decoding Output Sequences for Discrete-Time Linear Hybrid Systems.
• Velocity obstacle-based trajectory planner for anthropomorphic arms
• On the complexity of convex and reverse convex prequadratic constraints

Describes a project that uses

Uses Software

• CPLEX
• z3
• dReal
• CalCS

This page was built for publication: SMC: satisfiability modulo convex optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5275314)