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
20
views
3
references
Top references
cited by
1
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,030
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
Specifications of concurrently accessed data
other
Author(s):
Jayadev Misra
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
3
Record
: found
Abstract
: not found
Article
: not found
Abstract data types and the development of data structures
John V. Guttag
(1977)
0
comments
Cited
15
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Parallel Program Design: A Foundation
K.M. Chandy
,
K. G. Chandy
,
K.M. Chandy
…
(1988)
0
comments
Cited
10
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Verifying Concurrent Processes Using Temporal Logic
Brent T. Hailpern
(1982)
0
comments
Cited
3
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1989
Publication date (Online):
June 1 2005
Pages
: 91-114
DOI:
10.1007/3-540-51305-1_6
SO-VID:
28f02ff9-1f59-4247-8f9c-e001af90768a
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,030
Are Lock-Free Concurrent Algorithms Practically Wait-Free?
Authors:
Nir Shavit
,
Keren Censor-Hillel
,
Dan Alistarh
Sertoli-Leydig Cell Tumor with Concurrent Rhabdomyosarcoma: Three Case Reports and a Review of the Literature
Authors:
Trisha Plastini
,
Arthur Staddon
Reliable Cybertwin-Driven Concurrent Multipath Transfer With Deep Reinforcement Learning
Authors:
Chengxiao Yu
,
Wei Quan
,
Deyun Gao
…
See all similar
Cited by
1
Refinement calculus, part II: Parallel and reactive programs
Authors:
R. J. R. Back
See all cited by