-
Chapter and Conference Paper
Building Dynamic Models of Service Compositions with Simulation of Provision Resources
Efficient and competitive provision of service compositions depends both on the composition structure, and on planning and management of computational resources necessary for provision. Resource constraints on...
-
Chapter
Analytical Quality Assurance
As we described in Chapter 1, Services are often provisioned within short-term, volatile and highly dynamic (business) processes. These processes are designed in an abstract manner and when instantiated can in...
-
Chapter and Conference Paper
Automatic Fragment Identification in Workflows Based on Sharing Analysis
In Service-Oriented Computing (SOC), fragmentation and merging of workflows are motivated by a number of concerns, among which we can cite design issues, performance, and privacy. Fragmentation emphasizes the ...
-
Chapter and Conference Paper
An Initial Proposal for Data-Aware Resource Analysis of Orchestrations with Applications to Predictive Monitoring
Several activities in service oriented computing can benefit from knowing ahead of time future properties of a given service composition. In this paper we focus on how statically inferred computational cost fu...
-
Chapter
Modeling and Negotiating Service Quality
In this chapter the research problems of specifying and negotiating QoS and its corresponding quality documents are analyzed. For this reason, this chapter is separated into two main sections, Section 6.1 and ...
-
Chapter and Conference Paper
A Tabling Implementation Based on Variables with Multiple Bindings
Suspension-based tabling systems have to save and restore computation states belonging to OR branches. Stack freezing combined with (forward) trailing is among the better-known implementation approaches for th...
-
Chapter and Conference Paper
Modeling Concurrent Systems with Shared Resources
Testing is the more widely used approach to (partial) system validation in industry. The introduction of concurrency makes exhaustive testing extremely costly or just impossible, requiring shifting to formal v...
-
Chapter and Conference Paper
Towards a Complete Scheme for Tabled Execution Based on Program Transformation
The advantages of tabled evaluation regarding program termination and reduction of complexity are well known —as are the significant implementation, portability, and maintenance efforts that some proposals (es...
-
Chapter and Conference Paper
A Sketch of a Complete Scheme for Tabled Execution Based on Program Transformation
Tabled evaluation has proved to be an effective method to improve several aspects of goal-oriented query evaluation, including termination and complexity. “Native” implementations of tabled evaluation offer go...
-
Chapter and Conference Paper
Automatic Coding Rule Conformance Checking Using Logic Programming
An extended practice in the realm of Software Engineering and programming in industry is the application of coding rules. Coding rules are customarily used to constrain the use (or abuse) of certain programming l...
-
Chapter and Conference Paper
Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
We present two new algorithms which perform automatic parallelization via source-to-source transformations. The objective is to exploit goal-level, unrestricted independent and-parallelism. The proposed algorithm...
-
Chapter and Conference Paper
A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
The growing popularity of multicore architectures has renewed interest in language-based approaches to the exploitation of parallelism. Logic programming has proved an interesting framework to this end, and th...
-
Chapter and Conference Paper
Sound Multi-party Business Protocols for Service Networks
Service networks comprise large numbers of long-running, highly dynamic complex end-to-end service interactions reflecting asynchronous message flows that typically transcend several organizations and span sev...
-
Chapter and Conference Paper
An Improved Continuation Call-Based Implementation of Tabling
Tabled evaluation has been proved an effective method to improve several aspects of goal-oriented query evaluation, including termination and complexity. Several “native” implementations of tabled evaluation h...
-
Chapter and Conference Paper
Towards a High-Level Implementation of Execution Primitives for Unrestricted, Independent And-Parallelism
Most efficient implementations of parallel logic programming rely on complex low-level machinery which is arguably difficult to implement and modify. We explore an alternative approach aimed at taming that com...
-
Chapter
An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy
We describe some of the novel aspects and motivations behind the design and implementation of the Ciao multiparadigm programming system. An important aspect of Ciao is that it provides the programmer with a la...
-
Chapter and Conference Paper
Combining Static Analysis and Profiling for Estimating Execution Times
Effective static analyses have been proposed which infer bounds on the number of resolutions. These have the advantage of being independent from the platform on which the programs are executed and have been sh...
-
Chapter and Conference Paper
Towards Description and Optimization of Abstract Machines in an Extension of Prolog
Competitive abstract machines for Prolog are usually large, intricate, and incorporate sophisticated optimizations. This makes them difficult to code, optimize, and, especially, maintain and extend. This is pa...
-
Chapter and Conference Paper
Using Combined Static Analysis and Profiling for Logic Program Execution Time Estimation
Predicting statically the running time of programs has many applications ranging from task scheduling in parallel execution to proving the ability of a program to meet strict time constraints. A starting point...
-
Chapter and Conference Paper
A Generator of Efficient Abstract Machine Implementations and Its Application to Emulator Minimization
The implementation of abstract machines involves complex decisions regarding, e.g., data representation, opcodes, or instruction specialization levels, all of which affect the final performance of the emulator...
