Algebraic reasoning for object-oriented programming

Science of Computer Programming

Volumn 52, Issue 1-3, 2004, Pages 53-100

  Borba, Paulo ^a   Sampaio, Augusto ^a   Cavalcanti, Ana ^b   Cornélio, Márcio ^a,c  

^a FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

^b UNIVERSITY OF KENT   (United Kingdom)

^c FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER SOFTWARE; OBJECT ORIENTED PROGRAMMING; SEMANTICS; SOFTWARE ENGINEERING;

ALGEBRIC LAWS; DYNAMIC BINDING; PROGRAM TRANSFORMATIONS; RECURSIVE CLASSES;

COMPUTER PROGRAMMING LANGUAGES;

EID: 3042774757     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2004.03.003     Document Type: Article

References (46)

1. R.J.R. Back, Procedural Abstraction in the refinement calculus, Technical Report, Ser. A, vol. 55, Department of Computer Science, Åbo, Finland, 1987.
2. Banerjee A., Naumann D. Representation independence, confinement and access control. POPL2002. 2001.
3. Bergstein P.L. Object-preserving class transformations. OOPSLA'91 Conference Proceedings. 1991;299-313 ACM Press.
4. Bird R., de Moor O. Algebra of Programming. 1997;Prentice-Hall.
5. Booch G., Jacobson I., Rumbaugh J. The Unified Modeling Language User Guide. 1999;Addison-Wesley.
6. Borba P.H.M., Sampaio A.C.A., Cornélio M.L. A refinement algebra for object-oriented programming. Cardelli Luca. European Conference on Object-oriented Programming 2003, ECOOP 2003. Lecture Notes in Computer Science. vol. 2743:2003;457-482 Springer-Verlag.
7. Castor F., Borba P. A language for specifying Java transformations. V Brazilian Symposium on Programming Languages. Curitiba, Brazil, 23-25 May: 2001;236-251.
8. Cavalcanti A.L.C., Naumann D.A. A weakest precondition semantics for refinement of object-oriented programs. IEEE Trans. Softw. Eng. 26:(8):2000;713-728.
9. Cavalcanti A.L.C., Naumann D.A. Forward simulation for data refinement of classes. Eriksson L., Lindsay P.A. Formal Methods - Getting IT Right. FME 2002 Lecture Notes in Computer Science. vol. 2391:2002;471-490 Springer-Verlag.
10. Cavalcanti A.L.C., Sampaio A.C.A., Woodcock J.C.P. Procedures and recursion in the refinement calculus. J. Braz. Comput. Soc. 5:(1):1998;1-15.
11. Cavalcanti A.L.C., Sampaio A.C.A., Woodcock J.C.P. An inconsistency in procedures, parameters, and substitution the refinement calculus. Sci. Comput. Programming. 33:(1):1999;87-96.
12. M.L. Cornélio, Object-Oriented Refactorings and Patterns as Formal Refinements, Ph.D. Thesis, Informatics Center, Federal University of Pernambuco, Brazil, 2004, Ongoing work.
13. Cornélio M.L., Cavalcanti A.L.C., Sampaio A.C.A. Refactoring by transformation. Proceedings of REFINE'2002. Eletronic Notes in Theoretical Computer Science. vol. 70:2002;. (invited paper).
14. Dijkstra E.W. A Discipline of Programming. 1976;Prentice-Hall.
15. Duran A.A., Cavalcanti A.L.C., Sampaio A.C.A. A strategy for compiling classes, inheritance, and dynamic binding. Araki K., Gnesi S., Mandrioli D. FME 2003: Formal Methods. Lecture Notes in Computer Science. vol. 2805:2003;301-320 Springer-Verlag.
16. Evans A. Reasoning with UML diagrams. Workshop on Industrial Strength Formal Methods, WIFT'98. 1998;IEEE Press.
17. Evans A., et al. The UML as a formal modeling notation. Bézivin J., Muller P. The Unified Modeling Language, UML'98 - Beyond the Notation. Lecture Notes in Computer Science. vol. 1618:1999;336-348 Springer-Verlag.
18. Fowler M. Refactoring. 1999;Addison-Wesley.
19. Gamma E., et al. Design Patterns: Elements of Reusable Object-Oriented Software. 1994;Addison-Wesley.
20. Gogolla M., Richters M. Transformation rules for UML class diagrams. Bézivin J., Muller P. The Unified Modeling Language, UML'98 - Beyond the Notation. Lecture Notes in Computer Science. vol. 1618:1999;92-106 Springer-Verlag.
21. Gosling J., Joy B., Steele G. The Java Language Specification. 1996;Addison-Wesley.
22. He J., Bowen J. Specification, verification, and prototyping of an optimized compiler. Form. Asp. Comput. 6:1994;643-658.
23. Hoare C.A.R., He J. Unifying Theories of Programming. 1998;Prentice-Hall.
24. Hoare C.A.R., et al. Laws of programming. Commun. ACM. 30:(8):1987;672-686.
25. Kniesel G., Koch H. Static composition of refactorings. Sci. Comput. Programming. 2004;. (this issue, doi: 10.1016/j.scico.2004.03.002.).
26. Lano K., Bicarregui J. Semantics and transformations for UML models. Bézivin J., Muller P. The Unified Modeling Language, UML'98 - Beyond the Notation. Lecture Notes in Computer Science. vol. 1618:1999;107-119 Springer-Verlag.
27. Leino K.R.M. Recursive object types in a logic of object-oriented programming. Hankin C. 7th European Symposium on Programming. Lecture Notes in Computer Science. vol. 1381:1998;Springer-Verlag.
28. Lindholm T., Yellin F. The Java Virtual Machine Specification. 1997;Addison-Wesley.
29. Lira B.O., Cavalcanti A.L.C., Sampaio A.C.A. Automation of a normal form reduction strategy for object-oriented programming. Proceedings of the 5th Brazilian Workshop on Formal Methods. Gramado, Brazil, October: 2002;193-208.
30. Mahony B., Dong J.S. Timed communicating object Z. IEEE Trans. Softw. Eng. 26:(2):2000;150-177.
31. Meseguer J. A logical theory of concurrent objects and its realization in the maude language. Agha G., Wegner P., Yonezawa A. Object-Oriented Programming. 1993;314-390 MIT Press.
32. Mikhajlova A., Sekerinski E. Class refinement and interface refinement in object-oriented programs. Fitzgerald J., Jones C.B., Lucas P. FME'97: Industrial Benefit of Formal Methods. Lecture Notes in Computer Science. vol. 1313:1997;82-101 Springer-Verlag.
33. Moore I. Automatic inheritance hierarchy restructuring and method refactoring. OOPSLA'96 Conference Proceedings. 1996;235-250 ACM Press.
34. Moore I., Clement T. A simple and efficient algorithm for inferring inheritance hierarchies. Mitchell R. Proceedings of TOOLS-Europe'96. Paris, France: 1996;173-184 Prentice-Hall, Hertfordshire, UK.
35. Morgan C.C. Programming from Specifications. 2nd edition: 1994;Prentice-Hall.
36. Morgan C.C., Robinson K., Gardiner P.H.B. On the refinement calculus. Technical Monograph TM-PRG-70. 1988;Oxford University Computing Laboratory, Oxford, UK.
37. W. Opdyke, Refactoring Object-oriented Frameworks, Ph.D. Thesis, University of Illinois at Urban Champaign, 1992.
38. Partcsh H.A. Specification and Transformation of Programs: a Formal Approach to Software Development. Texts and Monographs in Computer Science. 1990;Springer-Verlag.
39. D. Roberts, Practical Analysis for Refactoring, Ph.D. Thesis, University of Illinois at Urban Champaign, 1999.
40. Roscoe A.W. The Theory and Practice of Concurrency. Prentice-Hall Series in Computer Science. 1998;Prentice-Hall.
41. Roscoe A.W., Hoare C.A.R. The laws of occam programming. Theor. Comput. Sci. 60:(2):1988;177-229.
42. Sampaio A.C.A. An Algebraic Approach to Compiler Design. AMAST Series in Computing. vol. 4:1997;World Scientific.
43. Seres S., Spivey M., Hoare T. Algebra of logic programming. ICPL'99. 1999.
44. Smith G. The Object-Z Specification Language. 1999;Kluwer Academic Publishers.
45. Ungar D., Smith R.B. Self: the power of simplicity. OOPSLA'87 Conference Proceedings. 1987;227-242 ACM Press.
46. M. Utting, An Object-Oriented Refinement Calculus with Modular Reasoning, Ph.D. Thesis, University of New South Wales, Kensington, Australia, 1992.