1894 search results - page 160 / 379 » A TLA Proof System |
129
click to vote
DAGSTUHL
2007
15 years 5 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...
133
Voted
FMOODS
2008
15 years 5 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...
121
Voted
IJCAI
2003
15 years 5 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...
184
Voted
FBT
2000
15 years 5 months ago
2000
The behavior of reactive systems can be described by their black box properties as a relation between input and output streams. More operational is the behavior's description...
110
click to vote
IGPL
2008
15 years 4 months ago
2008
In this paper we explore a generalization of traditional abduction which can simultaneously perform two different tasks: (i) given an unprovable sequent G, find a sentence H such ...