Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/wait-free-linearization-with-a-mechanical-proof-VYDL9Zxe33
References (32)
-
M. Gordon (1988)
HOL: A Proof Generating System for Higher-Order Logic -
EW Dijkstra (1968)
Programming languages -
J. Rushby, F. Henke (1991)
Formal verification of algorithms for critical systemsIEEE Trans. Software Eng., 19
-
K. Chandy, J. Misra (1988)
Parallel program design - a foundation -
(1968)
Programming languages (NATO Advanced Study Institute) -
C. Hoare (1986)
Notes on Communicating Sequential Systems -
W. Hunt (1994)
FM8501: A Verified Microprocessor, 795
-
M. Herlihy (1988)
Impossibility and universality results for wait-free synchronization -
Moore Strother (1992)
A Formal Model of Asynchronous Communication and Its Use in Mechanically Verifying a Biphase Mark ProtocolFormal Aspects of Computing, 6
-
J. Misra (1991)
Loosely-coupled processesFuture Gener. Comput. Syst., 8
-
Robert Kowalski (1999)
Computational Logic, 9
-
R. Back, K. Sere (1989)
Stepwise Refinement of Action SystemsStruct. Program., 12
-
S. Owicki, D. Gries (1976)
An axiomatic proof technique for parallel programs IActa Informatica, 6
-
Rahim Ramezanian (1978)
Communicating sequential processesCommun. ACM, 21
-
M. Herlihy, Jeannette Wing (1990)
Linearizability: a correctness condition for concurrent objectsACM Trans. Program. Lang. Syst., 12
-
M. Herlihy (1990)
A methodology for implementing highly concurrent data structures -
W. Hesselink (1994)
Wait-free linearization with an assertional proofDistributed Computing, 8
-
J. Baeten (1990)
Applications of process algebra -
R. Boyer, J. Moore (1979)
A computational logic handbook, 23
-
RJR Back, K Sere (1989)
Mathematics of program construction -
P. Lindsay (1988)
A survey of mechanical support for formal reasoningSoftw. Eng. J., 3
-
F. Hopgood, B. Meltzer, Donald Michie (1972)
Machine Intelligence 6The Mathematical Gazette, 56
-
James Anderson, B. Groselj (1992)
Beyond Atomic Registers: Bounded Wait-Free Implementations of Nontrivial ObjectsSci. Comput. Program., 19
-
K. Chandy (1989)
Parallel program design -
E. Ashcroft, Z. Manna (1970)
Formalization of properties of parallel programsAi Magazine
-
K. Apt, E. Olderog (1997)
Verification of Sequential and Concurrent Programs -
E. Dijkstra (1968)
Co-operating sequential processes -
M. Herlihy (1991)
Wait-free synchronizationACM Trans. Program. Lang. Syst., 13
-
W. Bevier, W. Hunt, J. Moore, W. Young (1989)
An approach to systems verificationJournal of Automated Reasoning, 5
-
Serge Plotkin (1989)
Sticky bits and universality of consensus -
C. Koomen (1991)
Calculus of Communicating Systems -
DM Russinoff (1992)
A verification system for concurrent programs based on the Boyer-Moore proverFormal Asp Comput, 4
- Publisher
- Springer Journals
- Copyright
- Copyright © 1995 by Springer-Verlag
- Subject
- Computer Science; Computer Communication Networks; Computer Hardware; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Theory of Computation
- ISSN
- 0178-2770
- eISSN
- 1432-0452
- DOI
- 10.1007/BF01784240
- Publisher site
- See Article on Publisher Site
Abstract
The correctness of a program for wait-free linearization ofan arbitrary shared data object in bounded memory is verified mechanically. The program uses atomic read-write registers, an array of consensus registers and one compare and swap register. In the program, a number of processes concurrently inspect and modify a pointer structure without waiting. Consequently, the proof of correctness is very delicate. The theorem prover NQTHM of Boyer and Moore has been used to mechanically certify the correctress.
Journal
Distributed Computing – Springer Journals
Published: May 11, 2005