Axiomatic system for proving the properties of simple multimodule programs

DOI10.1007/BF01082606MaRDI QIDQ3829057zbMATH OpenFDO

Authors K. K. Gyachas

Publication date 1988

Published in Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

axiomatic semanticscompletenessConsistencydistributed programming languagemultimodule programpartial correctnessstate transitions

Mathematics Subject Classification ID

Theory of operating systems (68N25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• A compositional proof system for distributed programs
• scientific article; zbMATH DE number 3902009
• scientific article; zbMATH DE number 3907747
• scientific article; zbMATH DE number 4058826
• Axiomatic semantics of communicating sequential processes

Cites work

• A linear-history semantics for languages for distributed programming
• A proof technique for communicating sequential processes
• An axiomatic basis for computer programming
• scientific article; zbMATH DE number 4005586 (Why is no real title available?)
• Soundness and Completeness of an Axiom System for Program Verification
• Verifying properties of parallel programs

Cited in

(1)

• A compositional proof system for distributed programs

This page was built for publication: Axiomatic system for proving the properties of simple multimodule programs

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