Sciweavers

JLP
2011
106views more  JLP 2011»
12 years 9 months ago
Concurrent Kleene Algebra and its Foundations
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
Tony Hoare, Bernhard Möller, Georg Struth, Ia...
JLP
2011
160views more  JLP 2011»
13 years 1 months ago
Axiomatizability of representable domain algebras
The family of domain algebras provide an elegant formal system for automated reasoning about programme verification. Their primary models are algebras of relations, viz. represen...
Robin Hirsch, Szabolcs Mikulás
JLP
2011
155views more  JLP 2011»
13 years 1 months ago
QoS negotiation in service composition
Service composition in Service Oriented Computing concerns not only integration of heterogeneous distributed applications but also dynamic selection of services. Quality of Servic...
Maria Grazia Buscemi, Ugo Montanari
JLP
2011
94views more  JLP 2011»
13 years 1 months ago
Permission to speak: A logic for access control and conformance
Formal languages for policy have been developed for access control and conformance checking. In this paper, we describe a formalism that combines features that have been developed...
Nikhil Dinesh, Aravind K. Joshi, Insup Lee, Oleg S...