z-logo
open-access-imgOpen Access
Modelchecking Correctness of Refactorings - Some Experiments
Author(s) -
H.-Christian Estler,
Thomas Ruhroth,
Heike Wehrheim
Publication year - 2007
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2006.08.041
Subject(s) - correctness , usable , programming language , computer science , class (philosophy) , object (grammar) , object oriented programming , simple (philosophy) , artificial intelligence , world wide web , philosophy , epistemology
Refactorings are changes made to programs, models or specifications with the intention of improving their structure and thus making them clearer, more readable and re-usable. Refactorings are required to be behaviour-preserving in that the external behaviour of the program/model/specification remains unchanged. In this paper we show how a simple type of refactorings on object-oriented specifications (written in Object-Z) can be formally shown to be behaviour-preserving using a modelchecker (SAL). The class of refactorings treated covers those operating on a single method only

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom