Entry Kurihara:1995:MNT from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                Valid HTML 3.2!

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{Kurihara:1995:MNT,
  author =       "Masahito Kurihara and Azuma Ohuchi",
  title =        "Modularity in noncopying term rewriting",
  journal =      j-THEOR-COMP-SCI,
  volume =       "152",
  number =       "1",
  pages =        "139--169",
  day =          "11",
  month =        dec,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:33 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=152&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=1995&volume=152&issue=1&aid=1882",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6110F
                 (Formal methods)",
  corpsource =   "Dept. of Inf. Eng., Hokkaido Univ., Sapporo, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "completeness; constructors; disjointness condition;
                 graph rewriting systems; modularity; noncopying term
                 rewriting; program verification; rewriting systems;
                 term-based formalism; termination",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries