Program derivation by fixed point computation

DOI10.1016/0167-6423(88)90033-0zbMath0681.68020OpenAlexW1994511561MaRDI QIDQ1823657

Robert Paige, Jiazhen Cai

Publication date: 1989

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(88)90033-0

zbMATH Keywords

transformationscomputable functionsprogramprogram derivationfixed point computationdesign and verification of nonnumerical algorithmsnondeterministic iterative algorithm schema

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05) General topics in the theory of software (68N01) Algorithms in computer science (68W99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (10)

Correctness of fixpoint transformations ⋮ Convergence of chaotic iterative least fixed point computations ⋮ Static and dynamic processor allocation for higher-order concurrent languages ⋮ Properties of data flow frameworks: A unified model ⋮ Solving Multiple Dataflow Queries Using WPDSs ⋮ Iterate, Incrementalize, and Implement: A Systematic Approach to Efficiency Improvement and Guarantees ⋮ Program construction by verifying specification ⋮ Transformational derivation of an improved alias analysis algorithm ⋮ Least reflexive points of relations ⋮ An NSF proposal

This page was built for publication: Program derivation by fixed point computation