Correctness of fixpoint transformations

DOI10.1016/0304-3975(94)90083-3zbMath0809.08003OpenAlexW2061262975MaRDI QIDQ1329743

Jiawang Wei

Publication date: 3 April 1995

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90083-3

zbMATH Keywords

complete partial orderedcorrectness of fixed-point transformationsgeneral transformations of equations

Mathematics Subject Classification ID

Partial orders, general (06A06) Formal languages and automata (68Q45) Applications of universal algebra in computer science (08A70) Specification and verification (program logics, model checking, etc.) (68Q60)

Uses Software

• ALGOL 60

Cites Work

• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Reasoning algebraically about recursion
• Chain-complete posets and directed sets with applications
• The convergence of functions to fixedpoints of recursive definitions
• Constructive versions of Tarski's fixed point theorems
• Program derivation by fixed point computation
• A lattice-theoretical fixpoint theorem and its applications
• Convergence of chaotic iterative least fixed point computations
• Global Data Flow Analysis and Iterative Algorithms
• Two Families of Languages Related to ALGOL
• Equational languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Correctness of fixpoint transformations