Tabular Verification and Refinement. Sekerinski, E. In Derrick, J., Boiten, E., Woodcock, J., & Wright, J. v., editors, REFINE 2002, The BCS FACS Refinement Workshop, volume 70, of Electronic Notes in Theoretical Computer Science, pages 179–198, July, 2002. Elsevier.
doi  abstract   bibtex   
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.
@inproceedings{Sekerinski02TabularVerificationRefinement,
	series = {Electronic {Notes} in {Theoretical} {Computer} {Science}},
	title = {Tabular {Verification} and {Refinement}},
	volume = {70},
	doi = {10.1016/S1571-0661(05)80492-X},
	abstract = {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.},
	booktitle = {{REFINE} 2002, {The} {BCS} {FACS} {Refinement} {Workshop}},
	publisher = {Elsevier},
	author = {Sekerinski, Emil},
	editor = {Derrick, John and Boiten, Eerke and Woodcock, Jim and Wright, Joakim von},
	month = jul,
	year = {2002},
	pages = {179--198},
}

Downloads: 0