12774 search results - page 384 / 2555 » A Framework for Proof Systems |
199
click to vote
ESOP
2008
Springer
15 years 8 months ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
159
click to vote
ESORICS
2008
Springer
15 years 8 months ago
2008
Springer
In authorization, there is often a wish to shift the burden of proof to those making requests, since they may have more resources and more specific knowledge to construct the requi...
168
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...
171
click to vote
FMOODS
2008
15 years 8 months ago
2008
This paper proposes a semantics-based automatic null pointer analysis for inferring non-null annotations of fields in objectoriented programs. The analysis is formulated for a mini...
163
click to vote
IJCAI
2003
15 years 8 months ago
2003
Efficient implementations of DPLL with the addition of clause learning are the fastest complete satisfiability solvers and can handle many significant real-world problems, such as...