171 search results - page 26 / 35 » CoSP: a general framework for computational soundness proofs |
143
click to vote
LICS
2003
IEEE
15 years 11 months ago
2003
IEEE
We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended with so-call...
147
click to vote
LICS
2009
IEEE
16 years 21 days ago
2009
IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
172
click to vote
JSC
2010
15 years 25 days ago
2010
Both Sequence and Context Unification generalize the same problem: Word Unification. Besides that, Sequence Unification solves equations between unranked terms involving sequence ...
188
click to vote
WWW
2004
ACM
16 years 6 months ago
2004
ACM
Security remains a major roadblock to universal acceptance of the Web for many kinds of transactions, especially since the recent sharp increase in remotely exploitable vulnerabil...
206
click to vote
HASKELL
2009
ACM
16 years 17 days ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...