A sound framework for untrusted verification-condition generators
Necula, G.C.
Schneck, R.R.
California Univ., Berkeley, CA, USA;
This paper appears in: Logic in Computer Science, 2003. Proceedings. 18th Annual IEEE Symposium on
Publication Date: 22-25 June 2003
On page(s): 248- 260
ISSN: 1043-6871
ISBN: 0-7695-1884-2
INSPEC Accession Number: 7804297
Digital Object Identifier: 10.1109/LICS.2003.1210065
Current Version Published: 2003-07-09
Abstract
We propose a framework called configurable proof-carrying code, which allows the untrusted producer of mobile code to provide the bulk of the code verifier used by a code receiver to check the safety of the received code. The resulting system is both more flexible and also more trustworthy than a standard proof-carrying code system, because only a small part of the verifier needs to be trusted, while the remaining part can be configured freely to suit the safety policy on one hand, and the structure of the mobile code on the other hand. In this paper we describe formally the protocol that the untrusted verifier must follow in the interaction with the trusted infrastructure. We present a proof of the soundness of the system, and we give preliminary evidence that the architecture is expressive enough to delegate to the untrusted verifier even the handling of loop invariants, indirect jumps and calling conventions.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
