A Deterministic Algorithm for Identifying Direct Superclasses in Java

Issue title: Concurrency Specification and Programming (CS&P)

Article type: Research Article

Authors: Langmaack, Hans | Salwicki, Andrzej | Warpechowski, Marek

Affiliations: Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Christian-Albrechts-Platz 4 D-24118 Kiel, Germany | 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

Note: [] Address for correspondence: National Institute of Telecomunication, Szachowa 1, 04-894 Warszawa, Poland

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.

Journal: Fundamenta Informaticae, vol. 85, no. 1-4, pp. 343-357, 2008