University of Oxford Logo University of OxfordDepartment of Computer Science - Home

Bill Roscoe : Publications

Personal orderingBibtex

[0]

Notes on Domain Theory

A. W. Roscoe

1989.

These notes were written for the Oxford Domain Theory course between 1984 and 1989. I originally planned to publish them as half of "Domains for denotational semantics".

[1]

A theory of communicating sequential processes

A. W. Roscoe‚ S.D. Brookes and C. A. R. Hoare

No. PRG−16. Oxford University Computing Laboratory. May, 1981.

[2]

A mathematical theory of communicating processes

A. W. Roscoe

PhD Thesis , type=D. Phil. thesis D. Phil. thesisType. Oxford University. 1982.

Please note this is a 270 page‚ 118 Mb scanned file and will take some time to download.

[3]

Criteria for metrisability

A. W. Roscoe and P.J. Collins

In Proc. Amer. Math. Soc.. No. 90. Pages 631−640. April, 1984.

[4]

A theory of communicating sequential processes

A. W. Roscoe‚ S.D. Brookes and C.A.R. Hoare

In Journal of the ACM. No. 3. Pages 560–599. July, 1984.

[5]

Programs as executable predicates

A. W. Roscoe and C.A.R. Hoare

In Proceedings of FGCS84 (ICOT‚ editors). Pages 220–228. 1984.

[6]

Continuous analogues of axiomatised digital surfaces

A. W. Roscoe and T.Y. Kong

In Computer Vision‚ Graphics and Image Processing. No. 29. Pages 60–86. January, 1985.

[7]

A lattice of conditions on topological spaces

A. W. Roscoe‚ P.J. Collins‚ G.M. Reed and M.E. Rudin

In Proc. Amer. Math. Soc.. No. 94. Pages 487–496. July, 1985.

[8]

Proceedings of the Pittsburgh seminar on concurrency

A. W. Roscoe‚ S.D. Brookes and G. Winskel, editors

A. W. Roscoe‚ S.D. Brookes and G. Winskel, editors

[9]

An improved failures model for communicating processes

A. W. Roscoe and S.D. Brookes

In Proceedings of the Pittsburgh seminar on concurrency. No. 197. Pages 281–305. Springer. 1985.

[10]

Denotational semantics for occam

A. W. Roscoe

In Proceedings of the Pittsburgh seminar on concurrency. No. 197. Pages 306–329. Springer. 1985.

[11]

Deadlock analysis in networks of communicating processes

A. W. Roscoe and S.D. Brookes

In K.R. Apt, editor, Logics and Models of Concurrent Systems. Vol. 13 of NATO ASI series F. Pages 305–324. Springer. 1985.

[12]

Characterisations of simply−connected finite polyhedra in 3−space

A. W. Roscoe and T.Y. Kong

In Bull. London Math. Soc.. No. 17. Pages 575–578. November, 1985.

[13]

A theory of binary digital pictures

A. W. Roscoe and T.Y. Kong

In Computer Vision‚ Graphics and Image Processing. No. 32. Pages 221–243. November, 1985.

[14]

Specifying problem one using the failures model for CSP and deriving CSP processes which meet this specification

A. W. Roscoe

In B.T. Denvir et al, editor, The Analysis of Concurrent Systems. No. 207. Pages 103–109. Springer. 1985.

[15]

A CSP solution to the trains problem

A. W. Roscoe

In B.T. Denvir et al, editor, The Analysis of Concurrent Systems. No. 207. Pages 384–388. Springer. 1985.

[16]

Local symmetry and triangle laws are sufficient for metrisability

A. W. Roscoe and P.J. Collins

In Colloquia Mathematica Societatis Janos Bolyai 41. Pages 177–181. 1985.

[17]

A timed model for communicating sequential processes

A. W. Roscoe and G.M. Reed

In Theoretical Computer Science. Vol. 58. Pages 249–261. 1988.

[18]

The pursuit of deadlock freedom

A. W. Roscoe and Naiem Dathi

In Information and Computation. Vol. 75. No. 3. Pages 289–327. December, 1987.

[19]

Metric spaces as models for real−time concurrency

A. W. Roscoe and G.M. Reed

In Main et al, editor, Proceedings of the Third Workshop on the Mathematical Foundations of Programming Language Semantics (New Orleans‚ 1987). No. 298. Pages 331–343. Springer. 1988.

[20]

Laws of programming

A. W. Roscoe‚ C.A.R. Hoare‚ He Jifeng‚ I.J. Hayes‚ C.C. Morgan‚ J.W. Sanders‚ I.H. Sorensen‚ J.M. Spivey and B.A. Sufrin

In Communications of the ACM. Vol. 30. No. 8. Pages 672–686. August, 1987.

Previously appeared as Oxford University Computing Laboratory Technical Report PRG−42.

[21]

Routing messages through networks: an exercise in deadlock avoidance

A. W. Roscoe

In Muntean et al., editor, Programming of Transputer Based Machines: Proceedings of 7th occam User Group Technical Meeting. Amsterdam. 1987. IOS B.V..

[22]

Transforming occam programs

A. W. Roscoe and M.H. Goldsmith

In The Design and Application of Parallel Digital Processors. No. 298. 1988.

[23]

A timed model for communicating sequential processes

A. W. Roscoe and G.M. Reed

In Proc.ICALP 86. No. 226. Pages 314–323. Springer. 1986.

[24]

The laws of occam programming

A. W. Roscoe and C.A.R. Hoare

In Theoretical Computer Science. Vol. 60. Pages 177–229. 1988.

Previously appeared as Oxford University Computing Laboratory Technical Report PRG−53‚ 1986.

[25]

The decomposition of a rectangle into rectangles of minimal perimeter

A. W. Roscoe‚ T.Y. Kong and D.M. Mount

No. CAR−TR−169. University of Maryland Center for Automation Research. 1986.

Also SIAM Journal of Computing 17‚ 6 pp1215−1231.

[26]

An Operational Semantics for CSP

A. W. Roscoe‚ S. D. Brookes and D. J. Walker

Oxford University Computing Laboratory. 1986.

[27]

An alternative order for the failures model

A. W. Roscoe

No. PRG−67. Oxford University Computing Laboratory. July, 1988.

in Two papers on CSP‚ Also appeared in Journal of Logic and Computation 2‚ 5 pp557−577

[28]

Unbounded nondeterminism in CSP

A. W. Roscoe

No. PRG−67. Oxford University Computing Laboratory. July, 1988.

in Two papers on CSP‚ Also appeared in Journal of Logic and Computation‚ Vol 3‚ No 2 pp131−172 (1993)

[29]

Unbounded nondeterminism in CSP

A. W. Roscoe and G.Barrett

In Proceedings of MFPS89. No. 298. Springer. 1989.

[30]

Deadlock analysis in networks of communicating processes

A. W. Roscoe and S.D. Brookes

In Distributed Computing. No. 4. Pages 209–230. 1991.

[31]

A lattice of conditions on topological spaces II

A. W. Roscoe‚ P. Moody‚ G.M. Reed and P.J. Collins

In Fundamenta Mathematicae. No. 138. Pages 69–81. 1991.

[32]

The point−countable base problem

A. W. Rosoce‚ P.J. Collins and G.M. Reed

In G.M. Reed and J. van Mill, editors, Problems in Topology. Elsevier. 1990.

[33]

Maintaining consistency in distributed databases

A. W. Roscoe

No. PRG−87. Oxford University Computing Laboratory. 1990.

[34]

Communication and correctness in Timed CSP

A. W. Roscoe‚ S.A. Schneider‚ J.W. Davies‚ D.M. Jackson and G.M. Reed

Esprit SPEC project. 1990.

[35]

A temporal logic for Timed CSP

D.M. Jackson‚ J.W. Davies‚ G.M. Reed and S.A. Schneider

Esprit SPEC project. 1990.

[36]

Topology‚ computer science and the mathematics of convergence

A. W. Roscoe

In G.M. Reed‚ A. W. Roscoe and R.F. Wachter, editors, Topology and Category Theory in Computer Science. OUP. 1991.

[37]

Topology and category theory in computer science

A. W. Roscoe‚ G.M. Reed and R.F. Wachter, editors

A. W. Roscoe‚ G.M. Reed and R.F. Wachter, editors

proceedings of a special session at the 1989 Oxford Topology Conference

[38]

Analysing TM_FS: a study of nondeterminism in real−time concurrency

A. W. Roscoe and G.M. Reed

In Concurrency: Theory Language and Architecture. Vol. 491. 1991.

[39]

CSP and timewise refinement

A. W. Roscoe‚ G. M. Reed and S. A. Schneider

In Proceedings of the BCS−FACS Refinement Workshop. LNCS. 1991.

[40]

Star covering properties

A. W. Roscoe‚ E.K. van Douwen‚ G.M. Reed and I.J. Tree

In Topology and its Applications. Vol. 39. Pages 71−103. 1991.

[41]

Formal methods in the development of the H1 Transputer

A. W. Roscoe‚ A.D.B. Cox‚ M.H. Goldsmith and J.B. Scattergood

In Proceedings of Transputing 91. IOS. 1991.

[42]

Concepts of digital topology

A. W. Roscoe and T.Y. Kong

In Topology and its applications. Vol. 46. Pages 219–262. 1992.

[43]

Timed CSP: theory and practice

A. W. Roscoe‚ J.Davies‚ D.Jackson‚ G.M.Reed‚ J.Reed and S.A. Schneider

In Proceedings of REX Workshop. Vol. 600. LNCS. 1992.

[44]

Acyclic monotone normality

A. W. Roscoe and P. Moody

In Topology and its Applications. Vol. 47. Pages 53−67. 1992.

[45]

Occam in the specification and verification of microprocessors

A. W. Roscoe

In Phil Trans R. Soc. Lond A. Vol. 339. Pages 137−151. 1992.

Also in Mechanised Reasoning and Hardware Design‚ M.J.C. Gordon and C.A.R. Hoare‚ eds (Prentice−Hall‚ 1992)‚ extended version available at http://web.comlab.ox.ac.uk/oucl/work/bill.roscoe/publications/45ex.ps

[46]

A semantic model for occam II

A. W. Roscoe‚ M.H. Goldsmith and B.G.O. Scott

In Proceedings of Transputing. Vol. 93. 1991.

[47]

Denotational semantics for occam II

A. W. Roscoe‚ M.H. Goldsmith and B.G.O. Scott

No. PRG−108. Oxford University Computing Laboratory. 1993.

[48]

Developing and verifying protocols in CSP

A. W. Roscoe

In Proceedings of Mierlo workshop on protocols. TU Eindhoven. 1993.

[49]

Fixed points without completeness

A. W. Roscoe‚ M.W. Mislove and S.A. Schneider

In Theoretical Computer Science. Vol. 138. Chapter 2. Pages 273–314. 1993.

[50]

Model−checking CSP

A. W. Roscoe

In A Classical Mind: essays in Honour of C.A.R. Hoare. Chapter 21. Prentice−Hall. 1994.

[51]

A Classical Mind: essays in Honour of C.A.R. Hoare

A. W. Roscoe, editor

Prentice−Hall. 1994.

[52]

Denotational semantics for occam2‚ Part 1

A. W. Roscoe‚ M.H. Goldsmith and B.G.O. Scott

In Transputer Communications. Vol. 1 of 2. Pages 65–91. 1994.

[53]

Denotational semantics for occam2‚ Part 2

A. W. Roscoe‚ M.H. Goldsmith and B.G.O. Scott

In Transputer Communications. Vol. 2 of 1. Pages 25–67. 1994.

[54]

Non−interference through determinism

A. W. Roscoe‚ J.C.P. Woodcock and L. Wulf

In Proceedings of ESORICS 94. 1994.

[55]

Non−interference through determinism

A. W. Roscoe‚ J.C.P. Woodcock and L. Wulf

In Journal of Computer Security. Vol. 4 of 1. Pages 27–54. 1996.

revised version of above

[56]

CSP and determinism in security modelling

1996

In Proceedings of 1995 IEEE Symposium on Security and Privacy. IEEE Computer Society Press. 1996.

[57]

Composing and decomposing systems under security properties

A. W. Roscoe and L. Wulf

In Proceedings of 1995 IEEE Computer Security Foundations Workshop. IEEE Computer Society Press. 1995.

[58]

Modelling and verifying key−exchange protocols using CSP and FDR

A. W. Roscoe

In Proceedings of 1995 IEEE Computer Security Foundations Workshop. IEEE Computer Society Press. 1995.

[59]

Hierarchical compression for model−checking CSP‚ or How to check 10^20 dining philosophers for deadlock

A. W. Roscoe‚ D.M.Jackson P.H.B. Gardiner M.H. Goldsmith J.R. Hulance and J.B. Scattergood

In Proceedings of TACAS 1995. BRICS. 1995.

also revised in a version of these proceedings published by LNCS

[60]

The timed failures−stability model for Timed CSP

A. W. Roscoe and G.M. Reed

No. PRG−119. Oxford University Computing Laboratory. 1996.

also appeared in Theoretical Computer Science‚ Vol 211 (1999)

[61]

Intensional specifications of security protocols

A. W. Roscoe

In Proceedings of 1996 IEEE Computer Security Foundations Workshop. IEEE Computer Society Press. 1996.

[62]

On transition systems and non−well−founded sets

A. W. Roscoe and R.S. Lazic

In Annals of the New York Academiy of Sciences. Vol. 806. 1996.

[63]

The perfect spy for model−checking crypto−protocols

A. W. Roscoe and M.H. Goldsmith

In Proceedings of DIMACS workshop on the design and formal verification of crypto−protocols. 1997.

http://dimacs.rutgers.edu/workshops/program2/program.html

[64]

A Case Study of the Formal Specification of a Parallel System using CSP

A. W. Roscoe and S. Kiyamura

In S. Noguchi and M. Ota, editors, Correct Models of Parallel Computing. IOS Press. 1997.

[65]

Using CSP to detect errors in the TMN protocol

A. W. Roscoe and G. Lowe

University of Leicester. 1996.

and IEEE transactions on Software Engineering Vol 23 (1997)

[66]

Verifying Determinism of Concurrent Systems Which Use Unbounded Arrays

A. W. Roscoe and R. Lazic

In Proceedings of INFINITY'98. July, 1998.

extended version as Oxford University Computing Laboratory TR−2−98.

[67]

Proving security protocols with model checkers by data independence techniques

A. W. Roscoe

In Proceedings of CSFW 1998. IEEE Press. 1998.

[68]

The theory and practice of concurrency

A. W. Roscoe

Prentice Hall. 1998.

The text book teaching material can be found at http://www.comlab.ox.ac.uk/publications/books/concurrency/

[69]

What is intransitive noninterference?

A. W. Roscoe and M.H. Goldsmith

In Proceedings of CSFW 1999. IEEE Press. 1999.

[70]

Proving security protocols with model checkers by data independence techniques

A. W. Roscoe and P.J. Broadfoot

In Journal of Computer Security. Vol. 7. 1999.

[71]

Data independence with predicate symbols

A. W. Roscoe and R.S. Lazic

In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'99). Vol. I. CSREA Press. 1999.

[72]

Verifying an infinite family of inductions simultaneously using data independence and FDR

A. W. Roscoe and S.J. Creese

In Formal Methods for Protocol Engineering and Distributed Systems‚ the proceedings of Formal Description Techniques for Distributed Systems and Communication Protocols and Protocol Specification‚ Testing and Verification (FORTE/PSTV'99). Kluwer Academic Publishers. 1999.

[73]

Formal Verification of Arbitrary Network Topologies

A. W. Roscoe and S.J. Creese

In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'99). Vol. II. CSREA Press. 1999.

[74]

TTP: A case study in combining induction and data independence

A. W. Roscoe and S.J. Creese

No. PRG−TR−1−99. Oxford University Computing Laboratory. 1999.

[75]

Data independent induction over structured networks

A. W. Roscoe and S.J. Creese

In Proceedings of PDPTA2000. 2000.

[76]

Automating Data Independence

A. W. Roscoe‚ P.J. Broadfoot and G. Lowe

In Proceedings of ESORICS2000. Vol. 1895. LNCS. 2000.

[77]

Millennial Perspectives in Computer Science

A. W. Roscoe‚ J. Davies and J. Woodcock, editors

Palgrave. 2000.

[78]

The successes and failures of behavioural models

A. W. Roscoe‚ R. Forster and G.M. Reed

In Millennial Perspectives in Computer Science. Palgrave. 2000.

[79]

The Modelling and Analysis of Security Protocols

A. W. Roscoe‚ P. Ryan‚ S. Schneider‚ M. Goldsmith and G. Lowe

Addison−Wesley. 2001.

[81]

What can you Decide about Resetable Arrays?

A. W. Roscoe and R. S. Lazic

In Proceedings of VCL 2001. 2001.

[82]

Compiling Shared Variable Programs into CSP

A. W. Roscoe

In Proceedings of PROGRESS workshop 2001. 2001.

[83]

Internalising Agents in CSP Protocol Models

A. W. Roscoe and P. J. Broadfoot

In Proceedings of WITS 2002. 2002.

Extended Abstract

[84]

Capturing parallel attacks within the data independence framework

A. W. Roscoe and P. J. Broadfoot

In Proceedings of CSFW 15. IEEE Press. 2002.

[85]

On Model Checking Data−independent Systems with Arrays without Reset

A. W. Roscoe‚ R. S. Lazic and T. C. Newcomb

In Proceedings of VCL 2001. 2001.

[85]

On Model Checking Data−independent Systems with Arrays without Reset

A. W. Roscoe‚ R. S. Lazic and T. C. Newcomb

In Theory and Practice of Logic Programming. Vol. 4. No. 5 & 6. Pages 659−693. 2004.

[86]

Embedding agents within the intruder to detect parallel attacks

A. W. Roscoe and P.J. Broadfoot

In Journal of Computer Security. Vol. 12. No. 3−4. Pages 379−408. 2004.

[87]

Authentication in pervasive computing

A. W. Roscoe‚ S.J. Creese‚ M.H. Goldsmith and I.Zakiuddin

In Proceedings of the First International Conference on Security in Pervasive Computing. LNCS. March, 2003.

[87]

Formal Verification of Arbitrary Network Topologies

A.W. Roscoe S.J. Creese

In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'99). June, 1999.

[88]

Bisimulation and refinement reconciled

A. W. Roscoe‚ C.A.R. Hoare‚ C. Fournet‚ P.H.B. Gardiner‚ R. Milner‚ S.Rajamani and J. Rehof

Microsoft. 2003.

[89]

On the expressive power of CSP refinement

A. W. Roscoe

In Formal Aspects of Computing. Vol. 17 of 2. Pages 93–112. 2003.

Preliminary version in Proceedings of AVoCS03‚ Southampton University Technical Report‚ April 2003

[90]

Polymorphic systems with arrays: decidability and undecidability

A. W. Roscoe‚ R. S. Lazic and T. C. Newcomb

In Proceedings of South−East Europe Workshop on Formal Methods. August, 2003.

Extended abstract

[91]

Watchdog transformations for property−oriented model checking

A. W. Roscoe‚ M.H. Goldsmith‚ N.Moffat‚ T. Whitworth and I. Zakiuddin

In Proceedings of FME 2003. 2003.

[92]

The attacker in ubiquitous computing environments: formalising the threat model

A. W. Roscoe‚ S.J. Creese‚ M.H. Goldsmith and I.Zakiuddin

In Proceedings of FAST 2003‚ Pisa. 2003.

[93]

Translating CSP trace refinement to UNITY unreachability : a study in data independence

A. W. Roscoe‚ Xu Wang and R.S. Lazic

No. RR−03−08. Oxford University Computing Laboratory. April, 2003.

[94]

Compiling Statemate Statecharts into CSP and verifying them using FDR

A. W. Roscoe

January, 2003.

Extended Abstract

[95]

Seeing beyond divergence

A. W. Roscoe

In Communicating Sequential Processes‚ the first 25 years. No. 3525. Springer LNCS. 2005.

[96]

Finitary refinement checks for infinitary specifications

A. W. Roscoe

In Proceedings of CPA 2004. June, 2004.

[97]

Research directions for trust and security in human−centric computing

A. W. Roscoe‚ Sadie Creese‚ Michael Goldsmith and Irfan Zakiuddin

In Proceedings of SPPC 2004. 2004.

[98]

Responsiveness of Interoperating Components

A. W. Roscoe‚ J. N. Reed and J. E. Sinclair

In Formal Aspects of Computing. Vol. 16. Pages 394–411. 2004.

[99]

Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption

A. W. Roscoe‚ Xu Wang and R. S. Lazic

In Proceedings of IFM 2004. Vol. 2999. Springer LNCS. 2004.

[100]

Web Services Security: a preliminary study using Casper and FDR

A. W. Roscoe and E. Kleiner

In Proceedings of Automated Reasoning for Security Protocol Analysis (ARSPA 04). 2004.

[101]

Polymorphic Systems with Arrays‚ 2−Counter Machines and Multiset Rewriting

A. W. Roscoe‚ R. S. Lazic and Tom Newcomb

In Proceedings of INFINITY 2004. 2004.

[102]

On Model checking data−independent systems with arrays with whole−array operations

A. W. Roscoe‚ R. S. Lazic and Tom Newcomb

In Communicating Sequential Processes. No. 3525. Springer LNCS. 2005.

[103]

Exploiting Empirical Engagement in Authentication Protocol Design

A. W. Roscoe‚ Sadie Creese‚ Michael Goldsmith‚ Richard Harrison‚ Paul Whittaker and Irfan Zakiuddin

In Proceedings of SPPC 2005. 2005.

[104]

On the relationship between Web Services Security and traditional protocols

A. W. Roscoe and Eldar Kleiner

In Proceedings of MFPS 2005. 2005.

To appear.

[105]

Revivals‚stuckness and the hierarchy of CSP Models

A. W. Roscoe

December, 2008.

to appear (revision of 2005 and 2007 drafts)

[106]

The pursuit of buffer tolerance

A. W. Roscoe

May, 2005.

unpublished draft

[107]

Confluence thanks to extensional determinism

A. W. Roscoe

In Proceedings of Bertinoro meeting on Concurrency‚ BRICS 2005. May, 2005.

Revised version‚ publication reference ENTCS 1336‚ 2006

[108]

Security and trust for ubiquitous communication

A. W. Roscoe‚ Sadie Creese‚ Mike Reed and Jeff Sanders

In ITU WSIS Thematic Meeting on Cybersecurity‚ Geneva‚ Switzerland. June, 2005.

[109]

Machine−Verifiable Responsiveness

A. W. Roscoe‚ J. N Reed and J. E Sinclair

In Proceedings of AVOCS 2005. 2005.

[110]

Extending noninterference properties to the timed world

A. W. Roscoe and Jian Huang

In Proceedings of SAC 2006. 2006.

to appear

[111]

Bootstrapping Multi−Party Ad−Hoc Security

A. W. Roscoe‚ S. J. Creese‚ M. H. Goldsmith and Ming Xiao

In Proceedings of SAC 2006. 2006.

to appear

[112]

A taxonomy of web services using CSP

Lee Momtahan‚ Andrew Martin and A. W. Roscoe

No. RR−04−22. Oxford University Computing Laboratory. October, 2004.

[112]

A taxonomy of web services in CSP

A. W. Roscoe‚ A. Martin and L. Momtahan

In Proceedings of Web Languages and Formal Methods 2005. 2005.

[113]

Human−centred computer security

A. W. Roscoe

2006.

Unpublished draft

[114]

Modelling unbounded parallel sessions of security protocols in CSP

A. W. Roscoe and E. Kleiner

2006.

[115]

Verifying Statemate Statecharts Using CSP and FDR

A. W. Roscoe and Zhenzhong Wu

In Proceedings of ICFEM 2006. 2006.

scripts: http://web.comlab.ox.ac.uk/oucl/work/bill.roscoe/publications/115.csp; http://web.comlab.ox.ac.uk/oucl/work/bill.roscoe/publications/115statechartcompiler.csp

[116]

Efficient group authentication protocols based on human interaction

A. W. Roscoe and L. H. Nguyen

In Proceedings of ARSPA 2006. 2006.

[117]

Responsiveness and stable revivals

A. W. Roscoe‚ J. N. Reed and J. E. Sinclair

In Formal Aspects of Computing. Vol. 19. No. 3. August, 2007.

[118]

Nets with Tokens Which Carry Data

A. W. Roscoe‚ Ranko Lazic‚ Tom Newcomb‚ Joel Ouaknine and James Worrell

In Springer LNCS 3349. 2007.

[119]

SVA‚ a tool for analysing shared−variable programms

A. W. Roscoe and David Hopkins

In Proceedings of AVoCS 2007. Pages 177–183. 2007.

to appear

[120]

Authenticating ad hoc networks by comparison of short digests

A. W. Roscoe and L. H. Nguyen

In Information and Computation. Vol. 206. Pages 250−271. 2008.

[121]

The three Platonic models of divergence−strict CSP

A.W. Roscoe

In Proceedings of ICTAC '08. 2008.

[122]

Separating two roles of hashing in one−way message authentication

L.H. Nguyen and A.W. Roscoe

In Proceedings of FCS−ARSPA−WITS. 2008.

(This version is extended by appendices not present in proceedings.)

[124]

A representative function approach to symmetry exploitation for CSP refinement checking

N Moffat‚ M.H. Goldsmith and A.W. Roscoe

In Proceedings of IFCEM 2008. 2008.

[125]

On the expressiveness of CSP

A.W. Roscoe

2011.

Draft of February 2011‚ which is very different from previous draft (2008).

[126]

Authentication protocols based on low−bandwidth unspoofable channels: a comparative survey

L.H. Nguyen and A.W. Roscoe

In Journal of Computer Security. Vol. 19. 2011.

[127]

CSP is expressive enough for pi

A.W. Roscoe

2010.

[128]

New combinatorial bounds for universal hash functions

L.H. Nguyen and A.W. Roscoe

2009.

[129]

Usability and security of out−of−bound channels in secure device pairing protocols

I. Flechais R. Kainda and A.W. Roscoe

2009.

[130]

Local search in model checking

P.J. Armstrong A.W. Roscoe and Pragyesh

2009.

[131]

Insight‚ innovation and collaboration

C.B. Jones and A.W. Roscoe

2010.

[132]

Reflections on the work of C.A.R. Hoare

A.W. Roscoe C.B. Jones and K.R. Wood (editors)

Springer. 2010.

[133]

Secure and usable out−of−band channels for ad hoc mobile device interactions

Ronald Kainda‚ Ivan Flechais and A.W. Roscoe

2010.

[134]

Security and Usability: Analysis and Evaluation

Ronald Kainda‚ Ivan Flechais and A.W. Roscoe

2010.

[135]

Understanding Concurrent Systems

A.W. Roscoe

Springer. 2010.

[136]

A new bound for t−wise almost universal hash functions

L.H. Nguyen and A.W. Roscoe

No. RR−10−24. OUCL. November, 2010.

[137]

Reverse authentication in financial transactions

Chen Bangdao and A.W. Roscoe

2010.

In Proceedings of IWSSI/SPMU‚ Helsinki

[138]

The missing link: Human Interactive Security Protocols in mobile payment

L.H. Nguyen Chen Bangdao and A.W. Roscoe

2010.

In Proceedings of 5th International Workshop on Security‚ Kobe‚ Japan

[139]

Mobile Electronic Identity: Securing Payment on Mobile Phones

Chen Bangdao and A.W. Roscoe

2011.

Proceedings of WISTP 2011