Recursive assertions and parallel programs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3716749 (Why is no real title available?)
- scientific article; zbMATH DE number 3569793 (Why is no real title available?)
- scientific article; zbMATH DE number 3248792 (Why is no real title available?)
- Recursive assertions are not enough - or are they?
- Soundness and Completeness of an Axiom System for Program Verification
Cited in
(8)- On the programs-as-formulas interpretation of parallel programs in Peano arithmetic
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
- Designing equivalent semantic models for process creation
- A generalization of Owicki-Gries's Hoare logic for a concurrent while language
- Towards a foundation for semantics in complete metric spaces
- Proving partial order properties
- The Rely-Guarantee method for verifying shared variable concurrent programs
- Three ways of proving termination of loops
This page was built for publication: Recursive assertions and parallel programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1140981)