Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
The Object-Z specification language
The Object-Z specification language
«UML» '01 Proceedings of the 4th International Conference on The Unified Modeling Language, Modeling Languages, Concepts, and Tools
A Survey of Software Refactoring
IEEE Transactions on Software Engineering
Architectural Design in Object-Z
ASWEC '04 Proceedings of the 2004 Australian Software Engineering Conference
Verifying data refinements using a model checker
Formal Aspects of Computing
Using the Alloy Analyzer to Verify Data Refinement in Z
Electronic Notes in Theoretical Computer Science (ENTCS)
Using coupled simulations in non-atomic refinement
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Issues in implementing a model checker for z
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Model checking z specifications using SAL
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
3FACS'98 Proceedings of the 3rd BCS-FACS conference on Northern Formal Methods
Alloy as a Refactoring Checker?
Electronic Notes in Theoretical Computer Science (ENTCS)
A Minimal Set of Refactoring Rules for Object-Z
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Challenge proposal: verification of refactorings
Proceedings of the 3rd workshop on Programming languages meets program verification
| Hi-index | 0.00 |
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.