129
click to vote
RTA
2007
Springer
15 years 11 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-...
166
click to vote
RTA
2007
Springer
15 years 11 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...
135
click to vote
RTA
2007
Springer
15 years 11 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...
116
click to vote
RTA
2007
Springer
15 years 11 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 ...