Stefan Ratschan
Stefan Ratschan
Verified email at cs.cas.cz - Homepage
Title
Cited by
Cited by
Year
Efficient solving of large non-linear arithmetic constraint systems with complex boolean structure
M Fränzle, C Herde, T Teige, S Ratschan, T Schubert
Journal on Satisfiability, Boolean Modeling and Computation 1 (3-4), 209-236, 2006
4102006
Safety verification of hybrid systems by constraint propagation-based abstraction refinement
S Ratschan, Z She
ACM Transactions on Embedded Computing Systems (TECS) 6 (1), 8-es, 2007
1922007
Safety verification of hybrid systems by constraint propagation based abstraction refinement
S Ratschan, Z She
International Workshop on Hybrid Systems: Computation and Control, 573-589, 2005
1642005
Efficient solving of quantified inequality constraints over the real numbers
S Ratschan
ACM Transactions on Computational Logic (TOCL) 7 (4), 723-748, 2006
1422006
Providing a basin of attraction to a target region of polynomial systems by computation of Lyapunov-like functions
S Ratschan, Z She
SIAM Journal on Control and Optimization 48 (7), 4377-4394, 2010
1072010
Safety verification for probabilistic hybrid systems
L Zhang, Z She, S Ratschan, H Hermanns, EM Hahn
International Conference on Computer Aided Verification, 196-211, 2010
722010
Continuous first-order constraint satisfaction
S Ratschan
Artificial Intelligence, Automated Reasoning, and Symbolic Computation, 181-195, 2002
502002
Approximate quantified constraint solving by cylindrical box decomposition
S Ratschan
Reliable Computing 8 (1), 21-42, 2002
482002
RSolver
S Ratschan
382004
Quantified constraints under perturbation
S Ratschan
Journal of Symbolic Computation 33 (4), 493-505, 2002
382002
Guaranteed termination in the verification of LTL properties of non-linear robust discrete time hybrid systems
W Damm, G Pinto, S Ratschan
International Symposium on Automated Technology for Verification and …, 2005
292005
Safety verification for probabilistic hybrid systems
L Zhang, Z She, S Ratschan, H Hermanns, EM Hahn
European Journal of Control 18 (6), 572-587, 2012
282012
Guaranteed termination in the verification of LTL properties of non-linear robust discrete time hybrid systems
W Damm, G Pinto, S Ratschan
International Journal of Foundations of Computer Science 18 (01), 63-86, 2007
282007
Constraints for continuous reachability in the verification of hybrid systems
S Ratschan, Z She
International Conference on Artificial Intelligence and Symbolic Computation …, 2006
282006
Combined global and local search for the falsification of hybrid systems
J Kuřátko, S Ratschan
International Conference on Formal Modeling and Analysis of Timed Systems …, 2014
222014
Applications of quantified constraint solving over the reals-bibliography
S Ratschan
arXiv preprint arXiv:1205.5571, 2012
222012
Safety verification of non-linear hybrid systems is quasi-decidable
S Ratschan
Formal Methods in System Design 44 (1), 71-90, 2014
202014
Safety verification of non-linear hybrid systems is quasi-semidecidable
S Ratschan
International Conference on Theory and Applications of Models of Computation …, 2010
202010
Quasi-decidability of a fragment of the first-order theory of real numbers
P Franek, S Ratschan, P Zgliczynski
Journal of Automated Reasoning 57 (2), 157-185, 2016
152016
Satisfiability of systems of equations of real analytic functions is quasi-decidable
P Franek, S Ratschan, P Zgliczynski
International Symposium on Mathematical Foundations of Computer Science, 315-326, 2011
152011
The system can't perform the operation now. Try again later.
Articles 1–20