#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1976

2015

- This year (0)
- Last 5 years (1)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission between threads,â€¦ (More)

- Richard Bornat
- MPC
- 2000

It is possible, but difficult, to reason in Hoare logic about programs which address and modify data structures defined by pointers. The challenge is to approach the simplicity of Hoare logicâ€™sâ€¦ (More)

Learning to program is notoriously difficult. A substantial minority of students fails in every introductory programming course in every UK university. Despite heroic academic effort, the proportionâ€¦ (More)

- Matthew J. Parkinson, Richard Bornat, Cristiano Calcagno
- 21st Annual IEEE Symposium on Logic in Computerâ€¦
- 2006

Hoare logic is bedevilled by complex but coarse side conditions on the use of variables. We define a logic, free of side conditions, which permits more precise statements of a program's use ofâ€¦ (More)

- Richard Bornat, Cristiano Calcagno, Hongseok Yang
- Electr. Notes Theor. Comput. Sci.
- 2006

Separation logic [20,21,14] began life as an extended formalisation of Burstallâ€™s treatment of list-mutating programs [8]. It rapidly became clear that there was more that it could say: Oâ€™Hearnâ€™sâ€¦ (More)

This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algorithm, which providesâ€¦ (More)

We propose a novel approach to proving the termination of heap-manipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system.Judgements in this systemâ€¦ (More)

- Richard Bornat, Saeed Dehnadi, Simon
- ACE '08
- 2008

Learning to program is notoriously difficult. Substantial failure rates plague introductory programming courses the world over, and have increased rather than decreased over the years. Despite aâ€¦ (More)

- Richard Bornat, Bernard Sufrin
- Comput. J.
- 1999

Jape is a program which supports the step-by-step interactive development of proofs in formal logics, in the style of proofs-on-paper. It is uncommitted to any particular logic and is customized by aâ€¦ (More)

- Richard Bornat, Cristiano Calcagno, Peter Oâ€™Hearn
- 2003

Structures built by pointer aliasing, such as DAGs and graphs, are notoriously tricky to deal with. The mechanisms of separation logic can deal with these structures, but so far this has been done byâ€¦ (More)