Last update: Sat Jan 6 02:03:49 MST 2018
@Article{Pandya:1986:SDT, author = "P. Pandya and M. Joseph", title = "A structure-directed total correctness proof rule for recursive procedure calls", journal = j-COMP-J, volume = "29", number = "6", pages = "531--537", month = dec, year = "1986", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/29.6.531", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Dec 4 14:48:22 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/29/6.toc; http://www.math.utah.edu/pub/tex/bib/compj1980.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_06/", URL = "http://comjnl.oxfordjournals.org/content/29/6/531.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_06/tiff/531.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_06/tiff/532.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_06/tiff/533.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_06/tiff/534.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_06/tiff/535.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_06/tiff/536.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_06/tiff/537.tif", acknowledgement = ack-nhfb, affiliation = "Tata Inst of Fundamental Research, Bombay, India", affiliationaddress = "Tata Inst of Fundamental Research, Bombay, India", classcodes = "C4240 (Programming and algorithm theory)", classification = "723", corpsource = "Comput. Sci. Group, Tata Inst. of Fundamental Res., Bombay, India", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "computer metatheory --- Programming Theory; computer programming; interval analysis; procedure call graph; programming theory; proof rule; recursion structures; recursive procedure calls; Theory; total correctness", treatment = "T Theoretical or Mathematical", }