swMATH4250MaRDI QIDQ16433FDOQ16433
Author name not available (Why is that?)
Official website: http://redlog.dolzmann.de/
Cited In (only showing first 100 items - show all)
- On the complexity of quantified linear systems
- Hidden verification for computational mathematics
- Parametric quantified SAT solving
- Multiphase until formulas over Markov reward models: an algebraic approach
- Title not available (Why is that?)
- Algorithmic methods for investigating equilibria in epidemic modeling
- Parametric toricity of steady state varieties of reaction networks
- Symbol elimination and applications to parametric entailment problems
- Better answers to real questions
- A quantifier-elimination based heuristic for automatically generating inductive assertions for programs
- Title not available (Why is that?)
- A speed-up of the algorithm for computing comprehensive Gröbner systems
- Solution formulas for cubic equations without or with constraints
- Building bridges between symbolic computation and satisfiability checking
- Formal modelling, analysis and verification of hybrid systems
- Linear-invariant generation for probabilistic programs: automated support for proof-based methods
- A Symbolic Approach to Generation and Analysis of Finite Difference Schemes of Partial Differential Equations
- Automatically discovering relaxed Lyapunov functions for polynomial dynamical systems
- The Gröbner cover
- A new approach for automatic theorem proving in real geometry
- A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications
- Symbolic versus numerical computation and visualization of parameter regions for multistationarity of biological networks
- Simple CAD construction and its applications
- On quantified linear implications
- Multistationarity in the space of total concentrations for systems that admit a monomial parametrization
- A logic based approach to finding real singularities of implicit ordinary differential equations
- Automated Deduction – CADE-20
- Title not available (Why is that?)
- SAT modulo linear arithmetic for solving polynomial constraints
- Thirty years of virtual substitution. Foundations, techniques, applications
- Efficiently and effectively recognizing toricity of steady state varieties
- Algorithmic reduction of biological networks with multiple time scales
- Title not available (Why is that?)
- An algebraic method to fidelity-based model checking over quantum Markov chains
- Model checking QCTL plus on quantum Markov chains
- A linear programming relaxation based approach for generating barrier certificates of hybrid systems
- Identifying the parametric occurrence of multiple steady states for some biological networks
- Reachability and optimal control for linear hybrid automata: a quantifier elimination approach
- On invariant synthesis for parametric systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(\epsilon\)-semantics computations on biological systems
- Efficient projection orders for CAD
- Symbolic reachability computation for families of linear vector fields
- Algorithmic global criteria for excluding oscillations
- Title not available (Why is that?)
- Semilinear motion planning in REDLOG
- Quantifier elimination in automatic loop parallelization
- Verification and synthesis using real quantifier elimination
- Title not available (Why is that?)
- Title not available (Why is that?)
- Certified Computer Algebra on Top of an Interactive Theorem Prover
- Efficient solution of a class of quantified constraints with quantifier prefix exists-forall
- Quantifier elimination for a class of exponential polynomial formulas
- Towards an automated reduction method for polynomial ODE models of biochemical reaction systems
- Programming Languages and Systems
- Deciding polynomial-transcendental problems
- Computing Hopf bifurcations in chemical reaction networks using reaction coordinates
- Reasoning over networks by symbolic methods
- A complexity perspective on entailment of parameterized linear constraints
- Algebraic analysis on asymptotic stability of switched hybrid systems
- Automated Technology for Verification and Analysis
- Linear problems in valued fields
- On the computation of parametric Gröbner bases for modules and syzygies
- Title not available (Why is that?)
- An extension of Turán's inequality
- Title not available (Why is that?)
- Analyzing restricted fragments of the theory of linear arithmetic
- The complexity of quantifier elimination and cylindrical algebraic decomposition
- Dynamics of a density-dependent stage-structured predator-prey system with Beddington-DeAngelis functional response
- On multivariate Hermitian quadratic forms
- An incremental algorithm for computing cylindrical algebraic decompositions
- Title not available (Why is that?)
- Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Time-bounded termination analysis for probabilistic programs with delays
- Virtual substitution for SMT-solving
- Adapting real quantifier elimination methods for conflict set computation
- Improved algorithms for linear complementarity problem arising from collision response
- On the implementation of CGS real QE
- Effective Quantifier Elimination for Presburger Arithmetic with Infinity
- Applying machine learning to the problem of choosing a heuristic to select the variable ordering for cylindrical algebraic decomposition
- A multi-criteria computer package for power transformer fault detection and diagnosis
- Comprehensive Gröbner bases in a Java computer algebra system
- Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition
- Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk)
- Zephyrus2
- Efficient Preprocessing Methods for Quantifier Elimination
- Multiple object semilinear motion planning
- Algorithmic Algebraic Model Checking IV: Characterization of Metabolic Networks
- The strategy challenge in SMT solving
- Automatic generation of bounds for polynomial systems with application to the Lorenz system
- Applied Algebraic Geometry in Model Based Design for Manufacturing
- A geometric method for model reduction of biochemical networks with polynomial rate functions
- Interpolation-based height analysis for improving a recurrence solver
- Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation)
- Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic
- Efficient simplification techniques for special real quantifier elimination with applications to the synthesis of optimal numerical algorithms
- Comprehensive Gröbner bases in a Java computer algebra system
This page was built for software: REDLOG
