Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An assertional correctness proof of a distributed algorithm

From MaRDI portal
Publication:1051413
Jump to:navigation, search

DOI10.1016/0167-6423(83)90014-XzbMath0514.68014MaRDI QIDQ1051413

Leslie Lamport

Publication date: 1982

Published in: Science of Computer Programming (Search for Journal in Brave)


zbMATH Keywords

assertional methods for concurrent program verificationcorrectness of a distributed algorithm


Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)


Related Items (7)

Distributed termination on a ring ⋮ Concurrent maintenance of rings ⋮ Maintaining the Ranch topology ⋮ Specifying modules to satisfy interfaces: A state transition system approach ⋮ Simplification of boolean verification conditions ⋮ Factorizing fault tolerance. ⋮ An assertional proof of Rana's algorithm







This page was built for publication: An assertional correctness proof of a distributed algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1051413&oldid=13066225"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 23:16.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki