Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
45
views
14
references
Top references
cited by
25
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,444
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Mathematics of Program Construction
Proving Pointer Programs in Hoare Logic
other
Author(s):
Richard Bornat
Publication date
(Print):
2000
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Most cited references
14
Record
: found
Abstract
: not found
Article
: not found
An axiomatic basis for computer programming
C. Hoare
(1969)
0
comments
Cited
370
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
An axiomatic definition of the programming language PASCAL
C. Hoare
,
N. Wirth
(1973)
0
comments
Cited
19
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
An efficient machine-independent procedure for garbage collection in various list structures
W. M. Waite
,
H Schorr
(1967)
0
comments
Cited
13
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2000
Pages
: 102-126
DOI:
10.1007/10722010_8
SO-VID:
76591cb5-0e56-4d1d-8409-6355c2d446a4
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 102
Proving Pointer Programs in Hoare Logic
pp. 230
A Metalanguage for Programming with Bound Names Modulo Renaming
Similar content
3,444
Selections from the Prison Notebook, edited and translated by Quintin Hoare & Goffrey Nowell Smith
Authors:
A. GRAMSCI
Depth-hoar crystal growth in the surface layer under high temperature gradient
Authors:
Takuya Fukuzawa
,
Eizi Akitaya
,
Fukuzawa
Hoare Logic for NanoJava: Auxiliary Variables, Side Effects, and Virtual Methods Revisited
Authors:
David von Oheimb
,
Tobias Nipkow
See all similar
Cited by
25
Local Reasoning about Programs that Alter Data Structures
Authors:
Peter O’Hearn
,
John Reynolds
,
Hongseok Yang
The Why/Krakatoa/Caduceus Platform for Deductive Program Verification
Authors:
Jean-Christophe Filliâtre
,
Claude Marche
Frama-C
Authors:
Pascal Cuoq
,
Florent Kirchner
,
Nikolai Kosmatov
…
See all cited by