© University of Kent - Contact | Feedback | Legal | FOI | Cookies
Tactics of refinement
M. V. M. Oliveira and A. L. C. Cavalcanti
In 14th Brazilian Symposium on Software Engineering, pages 182-196, October 2000.Abstract
The refinement calculus is a modern technique to develop and implement software in a precise, complete, and consistent way. Its application, however, may lead to developments that are long and repetitive. In this paper we present a language which can be used to write refinement tactics that capture commonly used development strategies, and present examples of useful tactics. They encompass the application of several refinement laws, but can be used as a single transformation rule. Using tactics is not a novel idea, particularly in the area of theorem proving. Nevertheless, as far as we know in the context of refinement the only existing work uses Prolog to write tactics. Our language does not depend of any programming language or tool. Also, we are not aware of any presentation of refinement strategies written in the form of tactics as we present here. Our results are going to be incorporated in a tool to support the application of the refinement calculus that is under development.
Download publication 160 kbytes (PDF)
Bibtex Record
@inproceedings{1709,
author = {M. V. M. Oliveira and A. L. C. Cavalcanti},
title = {Tactics of Refinement},
month = {October},
year = {2000},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2000/1709},
publication_type = {inproceedings},
submission_id = {6065_1063876619},
booktitle = {14th Brazilian Symposium on Software Engineering},
}