Sciweavers

2000 search results - page 320 / 400
» Program Transformation and Proof Transformation
Sort
View
134
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
Bounding the power rate function of wireless ad hoc networks
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...
Yunnan Wu, Qian Zhang, Wenwu Zhu, Sun-Yuan Kung
161
Voted
ICALP
1993
Springer
15 years 7 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
CAV
2008
Springer
122views Hardware» more  CAV 2008»
15 years 5 months ago
Thread Quantification for Concurrent Shape Analysis
In this paper we address the problem of shape analysis for concurrent programs. We present new algorithms, based on abstract interpretation, for automatically verifying properties ...
Josh Berdine, Tal Lev-Ami, Roman Manevich, G. Rama...
157
Voted
EUROPAR
2010
Springer
15 years 3 months ago
Optimized On-Chip-Pipelined Mergesort on the Cell/B.E
Abstract. Limited bandwidth to off-chip main memory is a performance bottleneck in chip multiprocessors for streaming computations, such as Cell/B.E., and this will become even mor...
Rikard Hultén, Christoph W. Kessler, Jö...
153
Voted
OOPSLA
2010
Springer
15 years 1 months ago
The Spoofax language workbench
Domain-specific languages offer high expressive power foa particular problem domain, abstracting over the accidental complexity associated with traditional software development. ...
Lennart C. L. Kats, Eelco Visser