Sciweavers

2558 search results - page 244 / 512
» Model Composition Contracts
Sort
View
CSL
1992
Springer
15 years 9 months ago
Communicating Evolving Algebras
We develop the rst steps of a theory of concurrency within the framework of evolving algebras of Gurevich, with the aim of investigating its suitability for the role of a general f...
Paola Glavan, Dean Rosenzweig
CSFW
2004
IEEE
15 years 8 months ago
Symmetric Encryption in a Simulatable Dolev-Yao Style Cryptographic Library
Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protocol environ...
Michael Backes, Birgit Pfitzmann
SCP
2011
228views Communications» more  SCP 2011»
15 years 5 hour ago
Channel-based coordination via constraint satisfaction
Coordination in Reo emerges from the composition of the behavioural constraints of primitives, such as channels, in a component connector. Understanding and implementing Reo, howe...
Dave Clarke, José Proença, Alexander...
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
16 years 5 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
ICWS
2008
IEEE
15 years 6 months ago
A Framework for Verifying SLA Compliance in Composed Services
Service level agreements (SLAs) impose many nonfunctional requirements on services. Business analysts specify and check these requirements in business process models using tools s...
Hua Xiao, Brian Chan, Ying Zou, Jay W. Benayon, Bi...