804 search results - page 28 / 161 » On the Termination of the Chase Algorithm |
94
Voted
DC
1998
15 years 2 days ago
1998
We show that the problem of predicate detection in distributed systems is NP-complete. In the past, efficient algorithms have been developed for special classes of predicates suc...
96
Voted
CONCUR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
99
Voted
MVA
2007
15 years 1 months ago
2007
It is very important to guarantee the quality of the industrial products by means of visual inspection. In order to reduce the soldering defect with terminal deformation and termi...
116
Voted
SODA
2001
ACM
15 years 1 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
102
Voted
DAC
2006
ACM
16 years 1 months ago
2006
ACM
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...