Reduction: A Method of Proving Properties of Parallel Programs.
Saved in:
| Title: | Reduction: A Method of Proving Properties of Parallel Programs. |
|---|---|
| Authors: | Lipton, Richard J.1 |
| Source: | Communications of the ACM. Dec1975, Vol. 18 Issue 12, p717-721. 5p. |
| Subjects: | Parallel programming, Computer programming, Parallel logic programming, Programming languages, Computational linguistics, Information theory, Logic programming, Artificial languages, Computer software |
| Abstract: | When proving that a parallel program has a given property it is often convenient to assume that a statement is indivisible, i.e. that the statement cannot be interleaved with the rest of the program. Here sufficient conditions are obtained to show that the assumption that a statement is indivisible can be relaxed and still preserve properties such as halting. Thus correctness proofs of a parallel system can often be greatly simplified. [ABSTRACT FROM AUTHOR] |
| Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 5206829 AccessLevel: 6 PubType: Periodical PubTypeId: serialPeriodical PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Reduction: A Method of Proving Properties of Parallel Programs. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Lipton%2C+Richard+J%2E%22">Lipton, Richard J.</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Dec1975, Vol. 18 Issue 12, p717-721. 5p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Parallel+programming%22">Parallel programming</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programming%22">Computer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Parallel+logic+programming%22">Parallel logic programming</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+linguistics%22">Computational linguistics</searchLink><br /><searchLink fieldCode="DE" term="%22Information+theory%22">Information theory</searchLink><br /><searchLink fieldCode="DE" term="%22Logic+programming%22">Logic programming</searchLink><br /><searchLink fieldCode="DE" term="%22Artificial+languages%22">Artificial languages</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+software%22">Computer software</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: When proving that a parallel program has a given property it is often convenient to assume that a statement is indivisible, i.e. that the statement cannot be interleaved with the rest of the program. Here sufficient conditions are obtained to show that the assumption that a statement is indivisible can be relaxed and still preserve properties such as halting. Thus correctness proofs of a parallel system can often be greatly simplified. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=5206829 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1145/361227.361234 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 5 StartPage: 717 Subjects: – SubjectFull: Parallel programming Type: general – SubjectFull: Computer programming Type: general – SubjectFull: Parallel logic programming Type: general – SubjectFull: Programming languages Type: general – SubjectFull: Computational linguistics Type: general – SubjectFull: Information theory Type: general – SubjectFull: Logic programming Type: general – SubjectFull: Artificial languages Type: general – SubjectFull: Computer software Type: general Titles: – TitleFull: Reduction: A Method of Proving Properties of Parallel Programs. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Lipton, Richard J. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 12 Text: Dec1975 Type: published Y: 1975 Identifiers: – Type: issn-print Value: 00010782 Numbering: – Type: volume Value: 18 – Type: issue Value: 12 Titles: – TitleFull: Communications of the ACM Type: main |
| ResultId | 1 |
