From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions. | 0 | 0.34 | 2018 |
A Proof of Entropy Minimization for Outputs in Deletion Channels via Hidden Word Statistics. | 0 | 0.34 | 2018 |
Software and Malware Capabilities: Opinions on (Inter)national Security | 1 | 0.40 | 2017 |
The Automatic Detection of Token Structures and Invariants Using SAT Checking. | 0 | 0.34 | 2017 |
Detecting Failed Attacks on Human-Interactive Security Protocols. | 0 | 0.34 | 2016 |
Detecting Failed Attacks on Human-Interactive Security Protocols (Transcript of Discussion). | 0 | 0.34 | 2016 |
Card games as pointer structures: case studies in mobile CSP modelling. | 0 | 0.34 | 2016 |
Computing maximal weak and other bisimulations. | 0 | 0.34 | 2016 |
Reducing Complex CSP Models to Traces via Priority. | 0 | 0.34 | 2016 |
The Expressiveness of CSP With Priority | 2 | 0.42 | 2015 |
Information Leakage due to Revealing Randomly Selected Bits | 1 | 0.35 | 2015 |
Computing Maximal Bisimulations. | 3 | 0.42 | 2014 |
A Static Analysis Framework for Livelock Freedom in CSP | 0 | 0.34 | 2013 |
Seminar on Concurrency, Carnegie-Mellon University, Pittsburg, PA, USA, July 9-11, 1984 | 24 | 21.27 | 1985 |