A Refinement Algebra for Object-Oriented Programming

作者: Paulo Borba , Augusto Sampaio , Márcio Cornélio

DOI: 10.1007/978-3-540-45070-2_20

关键词:

摘要: In this article we introduce a comprehensive set of algebraic laws for ROOL, language similar to sequential Java but with copy semantics. We present few commands, focus on the object-oriented features language. show that is complete in sense it sufficient reduce an arbitrary ROOL program normal form expressed restricted subset operators. also propose law data refinement generalises technique from traditional modules class hierarchies. Together, these are expressive enough derive more elaborate rules can be useful, example, formalize design practices; illustrated through systematic derivation refactoring proposed laws.

参考文章(29)
William F. Opdyke, Refactoring object-oriented frameworks PhD thesis, University of Illinois at Urbana-Champaign. ,(1992)
P. Garbett, J. P. Parkes, M. Shackleton, S. Anderson, Secure Synthesis of Code: A Process Improvement Experiment formal methods. pp. 1816- 1835 ,(1999) , 10.1007/3-540-48118-4_46
Carroll Morgan, Programming from specifications (2nd ed.) Prentice Hall International (UK) Ltd.. ,(1994)
Grady Booch, James Rumbaugh, Ivar Jacobson, The Unified Modeling Language ,(2003)
Ralph Johnson, Donald Bradley Roberts, Practical analysis for refactoring University of Illinois at Urbana-Champaign. ,(1999)
Martin Gogolla, Mark Richters, Transformation Rules for UML Class Diagrams Lecture Notes in Computer Science. pp. 92- 106 ,(1998) , 10.1007/978-3-540-48480-6_8
Anna Mikhajlova, Emil Sekerinski, Class Refinement and Interface Refinement in Object-Oriented Programs formal methods. pp. 82- 101 ,(1997) , 10.1007/3-540-63533-5_5
James Gosling, David Colin Holmes, Ken Arnold, None, The Java Programming Language ,(1996)
Stuart Anderson, Konstantinos Tourlas, Diagrams and Programming Languages for Programmable Controllers formal methods. pp. 1- 19 ,(1997) , 10.1007/3-540-63533-5_1