Tabular Verification and Refinement
Emil Sekerinski · Electronic Notes in Theoretical Computer Science · 2002
Tabular representations have been proposed for structuring mathematical expressions as they appear in the specification of programs. The thesis of this work is that tables not only help in writing and checking complex expressions, but also in their formal manipulation. We consider tabular predicates and tabular relations and their use in program verification and refinement.