Traversable stack with fewer errors

Authors:
Paulo A. S. Veloso
Affiliations:
Catholic University, Rio de Janeiro, RJ/ Brazil
Venue:
ACM SIGPLAN Notices
Year:
1979

Citing 3
Cited 3

Abstract data types and the development of data structures

Communications of the ACM
Limits of the "algebraic" specification of abstract data types

ACM SIGPLAN Notices
Some remarks on abstract data types

ACM SIGPLAN Notices

Data Type Specification: Parameterization and the Power of Specification Techniques

ACM Transactions on Programming Languages and Systems (TOPLAS)
Testing traversable stacks

ACM SIGPLAN Notices
Specifications of Majster's traversable stack and Veloso's traversable stack

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

A complete finite "algebraic" specification for a version of traversable stack with fewer error conditions is presented. This is used to illustrate some issues concerning formal specification of data types, namely naturalness and clarity. Uncontrolled errors are considered harmful and canonical-term specifications are considered helpful.