Sciweavers

240 search results - page 14 / 48
» A Typed Calculus of Synchronous Processes
Sort
View
POPL
1999
ACM
14 years 1 months ago
Type-Safe Linking and Modular Assembly Language
Linking is a low-level task that is usually vaguely specified, if at all, by language definitions. However, the security of web browsers and other extensible systems depends cru...
Neal Glew, J. Gregory Morrisett
IFIP
2004
Springer
14 years 2 months ago
Pattern-Matching Spi-Calculus
Cryptographic protocols often make use of nested cryptographic primitives, for example signed message digests, or encrypted signed messages. Gordon and Jeffrey’s prior work on ty...
Christian Haack, Alan Jeffrey
ACTA
2005
90views more  ACTA 2005»
13 years 9 months ago
MOMI: a calculus for mobile mixins
MoMi (Mobile Mixins) is a coordination language for mobile processes that communicate and exchange object-oriented code in a distributed context. MoMi's key idea is structuri...
Lorenzo Bettini, Betti Venneri, Viviana Bono
FOSSACS
2006
Springer
14 years 22 days ago
Smooth Orchestrators
A smooth orchestrator is a process with several alternative branches, every one defining synchronizations among co-located channels. Smooth orchestrators constitute a basic mechani...
Cosimo Laneve, Luca Padovani
FSEN
2009
Springer
14 years 3 months ago
Termination in Higher-Order Concurrent Calculi
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...