RSOLVER
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Efficient handling of universally quantified inequalities
- Tightened reachability constraints for the verification of linear hybrid systems
- A semi-algebraic approach for asymptotic stability analysis
- Hybrid systems: From verification to falsification by combining motion planning and discrete search
- Aligator
- MetiTarski
- QEPCAD
- Sostools
- Scicos
- HySAT
- KeYmaera
- PHAVer
- HyTech
- SMV
- REDLOG
- PDE2D
- RealPaver
- Benchmarks
- raSAT: an SMT solver for polynomial constraints
- LMIRank
- Formal verification and quantitative metrics of MPSoC data dynamics
- ScicosLab
- TRICE
- VERICOMP
- PENLAB
- Ariadne
- dReal
- mctau
- HSolver
- AQCS
- Quasi-decidability of a fragment of the first-order theory of real numbers
- PolyPaver
- Implicit definitions with differential equations for KeYmaera X (system description)
- Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro}
- Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming
- NLTOOLBOX
- AutoMOTGen
- An efficient framework for barrier certificate generation of uncertain nonlinear hybrid systems
- Extracting counterexamples induced by safety violation in linear hybrid systems
- d/dt
- SAHA-Tool
- An approximation algorithm for box abstraction of transition systems on real state spaces
- A compositional modelling and analysis framework for stochastic hybrid systems
- On quantified linear implications
- Ellipsoidal Toolbox
- HARE
- SpaceEx
- RAMAS
- Rigorous integration of non-linear ordinary differential equations in Chebyshev basis
- Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic
- Syntax and consistent equation semantics of hybrid Chi
- HybridSal
- BACH
- VNODE
- PVSio-web
- Manip
- Discovering polynomial Lyapunov functions for continuous dynamical systems
- TopDeg
- Decision algorithms for fragments of real analysis. I: Continuous functions with strict convexity and concavity predicates
- Taylor approximation for hybrid systems
- On a decision procedure for quantified linear programs
- Quantified set inversion algorithm with applications to control
- Deadness and how to disprove liveness in hybrid dynamical systems
- Verifying safety properties of a nonlinear control by interactive theorem proving with the prototype verification system
- Control barrier functions for stochastic systems
- iSat
- raSAT: An SMT Solver for Polynomial Constraints
- ConstructibleSetTools
- ParametricSystemTools
- Formal modelling, analysis and verification of hybrid systems
- A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning
- Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-Like Functions
- Satisfiability of systems of equations of real analytic functions is quasi-decidable
- Improving SAT modulo ODE for hybrid systems analysis by combining different enclosure methods
- Crossing the Bridge between Similar Games
- Incremental computation of succinct abstractions for hybrid systems
- Verification of Hybrid Systems
- C2e2
- LySHA
- Breach
- ABsolver
- Algorithm 875
- Mathpert
- Applications of MetiTarski in the Verification of Control and Hybrid Systems
- Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate
- Property Driven Three-Valued Model Checking on Hybrid Automata
- Safety verification for probabilistic hybrid systems
- On the complexity of quantified linear systems
- JuliaReach
- HyPro
- fasp2smt
- An introduction to the verification of hybrid systems using \textsc{Ariadne}
- Formal Verification Applied to Robotic Surgery
- aaflib
- PyInterval
- Polynomial function intervals for floating-point software verification
- Fuzzy answer set computation via satisfiability modulo theories
- Efficient solution of a class of quantified constraints with quantifier prefix exists-forall
- A complexity perspective on entailment of parameterized linear constraints
- Approximated reachability on hybrid automata: falsification meets certification
This page was built for software: RSOLVER
