Sciweavers

FOSSACS
2006
Springer
13 years 8 months ago
Guessing Attacks and the Computational Soundness of Static Equivalence
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
Martín Abadi, Mathieu Baudet, Bogdan Warins...
FOSSACS
2006
Springer
13 years 8 months ago
Undecidability Results for Bisimilarity on Prefix Rewrite Systems
Abstract. We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on words. Stirling (1996, 1998) proved the de...
Petr Jancar, Jirí Srba