Sciweavers

ENTCS
2007
121views more  ENTCS 2007»
14 years 12 days ago
An Account of Implementing Applicative Term Rewriting
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation ...
Muck van Weerdenburg
ENTCS
2007
101views more  ENTCS 2007»
14 years 12 days ago
From Functional Programs to Interaction Nets via the Rewriting Calculus
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...
Horatiu Cirstea, Germain Faure, Maribel Fern&aacut...
ENTCS
2007
79views more  ENTCS 2007»
14 years 12 days ago
Fault Detection in Multi-Threaded C++ Server Applications
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...
Arndt Mühlenfeld, Franz Wotawa
ENTCS
2007
102views more  ENTCS 2007»
14 years 12 days ago
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
Brigitte Pientka
ENTCS
2007
84views more  ENTCS 2007»
14 years 12 days ago
Preface and Foreword
Byron Cook, Roberto Sebastiani
ENTCS
2007
100views more  ENTCS 2007»
14 years 12 days ago
Lightweight Static Capabilities
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...
Oleg Kiselyov, Chung-chieh Shan
ENTCS
2007
95views more  ENTCS 2007»
14 years 12 days ago
Handshake Games
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...
Luca Fossati
ENTCS
2007
128views more  ENTCS 2007»
14 years 12 days ago
Rewriting-Based Access Control Policies
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 ...
Anderson Santana de Oliveira
ENTCS
2007
91views more  ENTCS 2007»
14 years 12 days ago
Timed Concurrent Constraint Programming for Analysing Biological Systems
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...
Julian Gutierrez, Jorge A. Pérez, Camilo Ru...
ENTCS
2007
82views more  ENTCS 2007»
14 years 12 days ago
A Simple Calculus for Proteins and Cells
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...
Cosimo Laneve, Fabien Tarissan