Abstract Data Type Specification in the Affirm System

Authors:
D. R. Musser
Affiliations:
Research and Development Center, General Electric Company
Venue:
IEEE Transactions on Software Engineering
Year:
1980

Citing 0
Cited 4

History and basic features of the critical-pair/completion procedure

Journal of Symbolic Computation
Only prime superpositions need be considered in the Knuth-Bendix completion procedure

Journal of Symbolic Computation
Inductive methods for reasoning about abstract data types

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Software requirements and specifications: A survey of needs and languages

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes the data type definition facilities of the AFFIRM system for program specification and verification. Following an overview of the system, we review the rewrite rule concepts that form the theoretical basis for its data type facilities. The main emphasis is on methods of ensuring convergence (finite and unique termination) of sets of rewrite rules and on the relation of this property to the equational and inductive proof theories of data types.