Sciweavers

80 search results - page 3 / 16
» Behavioral and Coinductive Rewriting
Sort
View
ENTCS
2000
114views more  ENTCS 2000»
13 years 7 months ago
Syntactic Type Soundness for the Region Calculus
The region calculus of Tofte and Talpin is an annotated polymorphically typed lambda calculus which makes memory allocation and deallocation explicit. It is intended as an interme...
Simon Helsen, Peter Thiemann
FUIN
2008
88views more  FUIN 2008»
13 years 7 months ago
Validating Behavioral Component Interfaces in Rewriting Logic
Many distributed applications can be understood in terms of components interacting in an open environment such as the Internet. Open environments are subject to change in unpredic...
Einar Broch Johnsen, Olaf Owe, Arild B. Torjusen
CSFW
2008
IEEE
14 years 1 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
TACS
2001
Springer
13 years 11 months ago
A Spatial Logic for Concurrency
We present a logic that can express properties of freshness, secrecy, structure, and behavior of concurrent systems. In addition to standard logical and temporal operators, our lo...
Luís Caires, Luca Cardelli
WADT
1997
Springer
13 years 11 months ago
An inductive view of graph transformation
The dynamic behavior of rule-based systems (like term rewriting systems 24], process algebras 27], and so on) can be traditionally determined in two orthogonal ways. Either operati...
Fabio Gadducci, Reiko Heckel