JVM Bytecode Verification Without Dataflow Analysis | Zendy

Ian Bayley | Zendy; Sam Shiel | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

JVM Bytecode Verification Without Dataflow Analysis

Author(s) -

Ian Bayley,

Sam Shiel

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2005.02.029

Subject(s) - bytecode , dataflow , computer science , programming language , semantics (computer science) , signature (topology) , functional programming , abstract interpretation , theoretical computer science , mathematics , geometry , java

Bytecode verification algorithms are traditionally based on dataflow analysis. We present an alternative algorithm that first restructures the bytecode and then infers a type signature for each method in a manner typical of functional programming languages. We also give an operational semantics to an algebra of structured bytecode and thereby prove both that restructuring preserves semantics and that our type inference is sound

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research