Research Publications
All | |
| Narrow your search | 314 result(s) |
By Type
By Year By Research Group | Web service composition (WSC) offers a range of solutions for rapid creation of complex applications by facilitating the composition of already existing concrete web services. One critical challenge in WSC is the dynamic selection of concrete services to ... Background: Cloud Computing is increasingly booming in industry with many competing providers and services. Accordingly, evaluation of commercial Cloud services is necessary. However, the existing evaluation studies are relatively chaotic. There exists ... Building on our published mechanisation of the probabilistic program logic pGCL we present a verified lattice scheduler, a standard covert-channel mitigation technique, employing randomisation as an elegant means of ensuring starvation-freeness. We show ... We develop program synthesis techniques that can help programmers fix concurrency-related bugs. We make two new contributions to synthesis for concurrency, the first improving the efficiency of the synthesized code, and the second improving the ... We investigate the complexity of temporal defeasible logic, and propose an efficient algorithm to compute the extension of any theory. The logic and algorithm are discussed in regard to modeling deadlines and normative retroactivity. In this paper we analyse different notions of the concept of goal starting from the idea of sequences of ``alternative acceptable outcomes''. We study the relationships between goals and concepts like agent's beliefs, norms and desires, and we propose ... This paper presents a new non-blocking skip list algorithm. The algorithm alleviates contention by localizing synchronization at the least contended part of the structure without altering consistency of the implemented abstraction. The key idea lies ... How many cloud resources does an application provider require to manage workload bursts that often accompany events like product announcements and sporting events, and when will these resources be required? How can one differentiate such bursts from ... We address the problem of computing accurate Worst-Case Execution Time (WCET) on pipelined architectures with caches. We propose a fully automatic and modular methodology based on program slicing and real-time model-checking. We have implemented our ... When deploying an application in a cloud, the choices of deployment are critical for determining the availability of applications. But choosing good deployment for various components into virtual machines is difficult because of potential sharing of ... |