Uncertainty Propagation in Heterogeneous Algebras for Approximate Quantified Constraint Solving. - Stefan Ratschan (J. Univers. Comput. Sci., 2000)

Solving Composed First-Order Constraints from Discrete-Time Robust Control - Stefan Ratschan; Luc Jaulin (CoRR, 2001)

Continuous First-Order Constraint Satisfaction. - Stefan Ratschan (AISC, 2002)

Continuous First-Order Constraint Satisfactionwith Equality and Disequality Constraints. - Stefan Ratschan (CP, 2002)

Search Heuristics for Box Decomposition Methods. - Stefan Ratschan (J. Glob. Optim., 2002)

Quantified Constraints Under Perturbation. - Stefan Ratschan (J. Symb. Comput., 2002)

Approximate Quantified Constraint Solving by Cylindrical Box Decomposition. - Stefan Ratschan (Reliab. Comput., 2002)

Solving Existentially Quantified Constraints with One Equality and Arbitrarily Many Inequalities. - Stefan Ratschan (CP, 2003)

Set Computation for Nonlinear Control. - Luc Jaulin; Stefan Ratschan; Laurent Hardouin (Reliab. Comput., 2004)

Convergent approximate solving of first-order constraints by approximate quantifiers. - Stefan Ratschan (ACM Trans. Comput. Log., 2004)

Solving Undecidable Problems in the Theory of Real Numbers and Hybrid Systems. - Stefan Ratschan (Algorithmic Algebra and Logic, 2005)

Verification-Integrated Falsification of non-Deterministic Hybrid Systems. - Stefan Ratschan; Jan-Georg Smaus (ADHS, 2006)

Constraints for Continuous Reachability in the Verification of Hybrid Systems. - Stefan Ratschan; Zhikun She (AISC, 2006)

Efficient solving of quantified inequality constraints over the real numbers. - Stefan Ratschan (ACM Trans. Comput. Log., 2006)

Language-Based Abstraction Refinement for Hybrid System Verification. - Felix Klaedtke; Stefan Ratschan; Zhikun She (VMCAI, 2007)

Guaranteed Termination in the Verification of Ltl Properties of Non-linear Robust Discrete Time Hybrid Systems. - Werner Damm; Guilherme Pinto; Stefan Ratschan (Int. J. Found. Comput. Sci., 2007)

Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure. - Martin Fränzle; Christian Herde; Tino Teige; Stefan Ratschan; Tobias Schubert 001 (J. Satisf. Boolean Model. Comput., 2007)

Safety verification of hybrid systems by constraint propagation-based abstraction refinement. - Stefan Ratschan; Zhikun She (ACM Trans. Embed. Comput. Syst., 2007)

Recursive and Backward Reasoning in the Verification on Hybrid Systems. - Stefan Ratschan; Zhikun She (ICINCO-SPSMC, 2008)

How to Capture Hybrid Systems Evolution Into Slices of Parallel Hyperplanes. - Tomás Dzetkulic; Stefan Ratschan (ADHS, 2009)

Symbolic-numeric problems in the automatic analysis and verification of cyber-physical systems. - Stefan Ratschan (SNC, 2009)

Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate. - Stefan Ratschan; Jan-Georg Smaus (TAP@TOOLS, 2009)

Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable. - Stefan Ratschan (TAMC, 2010)

Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-Like Functions. - Stefan Ratschan; Zhikun She (SIAM J. Control. Optim., 2010)

Incremental Computation of Succinct Abstractions for Hybrid Systems. - Tomás Dzetkulic; Stefan Ratschan (FORMATS, 2011)

Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable. - Peter Franek; Stefan Ratschan; Piotr Zgliczynski (MFCS, 2011)

Foreword. - Georgios Fainekos; Eric Goubault; Sylvie Putot; Stefan Ratschan (Math. Comput. Sci., 2011)

Applications of Quantified Constraint Solving over the Reals - Bibliography - Stefan Ratschan (CoRR, 2012)

Safety Verification for Probabilistic Hybrid Systems. - Lijun Zhang 001; Zhikun She; Stefan Ratschan; Holger Hermanns; Ernst Moritz Hahn (Eur. J. Control, 2012)

Foreword. - Stefan Ratschan; Thomas Sturm 001 (Math. Comput. Sci., 2012)

Combined Global and Local Search for the Falsification of Hybrid Systems. - Jan Kurátko; Stefan Ratschan (FORMATS, 2014)

Safety verification of non-linear hybrid systems is quasi-decidable. - Stefan Ratschan (Formal Methods Syst. Des., 2014)

Efficient Solution of a Class of Quantified Constraints with Quantifier Prefix Exists-Forall. - Milan Hladík; Stefan Ratschan (Math. Comput. Sci., 2014)

Effective topological degree computation based on interval arithmetic. - Peter Franek; Stefan Ratschan (Math. Comput., 2015)

Quasi-decidability of a Fragment of the First-Order Theory of Real Numbers. - Peter Franek; Stefan Ratschan; Piotr Zgliczynski (J. Autom. Reason., 2016)

Simulation Based Computation of Certificates for Safety of Dynamical Systems. - Stefan Ratschan (FORMATS, 2017)

A Robust Finite-Time Converse Theorem for Inductive Safety Certificates of Ordinary Differential Equations. - Stefan Ratschan (CoRR, 2017)

Converse Theorems for Safety and Barrier Certificates. - Stefan Ratschan (IEEE Trans. Autom. Control., 2018)

SAT Modulo Differential Equation Simulations. - Tomás Kolárik; Stefan Ratschan (TAP@STAF, 2020)

Computation of Stabilizing and Relatively Optimal Feedback Control Laws Based on Demonstrations. - Jirí Fejlek; Stefan Ratschan (CoRR, 2020)

Computing Funnels Using Numerical Optimization Based Falsifiers. - Jirí Fejlek; Stefan Ratschan (ICRA, 2022)

Fast Three-Valued Abstract Bit-Vector Arithmetic. - Jan Onderka; Stefan Ratschan (VMCAI, 2022)

Railway Scheduling Using Boolean Satisfiability Modulo Simulations. - Tomás Kolárik; Stefan Ratschan (FM, 2023)

LQR-Trees with Sampling Based Exploration of the State Space. - Jirí Fejlek; Stefan Ratschan (IROS, 2023)

Deciding Predicate Logical Theories Of Real-Valued Functions. - Stefan Ratschan (MFCS, 2023)

Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic. - Tomás Kolárik; Stefan Ratschan; Pavel Surynek (ICAART (1), 2024)

Computation of feedback control laws based on switched tracking of demonstrations. - Jirí Fejlek; Stefan Ratschan (Eur. J. Control, 2024)

SMT and Functional Equation Solving over the Reals: Challenges from the IMO. - Chad E. Brown; Karel Chvalovský; Mikolás Janota; Mirek Olsák; Stefan Ratschan (CADE, 2025)

Satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem. - Enrico Lipparini; Stefan Ratschan (J. Autom. Reason., 2025)