Entry Dam:1997:DPE 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{Dam:1997:DPE,
  author =       "Mads Dam",
  title =        "On the decidability of process equivalences for the
                 pi--- calculus",
  journal =      j-THEOR-COMP-SCI,
  volume =       "183",
  number =       "2",
  pages =        "215--228",
  day =          "15",
  month =        sep,
  year =         "1997",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:21:09 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=183&issue=2;
                 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=183&issue=2&aid=2526",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory); C6110F (Formal methods); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  conflocation = "Montreal, Que., Canada; 3-7 July 1995",
  conftitle =    "Algebraic Methodology and Software Technology. 4th
                 International Conference, AMAST '95",
  corpsource =   "Swedish Inst. of Comput. Sci., Kista, Sweden",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bisimulation equivalence; boundedness lemma; CCS;
                 decidability; decidable equivalences; exponential
                 running time; finite control fragment; finite name
                 spaces; finite reachability theorem; name spaces;
                 Paige-Tarjan algorithm; parameter passing process
                 calculi; pi-calculus; pi-calculus equivalences; process
                 algebra; process equivalences; program verification;
                 reachability analysis; reachable agent expressions;
                 static normalisation procedure; strong late
                 equivalence",
  pubcountry =   "Netherlands",
  sponsororg =   "Concordia Univ.; Univ. Quebec Montreal; Bell-Northern
                 Res.; et al",
  treatment =    "T Theoretical or Mathematical",
}

Related entries