| Program |
 |
|
|
|
| Find in Program |
|
|
|
|
| Page |
|
|
|
|
| Basket |
|
|
view, help
"Pluggable Verification Modules: An Extensible Protection Mechanism for the JVM"
|
|
|
|
Pluggable Verification Modules: An Extensible Protection Mechanism for the JVM
Meeting Rooms 1-3
Thursday, 10:30, 30 minutes | 7 | · | 8 | · | 9 | · | 10 | · | 11 | · | 12 | · | 13 | · | 14 | · | 15 | · | 16 | · | 17 | · | 18 | · | 19 | · | 20 | · | 21 |
Philip Fong, University of Regina
Through the design and implementation of a JVM that supports Pluggable
Verification Modules (PVMs), the idea of an extensible protection
mechanism is entertained. Link-time bytecode verification becomes
a pluggable service that can be readily replaced, reconfigured, and
augmented. Application-specific verification services can be safely
introduced into the dynamic linking process of the JVM. This feature
is enabled by the adoption of a previously proposed modular verification
architecture, Proof Linking, which decouples bytecode verification from
the dynamic linking process, rendering the verifier a replaceable module.
The PVM mechanism has been implemented in an open source JVM, the Aegis VM.
To evaluate the software engineering and security engineering benefits of
this extensible protection mechanism, an augmented type system JAC
(Java Access Control) has been successfully implemented as a PVM.
|
