Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ICTCS
2003
Springer
11 years 11 months ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
ICTCS
2003
Springer
11 years 11 months ago
Compositional Verification of Secure Streamed Data: A Case Study with EMSS
Fabio Martinelli, Marinella Petrocchi, Anna Vaccar...
ICTCS
2003
Springer
11 years 11 months ago
Cost Constrained Fixed Job Scheduling
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
Qiwei Huang, Errol L. Lloyd
ICTCS
2003
Springer
11 years 11 months ago
Algebraic Theories for Contextual Pre-nets
The algebraic models of computation for contextual nets that have been proposed in the literature either rely on a non-free monoid of objects, or introduce too many fictitious beh...
Roberto Bruni, José Meseguer, Ugo Montanari...
ICTCS
2003
Springer
11 years 11 months ago
Channel Assignment in Honeycomb Networks
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
ICTCS
2003
Springer
11 years 11 months ago
Security-Aware Program Transformations
Massimo Bartoletti, Pierpaolo Degano, Gian Luigi F...
ICTCS
2003
Springer
11 years 11 months ago
A Calculus for Dynamic Linking
We define a calculus for modeling dynamic linking independently of the details of a particular programming environment. The calculus distinguishes at the language level the notion...
Davide Ancona, Sonia Fagorzi, Elena Zucca
books