The following pages link to RSOLVER (Q16513):
Displaying 50 items.
- Verifying safety properties of a nonlinear control by interactive theorem proving with the prototype verification system (Q264193) (← links)
- Safety verification for probabilistic hybrid systems (Q389835) (← links)
- On the complexity of quantified linear systems (Q391791) (← links)
- Polynomial function intervals for floating-point software verification (Q457251) (← links)
- Efficient solution of a class of quantified constraints with quantifier prefix exists-forall (Q475420) (← links)
- A complexity perspective on entailment of parameterized linear constraints (Q487646) (← links)
- Barrier certificates revisited (Q507352) (← links)
- Analyzing restricted fragments of the theory of linear arithmetic (Q513354) (← links)
- Construction of parametric barrier functions for dynamical systems using interval analysis (Q518335) (← links)
- Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint-propagation techniques (Q547885) (← links)
- Formal analysis of the Schulz matrix inversion algorithm: a paradigm towards computer aided verification of general matrix flow solvers (Q779625) (← links)
- Synthesizing invariant barrier certificates via difference-of-convex programming (Q832194) (← links)
- Contractor programming (Q840818) (← links)
- Hybrid automata-based CEGAR for rectangular hybrid systems (Q888464) (← links)
- Exact safety verification of hybrid systems using sums-of-squares representation (Q893625) (← links)
- Computational complexity of determining which statements about causality hold in different space-time models (Q949614) (← links)
- Hybrid automata, reachability, and systems biology (Q969180) (← links)
- MetiTarski: An automatic theorem prover for real-valued special functions (Q972422) (← links)
- Efficient handling of universally quantified inequalities (Q1020499) (← links)
- Tightened reachability constraints for the verification of linear hybrid systems (Q1026401) (← links)
- A semi-algebraic approach for asymptotic stability analysis (Q1036644) (← links)
- Hybrid systems: From verification to falsification by combining motion planning and discrete search (Q1039839) (← links)
- raSAT: an SMT solver for polynomial constraints (Q1688535) (← links)
- Formal verification and quantitative metrics of MPSoC data dynamics (Q1707342) (← links)
- Quasi-decidability of a fragment of the first-order theory of real numbers (Q2013319) (← links)
- Implicit definitions with differential equations for KeYmaera X (system description) (Q2104559) (← links)
- Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro} (Q2105429) (← links)
- Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming (Q2105455) (← links)
- An efficient framework for barrier certificate generation of uncertain nonlinear hybrid systems (Q2178193) (← links)
- Extracting counterexamples induced by safety violation in linear hybrid systems (Q2184551) (← links)
- An approximation algorithm for box abstraction of transition systems on real state spaces (Q2248056) (← links)
- A compositional modelling and analysis framework for stochastic hybrid systems (Q2248073) (← links)
- On quantified linear implications (Q2254606) (← links)
- Rigorous integration of non-linear ordinary differential equations in Chebyshev basis (Q2346283) (← links)
- Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic'' (Q2364369) (← links)
- Syntax and consistent equation semantics of hybrid Chi (Q2368698) (← links)
- Discovering polynomial Lyapunov functions for continuous dynamical systems (Q2437283) (← links)
- Decision algorithms for fragments of real analysis. I: Continuous functions with strict convexity and concavity predicates (Q2457362) (← links)
- Taylor approximation for hybrid systems (Q2461793) (← links)
- On a decision procedure for quantified linear programs (Q2462634) (← links)
- Quantified set inversion algorithm with applications to control (Q2568644) (← links)
- Deadness and how to disprove liveness in hybrid dynamical systems (Q2629097) (← links)
- Control barrier functions for stochastic systems (Q2665332) (← links)
- raSAT: An SMT Solver for Polynomial Constraints (Q2817923) (← links)
- Formal Modelling, Analysis and Verification of Hybrid Systems (Q2948232) (← links)
- A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning (Q3055810) (← links)
- Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-Like Functions (Q3083226) (← links)
- Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable (Q3088050) (← links)
- Improving SAT Modulo ODE for Hybrid Systems Analysis by Combining Different Enclosure Methods (Q3095239) (← links)
- Crossing the Bridge between Similar Games (Q3172850) (← links)
