Pages that link to "Item:Q5277761"
From MaRDI portal
The following pages link to Efficient solving of quantified inequality constraints over the real numbers (Q5277761):
Displaying 22 items.
- 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)
- Analyzing restricted fragments of the theory of linear arithmetic (Q513354) (← links)
- Construction of parametric barrier functions for dynamical systems using interval analysis (Q518335) (← 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)
- Tightened reachability constraints for the verification of linear hybrid systems (Q1026401) (← links)
- raSAT: an SMT solver for polynomial constraints (Q1688535) (← links)
- Quasi-decidability of a fragment of the first-order theory of real numbers (Q2013319) (← links)
- Vector barrier certificates and comparison systems (Q2024361) (← links)
- On quantified linear implications (Q2254606) (← links)
- Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic'' (Q2364369) (← links)
- Solving quantified constraint satisfaction problems (Q2389634) (← links)
- Decision algorithms for fragments of real analysis. I: Continuous functions with strict convexity and concavity predicates (Q2457362) (← links)
- raSAT: An SMT Solver for Polynomial Constraints (Q2817923) (← links)
- Incremental Computation of Succinct Abstractions for Hybrid Systems (Q3172856) (← links)
- Fuzzy answer set computation via satisfiability modulo theories (Q4592999) (← links)
- Relating syntactic and semantic perturbations of hybrid automata (Q5009441) (← links)
- Real World Verification (Q5191121) (← links)
- Hybrid Automata in Systems Biology: How Far Can We Go? (Q5404076) (← links)