The following pages link to (Q5457277):
Displaying 50 items.
- \textsc{NeVer}: a tool for artificial neural networks verification (Q421446) (← links)
- SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
- Certifying feasibility and objective value of linear programs (Q453056) (← links)
- Polynomial function intervals for floating-point software verification (Q457251) (← links)
- Deciding floating-point logic with abstract conflict driven clause learning (Q479837) (← links)
- Structured learning modulo theories (Q511777) (← links)
- A search-based procedure for nonlinear real arithmetic (Q518407) (← links)
- Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems (Q547916) (← links)
- Formal reliability analysis of redundancy architectures (Q667523) (← links)
- Engineering constraint solvers for automatic analysis of probabilistic hybrid automata (Q710668) (← links)
- MetiTarski: An automatic theorem prover for real-valued special functions (Q972422) (← links)
- raSAT: an SMT solver for polynomial constraints (Q1688535) (← links)
- Reachability analysis of nonlinear systems using hybridization and dynamics scaling (Q1996035) (← links)
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings (Q1996869) (← links)
- A survey of challenges for runtime verification from advanced application domains (beyond software) (Q2008293) (← links)
- Accelerating numerical simulation of continuous-time Boolean satisfiability solver using discrete gradient (Q2045943) (← links)
- An efficient subsumption test pipeline for BS(LRA) clauses (Q2104505) (← links)
- Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro} (Q2105429) (← links)
- Tropical abstraction of biochemical reaction networks with guarantees (Q2229132) (← links)
- Learning modulo theories for constructive preference elicitation (Q2238637) (← links)
- A compositional modelling and analysis framework for stochastic hybrid systems (Q2248073) (← links)
- Generating invariants for non-linear hybrid systems (Q2355695) (← links)
- Deadness and how to disprove liveness in hybrid dynamical systems (Q2629097) (← links)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
- raSAT: An SMT Solver for Polynomial Constraints (Q2817923) (← links)
- A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic (Q2830009) (← links)
- Multi-objective Parameter Synthesis in Probabilistic Hybrid Systems (Q2945585) (← links)
- I-RiSC: An SMT-Compliant Solver for the Existential Fragment of Real Algebra (Q3014943) (← links)
- Virtual Substitution for SMT-Solving (Q3088298) (← links)
- Improving SAT Modulo ODE for Hybrid Systems Analysis by Combining Different Enclosure Methods (Q3095239) (← links)
- Crossing the Bridge between Similar Games (Q3172850) (← links)
- Craig Interpolation in the Presence of Non-linear Constraints (Q3172854) (← links)
- Superposition Modulo Non-linear Arithmetic (Q3172887) (← links)
- Temporal Logic Verification for Delay Differential Equations (Q3179413) (← links)
- SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving (Q3453240) (← links)
- Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems (Q3523106) (← links)
- SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems (Q3540072) (← links)
- Satisfiability Checking: Theory and Applications (Q4571125) (← links)
- Synthesizing SystemC Code from Delay Hybrid CSP (Q5055993) (← links)
- Efficient choice of parameters on delta-reachability bounded hybrid systems (Q5097076) (← links)
- Integrated and Automated Abstract Interpretation, Verification and Testing of C/C++ Modules (Q5187834) (← links)
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (Q5191109) (← links)
- Challenges in Constraint-Based Analysis of Hybrid Systems (Q5191406) (← links)
- Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic (Q5387634) (← links)
- Automated generation of hybrid automata for multi-rigid-body mechanical systems and its application to the falsification of safety properties (Q5861104) (← links)
- Validating numerical semidefinite programming solvers for polynomial invariants (Q5916266) (← links)
- Handling polynomial and transcendental functions in SMT via unconstrained optimisation and topological degree test (Q6160909) (← links)
- Spatial and timing properties in highway traffic (Q6164470) (← links)
- Satisfiability modulo finite fields (Q6535532) (← links)
- Verified reductions for optimization (Q6536123) (← links)
