Exploring Tabular Verification and Refinement Journal Articles

abstract

• 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, Emil

status

• published 

publication date

• November 2003

has subject area

• 0802 Computation Theory and Mathematics (FoR)
• 0803 Computer Software (FoR)
• Computation Theory & Mathematics (Science Metrix)

published in

• Formal Aspects of Computing  Journal

keywords

• 46 Information and Computing Sciences
• 4612 Software Engineering
• 4613 Theory Of Computation

Digital Object Identifier (DOI)

• 10.1007/s00165-003-0010-9

start page

• 215

end page

• 236

volume

• 15

issue

• 2-3