7886 search results - page 1256 / 1578 » An evaluation of bipartitioning techniques |
191
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
182
click to vote
COMPSEC
2008
15 years 7 months ago
2008
While general-purpose processor based systems are built to enforce memory protection to prevent the unintended sharing of data between processes, current systems built around reco...
200
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
State of the art analyzers in the Logic Programming (LP) paradigm are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including terminat...
185
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Static analysis is a powerful technique for automatic verification of programs but raises major engineering challenges when developing a full-fledged analyzer for a reali...
189
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspecti...