We propose a formalized method that allows to automatically derive an optimized implementation from the formal speciication of a protocol. Our method starts with the SDL speciication of a protocol stack. We rst derive a data and control ow dependence graph from each SDL process. Then, in order to perform cross-layer optimizations we combine the dependence graphs of diierent SDL processes. Next,...

in this paper, we use the concept of graph convergence of h(.,.)-co-accretive mapping introduced by [r. ahmad, m. akram, m. dilshad, graph convergence for the h(.,.)-co-accretive mapping with an application, bull. malays. math. sci. soc., doi: 10.1007/s40840-014-0103-z, 2014$] and define an over-relaxed proximal point method to obtain the solution of a generalized variational inclusion problem ...

We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes selectivity estimates for each relaxed XML query, using a natural generalization of the correlated subpath tree (CST) summary structure, and (2) carefully combines these estimates by analyzing the nature of overlap between the dif...