Sciweavers

584 search results - page 79 / 117
» Logic Programs as term Rewriting Systems
Sort
View
PPDP
2009
Springer
15 years 2 months ago
Context-based proofs of termination for typed delimited-control operators
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
Malgorzata Biernacka, Dariusz Biernacki
PLDI
2009
ACM
15 years 2 months ago
Flow-sensitive semantics for dynamic information flow policies
Dynamic information flow policies, such as declassification, are essential for practically useful information flow control systems. However, most systems proposed to date that ...
Niklas Broberg, David Sands
ICFP
2012
ACM
13 years 3 days ago
Introspective pushdown analysis of higher-order programs
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...
Christopher Earl, Ilya Sergey, Matthew Might, Davi...
ASPLOS
2006
ACM
15 years 3 months ago
Architectural support for software-based protection
Control-Flow Integrity (CFI) is a property that guarantees program control flow cannot be subverted by a malicious adversary, even if the adversary has complete control of data m...
Mihai Budiu, Úlfar Erlingsson, Martí...
82
Voted
ASPLOS
2008
ACM
14 years 11 months ago
The design and implementation of microdrivers
Device drivers commonly execute in the kernel to achieve high performance and easy access to kernel services. However, this comes at the price of decreased reliability and increas...
Vinod Ganapathy, Matthew J. Renzelmann, Arini Bala...