
doi: 10.1007/bfb0023745
This paper explores the role for mechanised support for refining specifications to executable programs. The goal of refinement is to achieve the translation from specification to implementation without the introducing errors. The refinement calculus provides a set of rules for developing procedural programs from abstract specifications. A prototype editor for the refinement calculus is described that was constructed using the Cornell Synthesizer Generator. Based on our experiences, desirable features for future tools are suggested.
1700 Computer Science, 2614 Theoretical Computer Science
1700 Computer Science, 2614 Theoretical Computer Science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
