Sciweavers

2257 search results - page 261 / 452
» Secure program partitioning
Sort
View
EACL
2009
ACL Anthology
13 years 8 months ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud
POPL
2007
ACM
14 years 10 months ago
Types, bytes, and separation logic
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
Harvey Tuch, Gerwin Klein, Michael Norrish
OOPSLA
2004
Springer
14 years 3 months ago
Modular generics
This paper presents the design of G, a new language specifically created for generic programming. We review and identify important language features of C++ and Haskell in light o...
Jeremy G. Siek
TLDI
2003
ACM
14 years 3 months ago
The logical approach to stack typing
We develop a logic for reasoning about adjacency and separation of memory blocks, as well as aliasing of pointers. We provide a memory model for our logic and present a sound set ...
Amal J. Ahmed, David Walker
ECOOP
2000
Springer
14 years 2 months ago
Runtime Support for Type-Safe Dynamic Java Classes
Modern software must evolve in response to changing conditions. In the most widely used programming environments, code is static and cannot change at runtime. This poses problems ...
Scott Malabarba, Raju Pandey, Jeff Gragg, Earl T. ...