Sciweavers

IFIP
2010
Springer
13 years 6 months ago
A Calculus for the Analysis of Wireless Network Security Protocols
We propose a timed broadcasting calculus for wireless systems. The operational semantics of our calculus is given both in terms of a Reduction Semantics and in terms of a Labelled ...
Francesco Ballardin, Massimo Merro
ACTA
2010
87views more  ACTA 2010»
13 years 11 months ago
On the observational theory of the CPS-calculus
We study the observational theory of Thielecke's CPS-calculus, a distillation of the target language of Continuation-Passing Style transforms. We define a labelled transition...
Massimo Merro
LICS
2000
IEEE
14 years 3 months ago
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names
Concurrent ML is an extension of Standard ML with π-calculus-like primitives for multi-threaded programming. CML has a reduction semantics, but to date there has been no labelled...
Alan Jeffrey, Julian Rathke
LICS
2000
IEEE
14 years 3 months ago
Models for Name-Passing Processes: Interleaving and Causal
We study syntax-free models for name-passing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support t...
Gian Luca Cattani, Peter Sewell
SIGSOFT
2001
ACM
15 years 5 days ago
Detecting implied scenarios in message sequence chart specifications
Scenario-based specifications such as Message Sequence Charts (MSCs) are becoming increasingly popular as part of a requirements specification. Scenarios describe how system compo...
Jeff Kramer, Jeff Magee, Sebastián Uchitel