A. W. Roscoe

According to our database1, A. W. Roscoe authored at least 130 papers between 1982 and 2020.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Formalising and verifying smart contracts with Solidifier: a bounded model checker for Solidity.
CoRR, 2020

Translating between models of concurrency.
Acta Informatica, 2020

Neural Network Security: Hiding CNN Parameters with Guided Grad-CAM.
Proceedings of the 6th International Conference on Information Systems Security and Privacy, 2020

2019
Efficient Verification of Concurrent Systems Using Synchronisation Analysis and SAT/SMT Solving.
ACM Trans. Softw. Eng. Methodol., 2019

Guest editorial for the special issue from the 18th Brazilian Symposium on Formal Methods (SBMF 2015).
Sci. Comput. Program., 2019

Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2019

Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving.
Formal Asp. Comput., 2019

Key Agreement via Protocols.
Proceedings of the Foundations of Security, Protocols, and Equational Reasoning, 2019

2018
Process Algebra and Model Checking.
Proceedings of the Handbook of Model Checking., 2018

A Proof of Entropy Minimization for Outputs in Deletion Channels via Hidden Word Statistics.
CoRR, 2018

From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions.
CoRR, 2018

ReGuard: finding reentrancy bugs in smart contracts.
Proceedings of the 40th International Conference on Software Engineering: Companion Proceeedings, 2018

2017
The Automatic Detection of Token Structures and Invariants Using SAT Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Auditable PAKEs: Approaching Fair Exchange Without a TTP.
Proceedings of the Security Protocols XXV, 2017

Checking Static Properties Using Conservative SAT Approximations for Reachability.
Proceedings of the Formal Methods: Foundations and Applications - 20th Brazilian Symposium, 2017

Software and Malware Capabilities: Opinions on (Inter)national Security.
Proceedings of the 2017 International Conference on Cyberworlds, 2017

2016
FDR3: a parallel refinement checker for CSP.
Int. J. Softw. Tools Technol. Transf., 2016

Rigorous development of component-based systems using component metadata and patterns.
Formal Asp. Comput., 2016

Computing maximal weak and other bisimulations.
Formal Asp. Comput., 2016

Reducing Complex CSP Models to Traces via Priority.
Proceedings of the Thirty-second Conference on the Mathematical Foundations of Programming Semantics, 2016

Card games as pointer structures: case studies in mobile CSP modelling.
CoRR, 2016

Detecting Failed Attacks on Human-Interactive Security Protocols (Transcript of Discussion).
Proceedings of the Security Protocols XXIV, 2016

Detecting Failed Attacks on Human-Interactive Security Protocols.
Proceedings of the Security Protocols XXIV, 2016

Efficient Deadlock-Freedom Checking Using Local Analysis and SAT Solving.
Proceedings of the Integrated Formal Methods - 12th International Conference, 2016

Tighter Reachability Criteria for Deadlock-Freedom Analysis.
Proceedings of the FM 2016: Formal Methods, 2016

2015
The Expressiveness of CSP With Priority.
Proceedings of the 31st Conference on the Mathematical Foundations of Programming Semantics, 2015

Information Leakage Due to Revealing Randomly Selected Bits.
Proceedings of the Security Protocols XXIII - 23rd International Workshop, Cambridge, UK, March 31, 2015

Practical Partial Order Reduction for CSP.
Proceedings of the NASA Formal Methods - 7th International Symposium, 2015

2014
FDR3 - A Modern Refinement Checker for CSP.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2014

Computing Maximal Bisimulations.
Proceedings of the Formal Methods and Software Engineering, 2014

Model checking Timed CSP.
Proceedings of the HOWARD-60: A Festschrift on the Occasion of Howard Barringer's 60th Birthday, 2014

2013
Reverse Authentication in Financial Transactions and Identity Management.
MONET, 2013

Human interactive secure key and identity exchange protocols in body sensor networks.
IET Information Security, 2013

Checking noninterference in Timed CSP.
Formal Asp. Comput., 2013

A Static Analysis Framework for Livelock Freedom in CSP
Log. Methods Comput. Sci., 2013

Slow Abstraction via Priority.
Proceedings of the Theories of Programming and Formal Methods, 2013

2012
SAT-solving in CSP trace refinement.
Sci. Comput. Program., 2012

Human Interactive Secure ID Management in Body Sensor Networks.
J. Networks, 2012

Simple construction of epsilon-biased distribution.
IACR Cryptol. ePrint Arch., 2012

Social Networks for Importing and Exporting Security.
Proceedings of the Large-Scale Complex IT Systems. Development, Operation and Management, 2012

Bootstrapping body sensor networks using human controlled LED-camera channels.
Proceedings of the 7th International Conference for Internet Technology and Secured Transactions, 2012

User interactive Internet of things privacy preserved access control.
Proceedings of the 7th International Conference for Internet Technology and Secured Transactions, 2012

Short-Output Universal Hash Functions and Their Use in Fast and Secure Data Authentication.
Proceedings of the Fast Software Encryption - 19th International Workshop, 2012

Recent Developments in FDR.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011
CSP (Communicating Sequential Processes).
Proceedings of the Encyclopedia of Parallel Computing, 2011

On the construction of digest functions for manual authentication protocols.
IACR Cryptol. ePrint Arch., 2011

Mobile Electronic Identity: Securing Payment on Mobile Phones.
Proceedings of the Information Security Theory and Practice. Security and Privacy of Mobile Devices in Wireless Communication, 2011

When Context Is Better Than Identity: Authentication by Context Using Empirical Channels.
Proceedings of the Security Protocols XIX, 2011

Body sensor network key distribution using human interactive channels.
Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies, 2011

Static Livelock Analysis in CSP.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010
Understanding Concurrent Systems.
Texts in Computer Science, Springer, ISBN: 978-1-84882-258-0, 2010

Authentication protocols based on low-bandwidth unspoofable channels: a comparative survey.
IACR Cryptol. ePrint Arch., 2010

Secure and Usable Out-Of-Band Channels for <i>Ad Hoc</i> Mobile Device Interactions.
Proceedings of the Information Security Theory and Practices. Security and Privacy of Pervasive Systems and Smart Devices, 2010

Two heads are better than one: security and usability of device associations in group scenarios.
Proceedings of the Sixth Symposium on Usable Privacy and Security, 2010

The Missing Link: Human Interactive Security Protocols in Mobile Payment.
Proceedings of the Advances in Information and Computer Security, 2010

Security and Usability: Analysis and Evaluation.
Proceedings of the ARES 2010, 2010

CSP is Expressive Enough for <i>π</i>.
Proceedings of the Reflections on the Work of C. A. R. Hoare., 2010

Insight, Inspiration and Collaboration.
Proceedings of the Reflections on the Work of C. A. R. Hoare., 2010

2009
Revivals, stuckness and the hierarchy of CSP models.
J. Log. Algebraic Methods Program., 2009

New combinatorial bounds for universal hash functions.
IACR Cryptol. ePrint Arch., 2009

Efficient group authentication protocols based on human interaction.
IACR Cryptol. ePrint Arch., 2009

Separating two roles of hashing in one-way message authentication.
IACR Cryptol. ePrint Arch., 2009

Preface.
Electron. Notes Theor. Comput. Sci., 2009

Faster FDR Counterexample Generation Using SAT-Solving.
ECEASST, 2009

Usability and security of out-of-band channels in secure device pairing protocols.
Proceedings of the 5th Symposium on Usable Privacy and Security, 2009

Local Search in Model Checking.
Proceedings of the Automated Technology for Verification and Analysis, 2009

2008
Authenticating ad hoc networks by comparison of short digests.
Inf. Comput., 2008

Nets with Tokens which Carry Data.
Fundam. Inform., 2008

The Three Platonic Models of Divergence-Strict CSP.
Proceedings of the Theoretical Aspects of Computing, 2008

A Representative Function Approach to Symmetry Exploitation for CSP Refinement Checking.
Proceedings of the Formal Methods and Software Engineering, 2008

2007
Responsiveness and stable revivals.
Formal Asp. Comput., 2007

2006
Confluence Thanks to Extensional Determinism.
Electron. Notes Theor. Comput. Sci., 2006

Machine-Verifiable Responsiveness.
Electron. Notes Theor. Comput. Sci., 2006

A Taxonomy of Web Services Using CSP.
Electron. Notes Theor. Comput. Sci., 2006

Extending noninterference properties to the timed world.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

Bootstrapping multi-party ad-hoc security.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

Verifying Statemate Statecharts Using CSP and FDR.
Proceedings of the Formal Methods and Software Engineering, 2006

2005
On the expressive power of CSP refinement.
Formal Asp. Comput., 2005

On the Relationship Between Web Services Security and Traditional Protocols.
Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics, 2005

Exploiting Empirical Engagement in Authentication Protocol Design.
Proceedings of the Security in Pervasive Computing, Second International Conference, 2005

2004
On model checking data-independent systems with arrays without reset.
Theory Pract. Log. Program., 2004

Embedding agents within the intruder to detect parallel attacks.
J. Comput. Secur., 2004

Responsiveness of interoperating components.
Formal Asp. Comput., 2004

Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting.
Proceedings of the 6th International Workshop on Verification of Infinite-State Systems, 2004

Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption.
Proceedings of the Integrated Formal Methods, 4th International Conference, 2004

Seeing Beyond Divergence.
Proceedings of the Communicating Sequential Processes: The First 25 Years, 2004

On Model Checking Data-Independent Systems with Arrays with Whole-Array Operations.
Proceedings of the Communicating Sequential Processes: The First 25 Years, 2004

2003
Authentication for Pervasive Computing.
Proceedings of the Security in Pervasive Computing, 2003

Watchdog Transformations for Property-Oriented Model-Checking.
Proceedings of the FME 2003: Formal Methods, 2003

2002
Capturing Parallel Attacks within the Data Independence Framework.
Proceedings of the 15th IEEE Computer Security Foundations Workshop (CSFW-15 2002), 2002

2000
Data independent verification of crypto-protocols.
Electron. Notes Theor. Comput. Sci., 2000

Tutorial on FDR and Its Applications.
Proceedings of the SPIN Model Checking and Software Verification, 7th International SPIN Workshop, Stanford, CA, USA, August 30, 2000

Data Independent Induction over Structured Networks.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

Automating Data Independence.
Proceedings of the Computer Security, 2000

1999
The Timed Failures-Stability Model for CSP.
Theor. Comput. Sci., 1999

Proving Security Protocols with Model Checkers by Data Independence Techniques.
J. Comput. Secur., 1999

Data Independence with Generalised Predicate Symbols.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

Formal Verification of Arbitrary Network Topologies.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

Verifying an infinite family of inductions simultaneously using data independence and FDR.
Proceedings of the Formal Methods for Protocol Engineering and Distributed Systems, 1999

What Is Intransitive Noninterference?
Proceedings of the 12th IEEE Computer Security Foundations Workshop, 1999

1998
Proving Security Protocols with Model Checkers by Data Independence Techniques.
Proceedings of the 11th IEEE Computer Security Foundations Workshop, 1998

1997
Using CSP to Detect Errors in the TMN Protocol.
IEEE Trans. Software Eng., 1997

1996
Non-interference through Determinism.
J. Comput. Secur., 1996

Intensional specifications of security protocols.
Proceedings of the Ninth IEEE Computer Security Foundations Workshop, March 10, 1996

1995
Fixed Points Without Completeness.
Theor. Comput. Sci., 1995

Hierarchical Compression for Model-Checking CSP or How to Check 10<sup>20</sup> Dining Philosophers for Deadlock.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1995

CSP and determinism in security modelling.
Proceedings of the 1995 IEEE Symposium on Security and Privacy, 1995

Composing and decomposing systems under security properties.
Proceedings of the Eighth IEEE Computer Security Foundations Workshop (CSFW '95), 1995

Modelling and verifying key-exchange protocols using CSP and FDR.
Proceedings of the Eighth IEEE Computer Security Foundations Workshop (CSFW '95), 1995

1993
Unbounded Non-Determinism in CSP.
J. Log. Comput., 1993

1992
An Alternative Order for the Failures Model.
J. Log. Comput., 1992

1991
Deadlock Analysis in Networks of Communicating Processes.
Distributed Comput., 1991

Timed CSP: Theory and Practice.
Proceedings of the Real-Time: Theory in Practice, 1991

1989
Unbounded Nondeterminism in CSP.
Proceedings of the Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29, 1989

Analysing <i>TM<sub>FS</sub></i>: a Study of Nondeterminism in Real-Time Concurrency.
Proceedings of the Concurrency: Theory, 1989

1988
The Laws of Occam Programming.
Theor. Comput. Sci., 1988

A Timed Model for Communicating Sequential Processes.
Theor. Comput. Sci., 1988

The Decomposition of a Rectangle into Rectangles of Minimal Perimeter.
SIAM J. Comput., 1988

1987
The Pursuit of Deadlock freedom
Inf. Comput., December, 1987

Laws of Programming.
Commun. ACM, 1987

Metric Spaces as Models for Real-Time Concurrency.
Proceedings of the Mathematical Foundations of Programming Language Semantics, 1987

1985
A theory of binary digital pictures.
Comput. Vis. Graph. Image Process., 1985

Continuous analogs of axiomatized digital surfaces.
Comput. Vis. Graph. Image Process., 1985

1984
A Theory of Communicating Sequential Processes.
J. ACM, 1984

Programs as Executable Predicates.
Proceedings of the International Conference on Fifth Generation Computer Systems, 1984

Denotational Semantics for occam.
Proceedings of the Seminar on Concurrency, 1984

An Improved Failures Model for Communicating Processes.
Proceedings of the Seminar on Concurrency, 1984

1983
A CSP solution to the "trains" problem.
Proceedings of the Analysis of Concurrent Systems, 1983

Specifying problem one using the failure sets model for CSP and deriving CSP processes which meett this specification.
Proceedings of the Analysis of Concurrent Systems, 1983

1982
A mathematical theory of communicating processes.
PhD thesis, 1982


  Loading...