Efficient Hierarchical Reasoning about Functions over Numerical Domains
We show that many properties studied in mathematical analysis (monotonicity, boundedness, inverse, Lipschitz properties possibly combined with continuity, derivability) are expressible by formulae in a class for which sound and complete hierarchical proof methods for testing satisfiability of sets of ground clauses exist. The results are useful for automated reasoning in analysis and in the verification of hybrid systems.
Unable to display preview. Download preview PDF.
- 4.Friedman, H., Serres, A.: Decidability in elementary analysis, II. Adv. in Mathematics 70(2), 1–17 (1990)Google Scholar
- 7.Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems (1979)Google Scholar
- 8.Sofronie-Stokkermans, V.: Hierarchic reasoning in local theory extensions. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 219–234. Springer, Heidelberg (2005)Google Scholar