AUTOMATIC PROOF METHODS FOR ALGEBRAIC SPECIFICATIONS

被引：0

作者：

KOUNALIS, E

RUSINOWITCH, M

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1991年 / 529卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：307 / 317

页数：11

共 18 条

[1] TERMINATION OF REWRITING [J].

DERSHOWITZ, N .

JOURNAL OF SYMBOLIC COMPUTATION, 1987, 3 (1-2) :69-116

[2]

EHRIG H, 1978, LECTURE NOTES COMPUT, V62

[3]

Ehrig Hartmut, 1985, EATCS MONOGRAPHS THE, V6

[4]

Goguen Joseph, 1978, TECHNICAL REPORT RC, VIV, P80

[5] ABSTRACT DATA TYPES AND SOFTWARE VALIDATION [J].

GUTTAG, JV ;

HOROWITZ, E ;

MUSSER, DR .

COMMUNICATIONS OF THE ACM, 1978, 21 (12) :1048-1064

[6] PROOFS BY INDUCTION IN EQUATIONAL THEORIES WITH CONSTRUCTORS [J].

HUET, G ;

HULLOT, JM .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1982, 25 (02) :239-266

[7]

KIRCHNER H, 1991, LNCS, V488, P174

[8]

Knuth D. E., 1970, COMPUTATIONAL PROBLE, P263, DOI DOI 10.1016/B978-0-08-012975-4.50028-X

[9]

KOUNALIS E, 1990, PROCEEDINGS : EIGHTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, P240

[10]

KOUNALIS E, 1985, LECT NOTES COMPUT SC, V204, P348

← 1 2 →