On a New Notion of Partial Refinement
Logic in Computer Science
2013-05-28 v1
Abstract
Formal specification techniques allow expressing idealized specifications, which abstract from restrictions that may arise in implementations. However, partial implementations are universal in software development due to practical limitations. Our goal is to contribute to a method of program refinement that allows for partial implementations. For programs with a normal and an exceptional exit, we propose a new notion of partial refinement which allows an implementation to terminate exceptionally if the desired results cannot be achieved, provided the initial state is maintained. Partial refinement leads to a systematic method of developing programs with exception handling.
Cite
@article{arxiv.1305.6110,
title = {On a New Notion of Partial Refinement},
author = {Emil Sekerinski and Tian Zhang},
journal= {arXiv preprint arXiv:1305.6110},
year = {2013}
}
Comments
In Proceedings Refine 2013, arXiv:1305.5634