338 search results - page 36 / 68 » On the Complexity of Termination Inference for Processes |
157
click to vote
ICDE
2007
IEEE
16 years 7 days ago
2007
IEEE
The correct implementation of security protocols is a challenging task. To achieve a high degree of confidence in an implementation, as with any software, ideally one requires bot...
162
click to vote
ICLP
2007
Springer
16 years 2 days ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
171
click to vote
ISSAC
2007
Springer
16 years 2 days ago
2007
Springer
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
172
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
176
click to vote
GLOBECOM
2009
IEEE
15 years 9 months ago
2009
IEEE
The wireless network scenario here is based on N users that communicate one with the others through a central relay node by adopting the Analog Network Coding (ANC) paradigm. In th...