Scholarly Works

Exploring Tabular Verification and Refinement

Journal article

Exploring Tabular Verification and Refinement

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.

Authors

Sekerinski E

Journal

Formal Aspects of Computing, Vol. 15, No. 2-3, pp. 215–236

Publisher

Association for Computing Machinery (ACM)

Publication Date

November 1, 2003

DOI

10.1007/s00165-003-0010-9

ISSN

0934-5043

Associated Experts

Emil Sekerinski

Professor, Faculty of Engineering

Labels

Fields of Research (FoR)

4613 Theory of computation 46 Information and Computing Sciences 4612 Software engineering

View published work (Non-McMaster Users)

View published work (McMaster Users)

Contact the Experts team

Get technical help

or

Provide website feedback