Entry Podelski:1997:SS 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{Podelski:1997:SS,
  author =       "Andreas Podelski and Gert Smolka",
  title =        "Situated simplification",
  journal =      j-THEOR-COMP-SCI,
  volume =       "173",
  number =       "1",
  pages =        "235--252",
  day =          "20",
  month =        feb,
  year =         "1997",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:37 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=173&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=173&issue=1&aid=2368",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6110L (Logic programming); C6110P (Parallel
                 programming); C6150G (Diagnostic, testing, debugging
                 and evaluating systems)",
  conflocation = "Cassis, France; 19-22 Sept. 1995",
  conftitle =    "Principles and Practice of Constraint Programming",
  corpsource =   "Max-Planck-Inst. f{\"u}r Inf., Saarbrucken, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "concurrent constraint programming systems; constraint
                 handling; constraint simplification; correctness
                 proving; deep guards; feature trees; finite trees;
                 fixed-point algorithm; guard satisfaction testing;
                 incremental algorithm; local computation space;
                 multiple bindings; parallel algorithms; parallel
                 programming; programming theory; rational tree
                 constraint disentailment; rational tree constraint
                 entailment; situated simplification; testing; tree
                 nodes; trees (mathematics)",
  pubcountry =   "Netherlands",
  sponsororg =   "ACM",
  treatment =    "T Theoretical or Mathematical",
}

Related entries