A Deterministic Algorithm for Identifying Direct Superclasses in Java

Authors:
Hans Langmaack;Andrzej Salwicki;Marek Warpechowski
Affiliations:
Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Christian-Albrechts-Platz 4 D-24118 Kiel, Germany;(Correspd.) National Institute of Telecomunication, Szachowa 1, 04-894 Warszawa, Poland;Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland. {salwicki ∣ warp}@mimuw.edu.pl
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2008

Citing 5
Cited 0

Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom

Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom
On inner classes

Information and Computation - FOOL VII
Java(TM) Language Specification, The (3rd Edition) (Java (Addison-Wesley))

Java(TM) Language Specification, The (3rd Edition) (Java (Addison-Wesley))
Thinking in Java (4th Edition)

Thinking in Java (4th Edition)
On an algorithm determining direct superclasses in Java and similar languages with inner classes---Its correctness, completeness and uniqueness of solutions

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In an earlier article [5] we analyzed the problem of determining direct superclasses in Java and Java-like languages. We gave a specification of the problem showing that it closely reflects the requirements of [2]. We presented a non-deterministic algorithm and proved its correctness and completeness. This paper presents a deterministic algorithm which elaborates direct superclasses. The new algorithm is better for it presents all details of implementation and its cost seems lower than the cost of the non-deterministic algorithm. Another advantage of the proposed algorithm is error recovery. Should the algorithm report an error it continues its job and possibly reports more errors in one pass.