A strategy for compiling classes, inheritance, and dynamic binding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2805, Issue , 2003, Pages 301-320

  Duran, Adolfo ^a   Cavalcanti, Ana ^a   Sampaio, Augusto ^b  

^a UNIVERSITY OF KENT   (United Kingdom)

^b FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; FORMAL METHODS; PROGRAM INTERPRETERS; SEMANTICS;

ALGEBRAIC LAWS; COMPILATION PROCESS; COMPILER CORRECTNESS; DYNAMIC BINDING; REFINEMENT LAWS; REFINEMENT STRATEGY; SEMANTIC FRAMEWORK; VISIBILITY CONTROL;

PROGRAM COMPILERS;

EID: 21144442899     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45236-2_18     Document Type: Article

References (17)

1. R. J. R. Back. Procedural abstraction in the refinement calculus. Technical Report Ser. A No. 55, Department of Computer Science, Abo - Finland, 1987.
2. P. Borba, A. Sampaio, and M. Cornélio. A refinement algebra for object-oriented programming. In To Appear in the Proceedings of ECOOP 2003, 2003.
3. E. Börger and W. Schulte. Defining the java virtual machine as platform for provably correct java compilation. In MFCS'98., number 1450, pages 17-35. Springer LNCS, 1998.
4. A. Cavalcanti and D. Naumann. A weakest precondition semantics for refinement of object-oriented programs. IEEE Transactions on Software Enginnering, 26(08):713-728, 2000.
5. M. Cornélio, A. Cavalcanti, and Augusto Sampaio. Refactoring by transformation. In Proceedings of REFINE'2002, Electronic Notes in Theoretical Computer Science, 2002.
6. E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, Engewood Cliffs, 1976.
7. A. Duran, A. Cavalcanti, and A. Sampaio. Refinement algebra for formal bytecode generation. In ICFEM 2002 - 4th International Conference on Formal Engineering Methods, pages 347-358, Shanghai, China, October 2002. Springer-Verlag.
8. A. Duran, A. Cavalcanti, and A. Sampaio. A refinement strategy for the compilation of classes, inheritance, and dynamic binding (extended version). Technical report, Computing Laboratory, University of Kent at Canterbury, 2003.
9. A. Duran, A. Sampaio, and A. Cavalcanti. Formal bytecode generation for rool virtual machine. In IV WMF - Workshop on Formal Methods. PUC - Rio de Janeiro/Brazil, October 2001.
10. C. A. R. Hoare, J. He, and A. Sampaio. Normal form approach to compiler design. Acta Informatica, 30:701-739, 1993.
11. Tim Lindholm and Frank Yellin. The java Virtual Machine Specification. Addison-Wesley, 1997.
12. J. McCarthy and J. Painter. Correctness of a compiler for arithmetic expressions. In Symposium on Applied Mathematics, pages 33-41. American Mathematical Society, 1967.
13. C. Morgan. Programming from Specifications. Prentice Hall, second edition, 1994.
14. M. Müller-Olm. Modular Compiler Verification: A Refinement-Algebraic Approach Advocating Stepwise Abstraction, volume 1283 of LNCS. Springer-Verlag, Heidelberg, Germany, 1997.
15. A. Sampaio. An Algebraic Approach to Compiler Design, volume 4 of AMAST Series in Computing. World Scientific, 1997.
16. R. Stärk, J. Schmid, and E. Börger. Java and the Java Virtual Machine - Definition, Verification, Validation. Springer-Verlag, 2001.
17. L. Wildman. A formal basis for a program compilation proof tool. In Lars-Henrik Eriksson and Peter Alexander Lindsay, editors, FME2002: Formal Methods - Getting IT Right, Copenhagen, Denmark, July 2002. International Symposium of Formal Methods Europe, Springer.