Skip to main content
Conference Proceedings

Verification and specification of concurrent programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 803 LNCS 347-374
DOI: 10.1007/3-540-58043-3_23
20Citations
Citations of this article
47Readers
Mendeley users who have this article in their library.
Get full text

Abstract

I explore the history of, and lessons learned from, eighteen years of assertional methods for specifying and verifying concurrent programs. I then propose a Utopian future in which mathematics prevails.

Author supplied keywords

Cite

CITATION STYLE

APA

Lamport, L. (1994). Verification and specification of concurrent programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 803 LNCS, pp. 347–374). Springer Verlag. https://doi.org/10.1007/3-540-58043-3_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free