581 search results - page 92 / 117 » On the Verifiability of Programs Written in the Feature Lang... |
ECOOP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
VRML
2000
ACM
14 years 1 days ago
2000
ACM
In this paper we discuss the benefits of extending VRML by constraints and present a new way based on prototypes and scripting to implement this extension. Our approach is easy-t...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
SIGADA
2004
Springer
14 years 1 months ago
2004
Springer
Existing security models require that information of a given security level be prevented from “leaking” into lower-security information. High-security applications must be dem...
LPNMR
1990
Springer
13 years 11 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...