Sciweavers

1875 search results - page 217 / 375
» A Calculus of Broadcasting Systems
Sort
View
76
Voted
ENTCS
2000
59views more  ENTCS 2000»
15 years 18 days ago
Building continuous webbed models for system F
We present here a large family of concrete models for Girard and Reynolds polymorphism (System F), in a non categorical setting. The family generalizes the construction of the mod...
Stefano Berardi, Chantal Berline
110
Voted
FOSSACS
2009
Springer
15 years 7 months ago
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
Christopher Broadbent, C.-H. Luke Ong
CSFW
2008
IEEE
15 years 7 months ago
Language Based Secure Communication
Secure communication in distributed systems is notoriously hard to achieve due to the variety of attacks an adversary can mount, based on message interception, modification, redi...
Michele Bugliesi, Riccardo Focardi
IAT
2007
IEEE
15 years 7 months ago
Automatically Costed Autonomous Mobility
To share resources in open distributed systems we have developed autonomous mobile programs, which periodically use a cost model to decide where to execute in a network. In additi...
Xiao Yan Deng, Greg Michaelson, Philip W. Trinder
97
Voted
LICS
2007
IEEE
15 years 7 months ago
Strong Normalization as Safe Interaction
When enriching the λ-calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (∨ E) of union typ...
Colin Riba