Skip to main content
Conference ProceedingsOPEN ACCESS

A programming logic for sequential java

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1576 162-176
DOI: 10.1007/3-540-49099-X_11
90Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A Hoare-style programming logic for the sequential kernel of Java is presented. It handles recursive methods, class and interface types, subtyping, inheritance, dynamic and static binding, aliasing via object references, and encapsulation. The logic is proved sound w.r.t. an SOS semantics by embedding both into higher-order logic.

Cite

CITATION STYLE

APA

Poetzsch-Heffter, A., & Müller, P. (1999). A programming logic for sequential java. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1576, pp. 162–176). Springer Verlag. https://doi.org/10.1007/3-540-49099-X_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free