Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
type: Item
instance of: scholarly article
title: Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
zbMATH Open document ID: 0943.68032
DOI: 10.1016/S0020-0255(99)00012-2
author: Rudolf Berghammer
published in: Information Sciences
publication date: 2000-01-30T00:00:00Z
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 03G15
zbMATH DE Number: 1394724
zbMATH Keywords: imperative programs
zbMATH Keywords: Dijkstra-Gries method
describes a project that uses: RelView
MaRDI profile type: Publication
cites work: Calculating path algorithms
cites work: Q4213376
cites work: Q4362883
cites work: Q5810602
cites work: Guarded commands, nondeterminacy and formal derivation of programs
cites work: Programming as a Discipline of Mathematical Nature
cites work: Q3925859
cites work: Boolean Algebras with Operators
cites work: A relational approach to the design of deterministic programs
cites work: Relational heuristics for the design of deterministic programs
cites work: Towards pointer algebra
cites work: Shorter paths to graph algorithms
cites work: Finite Differencing of Computable Expressions
cites work: Q5287518
cites work: Some Observations Concerning Formal Differentiation of Set Theoretic Expressions
cites work: Computing kernels in directed bichromatic graphs
cites work: A Theorem on Boolean Matrices
full work available at URL: s0020-0255(99)00012-2
OpenAlex ID: W1970275691
description: scientific article; zbMATH DE number 1394724