The following pages link to Michal Konečný (Q254163):
Displaying 17 items.
- Enclosing the behavior of a hybrid automaton up to and beyond a Zeno point (Q254170) (← links)
- Polynomial function intervals for floating-point software verification (Q457251) (← links)
- Real functions computable by finite automata using affine representations. (Q1607295) (← links)
- Real functions incrementally computable by finite automata (Q1826628) (← links)
- Axiomatic reals and certified efficient exact real computation (Q2148797) (← links)
- Function Interval Arithmetic (Q2879194) (← links)
- (Q3075217) (← links)
- (Q3075218) (← links)
- Time Complexity and Convergence Analysis of Domain Theoretic Picard Method (Q3511455) (← links)
- (Q4435470) (← links)
- (Q4457458) (← links)
- Representations and evaluation strategies for feasibly approximable functions (Q4995603) (← links)
- Continuous and monotone machines (Q5089226) (← links)
- A type system with usage aspects (Q5451967) (← links)
- Semantics, Specification Logic, and Hoare Logic of Exact Real Computation (Q6512011) (← links)
- Semantics, specification logic, and Hoare logic of exact real computation (Q6563064) (← links)
- Formalizing hyperspaces for extracting efficient exact real computation (Q6647692) (← links)