523 search results - page 58 / 105 » On the Power of Quantum Proofs |
DAGSTUHL
2007
15 years 1 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...
114
click to vote
ENTCS
2006
14 years 12 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...
102
click to vote
INFOCOM
2010
IEEE
14 years 9 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...
109
click to vote
RTA
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
116
click to vote
COMPSAC
2009
IEEE
15 years 28 days ago
2009
IEEE
Modular certification of low-level intermediate representation (IR) programs is one of the key steps of proof-transforming compilation. The major challenges are lexity of abstract ...