Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10328862 | Electronic Notes in Theoretical Computer Science | 2005 | 19 Pages |
Abstract
The verifier requires region-safety certificates to be provided along with the bytecodes. The verification process consists of a load-time verification of method bodies, and a lazy linkage verification of method calls. Our region system supports both regions that are not lexically scoped and dangling pointers; the verifier proposed in this paper can successfully handle both of these features. Our experiments indicate that the sizes of certificates are acceptable in practice, and that region verification incurs little run-time overhead.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sigmund Cherem, Radu Rugina,