Results 1 - 10
of
93
Proving Java Type Soundness
, 1997
"... This technical report describes a machine checked proof of the type soundness of a subset of the Java language called Java S . A formal semantics for this subset has been developed by Drossopoulou and Eisenbach, and they have sketched an outline of the type soundness proof. The formulation developed ..."
Abstract
-
Cited by 91 (2 self)
- Add to MetaCart
This technical report describes a machine checked proof of the type soundness of a subset of the Java language called Java S . A formal semantics for this subset has been developed by Drossopoulou and Eisenbach, and they have sketched an outline of the type soundness proof. The formulation
Java Type Soundness Revisited
, 2000
"... We present an operational semantics, type system, and a proof of type soundness for a substantial subset of Java. The subset includes interfaces, classes, inheritance, field hiding, method overloading and overriding, arrays with associated dynamic checks, and exception handling. We distinguish betwe ..."
Abstract
-
Cited by 25 (1 self)
- Add to MetaCart
We present an operational semantics, type system, and a proof of type soundness for a substantial subset of Java. The subset includes interfaces, classes, inheritance, field hiding, method overloading and overriding, arrays with associated dynamic checks, and exception handling. We distinguish
Is the Java Type System Sound?
- In Proceedings of the Fourth International Workshop on Foundations of Object-Oriented Languages
, 1997
"... We argue that the Java type system is sound, by proving a subject reduction theorem. We define a subset of Java, a language which is safe and which reflects the most essential features of Java, a term rewriting system for the operational semantics and a type inference system to describe compile time ..."
Abstract
-
Cited by 23 (5 self)
- Add to MetaCart
We argue that the Java type system is sound, by proving a subject reduction theorem. We define a subset of Java, a language which is safe and which reflects the most essential features of Java, a term rewriting system for the operational semantics and a type inference system to describe compile
A type system for Java bytecode subroutines
- In Proceedings of the 25th ACM POPL
, 1998
"... Java is typically compiled into an intermediate language, JVML, that is interpreted by the Java Virtual Machine. Because mobile JVML code is not always trusted, a bytecode verifier enforces static constraints that prevent various dynamic errors. Given the importance of the bytecode verifier for secu ..."
Abstract
-
Cited by 186 (0 self)
- Add to MetaCart
for security, its current descriptions are inadequate. This paper proposes using typing rules to describe the bytecode verifier because they are more precise than prose, clearer than code, and easier to reason about than either. JVML has a subroutine construct used for the compilation of Java’s try
Machine-checking the Java Specification: Proving Type-Safety
- FORMAL SYNTAX AND SEMANTICS OF JAVA
, 1998
"... In this article we present Bali, the formalization of a large (hitherto sequential) sublanguage of Java. We give its abstract syntax, type system, well-formedness conditions, and an operational evaluation semantics. Based on these definitions, we can express soundness of the type system, an importan ..."
Abstract
-
Cited by 15 (0 self)
- Add to MetaCart
In this article we present Bali, the formalization of a large (hitherto sequential) sublanguage of Java. We give its abstract syntax, type system, well-formedness conditions, and an operational evaluation semantics. Based on these definitions, we can express soundness of the type system
Java is Type Safe - Probably
- In European Conference On Object Oriented Programming
, 1997
"... . Amidst rocketing numbers of enthusiastic Java programmers and internet applet users, there is growing concern about the security of executing Java code produced by external, unknown sources. Rather than waiting to find out empirically what damage Java programs do, we aim to examine first the langu ..."
Abstract
-
Cited by 60 (2 self)
- Add to MetaCart
the language and then the environment looking for points of weakness. A proof of the soundness of the Java type system is a first, necessary step towards demonstrating which Java programs won't compromise computer security. We consider a type safe subset of Java describing primitive types, classes
Coinductive big-step operational semantics for type soundness of Java-like languages
, 2011
"... We define a coinductive semantics for a simple Java-like language by simply interpreting coinductively the rules of a standard big-step operational semantics. We prove that such a semantics is sound w.r.t. the usual small-step operational semantics, and then prove soundness of a conventional nominal ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
We define a coinductive semantics for a simple Java-like language by simply interpreting coinductively the rules of a standard big-step operational semantics. We prove that such a semantics is sound w.r.t. the usual small-step operational semantics, and then prove soundness of a conventional
Axiomatic Semantics for Java ℓight – Extended Abstract –
"... Abstract. We introduce a Hoare-style calculus for a nearly full subset of sequential Java, which we call Java ℓight. This axiomatic semantics has been proved sound and complete w.r.t. our operational semantics of Java ℓight, described in earlier papers. The proofs also give new insights into the rol ..."
Abstract
- Add to MetaCart
Abstract. We introduce a Hoare-style calculus for a nearly full subset of sequential Java, which we call Java ℓight. This axiomatic semantics has been proved sound and complete w.r.t. our operational semantics of Java ℓight, described in earlier papers. The proofs also give new insights
Axiomatic semantics for Java ℓight in Isabelle/HOL
- Formal Techniques for Java Programs. Technical Report 269, 5/2000, Fernuniversität Hagen, 2000. ECOOP2000 Workshop proceedings available from http://www.informatik.fernuni-hagen. de/pi5/publications.html
, 2000
"... Abstract. We introduce a Hoare-style calculus for a nearly full subset of sequential Java, which we call Java ℓight. In particular, we present solutions to challenging features like exception handling, static initialization of classes and dynamic binding of methods. This axiomatic semantics has been ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
been proved sound and complete w.r.t. pour operational semantics of Java ℓight, described in earlier papers. To our knowledge, our Hoare logic is the first one for an object-oriented language that has been proved complete. The proofs also give new insights into the role of type-safety. All
Axiomatic Semantics for Java^light (Extended Abstract)
"... { David von Oheimb ? Technische Universitat Munchen http://www.in.tum.de/~oheimb/ Abstract. We introduce a Hoare-style calculus for a nearly full subset of sequential Java, which we call Java `ight . This axiomatic semantics has been proved sound and complete wrt. our operational semantics of ..."
Abstract
- Add to MetaCart
{ David von Oheimb ? Technische Universitat Munchen http://www.in.tum.de/~oheimb/ Abstract. We introduce a Hoare-style calculus for a nearly full subset of sequential Java, which we call Java `ight . This axiomatic semantics has been proved sound and complete wrt. our operational semantics
Results 1 - 10
of
93