The statement constructors that we have introduced earlier — sequential composition, join, and meet — are all monotonic with respect to the refinement relation on Mtran. Hence, we can use these constructs to define monotonic functions from the complete lattice of predicate transformers to itself.
KeywordsMonotonic Function Complete Lattice Induction Assumption Denotational Semantic Predicate Transformer
Unable to display preview. Download preview PDF.