|
Search the dblp DataBase
Keith Wansbrough:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Keith Wansbrough, John Hamer
A Modular Monadic Action Semantics. [Citation Graph (0, 0)][DBLP] DSL, 1997, pp:- [Conf]
- Keith Wansbrough, Michael Norrish, Peter Sewell, Andrei Serjantov
Timing UDP: Mechanized Semantics for Sockets, Threads, and Failures. [Citation Graph (0, 0)][DBLP] ESOP, 2002, pp:278-294 [Conf]
- Gavin M. Bierman, Michael W. Hicks, Peter Sewell, Gareth Stoyle, Keith Wansbrough
Dynamic rebinding for marshalling and update, with destruct-time? [Citation Graph (0, 0)][DBLP] ICFP, 2003, pp:99-110 [Conf]
- James J. Leifer, Gilles Peskine, Peter Sewell, Keith Wansbrough
Global abstraction-safe marshalling with hash types. [Citation Graph (0, 0)][DBLP] ICFP, 2003, pp:87-98 [Conf]
- Peter Sewell, James J. Leifer, Keith Wansbrough, Francesco Zappa Nardelli, Mair Allen-Williams, Pierre Habouzit, Viktor Vafeiadis
Acute: high-level programming language design for distributed computation. [Citation Graph (0, 0)][DBLP] ICFP, 2005, pp:15-26 [Conf]
- Steve Bishop, Matthew Fairbairn, Michael Norrish, Peter Sewell, Michael Smith, Keith Wansbrough
Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations. [Citation Graph (0, 0)][DBLP] POPL, 2006, pp:55-66 [Conf]
- Keith Wansbrough, Simon L. Peyton Jones
Once Upon a Polymorphic Type. [Citation Graph (0, 0)][DBLP] POPL, 1999, pp:15-28 [Conf]
- Steve Bishop, Matthew Fairbairn, Michael Norrish, Peter Sewell, Michael Smith, Keith Wansbrough
Rigorous specification and conformance testing techniques for network protocols, as applied to TCP, UDP, and sockets. [Citation Graph (0, 0)][DBLP] SIGCOMM, 2005, pp:265-276 [Conf]
- Andrei Serjantov, Peter Sewell, Keith Wansbrough
The UDP Calculus: Rigorous Semantics for Real Networking. [Citation Graph (0, 0)][DBLP] TACS, 2001, pp:535-559 [Conf]
Rigour is good for you and feasible: reflections on formal treatments of C and UDP sockets. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
|