Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
4
views
12
references
Top references
cited by
3
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,336
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Mathematics of Program Construction : 375th Anniversary of the Groningen University International Conference Groningen, The Netherlands, June 26–30, 1989 Proceedings
Towards a calculus of data refinement
other
Author(s):
Wei Chen
,
Jan Tijmen Udding
Publication date
(Online):
June 1 2005
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
On Research Data Publishing
Most cited references
12
Record
: found
Abstract
: not found
Article
: not found
Proof of correctness of data representations
C. Hoare
(1972)
0
comments
Cited
100
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
An axiomatic proof technique for parallel programs I
David Gries
,
Susan Owicki
(1976)
0
comments
Cited
85
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Program development by stepwise refinement
Niklaus Wirth
(1971)
0
comments
Cited
81
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1989
Publication date (Online):
June 1 2005
Pages
: 197-218
DOI:
10.1007/3-540-51305-1_11
SO-VID:
47a34823-df93-4037-a6e3-a05dcbebca4f
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
A formal approach to large SOFTWARE CONSTRUCTION
pp. 21
Mathematics of program construction applied to analog neural networks
pp. 36
Termination is timing
pp. 48
Towards totally verified systems
pp. 66
Constructing a calculus of programs
pp. 91
Specifications of concurrently accessed data
pp. 115
Stepwise refinement of action systems
pp. 139
A lattice-theoretical basis for a specification language
pp. 157
Transformational programming and forests
pp. 174
Networks of communicating processes and their (De-)composition
pp. 197
Towards a calculus of data refinement
pp. 219
Stepwise refinement and concurrency: A small exercise
pp. 239
Deriving mixed evaluation from standard evaluation for a simple functional language
pp. 256
Realizability models for program construction
pp. 273
Initialisation with a final value, an exercise in program transformation
pp. 281
A derivation of a systolic rank order filter with constant response time
pp. 297
Searching by elimination
pp. 307
The projection of systolic programs
pp. 325
The formal construction of a parallel triangular system solver
pp. 335
Homomorphisms and promotability
pp. 348
Applicative assertions
pp. 363
Types and invariants in the refinement calculus
pp. 379
Algorithm theories and design tactics
pp. 399
A categorical approach to the theory of lists
pp. 409
Rabbitcounrt :=Rabbitcount — 1
Similar content
3,336
Using privacy calculus theory to explore entrepreneurial directions in mobile location-based advertising: Identifying intrusiveness as the critical risk factor
Authors:
Anabel Gutierrez
,
Simon O'Leary
,
Nripendra Rana
…
Algebraic complete axiomatisation of ZX-calculus with a norm form via elementary matrix operations
Authors:
Quanlong Wang
Fractional Versions of the Fundamental Theorem of Calculus
Authors:
Eliana Grigoletto
,
Edmundo Capelas de Oliveira
,
E. GRIGOLETTO
…
See all similar
Cited by
3
Algorithmic bias in data-driven innovation in the age of AI
Authors:
Shahriar Akter
,
Grace McCarthy
,
Shahriar Sajib
…
Refinement calculus, part I: Sequential nondeterministic programs
Authors:
R. J. R. Back
,
J. Wright
Reference
Authors:
Eric C. R. Hehner
See all cited by