238 search results - page 10 / 48 » Compositional Proof Methods for Concurrency: A Semantic Appr... |
124
Voted
ICWS
2004
IEEE
14 years 11 months ago
2004
IEEE
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses Semantic Web service language (DAML-S) f...
106
click to vote
ESOP
1999
Springer
15 years 1 months ago
1999
Springer
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...
SAC
2005
ACM
15 years 3 months ago
2005
ACM
Finding rapidly suitable experts in an organization to compose a team able to solve specific tasks is a typical problem in large consulting firms. In this paper we present a Des...
SIGSOFT
2008
ACM
15 years 10 months ago
2008
ACM
We propose a novel method for modular verification of web service compositions. We first use symbolic fixpoint computations to derive conditions on the incoming messages and relat...
SIGSOFT
2002
ACM
15 years 10 months ago
2002
ACM
We propose a unifying framework for model-based specification notations. Our framework captures the execution semantics that are common among model-based notations, and leaves the...