Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Shilov:1997:PSV, author = "N. V. Shilov", title = "Program schemata vs. automata for decidability of program logics", journal = j-THEOR-COMP-SCI, volume = "175", number = "1", pages = "15--27", day = "30", month = mar, year = "1997", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:20:44 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=175&issue=1; http://www.math.utah.edu/pub/tex/bib/tcs1995.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=175&issue=1&aid=2381", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory); C4240 (Programming and algorithm theory)", conflocation = "Kanazawa, Japan; 5-8 Dec. 1994", conftitle = "Workshop on Non-Standard Logics and Logical Aspects of Computer Science", corpsource = "Inst. of Inf. Syst., Acad. of Sci., Novosibirsk, Russia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata; automata theory; decidability; mu-calculus; process algebra; program logics; program schemata; programming theory; propositional program logic", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }