Refinement concepts formalised in higher order logic
type: Item
instance of: scholarly article
title: Refinement concepts formalised in higher order logic
zbMATH Open document ID: 0703.68074
DOI: 10.1007/BF01888227
author: Elsie Sterbin Gottlieb
published in: Formal Aspects of Computing
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 4153902
zbMATH Keywords: mechanical theorem proving
zbMATH Keywords: program development
zbMATH Keywords: refinement calculus
zbMATH Keywords: weakest precondition
describes a project that uses: HOL
MaRDI profile type: Publication
cites work: Q3898009
cites work: A calculus of refinements for program derivations
cites work: Stepwise refinement of parallel algorithms
cites work: Duality in specification languages: A lattice-theoretical approach
cites work: Q4144755
cites work: A simple fixpoint argument without the restriction to continuity
cites work: Data refinement of predicate transformers
cites work: Q3925859
cites work: Edinburgh LCF. A mechanized logic of computation
cites work: Q3996918
cites work: A theoretical basis for stepwise refinement and the programming calculus
cites work: Q3906397
cites work: A lattice-theoretical fixpoint theorem and its applications
description: scientific article; zbMATH DE number 4153902