204 search results - page 19 / 41 » A Half-Million Strong at Least |
ICTAC
2004
Springer
15 years 3 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
190
Voted
POPL
2006
ACM
15 years 10 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
WINE
2007
Springer
15 years 3 months ago
2007
Springer
A function is non-cooperative computable [NCC] if honest agents can compute it by reporting truthfully their private inputs, while unilateral deviations by the players are not bene...
POS
1994
Springer
15 years 1 months ago
1994
Springer
We consider some issues in optimizing persistent programming languages. In particular, we show how to express optimizations of object residency checks in strongly typed persistent...
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
Many tracking methods face a fundamental dilemma in practice: tracking has to be computationally efficient but verifying if or not the tracker is following the true target tends t...