| |
A. William Roscoe, Bill Roscoe
List of publications from the DBLP Bibliography Server - FAQ
| * | 2009 | |
|---|---|---|
| 66 | EE | A. W. Roscoe, P. J. Armstrong, Pragyesh: Local Search in Model Checking. ATVA 2009: 22-38 |
| 65 | EE | Ronald Kainda, Ivan Flechais, A. W. Roscoe: Usability and security of out-of-band channels in secure device pairing protocols. SOUPS 2009 |
| 2008 | ||
| 64 | EE | Nick Moffat, Michael Goldsmith, Bill Roscoe: A Representative Function Approach to Symmetry Exploitation for CSP Refinement Checking. ICFEM 2008: 258-277 |
| 63 | EE | A. W. Roscoe: The Three Platonic Models of Divergence-Strict CSP. ICTAC 2008: 23-49 |
| 62 | EE | Ranko Lazic, Tom Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell: Nets with Tokens which Carry Data. Fundam. Inform. 88(3): 251-274 (2008) |
| 61 | EE | L. H. Nguyen, A. W. Roscoe: Authenticating ad hoc networks by comparison of short digests. Inf. Comput. 206(2-4): 250-271 (2008) |
| 2007 | ||
| 60 | EE | Ranko Lazic, Thomas Christopher Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell: Nets with Tokens Which Carry Data. ICATPN 2007: 301-320 |
| 59 | EE | Joy N. Reed, A. W. Roscoe, J. E. Sinclair: Responsiveness and stable revivals. Formal Asp. Comput. 19(3): 303-319 (2007) |
| 2006 | ||
| 58 | EE | A. W. Roscoe, Zhenzhong Wu: Verifying Statemate Statecharts Using CSP and FDR. ICFEM 2006: 324-341 |
| 57 | EE | Sadie Creese, Michael Goldsmith, Bill Roscoe, Ming Xiao: Bootstrapping multi-party ad-hoc security. SAC 2006: 369-375 |
| 56 | EE | Jian Huang, A. W. Roscoe: Extending noninterference properties to the timed world. SAC 2006: 376-383 |
| 55 | EE | Joy N. Reed, A. W. Roscoe, Jane Sinclair: Machine-Verifiable Responsiveness. Electr. Notes Theor. Comput. Sci. 145: 185-200 (2006) |
| 54 | EE | Lee Momtahan, Andrew Martin, A. W. Roscoe: A Taxonomy of Web Services Using CSP. Electr. Notes Theor. Comput. Sci. 151(2): 71-87 (2006) |
| 53 | EE | E. Kleiner, A. W. Roscoe: On the Relationship Between Web Services Security and Traditional Protocols. Electr. Notes Theor. Comput. Sci. 155: 583-603 (2006) |
| 52 | EE | A. W. Roscoe: Confluence Thanks to Extensional Determinism. Electr. Notes Theor. Comput. Sci. 162: 305-309 (2006) |
| 2005 | ||
| 51 | EE | Sadie Creese, Michael Goldsmith, Richard Harrison, Bill Roscoe, Paul Whittaker, Irfan Zakiuddin: Exploiting Empirical Engagement in Authentication Protocol Design. SPC 2005: 119-133 |
| 50 | EE | Ranko Lazic, Thomas Christopher Newcomb, Bill Roscoe: Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting. Electr. Notes Theor. Comput. Sci. 138(3): 61-86 (2005) |
| 49 | EE | A. W. Roscoe: On the expressive power of CSP refinement. Formal Asp. Comput. 17(2): 93-112 (2005) |
| 2004 | ||
| 48 | EE | A. W. Roscoe: Seeing Beyond Divergence. 25 Years Communicating Sequential Processes 2004: 15-35 |
| 47 | EE | Ranko Lazic, Thomas Christopher Newcomb, A. W. Roscoe: On Model Checking Data-Independent Systems with Arrays with Whole-Array Operations. 25 Years Communicating Sequential Processes 2004: 275-291 |
| 46 | EE | Xu Wang, A. W. Roscoe, Ranko Lazic: Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption. IFM 2004: 247-266 |
| 45 | EE | Joy N. Reed, J. E. Sinclair, A. W. Roscoe: Responsiveness of interoperating components. Formal Asp. Comput. 16(4): 394-411 (2004) |
| 44 | Philippa J. Broadfoot, A. W. Roscoe: Embedding agents within the intruder to detect parallel attacks. Journal of Computer Security 12(3-4): 379-408 (2004) | |
| 43 | Ranko Lazic, Thomas Christopher Newcomb, A. W. Roscoe: On model checking data-independent systems with arrays without reset. TPLP 4(5-6): 659-693 (2004) | |
| 2003 | ||
| 42 | EE | Michael Goldsmith, Nick Moffat, Bill Roscoe, Tim Whitworth, Irfan Zakiuddin: Watchdog Transformations for Property-Oriented Model-Checking. FME 2003: 600-616 |
| 41 | EE | Sadie Creese, Michael Goldsmith, Bill Roscoe, Irfan Zakiuddin: Authentication for Pervasive Computing. SPC 2003: 116-129 |
| 2002 | ||
| 40 | EE | Philippa J. Broadfoot, A. W. Roscoe: Capturing Parallel Attacks within the Data Independence Framework. CSFW 2002: 147-159 |
| 2000 | ||
| 39 | EE | Philippa J. Broadfoot, Gavin Lowe, A. W. Roscoe: Automating Data Independence. ESORICS 2000: 175-190 |
| 38 | S. J. Creese, A. W. Roscoe: Data Independent Induction over Structured Networks. PDPTA 2000 | |
| 37 | Philippa J. Broadfoot, A. W. Roscoe: Tutorial on FDR and Its Applications. SPIN 2000: 322 | |
| 36 | EE | A. W. Roscoe, Philippa J. Broadfoot, Gavin Lowe: Data independent verification of crypto-protocols. Electr. Notes Theor. Comput. Sci. 40: (2000) |
| 1999 | ||
| 35 | EE | A. W. Roscoe, M. H. Goldsmith: What Is Intransitive Noninterference? CSFW 1999: 228-238 |
| 34 | S. J. Creese, A. W. Roscoe: Verifying an infinite family of inductions simultaneously using data independence and FDR. FORTE 1999: 437-452 | |
| 33 | S. J. Creese, A. W. Roscoe: Formal Verification of Arbitrary Network Topologies. PDPTA 1999: 1033-1039 | |
| 32 | Ranko Lazic, Bill Roscoe: Data Independence with Generalised Predicate Symbols. PDPTA 1999: 319-326 | |
| 31 | A. W. Roscoe, Philippa J. Broadfoot: Proving Security Protocols with Model Checkers by Data Independence Techniques. Journal of Computer Security 7(1): (1999) | |
| 30 | EE | George M. Reed, A. W. Roscoe: The Timed Failures-Stability Model for CSP. Theor. Comput. Sci. 211(1-2): 85-127 (1999) |
| 1998 | ||
| 29 | EE | A. W. Roscoe: Proving Security Protocols with Model Checkers by Data Independence Techniques. CSFW 1998: 84-95 |
| 1997 | ||
| 28 | EE | Gavin Lowe, A. W. Roscoe: Using CSP to Detect Errors in the TMN Protocol. IEEE Trans. Software Eng. 23(10): 659-669 (1997) |
| 1996 | ||
| 27 | EE | A. W. Roscoe: Intensional specifications of security protocols. CSFW 1996: 28-38 |
| 26 | A. W. Roscoe, Jim Woodcock, L. Wulf: Non-interference through Determinism. Journal of Computer Security 4(1): 27-54 (1996) | |
| 1995 | ||
| 25 | EE | A. W. Roscoe, L. Wulf: Composing and decomposing systems under security properties. CSFW 1995: 9-15 |
| 24 | EE | A. W. Roscoe: Modelling and verifying key-exchange protocols using CSP and FDR. CSFW 1995: 98-107 |
| 23 | A. W. Roscoe, Paul H. B. Gardiner, Michael Goldsmith, J. R. Hulance, D. M. Jackson, J. B. Scattergood: Hierarchical Compression for Model-Checking CSP or How to Check 1020 Dining Philosophers for Deadlock. TACAS 1995: 133-152 | |
| 22 | EE | Michael W. Mislove, A. W. Roscoe, Steve Schneider: Fixed Points Without Completeness. Theor. Comput. Sci. 138(2): 273-314 (1995) |
| 1994 | ||
| 21 | EE | A. W. Roscoe, Jim Woodcock, L. Wulf: Non-Interference Through Determinism. ESORICS 1994: 33-53 |
| 1993 | ||
| 20 | A. W. Roscoe: Unbounded Non-Determinism in CSP. J. Log. Comput. 3(2): 131-172 (1993) | |
| 1992 | ||
| 19 | A. W. Roscoe: An Alternative Order for the Failures Model. J. Log. Comput. 2(5): 557-577 (1992) | |
| 1991 | ||
| 18 | EE | Steve Schneider, Jim Davies, D. M. Jackson, George M. Reed, Joy N. Reed, A. W. Roscoe: Timed CSP: Theory and Practice. REX Workshop 1991: 640-675 |
| 17 | Stephen D. Brookes, A. W. Roscoe: Deadlock Analysis in Networks of Communicating Processes. Distributed Computing 4: 209-230 (1991) | |
| 1989 | ||
| 16 | EE | George M. Reed, A. W. Roscoe: Analysing TMFS: a Study of Nondeterminism in Real-Time Concurrency. Concurrency: Theory, Language, And Architecture 1989: 36-63 |
| 15 | EE | A. W. Roscoe, Geoff Barrett: Unbounded Nondeterminism in CSP. Mathematical Foundations of Programming Semantics 1989: 160-193 |
| 1988 | ||
| 14 | T. Yung Kong, David M. Mount, A. W. Roscoe: The Decomposition of a Rectangle into Rectangles of Minimal Perimeter. SIAM J. Comput. 17(6): 1215-1231 (1988) | |
| 13 | George M. Reed, A. W. Roscoe: A Timed Model for Communicating Sequential Processes. Theor. Comput. Sci. 58: 249-261 (1988) | |
| 12 | A. W. Roscoe, C. A. R. Hoare: The Laws of Occam Programming. Theor. Comput. Sci. 60: 177-229 (1988) | |
| 1987 | ||
| 11 | EE | George M. Reed, A. W. Roscoe: Metric Spaces as Models for Real-Time Concurrency. MFPS 1987: 331-343 |
| 10 | C. A. R. Hoare, Ian J. Hayes, Jifeng He, Carroll Morgan, A. W. Roscoe, Jeff W. Sanders, Ib Holm Sørensen, J. Michael Spivey, Bernard Sufrin: Laws of Programming. Commun. ACM 30(8): 672-686 (1987) | |
| 9 | A. W. Roscoe, Naiem Dathi: The Pursuit of Deadlock freedom Inf. Comput. 75(3): 289-327 (1987) | |
| 1986 | ||
| 8 | EE | George M. Reed, A. W. Roscoe: A Timed Model for Communicating Sequential Processes. ICALP 1986: 314-323 |
| 1985 | ||
| 7 | Stephen D. Brookes, A. W. Roscoe, Glynn Winskel: Seminar on Concurrency, Carnegie-Mellon University, Pittsburg, PA, USA, July 9-11, 1984 Springer 1985 | |
| 1984 | ||
| 6 | C. A. R. Hoare, A. W. Roscoe: Programs as Executable Predicates. FGCS 1984: 220-228 | |
| 5 | EE | Stephen D. Brookes, A. W. Roscoe: An Improved Failures Model for Communicating Processes. Seminar on Concurrency 1984: 281-305 |
| 4 | EE | A. W. Roscoe: Denotational Semantics for occam. Seminar on Concurrency 1984: 306-329 |
| 3 | EE | Stephen D. Brookes, C. A. R. Hoare, A. W. Roscoe: A Theory of Communicating Sequential Processes. J. ACM 31(3): 560-599 (1984) |
| 1983 | ||
| 2 | A. W. Roscoe: Specifying problem one using the failure sets model for CSP and deriving CSP processes which meett this specification. The Analysis of Concurrent Systems 1983: 103-109 | |
| 1 | A. W. Roscoe: A CSP solution to the "trains" problem. The Analysis of Concurrent Systems 1983: 384-388 | |