479 search results - page 49 / 96 » The theory and calculus of aliasing |
IANDC
2010
13 years 6 months ago
2010
The semantics of name-passing calculi is often defined employing coalgebraic models over presheaf categories. This elegant theory lacks finiteness properties, hence it is not ap...
ISOLA
2010
Springer
13 years 6 months ago
2010
Springer
According to the theory of Network Calculus based on the (min,+) algebra, analysis and measure of worst-case performance in communication networks can be made easily. In this conte...
JLP
2011
12 years 10 months ago
2011
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
MMB
2010
Springer
14 years 19 days ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
ASIAN
1998
Springer
14 years 2 days ago
1998
Springer
Chi calculus was proposed as a process algebra that has a uniform treatment of names. The paper carries out a systematic study of bisimilarities for chi processes. The notion of L-...