Pages that link to "Item:Q2908499"
From MaRDI portal
The following pages link to δ-Complete Decision Procedures for Satisfiability over the Reals (Q2908499):
Displaying 17 items.
- A heuristic prover for real inequalities (Q287379) (← links)
- A search-based procedure for nonlinear real arithmetic (Q518407) (← links)
- Quasi-decidability of a fragment of the first-order theory of real numbers (Q2013319) (← links)
- Unbounded-time safety verification of guarded LTI models with inputs by abstract acceleration (Q2031413) (← links)
- Automated and formal synthesis of neural barrier certificates for dynamical models (Q2044214) (← links)
- The \texttt{ksmt} calculus is a \(\delta \)-complete decision procedure for non-linear constraints (Q2055849) (← links)
- Compositional construction of control barrier functions for continuous-time stochastic hybrid systems (Q2081792) (← links)
- Automated verification and synthesis of stochastic hybrid systems: a survey (Q2097770) (← links)
- Formal synthesis of closed-form sampled-data controllers for nonlinear continuous-time systems under STL specifications (Q2116657) (← links)
- Computing compositional proofs of input-to-output stability using SOS optimization and \(\delta\)-decidability (Q2374569) (← links)
- Probabilistic reachability for multi-parameter bifurcation analysis of cardiac alternans (Q2422015) (← links)
- Numerically-aided deductive safety proof for a powertrain control system (Q2520674) (← links)
- Hybrid Multirate PALS (Q2945702) (← links)
- Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration (Q2949859) (← links)
- Relating syntactic and semantic perturbations of hybrid automata (Q5009441) (← links)
- The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints (Q6076350) (← links)
- Counterexample-guided computation of polyhedral Lyapunov functions for piecewise linear systems (Q6165341) (← links)