9931
|
1 |
|
|
2 |
@inproceedings{NipkowOP00,
|
9986
|
3 |
author={Tobias Nipkow and Oheimb, David von and Cornelia Pusch},
|
|
4 |
title={{$\mu$Java}: Embedding a Programming Language in a Theorem Prover},
|
|
5 |
booktitle = {Foundations of Secure Computation},
|
|
6 |
series= {NATO Science Series F: Computer and Systems Sciences}
|
|
7 |
volume = {175},
|
|
8 |
year = {2000},
|
|
9 |
publisher = {IOS Press},
|
|
10 |
editor = {Friedrich L. Bauer and Ralf Steinbr{\"u}ggen},
|
|
11 |
abstract = {This paper introduces the subset $micro$Java of Java,
|
|
12 |
essentially by omitting everything but classes.
|
|
13 |
The type system and semantics of this language
|
|
14 |
(and a corresponding abstract Machine $micro$JVM)
|
|
15 |
are formalized in the theorem prover Isabelle/HOL.
|
|
16 |
Type safety both of $micro$Java and the $micro$JVM
|
|
17 |
are mechanically verified.
|
|
18 |
|
|
19 |
To make the paper self-contained, it starts with
|
|
20 |
introductions to Isabelle/HOL and the art of
|
|
21 |
embedding languages in theorem provers.},
|
|
22 |
CRClassification = {D.3.1, F.3.2},
|
|
23 |
CRGenTerms = {Languages, Reliability, Theory, Verification},
|
|
24 |
url = {\url{http://isabelle.in.tum.de/Bali/papers/MOD99.html}},
|
|
25 |
pages = {117--144}
|
|
26 |
}
|
|
27 |
|
|
28 |
|
|
29 |
|
|
30 |
@inproceedings{DvO-ECOOP00,
|
|
31 |
author = {David von Oheimb},
|
|
32 |
title = {Axiomatic Semantics for Java_light in Isabelle/HOL},
|
|
33 |
booktitle = {Formal Techniques for {J}ava Programs},
|
|
34 |
year = {2000},
|
|
35 |
publisher = {Fernuniversit{{\"a}t} Hagen},
|
|
36 |
editor = {Drossopoulou, S. and Eisenbach, S. and Jacobs, B. and Leavens, G. T. and M{\"u}ller, P. and Poetzsch-Heffter, A.},
|
|
37 |
organization = {Technical Report 269, 5/2000, Fernuniversit{{\"a}t} Hagen},
|
|
38 |
note = {ECOOP2000 Workshop proceedings available from \url{http://www.informatik.fernuni-hagen.de/pi5/publications.html}}
|
|
39 |
abstract = {We introduce a Hoare-style calculus for a nearly
|
|
40 |
full subset of sequential Java, which we call Java_light. In particular,
|
|
41 |
we present solutions to challenging features like exception handling,
|
|
42 |
static initialization of classes and dynamic binding of methods.
|
|
43 |
|
|
44 |
This axiomatic semantics has been proved sound and complete w.r.t.
|
|
45 |
our operational semantics of Java_light, described in earlier papers.
|
|
46 |
To our knowledge, our Hoare logic is the first one for an
|
|
47 |
object-oriented language that has been proved complete.
|
|
48 |
The proofs also give new insights into the role of type-safety.
|
|
49 |
|
|
50 |
All the formalization and proofs have been done with the
|
|
51 |
theorem prover Isabelle/HOL.},
|
|
52 |
CRClassification = {D.2.4, D.3.1, F.3.1},
|
|
53 |
CRGenTerms = {Languages, Verification, Theory},
|
|
54 |
url = {\url{http://isabelle.in.tum.de/Bali/papers/ECOOP00.html}}
|
|
55 |
}
|
|
56 |
|
|
57 |
|
|
58 |
|
|
59 |
@inproceedings{KleinN00,
|
|
60 |
author={Gerwin Klein and Tobias Nipkow},
|
|
61 |
title={Verified Lightweight Bytecode Verification},
|
|
62 |
booktitle = {Formal Techniques for {J}ava Programs},
|
|
63 |
year = {2000},
|
|
64 |
publisher = {Fernuniversit{{\"a}t} Hagen},
|
|
65 |
editor = {Drossopoulou, S. and Eisenbach, S. and Jacobs, B. and Leavens, G. T. and M{\"u}ller, P. and Poetzsch-Heffter, A.},
|
|
66 |
organization = {Technical Report 269, 5/2000, Fernuniversit{{\"a}t} Hagen},
|
|
67 |
note = {ECOOP2000 Workshop proceedings available from \url{http://www.informatik.fernuni-hagen.de/pi5/publications.html}}
|
|
68 |
url = {\url{http://www4.in.tum.de/~nipkow/pubs/lbv.html}}
|
|
69 |
}
|