1410 search results - page 119 / 282 » Proving theorems by reuse |
154
click to vote
RTA
2010
Springer
15 years 4 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and...
161
click to vote
ISORC
2005
IEEE
15 years 11 months ago
2005
IEEE
Web Services emerge as a new paradigm for distributed computing. Model checking is an important verification method to ensure the trustworthiness of composite WS. abstraction and...
180
click to vote
JSC
2002
15 years 5 months ago
2002
We describe a framework of algebraic structures in the proof assistant Coq. We have developed this framework as part of the FTA project in Nijmegen, in which a constructive proof ...
173
click to vote
PIMRC
2010
IEEE
15 years 3 months ago
2010
IEEE
This paper concentrates on characterizing energy, latency and capacity trade-offs in multi-hop wireless ad-hoc networks. Therefore, a multiobjective framework is proposed to derive...
268
Voted
POPL
2007
ACM
16 years 6 months ago
2007
ACM
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...