A single complete rule for data refinement (Q684396)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 411695
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A single complete rule for data refinement |
scientific article; zbMATH DE number 411695 |
Statements
A single complete rule for data refinement (English)
0 references
15 September 1993
0 references
program verification
0 references
language constructs
0 references
abstract datatypes
0 references
specification techniques
0 references
refinement calculus
0 references
completeness
0 references
weakest precondition
0 references
bounded nondeterminism
0 references
0.8515332341194153
0 references
0.8149723410606384
0 references
0.8030807375907898
0 references
0.7994799613952637
0 references
