An assertional criterion for atomicity

Acta Informatica

Volumn 38, Issue 5, 2002, Pages 343-366

  Hesselink, Wim H ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ATOMIC REGISTER; MECHANICAL THEOREMS;

THEOREM PROVING;

EID: 23044533235     PISSN: 00015903     EISSN: 14320525     Source Type: Journal    
DOI: 10.1007/s002360200080     Document Type: Article

References (24)

1. Abadi M., Lamport, L.: The existence of refinement mappings. Theoretical Computer Science 82, 253-284 (1991)
2. Apt, K.R., Olderog, E.-R.: Verification of Sequential and Concurrent Programs. Berlin Heidelberg New York: Springer 1991
3. Bloom, B.: Constructing two-writer atomic registers. IEEE Transactions on Computers 37, 1506-1514 (1988)
4. Boyer, R.S., Moore, J S.: A Computational Logic Handbook. Boston: Academic Press 1988
5. Boyer, R.S., Moore, J S.: A Computational Logic Handbook, Authorized Excerpts from a Proposed Second Edition, to be obtained by ftp from Computational Logic Inc. Information available at nqthm-request@cli.com
6. Clint, M.: Program proving: coroutines. Acta Informatica 2, 50-63 (1973)
7. Dijkstra, E.W.: Co-operating sequential processes. In: F. Genuys (ed.): Programming Languages (NATO Advanced Study Institute) pp. 43-112. London: Academic Press 1968
8. Feijen, W.H.J., Gasteren, A.J.M. van: On a method of multiprogramming. New York: Springer 1999
9. Francez, N.: Fairness. Berlin Heidelberg New York: Springer 1986
10. Groote, J.F.: We moeten software leren beheersen. Inaugural Address, University of Eindhoven, 1999
11. Herlihy, M.P.: Wait-free synchronization. ACM Trans. on Program. Languages and Systems 13, 124-149 (1991)
12. Herlihy M.P., Wing J.: Linearizability: A Correctness Condition for Concurrent Objects. ACM Trans. on Program. Languages and Systems 12, 463-492 (1990)
13. Hesselink, W.H.: Wait-free linearization with a mechanical proof. Distrib Comput 9, 21-36 (1995)
14. Hesselink, W.H.: Theories for mechanical proofs of imperative programs. Formal Aspects of Computing 9, 448-468 (1997)
15. Hesselink, W.H.: Invariants for the construction of a handshake register. Information Processing Letters 68, 173-177 (1998)
16. Hesselink, W.H.: www.cs.rug.nl/~wim/mechver/imperative/, the NQTHM events files concprelude, bloom, and vitanyi
17. Lamport, L.: How to make a multiprocessor computer that correctly executes multi-process programs. IEEE Trans. Computers 28, 690-691 (1979)
18. Lamport, L.: On interprocess communication, Parts I and II. Distrib. Comput. 1, 77-101 (1986)
19. Lamport, L.: How to make a correct multiprocess program execute correctly on a multiprocessor. IEEE Trans. Computers 46, 779-782 (1997)
20. Lynch, N.A.: Distributed Algorithms. San Francisco: Morgan Kaufman 1996
21. Owicki, S., Gries, D.: An axiomatic proof technique for parallel programs. Acta Informatica 6, 319-340 (1976)
22. Papadimitriou, C.H.: The serializability of concurrent database updates. J. ACM 26, 631-653 (1979)
23. Tromp, J.: How to construct an atomic variable. In: J.-C. Bermond, M. Raynal (Eds.): Distributed Algorithms, Proceedings Nice. Lecture Notes in Comput. Sci., Vol. 392, pp. 292-302. Berlin: Springer 1989
24. Vitányi, P.M.B., Awerbuch, B.: Atomic shared register access by asynchronous hardware. In 27th Annual Symposium on Foundations of Computer Science, pages 233-243, Toronto, Ontario, Canada, 1986. IEEE, Los Alamitos, Calif. Corrigendum in 28th Annual Symposium on Foundations of Computer Science, page 487, Los Angeles, 1987