Total correctness of CSP programs

DOI10.1007/BF00289498zbMath0596.68026OpenAlexW1980945286MaRDI QIDQ1079011

N. Soundararajan

Publication date: 1986

Published in: Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

partial correctnessset partitioningaxiomatic systemtotal correctness of CSP programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Total correctness of CSP programs ⋮ P-A logic - a compositional proof system for distributed programs

Cites Work

• Total correctness of CSP programs
• A proof technique for communicating sequential processes
• Axiomatic semantics of communicating sequential processes
• A Proof System for Communicating Sequential Processes
• Formal Justification of a Proof System for Communicating Sequential Processes

This page was built for publication: Total correctness of CSP programs