Abstract
We compare the standard Vienna method for establishing the correctness of a data reification with an alternative approach which is looser in its proof obligations. This is done by comparing the effort required to prove rigorously that a reification arising in the development of a unification algorithm is correct. We then generalize from this experience to identify two strategies for constructing reification proofs which are economical and well-structured.
Cite
CITATION STYLE
Clement, T. (1994). Comparing approaches to data reification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 873 LNCS, pp. 118–133). Springer Verlag. https://doi.org/10.1007/3-540-58555-9_92
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
