Reasoning about programs by exploiting the environment
From MaRDI portal
(Redirected from Publication:4632437)
Recommendations
Cites work
- Alternative semantics for temporal logics
- An axiomatic basis for computer programming
- An axiomatic proof technique for parallel programs
- scientific article; zbMATH DE number 4180789 (Why is no real title available?)
- scientific article; zbMATH DE number 3926220 (Why is no real title available?)
- scientific article; zbMATH DE number 1049169 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- scientific article; zbMATH DE number 4119617 (Why is no real title available?)
- Priority inheritance protocols: an approach to real-time synchronization
- Program composition via unification
- Proofs of Networks of Processes
- Reasoning about programs by exploiting the environment
- The Hoare logic of concurrent programs
- The ``Hoare Logic of CSP, and All That
- Verification of schedulability for real-time programs
- “Sometimes” and “not never” revisited
Cited in
(6)- Computing in unpredictable environments: semantics, reduction strategies, and program transformations
- Verification, refinement and scheduling of real-time programs
- Reasoning about programs by exploiting the environment
- Program models and semi-public environments
- Reasoning About Incompletely Defined Programs
- Analyzing the environment structure of higher-order languages using frame strings
This page was built for publication: Reasoning about programs by exploiting the environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632437)