✦ LIBER ✦

Verified lightweight bytecode verification

✍ Scribed by Gerwin Klein; Tobias Nipkow

Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 187 KB
Volume: 13
Category: Article
ISSN: 1532-0626
DOI: 10.1002/cpe.597

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Verified bytecode verifiers

✍ Gerwin Klein; Tobias Nipkow 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 335 KB

Using the theorem prover Isabelle/HOL we have formalized and proved correct and executable bytecode veriÿer in the style of Kildall's algorithm for a signiÿcant subset of the Java Virtual Machine (JVM). First an abstract framework for proving correctness of data ow based type inference algorithms fo

Weaknesses in Java bytecode verifier

📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 139 KB

Improving the official specification of

Improving the official specification of Java bytecode verification

✍ Alessandro Coglio 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB

Simple verification technique for comple

Simple verification technique for complex Java bytecode subroutines

✍ Alessandro Coglio 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 277 KB

Formalisation and implementation of an a

Formalisation and implementation of an algorithm for bytecode verification of @NonNull types

✍ Chris Male; David J. Pearce; Alex Potanin; Constantine Dymnikov 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 534 KB

Java's annotation mechanism allows us to extend its type system with non-null types. Checking such types cannot be done using the existing bytecode verification algorithm. We extend this algorithm to verify non-null types using a novel technique that identifies aliasing relationships between local v

Trust, but verify: The necessity of empi

Trust, but verify: The necessity of empirical verification in quantitative neurobiology

✍ Farel, Paul B. 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB