Sciweavers

382 search results - page 2 / 77
» Static Type-Inference for Trust in Distributed Information S...
Sort
View
ICFP
2004
ACM
14 years 5 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
SCAM
2005
IEEE
13 years 11 months ago
Static Analysis for Computing Escapability and Mutability for Java Components
A common theme in information security is protection of trusted software components against unauthorized access by untrusted users. In the context of distributed object technologi...
Aiwu Shi, Gleb Naumovich
DLS
2008
149views Languages» more  DLS 2008»
13 years 7 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
ICFP
2003
ACM
14 years 5 months ago
A static type system for JVM access control
This paper presents a static type system for JAVA Virtual Machine (JVM) code that enforces an access control mechanism similar to the one found, for example, in a JAVA implementat...
Tomoyuki Higuchi, Atsushi Ohori
TGC
2007
Springer
13 years 11 months ago
Access Control Based on Code Identity for Open Distributed Systems
In computing systems, trust is an expectation on the dynamic behavior of an agent; static analysis is a collection of techniques for establishing static bounds on the dynamic behav...
Andrew Cirillo, James Riely