@article{Sekerinski03TabularVerificationRefinement,
	title = {Exploring {Tabular} {Verification} and {Refinement}},
	volume = {15},
	doi = {10.1007/s00165-003-0010-9},
	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.},
	number = {2},
	journal = {Formal Aspects of Computing},
	author = {Sekerinski, Emil},
	month = nov,
	year = {2003},
	pages = {215--236},
}

{"_id":"hqx8h8CFzxJEvBt37","bibbaseid":"sekerinski-exploringtabularverificationandrefinement-2003","downloads":1,"creationDate":"2019-02-02T15:48:53.593Z","title":"Exploring Tabular Verification and Refinement","author_short":["Sekerinski, E."],"year":2003,"bibtype":"article","biburl":"https://api.krunk.cn/emil/bib.php","bibdata":{"bibtype":"article","type":"article","title":"Exploring Tabular Verification and Refinement","volume":"15","doi":"10.1007/s00165-003-0010-9","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.","number":"2","journal":"Formal Aspects of Computing","author":[{"propositions":[],"lastnames":["Sekerinski"],"firstnames":["Emil"],"suffixes":[]}],"month":"November","year":"2003","pages":"215–236","bibtex":"@article{Sekerinski03TabularVerificationRefinement,\n\ttitle = {Exploring {Tabular} {Verification} and {Refinement}},\n\tvolume = {15},\n\tdoi = {10.1007/s00165-003-0010-9},\n\tabstract = {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.},\n\tnumber = {2},\n\tjournal = {Formal Aspects of Computing},\n\tauthor = {Sekerinski, Emil},\n\tmonth = nov,\n\tyear = {2003},\n\tpages = {215--236},\n}\n\n","author_short":["Sekerinski, E."],"key":"Sekerinski03TabularVerificationRefinement","id":"Sekerinski03TabularVerificationRefinement","bibbaseid":"sekerinski-exploringtabularverificationandrefinement-2003","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":1},"search_terms":["exploring","tabular","verification","refinement","sekerinski"],"keywords":[],"authorIDs":[],"dataSources":["fDYYrPxpzcyDvQK6b","HEdahWqKBpmSGmDwq","MF5eGzpJnqf6bSAoG","ienufKdnmJs49AsjR","So4gmSWFmbQRNEuFs","ezsmw4w22u9JFLNYJ","CvQYP6Tmpapx74Mgr","RWydLHbBJqgdeh5jr"]}