Sciweavers

925 search results - page 14 / 185
» Typing Component-Based Communication Systems
Sort
View
CONCUR
2000
Springer
14 years 2 months ago
An Implicitly-Typed Deadlock-Free Process Calculus
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
Naoki Kobayashi, Shin Saito, Eijiro Sumii
ECOOP
2006
Springer
14 years 1 months ago
Session Types for Object-Oriented Languages
A session takes place between two parties; after establishing a connection, each party interleaves local computations and communications (sending or receiving) with the other. Ses...
Mariangiola Dezani-Ciancaglini, Dimitris Mostrous,...
IFIP
2010
Springer
13 years 4 months ago
Secrecy and Authenticity Types for Secure Distributed Messaging
Abstract. We introduce a calculus with mobile names, distributed principals and primitives for secure remote communication, without any reference to explicit cryptography. The calc...
Michele Bugliesi, Stefano Calzavara, Damiano Maced...
DEBS
2007
ACM
14 years 1 months ago
Concepts and models for typing events for event-based systems
Event-based systems are increasingly gaining widespread attention for applications that require integration with loosely coupled and distributed systems for time-critical business...
Szabolcs Rozsnyai, Josef Schiefer, Alexander Schat...
IFIP
2004
Springer
14 years 3 months ago
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Benjamin Wack