Bill Roscoe | Academic Influence

Bill Roscoe's AcademicInfluence.com Rankings

Bill Roscoe

Computer Science

#1168

World Rank

#1208

Historical Rank

Database

#2839

World Rank

#2964

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Bill Roscoe's Degrees

Masters Computer Science University of Oxford
Bachelors Computer Science University of Oxford

Similar Degrees You Can Earn

Why Is Bill Roscoe Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Andrew William Roscoe is a Scottish computer scientist. He was Head of the Department of Computer Science, University of Oxford from 2003 to 2014, and is a Professor of Computer Science. He is also a Fellow of University College, Oxford.

(See a Problem?)

Bill Roscoe's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The Theory and Practice of Concurrency (1997) (2066)
A Theory of Communicating Sequential Processes (1984) (1402)
A Timed Model for Communicating Sequential Processes (1986) (575)
Laws of programming (1987) (430)
Understanding Concurrent Systems (2010) (368)
Model-checking CSP (1994) (288)
CSP and determinism in security modelling (1995) (255)
The Laws of Occam Programming (1988) (238)
Modelling and verifying key-exchange protocols using CSP and FDR (1995) (232)
An Improved Failures Model for Communicating Processes (1984) (222)
FDR3 - A Modern Refinement Checker for CSP (2014) (218)
Using CSP to Detect Errors in the TMN Protocol (1997) (207)
ReGuard: Finding Reentrancy Bugs in Smart Contracts (2018) (187)
Non-interference through Determinism (1994) (182)
What is intransitive noninterference? (1999) (159)
Star covering properties (1991) (151)
A classical mind: essays in honour of C. A. R. Hoare (1994) (140)
Security and Usability: Analysis and Evaluation (2010) (136)
Topology and category theory in computer science (1991) (133)
Usability and security of out-of-band channels in secure device pairing protocols (2009) (130)
Nets with Tokens which Carry Data (2008) (127)
Hierarchical Compression for Model-Checking CSP or How to Check 1020 Dining Philosophers for Deadlock (1995) (123)
Proving security protocols with model checkers by data independence techniques (1998) (115)
Metric Spaces as Models for Real-Time Concurrency (1987) (112)
Intensional specifications of security protocols (1996) (105)
Timed CSP: Theory and Practice (1991) (100)
Concepts of digital topology (1992) (95)
Authentication protocols based on low-bandwidth unspoofable channels: A comparative survey (2011) (76)
Continuous analogs of axiomatized digital surfaces (1984) (72)
A theory of binary digital pictures (1985) (70)
Authentication for Pervasive Computing (2003) (65)
Unbounded Nondeterminism in CSP (1989) (63)
The Pursuit of Deadlock freedom (1987) (62)
Criteria for metrisability (1984) (61)
Denotational Semantics for occam (1984) (58)
A mathematical theory of communicating processes (1982) (55)
User interactive Internet of things privacy preserved access control (2012) (53)
Authenticating ad hoc networks by comparison of short digests (2008) (52)
Seminar on Concurrency (1984) (51)
Efficient group authentication protocols based on human interaction (2009) (47)
The Timed Failures-Stability Model for CSP (1999) (45)
A lattice of conditions on topological spaces (1985) (44)
Exploiting Empirical Engagement in Authentication Protocol Design (2005) (43)
FDR3: a parallel refinement checker for CSP (2016) (43)
Deadlock analysis in networks of communicating processes (1989) (42)
On the expressive power of CSP refinement (2005) (41)
An Alternative Order for the Failures Model (1992) (38)
On the Relationship Between Web Services Security and Traditional Protocols (2006) (36)
Verifying Statemate Statecharts Using CSP and FDR (2006) (35)
Two heads are better than one: security and usability of device associations in group scenarios (2010) (35)
Fixed Points Without Completeness (1995) (34)
Unbounded Non-Determinism in CSP (1993) (32)
Automating Data Independence (2000) (32)
A lattice of conditions on topological spaces II (1991) (32)
Data Independent Induction over Structured Networks (2000) (27)
Revivals, stuckness and the hierarchy of CSP models (2009) (27)
Human Interactive Secure ID Management in Body Sensor Networks (2012) (26)
Human interactive secure key and identity exchange protocols in body sensor networks (2013) (25)
The colour problem (1968) (25)
Seeing Beyond Divergence (2004) (24)
Watchdog Transformations for Property-Oriented Model-Checking (2003) (24)
Seminar on Concurrency: Carnegie-Mellon University Pittsburgh, PA, July 9-11, 1984 (1985) (23)
Model checking Timed CSP (2014) (22)
Programs as Executable Predicates (1984) (22)
Tutorial on FDR and Its Applications (2000) (21)
On model checking data-independent systems with arrays without reset (2004) (21)
Responsiveness of interoperating components (2004) (21)
Composing and decomposing systems under security properties (1995) (20)
Acyclic monotone normality (1992) (19)
Recent Developments in FDR (2012) (19)
The Three Platonic Models of Divergence-Strict CSP (2008) (18)
Formal Verification of Arbitrary Network Topologies (1999) (18)
Verifying an infinite family of inductions simultaneously using data independence and FDR (1999) (17)
Responsiveness and stable revivals (2007) (17)
Data Independence with Generalised Predicate Symbols (1999) (17)
Bootstrapping multi-party ad-hoc security (2006) (17)
Practical Partial Order Reduction for CSP (2015) (16)
The Decomposition of a Rectangle into Rectangles of Minimal Perimeter (1988) (16)
Separating two roles of hashing in one-way message authentication (2009) (16)
CSP is Expressive Enough for π (2010) (16)
SAT-solving in CSP trace refinement (2012) (15)
Occam in the specification and verification of microprocessors (1992) (15)
Mobile Electronic Identity: Securing Payment on Mobile Phones (2011) (15)
Efficient Deadlock-Freedom Checking Using Local Analysis and SAT Solving (2016) (14)
Analysing TMFS: a Study of Nondeterminism in Real-Time Concurrency (1991) (14)
Checking noninterference in Timed CSP (2012) (14)
Body sensor network key distribution using human interactive channels (2011) (13)
Rigorous development of component-based systems using component metadata and patterns (2016) (13)
CSP and timewise refinement (1991) (13)
Short-Output Universal Hash Functions and Their Use in Fast and Secure Data Authentication (2012) (12)
On Model Checking Data-Independent Systems with Arrays with Whole-Array Operations (2004) (12)
CSP (Communicating Sequential Processes) (2011) (12)
Topology, computer science, and the mathematics of convergence (1991) (12)
Formalising and verifying smart contracts with Solidifier: a bounded model checker for Solidity (2020) (11)
Reflections on the Work of C. A. R. Hoare (2010) (10)
A Taxonomy of Web Services Using CSP (2006) (10)
A Static Analysis Framework for Livelock Freedom in CSP (2013) (10)
Static Livelock Analysis in CSP (2011) (10)
Faster FDR Counterexample Generation Using SAT-Solving (2009) (10)
From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions (2018) (9)
Extending noninterference properties to the timed world (2006) (9)
New combinatorial bounds for universal hash functions (2009) (9)
Tighter Reachability Criteria for Deadlock-Freedom Analysis (2016) (9)
Computing maximal weak and other bisimulations (2016) (9)
Secure and Usable Out-Of-Band Channels for Ad Hoc Mobile Device Interactions (2010) (8)
Capturing parallel attacks within the data independence framework (2002) (8)
A Representative Function Approach to Symmetry Exploitation for CSP Refinement Checking (2008) (8)
The Expressiveness of CSP With Priority (2015) (8)
Slow Abstraction via Priority (2013) (8)
Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer (2019) (7)
Community Climate System Model (CCSM) (2011) (7)
The Missing Link: Human Interactive Security Protocols in Mobile Payment (2010) (7)
FDR into The Cloud (2014) (7)
Local Search in Model Checking (2009) (6)
Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting (2005) (6)
Intensional Speciications of Security Protocols (1998) (6)
Embedding agents within the intruder to detect parallel attacks (2004) (6)
The Automatic Detection of Token Structures and Invariants Using SAT Checking (2017) (6)
Reducing Complex CSP Models to Traces via Priority (2016) (6)
Finitary refinement checks for infinitary specifications (2004) (6)
Detecting Failed Attacks on Human-Interactive Security Protocols (2016) (6)
Confluence Thanks to Extensional Determinism (2006) (5)
Information Leakage Due to Revealing Randomly Selected Bits (2015) (5)
Auditable PAKEs: Approaching Fair Exchange Without a TTP (2017) (5)
Efficient Verification of Concurrent Systems Using Synchronisation Analysis and SAT/SMT Solving (2019) (5)
Computing Maximal Bisimulations (2014) (5)
Solidifier: bounded model checking solidity using lazy contract deployment and precise memory modelling (2021) (5)
Checking Static Properties Using Conservative SAT Approximations for Reachability (2017) (4)
Reverse Authentication in Financial Transactions and Identity Management (2013) (4)
Millennial perspectives in computer science : proceedings of the 1999 Oxford-Microsoft Symposium in honour of Professor Sir Antony Hoare (2000) (4)
Short-output universal hash functions and their use in fast and secure message authentication (2012) (4)
A CSP solution to the "trains" problem (1983) (4)
Revivals, stuckness and responsiveness (2006) (4)
Bootstrapping body sensor networks using human controlled LED-camera channels (2012) (4)
Social Networks for Importing and Exporting Security (2012) (4)
When Context Is Better Than Identity: Authentication by Context Using Empirical Channels (2011) (3)
Detecting Failed Attacks on Human-Interactive Security Protocols (Transcript of Discussion) (2016) (3)
Machine-Verifiable Responsiveness (2005) (3)
Insight, Inspiration and Collaboration (2010) (3)
Software and Malware Capabilities: Opinions on (Inter)national Security (2017) (3)
Process Algebra and Model Checking (2018) (3)
Selected papers of the meeting on Mathematical foundations of programming semantics. Part II : lambda calculus and domain theory: lambda calculus and domain theory (1994) (3)
Translating between models of concurrency (2019) (3)
Formal methods in the development of the H1 transputer (1991) (2)
Neural Network Security: Hiding CNN Parameters with Guided Grad-CAM (2020) (2)
Specification is Law: Safe Creation and Upgrade of Ethereum Smart Contracts (2022) (2)
Static Livelock Analysis in CSP : Full Version (2011) (2)
Internalising agents in CSP protocol models ( Extended (2002) (2)
Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (2019) (2)
CSP: A Practical Process Algebra (2021) (2)
Card games as pointer structures: case studies in mobile CSP modelling (2016) (2)
Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption (2004) (1)
Critical Sections (2011) (1)
Consistency in Distributed Databases a Group-like Algebra and Its Applications (1)
Approximate verification of concurrent systems using token structures and invariants (2022) (1)
Community Ice Code (CICE) (2011) (1)
Configurable, Highly Parallel Computer (2011) (1)
Reflections on the need to de-skill CSP (2014) (1)
Cluster File Systems (2011) (1)
Simple construction of epsilon-biased distribution (2012) (1)
Polymorphic systems with arrays : decidability and undecidability (2004) (1)
A Proof of Entropy Minimization for Outputs in Deletion Channels via Hidden Word Statistics (2018) (1)
Under consideration for publication in Formal Aspects of Computing Computing Maximal Weak and Other Bisimulations (2015) (1)
Seminar on Concurrency, Carnegie-Mellon University (1984) (1)
Guardian: Symbolic Validation of Orderliness in SGX Enclaves (2021) (1)
Specifying problem one using the failure sets model for CSP and deriving CSP processes which meett this specification (1983) (0)
Programming Research Group Fixed Points without Completeness (1993) (0)
Preface (1986) (0)
Embedding reverse links in a blockchain (2022) (0)
The automated verification of timewise refinement ( Draft ) (2013) (0)
Temporal signatures (2017) (0)
DENOTAPIONAL SEMANTICS FOR (0)
Generating short-output digest functions (2010) (0)
Finite Observation Models (2010) (0)
Computing maximal weak and other bisimulations (2016) (0)
Guest editorial for the special issue from the 18th Brazilian Symposium on Formal Methods (SBMF 2015) (2019) (0)
Fully Decentralized Post-Quantum Resistant Authentication, Encryption Protocol with Full Data Interoperability Universally Deployable in any Network Environment (2022) (0)
State Explosion and Parameterised Verification (2010) (0)
North-Holland 53 Acyclic monotone normality (2001) (0)
Reverse Authentication in Financial Transactions and Identity Management (2012) (0)
Community Climate Model (CCM) (2011) (0)
More About FDR (2010) (0)
Understanding Shared-Variable Concurrency (2010) (0)
Translating between models of concurrency (2020) (0)
The Point-countable Base Problem Introduction (1990) (0)
The engineer in society (1967) (0)
Rigorous development of component-based systems using component metadata and patterns (2016) (0)
Denotational Semantics and Behavioural Models (2010) (0)
Priority and Mobility (2010) (0)
Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (2019) (0)
Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic (1992) (0)
Timed Systems 1: tock-CSP (2010) (0)
Shared-Variable Programs (2010) (0)
CSP Case Studies (2010) (0)
Seminar on Concurrrency (1985) (0)
Delay Encryption by Cubing (2022) (0)
Timed Systems 2: Discrete Timed CSP (2010) (0)
Electronic Communications of the EASST Volume ? ( 2009 ) Proceedings of the Ninth International Workshop on Automated Verification of Critical Systems ( AVOCS 2009 ) Faster FDR Counterexample Generation Using SAT-Solving (2009) (0)
Data independent verification of crypto-protocols (2001) (0)
The expressiveness of CSP extended by priority ( draft ) (2014) (0)
Keynote Abstract - The Effectiveness of CSP Model Checking (2010) (0)
Checking noninterference in Timed CSP (2012) (0)
Verifying an Innnite Family of Inductions Simultaneously Using Data Independence and Fdr (extended Abstract) (2007) (0)
Maintaining Consistency in Distributed Databases applications (2009) (0)
Dedication : I have happy memories of chasing time in the 1980 s with Howard Barringer and others . Now it seems to be catching us up ! (2014) (0)
Trusted And Confidential Program Analysis (2021) (0)
Guardian (2021) (0)
Key Agreement via Protocols (2019) (0)
Decentralised Edge Authentication in the Industrial Enterprise IoT Space (2020) (0)
Summary : We give details of a new model for CSP introduced in response to work by (2022) (0)
Infinite-Behaviour Models (2010) (0)
FDR3: a parallel refinement checker for CSP (2015) (0)
Solidifier (0)
Bootstrapping IoT authentication using aggregated local knowledge and novel self-contained triangulation methodologies (2022) (0)
Hiding and Renaming (2010) (0)
The Algebra of CSP (2010) (0)
Committable: A Decentralised and Trustless Open-Source Protocol (2022) (0)
Building a Simple Sequential Process (2010) (0)

This paper list is powered by the following services:

Other Resources About Bill Roscoe

en.wikipedia.org

What Schools Are Affiliated With Bill Roscoe?

Bill Roscoe is affiliated with the following schools: