✓

@Book{            Le-Charlier:1990aa,
  Author        = "Le Charlier, Baudouin and Musumbu, Kaninda and Van Hentenryck, Pascal",
  Abstract      = {Abstract: "A generic abstract interpretation algorithm for Prolog programs is presented and its complexity analyzed. The algorithm is parametrized on the abstract domain and can be instantiated by choosing an abstraction of substitutions and an implementation of a number of abstract operations whose specifications are given as consistent abstractions of some concrete operations. The algorithm, which is representation- independent, has been developed by successive refinments {$[$}sic{$]$} from the abstract semantics and includes optimizations such as the detection of definitive results, the early recognition of termination, and the detection of dynamic dependencies. The worst-case complexity of the algorithm is analyzed for various classes of programs and behavioural assumptions."},
  Address       = "Providence, R.I.",
  Date          = "1990",
  date-added    = "2020-04-10 11:07:26 +0200",
  date-modified = "2020-04-10 11:07:26 +0200",
  dp            = "http://worldcat.org",
  id            = "24366851",
  Keywords      = "readme",
  la            = "English",
  Publisher     = "Brown University, Dept. of Computer Science",
  Title         = "A generic abstract interpretation algorithm and its complexity analysis : extended abstract",
  ty            = "BOOK",
  Year          = "1990",
  File          = "A\_Generic\_Abstract\_Interpretation\_Algorithm\_and\_it (0) - a - a.pdf",
  file-2        = "cs90-25 (0) - a - a.pdf"
}

@Book{ Le-Charlier:1990aa, Author = "Le Charlier, Baudouin and Musumbu, Kaninda and Van Hentenryck, Pascal", Abstract = {Abstract: "A generic abstract interpretation algorithm for Prolog programs is presented and its complexity analyzed. The algorithm is parametrized on the abstract domain and can be instantiated by choosing an abstraction of substitutions and an implementation of a number of abstract operations whose specifications are given as consistent abstractions of some concrete operations. The algorithm, which is representation- independent, has been developed by successive refinments {$[$}sic{$]$} from the abstract semantics and includes optimizations such as the detection of definitive results, the early recognition of termination, and the detection of dynamic dependencies. The worst-case complexity of the algorithm is analyzed for various classes of programs and behavioural assumptions."}, Address = "Providence, R.I.", Date = "1990", date-added = "2020-04-10 11:07:26 +0200", date-modified = "2020-04-10 11:07:26 +0200", dp = "http://worldcat.org", id = "24366851", Keywords = "readme", la = "English", Publisher = "Brown University, Dept. of Computer Science", Title = "A generic abstract interpretation algorithm and its complexity analysis : extended abstract", ty = "BOOK", Year = "1990", File = "A_Generic_Abstract_Interpretation_Algorithm_and_it (0) - a - a.pdf", file-2 = "cs90-25 (0) - a - a.pdf" }