Using Hoare logic in a process algebra setting
From MaRDI portal
Publication:5164860
DOI10.3233/FI-2021-2026OpenAlexW2951755804MaRDI QIDQ5164860FDOQ5164860
Authors: J. 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
Recommendations
Cites Work
- Process algebra for synchronous communication
- Title not available (Why is that?)
- An axiomatic basis for computer programming
- Soundness and Completeness of an Axiom System for Program Verification
- Communicating sequential processes
- An axiomatic proof technique for parallel programs
- Process algebra with propositional signals
- Process Algebra
- A process calculus with finitary comprehended terms
- A complete inference system for a class of regular behaviours
- Title not available (Why is that?)
- Splitting bisimulations and retrospective conditions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Process algebra with recursive operations
- Verification of sequential and concurrent programs
- A Proof System for Communicating Sequential Processes
- Process algebra with guards: Combining hoare logic with process algebra
- Global renaming operators in concrete process algebra
- A proof technique for communicating sequential processes
- The abstract variable-binding calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Using Hoare logic in a process algebra setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5164860)