Abstract
Algebraic specifications provide a formal basis for designing data-structures and reasoning about their properties. Sufficient-completeness and consistency are fundamental notions for building algebraic specifications in a modular way. We give in this paper effective methods for testing these properties for algebraic specifications including conditional axioms.
Cite
CITATION STYLE
Kounalis, E., & Rusinowitch, M. (1991). Automatic proof methods for algebraic specifications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 529 LNCS, pp. 307–317). Springer Verlag. https://doi.org/10.1007/3-540-54458-5_75
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
