Our long-term research in process programming is based on the hypothesis that software processes can and should be captured accurately and formally, using executable formalisms to support execution, analysis, and understanding. Many process languages have been developed over the years for modeling processes formally. In this paper, we argue that for automated support, we need not a process mode...

In this paper, we present a framework that allows for testing and model checking of implicit-invocation systems. The framework includes a new programming language – the Implicit-Invocation Language (IIL), and a set of formal rule-based transformation tools that allow automatic generation of executable and formal verification artifacts. We provide details on the design of these formal rule-based...

With the growing size and complexity of software systems, software verification and validation (V&V) is becoming increasingly important. Model checking and testing are two of the main V&V methods. In this paper, we present a framework that allows for testing and formal modeling and analysis to be combined. More precisely, we describe a framework for model checking and testing implicit invocatio...

One of the main benefits of service-based systems is the loose coupling of components, which increases flexibility during the selection of internal and external business partners. However, currently this flexibility is severely limited by the fact that components have to provide not only the same functionality, but do so via virtually the same interface. Invocation-level mediation may be used t...

The ability to dynamically bind to Web services at runtime is becoming increasingly important as the era of Service-Oriented Computing (SOC) emerges. With SOC selection and invocation of Web service partners will occur in software at run-time, as opposed to by software developers at design and compile time. Unfortunately, the marketplace has yet to yield a predominate applications programming i...

We describe the hardware support in the DELFT-JAVA processor which enables efficient dynamic linking of JAVA programs. The proposed mechanism supports method invocation of dynamically linked classes through the use of a Link Translation Buffer (LTB). Since our Instruction Set Architecture directly supports dynamically linked method invocation, the Link Translation Buffer is architecturally tran...

In service composition environments, users and service entity hosts are always geometrically distributed. Therefore the performance of the service response might be poor when users invoke services that are physically far from them. Such issues are difficult to be solved with traditional caching technologies in the areas of contents delivery network because service providers do not always allow ...

Applications are regularly developed by composing functionality encapsulated in units of computation. Depending on the type of system these units of computation, components for short, include modules, classes, and programs. The functionality provided by components can be composed by procedural abstraction and implicit invocation (Garlan & Shaw, 1994; Dingel et al., 1998; Notkin et al., 1993). W...