ENTCS
2007
13 years 5 months ago
2007
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation ...
ENTCS
2007
13 years 5 months ago
2007
We use the ρ-calculus as an intermediate language to compile functional languages with pattern-matching features, and give an interaction net encoding of the ρ-terms arising fro...
ENTCS
2007
13 years 5 months ago
2007
Due to increasing demands in processing power on the one hand, but the physical limit on CPU clock speed on the other hand, multi-threaded programming is becoming more important i...
ENTCS
2007
13 years 5 months ago
2007
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
ENTCS
2007
13 years 5 months ago
2007
ENTCS
2007
13 years 5 months ago
2007
We describe a modular programming style that harnesses modern type systems to verify safety conditions in practical systems. This style has three ingredients: (i) A compact kernel...
ENTCS
2007
13 years 5 months ago
2007
In this paper I present a game model for the semantical analysis of handshake circuits. I show how the model captures effectively the composition of circuits in an associative wa...
ENTCS
2007
13 years 5 months ago
2007
In this paper we propose a formalization of access control policies based on term rewriting. The state of the system to which policies are enforced is represented as an algebraic ...
ENTCS
2007
13 years 5 months ago
2007
In this paper we present our rst approach to model and verify biological systems using ntcc, a concurrent constraint process calculus. We argue that the partial information const...
ENTCS
2007
13 years 5 months ago
2007
The use of process calculi to represent biological systems has led to the design of different formalisms such as brane calculi and κ-calculus. Both have proved to be useful to m...