13383 search results - page 2267 / 2677 » Abstractions from proofs |
150
click to vote
WRLA
2010
15 years 3 months ago
2010
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...
200
click to vote
CC
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
177
Voted
ADAEUROPE
2010
Springer
15 years 2 months ago
2010
Springer
Abstract: This paper proposes a strategy to manage the schedulability of realtime component-based applications that is fully compatible with the concept of component viewed as a re...
178
click to vote
ANTSW
2010
Springer
15 years 2 months ago
2010
Springer
robotics, the agents are often assumed to be identical. In this abstract, we argue that the cooperation between swarms of different kinds of robots can enhance the capabilities of ...
136
click to vote
ASPDAC
2010
ACM
15 years 2 months ago
2010
ACM
- The design of embedded computing systems faces a serious productivity gap due to the increasing complexity of their hardware and software components. One solution to address this...