Using Hoare Logic in a Process Algebra Setting

DOI10.3233/FI-2021-2026OpenAlexW2951755804MaRDI QIDQ5164860

Jan A. Bergstra, C. A. Middelburg

Publication date: 15 November 2021

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.04491

zbMATH Keywords

process algebraHoare logicguarded commandasserted processassignment actiondata parameterized action

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• A process calculus with finitary comprehended terms
• Verification of sequential and concurrent programs
• A complete inference system for a class of regular behaviours
• Global renaming operators in concrete process algebra
• A proof technique for communicating sequential processes
• An axiomatic proof technique for parallel programs
• Process algebra with guards: Combining hoare logic with process algebra
• Process algebra with propositional signals
• The abstract variable-binding calculus
• Splitting bisimulations and retrospective conditions
• Process algebra for synchronous communication
• A Proof System for Communicating Sequential Processes
• Process Algebra
• Soundness and Completeness of an Axiom System for Program Verification
• Communicating sequential processes
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item