Stefan Ratschan

Affiliations:
  • Academy of Sciences of the Czech Republic, Praha, Czech Republic


According to our database1, Stefan Ratschan authored at least 47 papers between 2000 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic.
CoRR, 2023

Satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem.
Proceedings of the NASA Formal Methods - 15th International Symposium, 2023

Deciding Predicate Logical Theories Of Real-Valued Functions.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

LQR-Trees with Sampling Based Exploration of the State Space.
IROS, 2023

Railway Scheduling Using Boolean Satisfiability Modulo Simulations.
Proceedings of the Formal Methods - 25th International Symposium, 2023

2022
Fast Three-Valued Abstract Bit-Vector Arithmetic.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2022

Computing Funnels Using Numerical Optimization Based Falsifiers.
Proceedings of the 2022 International Conference on Robotics and Automation, 2022

2020
Computation of Stabilizing and Relatively Optimal Feedback Control Laws Based on Demonstrations.
CoRR, 2020

SAT Modulo Differential Equation Simulations.
Proceedings of the Tests and Proofs - 14th International Conference, 2020

2018
Converse Theorems for Safety and Barrier Certificates.
IEEE Trans. Autom. Control., 2018

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

Simulation Based Computation of Certificates for Safety of Dynamical Systems.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2017

2016
Quasi-decidability of a Fragment of the First-Order Theory of Real Numbers.
J. Autom. Reason., 2016

2015
Effective topological degree computation based on interval arithmetic.
Math. Comput., 2015

2014
Efficient Solution of a Class of Quantified Constraints with Quantifier Prefix Exists-Forall.
Math. Comput. Sci., 2014

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

Combined Global and Local Search for the Falsification of Hybrid Systems.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2014

2012
Foreword.
Math. Comput. Sci., 2012

Safety Verification for Probabilistic Hybrid Systems.
Eur. J. Control, 2012

Applications of Quantified Constraint Solving over the Reals - Bibliography
CoRR, 2012

2011
Foreword.
Math. Comput. Sci., 2011

Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Incremental Computation of Succinct Abstractions for Hybrid Systems.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

2010
Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-Like Functions.
SIAM J. Control. Optim., 2010

Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

2009
Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate.
Proceedings of the Tests and Proofs - 3rd International Conference, 2009

Symbolic-numeric problems in the automatic analysis and verification of cyber-physical systems.
Proceedings of the Symbolic Numeric Computation, 2009

How to Capture Hybrid Systems Evolution Into Slices of Parallel Hyperplanes.
Proceedings of the 3rd IFAC Conference on Analysis and Design of Hybrid Systems, 2009

2008
Recursive and Backward Reasoning in the Verification on Hybrid Systems.
Proceedings of the ICINCO 2008, 2008

2007
Safety verification of hybrid systems by constraint propagation-based abstraction refinement.
ACM Trans. Embed. Comput. Syst., 2007

Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure.
J. Satisf. Boolean Model. Comput., 2007

Guaranteed Termination in the Verification of Ltl Properties of Non-linear Robust Discrete Time Hybrid Systems.
Int. J. Found. Comput. Sci., 2007

Language-Based Abstraction Refinement for Hybrid System Verification.
Proceedings of the Verification, 2007

2006
Efficient solving of quantified inequality constraints over the real numbers.
ACM Trans. Comput. Log., 2006

Constraints for Continuous Reachability in the Verification of Hybrid Systems.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2006

Verification-Integrated Falsification of non-Deterministic Hybrid Systems.
Proceedings of the 2nd IFAC Conference on Analysis and Design of Hybrid Systems, 2006

2005
Solving Undecidable Problems in the Theory of Real Numbers and Hybrid Systems.
Proceedings of the Algorithmic Algebra and Logic. Proceedings of the A3L 2005, 2005

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

Set Computation for Nonlinear Control.
Reliab. Comput., 2004

2003
Solving Existentially Quantified Constraints with One Equality and Arbitrarily Many Inequalities.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2002
Approximate Quantified Constraint Solving by Cylindrical Box Decomposition.
Reliab. Comput., 2002

Quantified Constraints Under Perturbation.
J. Symb. Comput., 2002

Search Heuristics for Box Decomposition Methods.
J. Glob. Optim., 2002

Continuous First-Order Constraint Satisfactionwith Equality and Disequality Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2002

Continuous First-Order Constraint Satisfaction.
Proceedings of the Artificial Intelligence, 2002

2001
Solving Composed First-Order Constraints from Discrete-Time Robust Control
CoRR, 2001

2000
Uncertainty Propagation in Heterogeneous Algebras for Approximate Quantified Constraint Solving.
J. Univers. Comput. Sci., 2000


  Loading...