RTA
2007
Springer
15 years 10 months ago
2007
Springer
118
click to vote
RTA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We give a simple and direct proof that super-consistency implies cut elimination in deduction modulo. This proof can be seen as a simplification of the proof that super-...
157
click to vote
RTA
2007
Springer
15 years 10 months ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
127
click to vote
RTA
2007
Springer
15 years 10 months ago
2007
Springer
We present the Tom language that extends Java with the purpose of providing high level constructs inspired by the rewriting community. Tom furnishes a bridge between a general purp...
109
click to vote
RTA
2007
Springer
15 years 10 months ago
2007
Springer
In the analysis of cryptographic protocols, a treacherous set of terms is one from which an intruder can get access to what was intended to be secret, by adding on to the top of a ...
124
click to vote
ICTCS
2007
Springer
15 years 10 months ago
2007
Springer
ing from Prioritized/Weighted Internal Immediate Actions Marco Bernardo and Alessandro Aldini Universit`a di Urbino “Carlo Bo” – Italy Markovian process calculi constitute a ...
127
click to vote
ICTCS
2007
Springer
15 years 10 months ago
2007
Springer
The information flow property of Non-Interference was recently relaxed into Abstract NonInterference (ANI), a weakened version where attackers can only observe properties of data,...