888 search results - page 77 / 178 » The Power of Temporal Proofs |
CSL
1999
Springer
15 years 2 months ago
1999
Springer
This paper gives the first proof that the subtyping relation of a higherorder lambda calculus, Fω ≤, is anti-symmetric, establishing in the process that the subtyping relation...
AAAI
2010
14 years 11 months ago
2010
Modern complete SAT solvers almost uniformly implement variations of the clause learning framework introduced by Grasp and Chaff. The success of these solvers has been theoretical...
DAGSTUHL
2007
14 years 11 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...
ENTCS
2006
14 years 10 months ago
2006
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
INFOCOM
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper investigates the properties of social choice functions that represent resource allocation strategies in interference coupled wireless systems. The allocated resources ca...