Search filters

List of works by Steve Schneider

A CSP Approach to Control in Event-B

article published in 2010

A Formal Approach for Reasoning About a Class of Diffie-Hellman Protocols

A Formal Framework for Modelling Coercion Resistance and Receipt Freeness

A Peered Bulletin Board for Robust Use in Verifiable Voting Systems

A Practical Voter-Verifiable Election Scheme

A Step towards Merging xUML and CSP ${\| \ }$ B

article by Helen Treharne et al published 2009 in Lecture Notes in Computer Science

A brief history of Timed CSP

A step towards refining and translating B control annotations to Handel-C

An Operational Semantics for Timed CSP

article published in 1995

An Optimization Approach for Effective Formalized fUML Model Checking

An algebraic approach to the verification of a class of Diffie-Hellman protocols

scholarly article by Rob Delicata & Steve Schneider published 8 February 2007 in International Journal of Information Security

An integrated framework for checking the behaviour of fUML models using CSP

Automated Anonymity Verification of the ThreeBallot Voting System

Automated anonymity verification of the ThreeBallot and VAV voting systems

Automatic Generation of CSP || B Skeletons from xUML Models

Bounded Retransmission in Event-B∥CSP: a Case Study

CSP theorems for communicating B machines

Changing system interfaces consistently: A new refinement strategy for CSP ∥ B

Correctness and communication in real-time systems

doctoral thesis by S. A. (Steve A.) Schneider

Cryptographic protocols with everyday objects

Editorial

End-to-End Verifiability in Voting Systems, from Theory to Practice

Experiences Gained from the first Prêt à Voter Implementation

Feasibility Analysis of Prêt à Voter for German Federal Elections

article

Focus group views on Prêt à Voter 1.0

Formal Security Analysis and Improvement of a Hash-Based NFC M-Coupon Protocol

Formal Verification of Tokeneer Behaviours Modelled in fUML Using CSP

Formal analysis of a non-repudiation protocol

Formal security analysis of NFC M-coupon protocols using Casper/FDR

Formally defining NFC M-coupon requirements, with a case study

Guest Editors’ Preface

Guest editorial overview

Managing LTL Properties in Event-B Refinement

May Testing, Non-interference, and Compositionality

article

Modelling and analysis of the AMBA bus using CSP and B

Object Modelling in the SystemB Industrial Project

On modelling and verifying railway interlockings: Tracking train lengths

OnTrack: An Open Tooling Environment for Railway Verification

Policy templates for relationship-based access control

Preface

Preserving Privacy of Vulnerable Users across Heterogeneous Sensitive Sensor Data Streams using Smart Contracts

scientific article published on 02 January 2024

PrÊt À Voter: a Voter-Verifiable Voting System

scientific article (publication date: December 2009)

Prêt á Voter with Write-Ins

Recursion induction for real-time processes

Solving the Discrete Logarithm Problem for Packing Candidate Preferences

Special issue on Automated Verification of Critical Systems (AVoCS 2013)

Tank Monitoring: A pAMN Case Study

Tank monitoring: a pAMN case study

Techniques for modelling and verifying railway interlockings

The behavioural semantics of Event-B refinement

Timed CSP: A Retrospective

Towards a Practical Approach to Check UML/fUML Models Consistency Using CSP

Verifiable Voting Systems

Verification of Scheme Plans Using CSP $$||$$ | | B

Verifying anonymity in voting systems using CSP

Verifying authentication protocols in CSP

Verifying security protocols with PVS: widening the rank function approach

Versatile Prêt à Voter: Handling Multiple Election Methods with a Unified Interface

vVote