IFIP
2004
Springer
13 years 11 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
IFIP
2004
Springer
13 years 11 months ago
2004
Springer
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...
IFIP
2004
Springer
13 years 11 months ago
2004
Springer
Abstract We introduce a generic framework for proof carrying code, developed and mechanically verified in Isabelle/HOL. The framework defines and proves sound a verification con...
IFIP
2004
Springer
13 years 11 months ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
IFIP
2004
Springer
13 years 11 months ago
2004
Springer
We study from an implementation viewpoint what constitutes a reasonable and effective notion of structural equivalence of terms in a calculus of concurrent processes and propose op...
IFIP
2004
Springer
13 years 11 months ago
2004
Springer
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
IFIP
2004
Springer
13 years 11 months ago
2004
Springer
Abstract The Firing Squad Synchronization Problem is one of the classical problems for cellular automata. In this paper we consider the case of more than one general. A synchronous...
IFIP
2004
Springer
13 years 11 months ago
2004
Springer
We introduce an extension of the Parikh mapping called the Parikh ¢ -matrix mapping, which takes its values in matrices with polynomial entries. The morphism constructed represent...
IFIP
2004
Springer
13 years 11 months ago
2004
Springer
Dependent type systems are promising tools programmers can use to increase the reliability and security of their programs. Unfortunately, dependently-typed programming languages re...
IFIP
2004
Springer
13 years 11 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...