Program derivation by fixed point computation
From MaRDI portal
Publication:1823657
Recommendations
Cited in
(21)- Program construction by verifying specification
- Correctness of fixpoint transformations
- A fixpoint theory for non-monotonic parallelism
- Program schemes with constants
- On Programming by Iterations
- Solving Multiple Dataflow Queries Using WPDSs
- Convergence of chaotic iterative least fixed point computations
- scientific article; zbMATH DE number 512950 (Why is no real title available?)
- scientific article; zbMATH DE number 1948158 (Why is no real title available?)
- scientific article; zbMATH DE number 2012391 (Why is no real title available?)
- Iterate, incrementalize, and implement: a systematic approach to efficiency improvement and guarantees
- Transformational programming and the derivation of algorithms
- Static and dynamic processor allocation for higher-order concurrent languages
- Logic Programming and Nonmonotonic Reasoning
- Letter to the Editor—-A Closed Form Solution of Certain Programming Problems
- Computer Aided Verification
- ConcurrentHOL
- Transformational derivation of an improved alias analysis algorithm
- Least reflexive points of relations
- An NSF proposal
- Properties of data flow frameworks: A unified model
This page was built for publication: Program derivation by fixed point computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823657)