Sciweavers

Share
POST
2014

A Reduced Semantics for Deciding Trace Equivalence Using Constraint Systems

6 years 1 months ago
A Reduced Semantics for Deciding Trace Equivalence Using Constraint Systems
Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be decided for interesting classes of finite processes (i.e., without replication) by means of symbolic execution and constraint solving. However, this does not suffice to obtain practical tools. Current prototypes suffer from a classical combinatorial explosion problem caused by the exploration of many interleavings in the behaviour of processes. M¨odersheim et al. [17] have tackled this problem for reachability properties using partial order reduction techniques. We revisit their work, generalize it and adapt it for equivalence checking. We obtain an optimization in the form of a reduced symbolic semantics that eliminates redundant interleavings on the fly.
David Baelde, Stéphanie Delaune, Lucca Hirsch
Added 27 Apr 2014
Updated 27 Apr 2014
Type Journal
Year 2014
Where POST
Authors David Baelde, Stéphanie Delaune, Lucca Hirschi
Comments (0)
books