Sciweavers

479 search results - page 69 / 96
» The theory and calculus of aliasing
Sort
View
IS
2006
13 years 7 months ago
Composition of Semantic Web services using Linear Logic theorem proving
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses a Semantic Web service language (DAML-S)...
Jinghai Rao, Peep Küngas, Mihhail Matskin
ENTCS
2002
101views more  ENTCS 2002»
13 years 7 months ago
A categorical framework for typing CCS-style process communication
Category theory has proved a useful tool in the study of type systems for sequential programming languages. Various approaches have been proposed to use categorical models to exam...
Ralf Schweimeier
JLP
2010
85views more  JLP 2010»
13 years 2 months ago
Synchronous Kleene algebra
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner's SCCS calculus. The resulting algebraic structure ...
Cristian Prisacariu
TON
2002
76views more  TON 2002»
13 years 7 months ago
Some properties of variable length packet shapers
The min-plus theory of greedy shapers has been developed after Cruz's results on the calculus of network delays. An example of greedy shaper is the buffered leaky bucket cont...
Jean-Yves Le Boudec
RTA
2009
Springer
14 years 2 months ago
YAPA: A Generic Tool for Computing Intruder Knowledge
Reasoning about the knowledge of an attacker is a necessary step in many formal analyses of security protocols. In the framework of the applied pi calculus, as in similar languages...
Mathieu Baudet, Véronique Cortier, St&eacut...