Sciweavers

Share
RTA
2011
Springer
8 years 9 months ago
Maximal Completion
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
Dominik Klein, Nao Hirokawa
FOSSACS
2006
Springer
9 years 10 months ago
Processes for Adhesive Rewriting Systems
Abstract. Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, includ...
Paolo Baldan, Andrea Corradini, Tobias Heindel, Ba...
CCS
2005
ACM
10 years 15 days ago
Deciding security of protocols against off-line guessing attacks
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Mathieu Baudet
FCT
2007
Springer
10 years 1 months ago
Rewriting Systems with Data
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Miha...
books