Sciweavers

128 search results - page 16 / 26
» Ensuring Termination by Typability
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
13 years 7 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening
FUIN
2006
81views more  FUIN 2006»
13 years 7 months ago
Redundant Call Elimination via Tupling
Redundant call elimination has been an important program optimisation process as it can produce super-linear speedup in optimised programs. In this paper, we investigate use of the...
Wei-Ngan Chin, Siau-Cheng Khoo, Neil Jones
CORR
2002
Springer
93views Education» more  CORR 2002»
13 years 7 months ago
Logic program specialisation through partial deduction: Control issues
Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programm...
Michael Leuschel, Maurice Bruynooghe
PVLDB
2010
114views more  PVLDB 2010»
13 years 5 months ago
Peer coordination through distributed triggers
This is a demonstration of data coordination in a peer data management system through the employment of distributed triggers. The latter express in a declarative manner individual...
Verena Kantere, Maher Manoubi, Iluju Kiringa, Timo...
INFOCOM
2012
IEEE
11 years 10 months ago
RxIP: Monitoring the health of home wireless networks
Abstract—Deploying home access points (AP) is hard. Untrained users typically purchase, install, and configure a home AP with very little awareness of wireless signal coverage a...
Justin Manweiler, Peter Franklin, Romit Roy Choudh...