804 search results - page 25 / 161 » On the Termination of the Chase Algorithm |
100
click to vote
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
102
Voted
SAS
2010
Springer
14 years 10 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
84
Voted
ICWN
2003
15 years 1 months ago
2003
Wireless multi carrier approaches can support the simultaneous transmissions to several wireless terminals, each one getting only some of the available subcarriers. Judiciously ass...
199
Voted
POPL
2008
ACM
16 years 21 days ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
120
click to vote
COMCOM
2011
14 years 7 months ago
2011
The rapid proliferation of mobile computing devices and local wireless networks over the past few years has promoted a continuously growing interest in location-aware systems and ...