| Concurrent and Real-time systems S Schneider The CSP approach, 2000 | 735 | 2000 |
| The modelling and analysis of security protocols: the CSP approach P Ryan, S Schneider, M Goldsmith, G Lowe, B Roscoe Addison-Wesley Professional, 2001 | 661 | 2001 |
| A practical voter-verifiable election scheme D Chaum, PYA Ryan, S Schneider European Symposium on Research in Computer Security, 118-139, 2005 | 415 | 2005 |
| Verifying authentication protocols with CSP S Schneider Computer Security Foundations Workshop, 1997. Proceedings., 10th, 3-17, 1997 | 406 | 1997 |
| The B-method: An introduction S Schneider Palgrave, 2001 | 311 | 2001 |
| Security properties and CSP SA Schneider Proceedings of the 1996 IEEE Symposium on Security and Privacy, 174-187, 1996 | 311 | 1996 |
| How to prevent type flaw attacks on security protocols J Heather, G Lowe, S Schneider Journal of computer Security 11 (2), 217-244, 2003 | 284 | 2003 |
| Process algebra and non-interference PYA Ryan, SA Schneider Journal of Computer Security 9 (1-2), 75-103, 2001 | 277 | 2001 |
| CSP and anonymity S Schneider, A Sidiropoulos European Symposium on Research in Computer Security, 198-218, 1996 | 244 | 1996 |
| An operational semantics for timed CSP S Schneider Information and computation 116 (2), 193-213, 1995 | 237 | 1995 |
| A brief history of Timed CSP J Davies, S Schneider Theoretical Computer Science 138 (2), 243-271, 1995 | 229 | 1995 |
| Formal analysis of a non-repudiation protocol S Schneider Computer Security Foundations Workshop, 1998. Proceedings. 11th IEEE, 54-65, 1998 | 172 | 1998 |
| Prêt à voter: a voter-verifiable voting system PYA Ryan, D Bismark, J Heather, S Schneider, Z Xia IEEE transactions on information forensics and security 4 (4), 662-673, 2009 | 167* | 2009 |
| Prêt à voter with re-encryption mixes PYA Ryan, SA Schneider European Symposium on Research in Computer Security, 313-326, 2006 | 155 | 2006 |
| An attack on a recursive authentication protocol A cautionary tale PYA Ryan, SA Schneider Information Processing Letters 65 (1), 7-10, 1998 | 140 | 1998 |
| Timed CSP: Theory and practice S Schneider, J Davies, DM Jackson, GM Reed, JN Reed, AW Roscoe Proceedings of the Real-Time: Theory in Practice, REX Workshop, 640-675, 1991 | 114 | 1991 |
| Using a process algebra to control B operations H Treharne, S Schneider IFM’99, 437-456, 1999 | 112 | 1999 |
| CSP theorems for communicating B machines S Schneider, H Treharne Formal Aspects of Computing 17 (4), 390-422, 2005 | 107 | 2005 |
| An Introduction to Timer CSP J Davies, S Schneider Oxford University Computing Laboratory, Programming Research Group, 1989 | 99 | 1989 |
| Communicating B machines S Schneider, H Treharne International Conference of B and Z Users, 416-435, 2002 | 96 | 2002 |
Helen TreharneReader, Department of Computer Science, University of SurreyVerified email at surrey.ac.uk
