Sciweavers

633 search results - page 67 / 127
» Locality and Hard SAT-Instances
Sort
View
ICFP
2004
ACM
14 years 10 months ago
Verification of safety properties for concurrent assembly code
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
Dachuan Yu, Zhong Shao
PERCOM
2007
ACM
14 years 9 months ago
A Scalable Geographic Service Provision Framework for Mobile Ad Hoc Networks
Supporting scalable and efficient routing and service provision in Mobile Ad Hoc Networks (MANET) has been a big research challenge. Conventional topology-based unicast and multic...
Xiaojing Xiang, Xin Wang
CASES
2003
ACM
14 years 3 months ago
Clustered calculation of worst-case execution times
Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the po...
Andreas Ermedahl, Friedhelm Stappert, Jakob Engblo...
ICFP
1999
ACM
14 years 2 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil
LISA
2004
13 years 11 months ago
LifeBoat: An Autonomic Backup and Restore Solution
We present an innovative backup and restore solution, called LifeBoat, for Windows machines. Our solution provides for local and remote backups and ``bare metal'' restor...
Ted Bonkenburg, Dejan Diklic, Benjamin Reed, Mark ...