Describing the Semantics of Java and Proving Type Soundness

Drossopoulou, Sophia; Eisenbach, Susan

doi:10.1007/3-540-48737-9_2

Cited by 43 publications

(46 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a consequence, as well-known to experienced Java programmers, standard Java compilers, as SDK and Jikes, are not type safe in the sense that they can generate binary fragments whose execution throws linkage errors. This seems in contradiction with the fact that type safety results have been proved for the Java language [19,10,18]; the explanation is that these formal type systems, and the related type safety results, are only related to the special case when a closed set of source fragments is typechecked, while (1) and (2) are not taken into account (apart from [12], see Section 5). Even worse, there is no specification of separate compilation in [14], hence the outcome of compilations may strongly depend on the particular compiler implementation.…”

Section: Introductionmentioning

confidence: 87%

“…While all these three schemata share the same source type judgment and type extraction function (corresponding to the Java type system defined in [14] and formalized in, e.g., [10]), they remarkably differ in the other two components (that is, dependency function and binary type judgment) as described in the following examples.…”

Section: Some Motivating Examplesmentioning

confidence: 99%

“…Again, the source type judgment is the same for the three schemata, and corresponds to the Java type system defined in [14] and formalized, e.g., in [10]. The formalization for the small Java subset for which we define a type safe compilation schema is given in Figure 3 in the Appendix.…”

Section: Fig 1 Definition Of Compilation Functionmentioning

confidence: 99%

“…As already mentioned, the type judgment which we consider at the source level is based (though much simpler, since we consider a small Java subset) on the many existing formal Java type systems, in particular those in [10]. For what concerns an integrated formal model covering all Java aspects, the most remarkable amount of work in this direction is that of Sophia Drossopoulou and her group.…”

Section: Related Workmentioning

confidence: 99%

“…For what concerns an integrated formal model covering all Java aspects, the most remarkable amount of work in this direction is that of Sophia Drossopoulou and her group. The already cited [10] provides a formal type system at the source level for a substantial subset Java s of Java and a translation of this language into a binary language Java b , which is in turn a subset of a language Java r of run-time terms for which an operational semantics is given. This allows to prove type safety of the Java subset.…”

Section: Related Workmentioning

confidence: 99%

See 4 more Smart Citations

A Formal Framework for Java Separate Compilation

Ancona

Lagorio

Zucca

2002

ECOOP 2002 — Object-Oriented Programming

View full text Add to dashboard Cite

Abstract. We define a formal notion, called compilation schema, suitable for specifying different possibilities for performing the overall process of Java compilation, which includes typechecking of source fragments with generation of corresponding binary code, typechecking of binary fragments, extraction of type information from fragments and definition of dependencies among them. We consider three compilation schemata of interest for Java, that is, minimal, SDK and safe, which correspond to a minimal set of checks, the checks performed by the SDK implementation, and all the checks needed to prevent run-time linkage errors, respectively. In order to demonstrate our approach, we define a kernel model for Java separate compilation and execution, consisting in a small Java subset, and a simple corresponding binary language for which we provide an operational semantics including run-time verification. We define a safe compilation schema for this language and formally prove type safety.

show abstract

Section: Introductionmentioning

confidence: 87%

Section: Some Motivating Examplesmentioning

confidence: 99%

Section: Fig 1 Definition Of Compilation Functionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

A Formal Framework for Java Separate Compilation

Ancona

Lagorio

Zucca

2002

ECOOP 2002 — Object-Oriented Programming

View full text Add to dashboard Cite

show abstract

Hoare logic for Java in Isabelle/HOL

Oheimb

2001

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYThis article presents a Hoare-style calculus for a substantial subset of Java Card, which we call Java ight . In particular, the language includes side-effecting expressions, mutual recursion, dynamic method binding, full exception handling, and static class initialization.The Hoare logic of partial correctness is proved not only sound (w.r.t. our operational semantics of Java ight , described in detail elsewhere) but even complete. It is the first logic for an object-oriented language that is provably complete. The completeness proof uses a refinement of the Most General Formula approach. The proof of soundness gives new insights into the role of type safety. Further by-products of this work are a new general methodology for handling side-effecting expressions and their results, the discovery of the strongest possible rule of consequence, and a flexible Call rule for mutual recursion. We also give a small but non-trivial application example.All definitions and proofs have been done formally with the interactive theorem prover Isabelle/HOL. This guarantees not only rigorous definitions, but also gives maximal confidence in the results obtained.

show abstract

Analysing the Java package/access concepts in Isabelle/HOL

Schirmer

2004

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYJava access modifiers and packages provide a mechanism to restrict access to members and types, as an additional means of information hiding beyond the purely object-oriented concept of classes. In this paper we clarify the semantics of access modifiers and packages by adding them to our formal model of Java in the theorem prover Isabelle/HOL. We analyse which properties we can rely on at runtime, provided that the program has passed the static accessibility tests.

show abstract

Describing the Semantics of Java and Proving Type Soundness

Cited by 43 publications

References 18 publications

A Formal Framework for Java Separate Compilation

A Formal Framework for Java Separate Compilation

Hoare logic for Java in Isabelle/HOL

Analysing the Java package/access concepts in Isabelle/HOL

Contact Info

Product

Resources

About