Delta-Decidability over the Reals

DOI10.1109/LICS.2012.41zbMath1364.03065arXiv1204.6671OpenAlexW2128612513MaRDI QIDQ2986807

Sicun Gao, Jeremy Avigad, Edmund M. Clarke

Publication date: 16 May 2017

Published in: 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.6671

zbMATH Keywords

computable analysisdecision proceduresfirst-order theories over the reals

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Computation over the reals, computable analysis (03D78)

Related Items (7)

Computing compositional proofs of input-to-output stability using SOS optimization and \(\delta\)-decidability ⋮ The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints ⋮ Relating syntactic and semantic perturbations of hybrid automata ⋮ Quasi-decidability of a fragment of the first-order theory of real numbers ⋮ Monitoring bounded LTL properties using interval analysis ⋮ The \texttt{ksmt} calculus is a \(\delta \)-complete decision procedure for non-linear constraints ⋮ Towards physical hybrid systems

This page was built for publication: Delta-Decidability over the Reals