On correct refinement of programs
From MaRDI portal
Publication:1157144
DOI10.1016/0022-0000(81)90005-2zbMath0469.68012OpenAlexW2076964487MaRDI QIDQ1157144
Publication date: 1981
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(81)90005-2
Related Items
The weakest precondition calculus: Recursion and duality, Integrating formal specifications into applications: the ProB Java API, Predicate transformers as power operations, Generalised rely-guarantee concurrency: an algebraic foundation, Temporal reasoning through automatic translation of tock-CSP into timed automata, Formal and incremental construction of distributed algorithms: on the distributed reference counting algorithm, A calculus of refinements for program derivations, A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency, Predicate transformers and higher-order programs, Combining angels, demons and miracles in program specifications, Refinement and state machine abstraction, Relational demonic fuzzy refinement, Parallel composition and decomposition of specifications
Cites Work
- Proving programs correct through refinement
- The denotational semantics of programming languages
- A Transformation System for Developing Recursive Programs
- Goal-Directed Program Transformation
- A Powerdomain Construction
- Program Improvement by Source-to-Source Transformation
- Initial Algebra Semantics and Continuous Algebras
- Programming as a Discipline of Mathematical Nature
- A constructive approach to the problem of program correctness
- Program development by stepwise refinement
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
