Stefan Ratschan

71 papers A* 2A 4B 7C 1Misc 2Journal 41Unranked 13

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Inductive Satisfiability Certification for Universal Quantifiers and Uninterpreted Function Symbols. CoRR Stefan Ratschan, Anggha Nugraha, Mikolás Janota, Marek Danco
2026	B	`conf`	Input-Based Three-Valued Abstraction Refinement. VMCAI Jan Onderka, Stefan Ratschan
2026	J	`jnl`	Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Arithmetic Over the Reals. SN Comput. Sci. Tomás Kolárik, Stefan Ratschan, Pavel Surynek
2025	A	`conf`	SMT and Functional Equation Solving over the Reals: Challenges from the IMO. CADE Chad E. Brown, Karel Chvalovský, Mikolás Janota, Mirek Olsák, Stefan Ratschan
2025	J	`jnl`	SMT and Functional Equation Solving over the Reals: Challenges from the IMO. CoRR Chad E. Brown, Karel Chvalovský, Mikolás Janota, Mirek Olsák, Stefan Ratschan
2025	J	`jnl`	Satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem. J. Autom. Reason. Enrico Lipparini, Stefan Ratschan
2024	J	`jnl`	Computation of feedback control laws based on switched tracking of demonstrations. Eur. J. Control Jirí Fejlek, Stefan Ratschan
2024	—	`conf`	Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic. ICAART (1) Tomás Kolárik, Stefan Ratschan, Pavel Surynek
2023	B	`conf`	Deciding Predicate Logical Theories Of Real-Valued Functions. MFCS Stefan Ratschan
2023	J	`jnl`	Deciding Predicate Logical Theories of Real-Valued Functions. CoRR Stefan Ratschan
2023	A	`conf`	LQR-Trees with Sampling Based Exploration of the State Space. IROS Jirí Fejlek, Stefan Ratschan
2023	J	`jnl`	LQR-trees with Sampling Based Exploration of the State Space. CoRR Jirí Fejlek, Stefan Ratschan
2023	J	`jnl`	Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic. CoRR Tomás Kolárik, Stefan Ratschan, Pavel Surynek
2023	B	`conf`	Railway Scheduling Using Boolean Satisfiability Modulo Simulations. FM Tomás Kolárik, Stefan Ratschan
2023	J	`jnl`	Satisfiability of Non-Linear Transcendental Arithmetic as a Certificate Search Problem. CoRR Enrico Lipparini, Stefan Ratschan
2023	—	`conf`	Satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem. NFM Enrico Lipparini, Stefan Ratschan
2022	A*	`conf`	Computing Funnels Using Numerical Optimization Based Falsifiers. ICRA Jirí Fejlek, Stefan Ratschan
2022	B	`conf`	Fast Three-Valued Abstract Bit-Vector Arithmetic. VMCAI Jan Onderka, Stefan Ratschan
2022	J	`jnl`	Railway Scheduling Using Boolean Satisfiability Modulo Simulations. CoRR Tomás Kolárik, Stefan Ratschan
2021	J	`jnl`	Computing Funnels Using Numerical Optimization Based Falsifiers. CoRR Jirí Fejlek, Stefan Ratschan
2021	—	`ed.`	Proceedings 6th International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT, SNR 2020, online, 31 August 2020. SNR Thao Dang, Stefan Ratschan
2020	J	`jnl`	Computation of Stabilizing and Relatively Optimal Feedback Control Laws Based on Demonstrations. CoRR Jirí Fejlek, Stefan Ratschan
2020	—	`conf`	SAT Modulo Differential Equation Simulations. TAP@STAF Tomás Kolárik, Stefan Ratschan
2018	J	`jnl`	Converse Theorems for Safety and Barrier Certificates. IEEE Trans. Autom. Control. Stefan Ratschan
2017	J	`jnl`	A Robust Finite-Time Converse Theorem for Inductive Safety Certificates of Ordinary Differential Equations. CoRR Stefan Ratschan
2017	—	`conf`	Simulation Based Computation of Certificates for Safety of Dynamical Systems. FORMATS Stefan Ratschan
2017	J	`jnl`	Simulation Based Computation of Certificates for Safety of Dynamical Systems. CoRR Stefan Ratschan
2016	J	`jnl`	Quasi-decidability of a Fragment of the First-Order Theory of Real Numbers. J. Autom. Reason. Peter Franek, Stefan Ratschan, Piotr Zgliczynski
2015	J	`jnl`	Effective topological degree computation based on interval arithmetic. Math. Comput. Peter Franek, Stefan Ratschan
2014	—	`conf`	Combined Global and Local Search for the Falsification of Hybrid Systems. FORMATS Jan Kurátko, Stefan Ratschan
2014	J	`jnl`	Combined Global and Local Search for the Falsification of Hybrid Systems. CoRR Jan Kurátko, Stefan Ratschan
2014	J	`jnl`	Efficient Solution of a Class of Quantified Constraints with Quantifier Prefix Exists-Forall. Math. Comput. Sci. Milan Hladík, Stefan Ratschan
2014	J	`jnl`	Safety verification of non-linear hybrid systems is quasi-decidable. Formal Methods Syst. Des. Stefan Ratschan
2013	J	`jnl`	Efficient Solution of a Class of Quantified Constraints with Quantifier Prefix Exists-Forall. CoRR Milan Hladík, Stefan Ratschan
2013	J	`jnl`	Quasi-decidability of a Fragment of the First-order Theory of Real Numbers. CoRR Peter Franek, Stefan Ratschan, Piotr Zgliczynski
2012	J	`jnl`	Applications of Quantified Constraint Solving over the Reals - Bibliography CoRR Stefan Ratschan
2012	J	`jnl`	Effective Topological Degree Computation Based on Interval Arithmetic CoRR Peter Franek, Stefan Ratschan
2012	J	`jnl`	Foreword. Math. Comput. Sci. Stefan Ratschan, Thomas Sturm
2012	J	`jnl`	Safety Verification for Probabilistic Hybrid Systems. Eur. J. Control Lijun Zhang, Zhikun She, Stefan Ratschan, Holger Hermanns, Ernst Moritz Hahn
2011	J	`jnl`	Foreword. Math. Comput. Sci. Georgios Fainekos, Eric Goubault, Sylvie Putot, Stefan Ratschan
2011	—	`conf`	Incremental Computation of Succinct Abstractions for Hybrid Systems. FORMATS Tomás Dzetkulic, Stefan Ratschan
2011	B	`conf`	Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable. MFCS Peter Franek, Stefan Ratschan, Piotr Zgliczynski
2010	J	`jnl`	Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-Like Functions. SIAM J. Control. Optim. Stefan Ratschan, Zhikun She
2010	A*	`conf`	Safety Verification for Probabilistic Hybrid Systems. CAV Lijun Zhang, Zhikun She, Stefan Ratschan, Holger Hermanns, Ernst Moritz Hahn
2010	C	`conf`	Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable. TAMC Stefan Ratschan
2009	—	`conf`	Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate. TAP@TOOLS Stefan Ratschan, Jan-Georg Smaus
2009	—	`conf`	How to Capture Hybrid Systems Evolution Into Slices of Parallel Hyperplanes. ADHS Tomás Dzetkulic, Stefan Ratschan
2009	—	`conf`	Symbolic-numeric problems in the automatic analysis and verification of cyber-physical systems. SNC Stefan Ratschan
2008	—	`conf`	Recursive and Backward Reasoning in the Verification on Hybrid Systems. ICINCO-SPSMC Stefan Ratschan, Zhikun She
2007	J	`jnl`	Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure. J. Satisf. Boolean Model. Comput. Martin Fränzle, Christian Herde, Tino Teige, Stefan Ratschan, Tobias Schubert
2007	J	`jnl`	Guaranteed Termination in the Verification of Ltl Properties of Non-linear Robust Discrete Time Hybrid Systems. Int. J. Found. Comput. Sci. Werner Damm, Guilherme Pinto, Stefan Ratschan
2007	B	`conf`	Language-Based Abstraction Refinement for Hybrid System Verification. VMCAI Felix Klaedtke, Stefan Ratschan, Zhikun She
2007	J	`jnl`	Safety verification of hybrid systems by constraint propagation-based abstraction refinement. ACM Trans. Embed. Comput. Syst. Stefan Ratschan, Zhikun She
2006	Misc	`conf`	Constraints for Continuous Reachability in the Verification of Hybrid Systems. AISC Stefan Ratschan, Zhikun She
2006	J	`jnl`	Efficient solving of quantified inequality constraints over the real numbers. ACM Trans. Comput. Log. Stefan Ratschan
2006	—	`conf`	Verification-Integrated Falsification of non-Deterministic Hybrid Systems. ADHS Stefan Ratschan, Jan-Georg Smaus
2005	B	`conf`	Guaranteed Termination in the Verification of LTL Properties of Non-linear Robust Discrete Time Hybrid Systems. ATVA Werner Damm, Guilherme Pinto, Stefan Ratschan
2005	—	`conf`	Safety Verification of Hybrid Systems by Constraint Propagation Based Abstraction Refinement. HSCC Stefan Ratschan, Zhikun She
2005	—	`conf`	Solving Undecidable Problems in the Theory of Real Numbers and Hybrid Systems. Algorithmic Algebra and Logic Stefan Ratschan
2004	J	`jnl`	Convergent approximate solving of first-order constraints by approximate quantifiers. ACM Trans. Comput. Log. Stefan Ratschan
2004	J	`jnl`	Set Computation for Nonlinear Control. Reliab. Comput. Luc Jaulin, Stefan Ratschan, Laurent Hardouin
2003	A	`conf`	Solving Existentially Quantified Constraints with One Equality and Arbitrarily Many Inequalities. CP Stefan Ratschan
2002	J	`jnl`	Approximate Quantified Constraint Solving by Cylindrical Box Decomposition. Reliab. Comput. Stefan Ratschan
2002	Misc	`conf`	Continuous First-Order Constraint Satisfaction. AISC Stefan Ratschan
2002	A	`conf`	Continuous First-Order Constraint Satisfactionwith Equality and Disequality Constraints. CP Stefan Ratschan
2002	J	`jnl`	Efficient Solving of Quantified Inequality Constraints over the Real Numbers CoRR Stefan Ratschan
2002	J	`jnl`	Quantified Constraints Under Perturbation. J. Symb. Comput. Stefan Ratschan
2002	J	`jnl`	Search Heuristics for Box Decomposition Methods. J. Glob. Optim. Stefan Ratschan
2001	J	`jnl`	Convergent Approximate Solving of First-Order Constraints by Approximate Quantifiers CoRR Stefan Ratschan
2001	J	`jnl`	Solving Composed First-Order Constraints from Discrete-Time Robust Control CoRR Stefan Ratschan, Luc Jaulin
2000	J	`jnl`	Uncertainty Propagation in Heterogeneous Algebras for Approximate Quantified Constraint Solving. J. Univers. Comput. Sci. Stefan Ratschan