Proof rules for communication abstractions

Gadi Taubenfeld; Nissim Francez

doi:10.1007/3-540-13883-8_90

Proof rules for communication abstractions

Gadi Taubenfeld, Nissim Francez

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

A modular proof system is presented for proving partial correctness and freedom from deadlock of concurrent programs using scripts (including recursive scripts). Its applications to augmentations of CSP and a subset of ADA are discussed. The proof rules are a generalization of both the procedure rules and the concurrency rules. Correctness proofs for examples are presented.

Original language	English
Title of host publication	Foundations of Software Technology and Theoretical Computer Science - 4th Conference, Proceedings
Editors	Mathai Joseph, Rudrapatna Shyamasundar
Publisher	Springer Verlag
Pages	443-465
Number of pages	23
ISBN (Print)	9783540138839
DOIs	https://doi.org/10.1007/3-540-13883-8_90 https://doi.org/10.1007/3-540-13883-8_67
State	Published - 1984
Externally published	Yes
Event	4th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1984 - Bangalore, India Duration: 13 Dec 1984 → 15 Dec 1984

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	181 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	4th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1984
Country/Territory	India
City	Bangalore
Period	13/12/84 → 15/12/84

Bibliographical note

Publisher Copyright:
© 1984, Springer-Verlag.

Keywords

Concurrent programming
Deadlock
Invariants
Proof rule
Script
Verification

Access to Document

Cite this

Taubenfeld, G., & Francez, N. (1984). Proof rules for communication abstractions. In M. Joseph, & R. Shyamasundar (Eds.), Foundations of Software Technology and Theoretical Computer Science - 4th Conference, Proceedings (pp. 443-465). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 181 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-13883-8_90, https://doi.org/10.1007/3-540-13883-8_67

Taubenfeld, Gadi ; Francez, Nissim. / Proof rules for communication abstractions. Foundations of Software Technology and Theoretical Computer Science - 4th Conference, Proceedings. editor / Mathai Joseph ; Rudrapatna Shyamasundar. Springer Verlag, 1984. pp. 443-465 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{4ccfd8ee4e464555a8f2d1a56335bf9a,

title = "Proof rules for communication abstractions",

abstract = "A modular proof system is presented for proving partial correctness and freedom from deadlock of concurrent programs using scripts (including recursive scripts). Its applications to augmentations of CSP and a subset of ADA are discussed. The proof rules are a generalization of both the procedure rules and the concurrency rules. Correctness proofs for examples are presented.",

keywords = "Concurrent programming, Deadlock, Invariants, Proof rule, Script, Verification",

author = "Gadi Taubenfeld and Nissim Francez",

note = "Publisher Copyright: {\textcopyright} 1984, Springer-Verlag.; 4th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1984 ; Conference date: 13-12-1984 Through 15-12-1984",

year = "1984",

doi = "10.1007/3-540-13883-8_90",

language = "אנגלית",

isbn = "9783540138839",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "443--465",

editor = "Mathai Joseph and Rudrapatna Shyamasundar",

booktitle = "Foundations of Software Technology and Theoretical Computer Science - 4th Conference, Proceedings",

address = "גרמניה",

}

Taubenfeld, G & Francez, N 1984, Proof rules for communication abstractions. in M Joseph & R Shyamasundar (eds), Foundations of Software Technology and Theoretical Computer Science - 4th Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 181 LNCS, Springer Verlag, pp. 443-465, 4th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1984, Bangalore, India, 13/12/84. https://doi.org/10.1007/3-540-13883-8_90, https://doi.org/10.1007/3-540-13883-8_67

Proof rules for communication abstractions. / Taubenfeld, Gadi; Francez, Nissim.
Foundations of Software Technology and Theoretical Computer Science - 4th Conference, Proceedings. ed. / Mathai Joseph; Rudrapatna Shyamasundar. Springer Verlag, 1984. p. 443-465 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 181 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Proof rules for communication abstractions

AU - Taubenfeld, Gadi

AU - Francez, Nissim

PY - 1984

Y1 - 1984

N2 - A modular proof system is presented for proving partial correctness and freedom from deadlock of concurrent programs using scripts (including recursive scripts). Its applications to augmentations of CSP and a subset of ADA are discussed. The proof rules are a generalization of both the procedure rules and the concurrency rules. Correctness proofs for examples are presented.

AB - A modular proof system is presented for proving partial correctness and freedom from deadlock of concurrent programs using scripts (including recursive scripts). Its applications to augmentations of CSP and a subset of ADA are discussed. The proof rules are a generalization of both the procedure rules and the concurrency rules. Correctness proofs for examples are presented.

KW - Concurrent programming

KW - Deadlock

KW - Invariants

KW - Proof rule

KW - Script

KW - Verification

UR - http://www.scopus.com/inward/record.url?scp=85034824470&partnerID=8YFLogxK

U2 - 10.1007/3-540-13883-8_90

DO - 10.1007/3-540-13883-8_90

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85034824470

SN - 9783540138839

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 443

EP - 465

BT - Foundations of Software Technology and Theoretical Computer Science - 4th Conference, Proceedings

A2 - Joseph, Mathai

A2 - Shyamasundar, Rudrapatna

PB - Springer Verlag

T2 - 4th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1984

Y2 - 13 December 1984 through 15 December 1984

ER -

Taubenfeld G, Francez N. Proof rules for communication abstractions. In Joseph M, Shyamasundar R, editors, Foundations of Software Technology and Theoretical Computer Science - 4th Conference, Proceedings. Springer Verlag. 1984. p. 443-465. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-13883-8_90, 10.1007/3-540-13883-8_67

Proof rules for communication abstractions

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this