arXiv (Cornell University) · 2013 · 29 citations · 10 references
ComputingComputer ScienceAlgorithmsDifferential EquationsTheory Of ComputationDeductive VerificationHybrid Systems VerificationModel CheckingTheorem ProvingDifferential Equation SolversEmbedded Software DevelopmentFormal VerificationSatisfiabilitySatisfiability Problem
We study SMT problems over the reals containing ordinary differential equations. They are important for formal verification of realistic hybrid systems and embedded software. We develop delta-complete algorithms for SMT formulas that are purely existentially quantified, as well as exists-forall formulas whose universal quantification is restricted to the time variables. We demonstrate scalability of the algorithms, as implemented in our open-source solver dReal, on SMT benchmarks with several hundred nonlinear ODEs and variables.
10
Laurent Granvilliers, Frédéric Benhamou · ACM Transactions on Mathematical Software · 2006 · 228 citations
Delta-Decidability over the Reals
Sicun Gao, Jeremy Avigad, Edmund M. Clarke · 2012 · 79 citations