85 search results - page 1 / 17 » Decidability of Trajectory-Based Equations |
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
We consider the decidability of existence of solutions to language equations involving the operations of shuffle and deletion along trajectories. These operations generalize the o...
FROCOS
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
CSFW
2005
IEEE
13 years 10 months ago
2005
IEEE
In the analysis of security protocols, the knowledge of attackers is often described in terms of message deducibility and indistinguishability relations. In this paper, we pursue ...
LPAR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...