Using Hoare logic in a process algebra setting
From MaRDI portal
Publication:5164860
Recommendations
- Process algebra with guards: Combining hoare logic with process algebra
- scientific article; zbMATH DE number 4016181
- Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule
- scientific article; zbMATH DE number 3900131
- The ``Hoare Logic of CSP, and All That
Cites work
- A complete inference system for a class of regular behaviours
- A process calculus with finitary comprehended terms
- A Proof System for Communicating Sequential Processes
- A proof technique for communicating sequential processes
- An axiomatic basis for computer programming
- An axiomatic proof technique for parallel programs
- Communicating sequential processes
- Global renaming operators in concrete process algebra
- scientific article; zbMATH DE number 3930354 (Why is no real title available?)
- scientific article; zbMATH DE number 1049169 (Why is no real title available?)
- scientific article; zbMATH DE number 1113856 (Why is no real title available?)
- scientific article; zbMATH DE number 1142323 (Why is no real title available?)
- scientific article; zbMATH DE number 1555176 (Why is no real title available?)
- scientific article; zbMATH DE number 1368948 (Why is no real title available?)
- Process Algebra
- Process algebra for synchronous communication
- Process algebra with guards: Combining hoare logic with process algebra
- Process algebra with propositional signals
- Process algebra with recursive operations
- Soundness and Completeness of an Axiom System for Program Verification
- Splitting bisimulations and retrospective conditions
- The abstract variable-binding calculus
- Verification of sequential and concurrent programs
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)