590 search results - page 84 / 118 » Non-Failure Analysis for Logic Programs |
IFIP
2010
Springer
13 years 3 months ago
2010
Springer
In the last years several attempts to define identity-related properties such as identifiability, pseudonymity and anonymity have been made to analyze the privacy offered by inform...
POPL
2012
ACM
12 years 4 months ago
2012
ACM
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
POPL
2010
ACM
13 years 9 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
EMSOFT
2007
Springer
14 years 3 months ago
2007
Springer
This paper describes techniques to estimate the worst case execution time of executable code on architectures with data caches. The underlying mechanism is Abstract Interpretation...
ENTCS
2007
13 years 8 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...