Entry Leuschel:1998:CGP from toplas.bib

Last update: Tue May 1 02:05:46 MDT 2012                Valid HTML 3.2!

Index sections

Top | Symbols | 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{Leuschel:1998:CGP,
  author =       "Michael Leuschel and Bern Martens and Danny {De
                 Schreye}",
  title =        "Controlling generalization and polyvariance in partial
                 deduction of normal logic programs",
  journal =      j-TOPLAS,
  volume =       "20",
  number =       "1",
  pages =        "208--258",
  month =        jan,
  year =         "1998",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Mon Jul 26 15:58:11 1999",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/toplas/1998-20-1/p208-leuschel/",
  abstract =     "Given a program and some input data, partial deduction
                 computes a specialized program handling any remaining
                 input more efficiently. However, controlling the
                 process well is a rather difficult problem. In this
                 article, we elaborate global control for partial
                 deduction: for which atoms, among possibly infinitely
                 many, should specialized relations be produced,
                 meanwhile guaranteeing correctness as well as
                 termination. Our work is based on two ingredients.
                 First, we use the concept of a characteristic tree,
                 encapsulating specialization behavior rather than
                 syntactic structure, to guide generalization and
                 polyvariance, and we show how this can be done in a
                 correct and elegant way. Second, we structure
                 combinations of atoms and associated characteristic
                 trees in global trees registering ``causal''
                 relationships among such pairs. This allows us to spot
                 looming nontermination and perform proper
                 generalization in order to avert the danger, without
                 having to impose a depth bound on characteristic trees.
                 The practical relevance and benefits of the work are
                 illustrated through extensive experiments. Finally, a
                 similar approach may improve upon current (on-line)
                 control strategies for program transformation in
                 general such as (positive) supercompilation of
                 functional programs. It also seems valuable in the
                 context of abstract interpretation to handle infinite
                 domains of infinite height with more precision.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  keywords =     "algorithms; performance; theory",
  subject =      "{\bf D.1.2} Software, PROGRAMMING TECHNIQUES,
                 Automatic Programming. {\bf I.2.3} Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
                 Theorem Proving, Logic programming. {\bf D.1.6}
                 Software, PROGRAMMING TECHNIQUES, Logic Programming.
                 {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic, Logic and
                 constraint programming. {\bf I.2.2} Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Automatic
                 Programming.",
}

Related entries