Abstract
We present the Maude sufficient completeness tool, which explicitly supports sufficient completeness reasoning for partial conditional specifications having sorts and subsorts and with domains of functions defined by conditional memberships. Our tool consists of two main components: (i) a sufficient completeness analyzer that generates a set of proof obligations which if discharged, ensures sufficient completeness; and (ii) Maude's inductive theorem prover (ITP) that is used as a back-end to try to automatically discharge those proof obligations. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Hendrix, J., Clavel, M., & Meseguer, J. (2005). A sufficient completeness reasoning tool for partial specifications. In Lecture Notes in Computer Science (Vol. 3467, pp. 165–174). Springer Verlag. https://doi.org/10.1007/978-3-540-32033-3_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
