A proof method for cyclic programs

DOI10.1007/BF00289074MaRDI QIDQ1242445zbMATH OpenOpenAlexFDO

Authors Nissim Francez, Amir Pnueli

Publication date 1978

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00289074

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cites work

• scientific article; zbMATH DE number 3469999 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• Interference between communicating parallel processes
• Proving properties of interacting processes

Cited in

(4)

• P-A logic - a compositional proof system for distributed programs
• The temporal semantics of concurrent programs
• Formal derivation of strongly correct concurrent programs
• Assume-guarantee reasoning with local specifications

This page was built for publication: A proof method for cyclic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1242445)