123 search results - page 21 / 25 » ifip 2004 |
156
click to vote
IFIP
2004
Springer
15 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...
145
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
We analyze an algebraic representation of AES–128 as an embedding in BES, due to Murphy and Robshaw. We present two systems of equations S and K concerning encryption and key gen...
175
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
149
click to vote
IFIP
2004
Springer
15 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...
161
click to vote
IFIP
2004
Springer
15 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...