Executable specifications with quantifiers in the FASE system

Authors:
Stan Jefferson;Samuel N. Kamin
Affiliations:
-;-
Venue:
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Year:
1986

Citing 6
Cited 0

Principles of OBJ2

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Final Data Types and Their Specification

ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract data types and software validation

Communications of the ACM
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Final data type specifications: a new data type specification method

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A FASE Specification of FP

Proceedings of the Conference on Logic of Programs

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an overview of the FASE system for executable specifications based upon final, rather than initial, algebras. Particular emphasis is placed upon the execution of expressions involving quantifiers. The need for such expressions is explained, as is our method for evaluating them. By permitting quantifiers, we are able to give very natural specifications for many data types. As an example, we give the FASE specification of Kemmerer's library system.