Exploring Tabular Verification and Refinement
Emil Sekerinski · Formal Aspects of Computing · 2003
Abstract Tabular representations have been proposed for structuring complex mathematical expressions as they appear in the specification of programs. We argue that tables not only help in writing and checking complex expressions, but also in their formal manipulation. More specifically, we explore the use of tabular predicates and tabular relations in program verification and refinement.