Recursively defined properties are ubiquitous. We present a proof method for establishing entailment of such properties and over a set of common variables. The main contribution is a particular proof rule based intuitively upon the concept of coinduction. This rule allows the inductive step of assuming that an entailment holds during the proof the entailment. In general, the proof method is based on an unfolding (and no folding) algorithm that reduces recursive definitions to a point where only constraint solving is necessary. The constraint-based proof obligation is then discharged with available solvers. The algorithm executes the proof by a search-based method which automatically discovers the opportunity of applying induction instead of the user having to specify some induction schema, and which does not require any base case. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Jaffar, J., Santosa, A. E., & Voicu, R. (2008). A coinduction rule for entailment of recursively defined properties. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5202 LNCS, pp. 493–508). https://doi.org/10.1007/978-3-540-85958-1_33
Mendeley helps you to discover research relevant for your work.