Skip to main content
Conference Proceedings

A proof system for conditional algebraic specifications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1991) 516 LNCS 51-63
DOI: 10.1007/3-540-54317-1_80
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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 specifications with conditional axioms.

Cite

CITATION STYLE

APA

Kounalis, E., & Rusinowitch, M. (1991). A proof system for conditional algebraic specifications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 516 LNCS, pp. 51–63). Springer Verlag. https://doi.org/10.1007/3-540-54317-1_80

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free