258 search results - page 21 / 52 » Weak Bisimulation Approximants |
118
click to vote
ESOP
2005
Springer
15 years 5 months ago
2005
Springer
The notion of control dependence underlies many program analysis and transformation techniques used in numerous applications. Despite wide application, existing definitions and ap...
102
click to vote
CCS
2006
ACM
15 years 3 months ago
2006
ACM
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
103
click to vote
TAPSOFT
1991
Springer
15 years 3 months ago
1991
Springer
Abstract. CBS is a simple and natural CCS-like calculus where processes speak one at a time and are heard instantaneously by all others. Speech is autonomous, contention between sp...
IANDC
2006
14 years 11 months ago
2006
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
TCS
2008
14 years 11 months ago
2008
The object of this paper is to appreciate the computational limits inherent in the combinatorics of an applied concurrent (aka agent-based) language . That language is primarily m...