Abstraction Barriers in Equational Proof

Authors:
Jo Erskine Hannay
Affiliations:
-
Venue:
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Year:
1999

Citing 7
Cited 0

Toward formal development of programs from algebraic specifications: implementations revisited

Acta Informatica
Referential transparency, definiteness and unfoldability

Acta Informatica
Algebraic specification

Handbook of theoretical computer science (vol. B)
Referential opacity in nondeterministic data refinement

ACM Letters on Programming Languages and Systems (LOPLAS)
Programming from specifications (2nd ed.)

Programming from specifications (2nd ed.)
On behavioural abstraction and behavioural satisfaction in higher-order logic

TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Algebraic Specification Languages: An Overview

Selected papers from the 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop on Recent Trends in Data Type Specification

Quantified Score

Hi-index	0.00

Visualization

Abstract

Module constructs in programming languages have protection mechanisms hindering unauthorised external access to internal operators of data types. In some cases, granting external access to internal operators would result in serious violation of a data type's specified external properties. In order to reason consistently about specifications of such data types, it is necessary in general to incorporate a notion of protective abstraction barrier in proof strategies as well. We show how this can be done in equational calculus by simply restricting the congruence axiom, and see how the motivation for this naturally arises from FI and FRI approaches to specification refinement.