An approach to subroutine elimination
Resumen:
Subroutines seem to be more a problem than a solution for the Byte Code Verifier's world, especially with resource constrained devices like Java Card. The elimination of subroutines form the Java bytecode would allow the construction of more efficient and precise Byte Code Verifiers. Here we specify a transformation for eliminating subroutines and we prove that its preserves the semantics of the Java program been transformed. Al this is done on top of the COQ Proof Assistant.
| 2003 | |
|
BYTE CODE VERIFIERS SUBROUTINES JAVA CARD CQQ FORMAL PROOFS |
|
| Universidad de la República | |
| COLIBRI | |
| http://hdl.handle.net/20.500.12008/3498 | |
| Acceso abierto | |
| Licencia Creative Commons Atribución – No Comercial – Sin Derivadas (CC BY-NC-ND 4.0) |
