Making Mobile Code Both Safe and Efficient (2003)
Cached
Download Links
| Citations: | 2 - 1 self |
BibTeX
@MISC{Franz03makingmobile,
author = {Michael Franz and Wolfram Amme and Matthew Beers and Niall Dalton and Peter H. Fröhlich and Vivek Haldar and Andreas Hartmann and Peter S. Housel and Fermín Reig and Jeffery von Ronne and Christian H. Stork and Sergiy Zhenochin},
title = {Making Mobile Code Both Safe and Efficient},
year = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Mobile programs can potentially be malicious. To protect itself, a host that receives such mobile programs from an untrusted party or via an untrusted network connection will want some kind of guarantee that the mobile code is not about to cause any damage. The traditional solution to this problem has been verification, by which the receiving host examines the mobile program to discover all its actions even before starting execution. Unfortunately, aside from consuming computing resources in itself, verification inhibits traditional compiler optimizations, making such verifiable mobile code much less efficient than native code. We have found an alternative solution...
