Entry Anonymous:1993:SFS 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{Anonymous:1993:SFS,
  author =       "Anonymous",
  title =        "{5th Soviet --- French Symposium on Theoretical
                 Computer Science, Methods and Tools for Compilation,
                 and Program Development (Informatika '91)}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "119",
  number =       "1",
  pages =        "??--??",
  day =          "11",
  month =        oct,
  year =         "1993",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:15:15 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory);
                 C6110P (Parallel programming); C6150G (Diagnostic,
                 testing, debugging and evaluating systems)",
  conflocation = "Grenoble, France; Oct. 1991",
  conftitle =    "5th Soviet-French Symposium on Theoretical Computer
                 Science, Methods and Tools for Compilation, and Program
                 Development (Informatika'91)",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "attributed tree grammars; complete modal proof;
                 computational complexity; concurrent programs; data
                 bases; fault tolerance; generalised product of domains;
                 grammars; HAL; Herbrand agent language;
                 hereditarily-finite sets; inference mechanisms;
                 parallel programming; polynomial-time computability;
                 problem oriented verification system; program
                 verification; Prolog; propositional logics; theorem
                 proving; type inference; weighted systems",
  pubcountry =   "Netherlands",
}

Related entries