Entry Sabelfeld:1990:ADF from tcs1990.bib

Last update: Wed Sep 26 02:11:46 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Sabelfeld:1990:ADF,
  author =       "V. K. Sabelfeld",
  title =        "An algorithm deciding functional equivalence in a new
                 class of program schemes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "71",
  number =       "2",
  pages =        "265--279",
  day =          "30",
  month =        mar,
  year =         "1990",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory)",
  conflocation = "Nice, France; 23-25 Feb. 1988",
  conftitle =    "INFORMATIKA 88. 2nd French-Soviet Workshop on Methods
                 of Compilation and Program Construction",
  corpsource =   "Comput. Center, Acad. of Sci., Novosibirsk, USSR",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithm; automata theory; decidability; equivalence
                 classes; formal languages; free interpretation;
                 functional equivalence; predicate; program
                 optimization; program schemes; program verification;
                 through schemes; undecidable problem",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries