100
Voted
RTA
15 years 7 months ago
2009 Springer 
Abstract. The automated analysis of termination of term rewriting systems (TRSs) has drawn a lot of attention in the scientific community during the last decades and many differe...
RTA
15 years 7 months ago
2009 Springer 
Reasoning about the knowledge of an attacker is a necessary step in many formal analyses of security protocols. In the framework of the applied pi calculus, as in similar languages...
108
Voted
RTA
15 years 7 months ago
2009 Springer 
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...
RTA
15 years 7 months ago
2009 Springer
Abstract. We consider the problem of deciding the security of cryptographic protocols for a bounded number of sessions, taking into account some algebraic properties of the securit...
105
Voted
RTA
15 years 7 months ago
2009 Springer
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
|
Theoretical Computer Science