An Axiomatic Approach to Binary Logical Relations with Applications to Data Refinement

An Axiomatic Approach to Binary Logical Relations with Applications to Data Refinement (1997)

Cached

Download Links

[ftp.qucis.queensu.ca]
[ftp.dcs.qmw.ac.uk]

Other Repositories/Bibliography

DBLP

by Yoshiki Kinoshita , Peter W. O'hearn , A. John Power , Makoto Takeyama , Robert D. Tennent

Venue:	Proc. TACS'97, Springer LNCS 1281
Citations:	18 - 1 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	An Axiomatic Approach to Binary Logical Relations with Applications to Data Refinement	user correction - Legacy Corrections
AUTHOR NAME	Yoshiki Kinoshita	SVM HeaderParse 0.1
AUTHOR AFFIL	Electrotechnical Laboratory	SVM HeaderParse 0.2
AUTHOR ADDR	Japan	SVM HeaderParse 0.1
AUTHOR NAME	Peter W. O'hearn	SVM HeaderParse 0.1
AUTHOR AFFIL	y; Queen Mary and Westfield College, London, England	SVM HeaderParse 0.2
AUTHOR NAME	A. John Power	SVM HeaderParse 0.1
AUTHOR AFFIL	z; University of Edinburgh, Scotland	SVM HeaderParse 0.2
AUTHOR NAME	Makoto Takeyama	SVM HeaderParse 0.1
AUTHOR AFFIL	Chalmers University of Technology	SVM HeaderParse 0.2
AUTHOR ADDR	Goteburg, Sweden	SVM HeaderParse 0.1
AUTHOR NAME	Robert D. Tennent	SVM HeaderParse 0.1
AUTHOR AFFIL	x; Queen's University, Kingston	SVM HeaderParse 0.2
AUTHOR ADDR	Canada	SVM HeaderParse 0.1
ABSTRACT	We introduce an axiomatic approach to logical relations and data refinement. We consider a programming language and the monad on the category of small categories generated by it. We identify abstract data types for the language with sketches for the associated monad, and define an axiomatic notion of "relation" between models of such a sketch in a semantic category. We then prove three results: (i) such models lift to the whole language together with the sketch; (ii) any such relation satisfies a soundness condition, and (iii) such relations compose. We do this for both equality of data representations and for an ordered version. Finally, we compare our formulation of data refinement with that of Hoare. This work has been done with the support of the MITI Cooperative Architecture Project. This author also acknowledges the support of Kaken-hi. y This author achnowledges the support of the MITI Cooperative Architecture Project. z This author acknowledges the support of EPSRC grant...	user correction - Legacy Corrections
YEAR	1997	INFERENCE
VENUE	Proc. TACS'97, Springer LNCS 1281	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	191--212	INFERENCE
CITATIONS	24 found	ParsCit 1.0