@inproceedings{GieslSTSNSS07,
  title = {Termination of Programs using Term Rewriting and SAT Solving},
  author = {Jürgen Giesl and Peter Schneider-Kamp and René Thiemann and Stephan Swiderski and Manh Thang Nguyen and Danny De Schreye and Alexander Serebrenik},
  year = {2007},
  url = {http://drops.dagstuhl.de/opus/volltexte/2007/1248},
  tags = {term rewriting, termination, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GieslSTSNSS07},
  cites = {0},
  citedby = {0},
  booktitle = {Deduction and Decision Procedures, 30.09. - 05.10.2007},
  editor = {Franz Baader and Byron Cook and Jürgen Giesl and Robert Nieuwenhuis},
  volume = {07401},
  series = {Dagstuhl Seminar Proceedings},
  publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany},
}

@inproceedings{SerebrenikS01,
  title = {On Termination of Meta-Programs},
  author = {Alexander Serebrenik and Danny De Schreye},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2250/22500517.htm},
  tags = {meta programming, meta-model, termination, Meta-Environment, meta-objects},
  researchr = {https://researchr.org/publication/SerebrenikS01},
  cites = {0},
  citedby = {0},
  pages = {517-530},
  booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning, 8th International Conference, LPAR 2001, Havana, Cuba, December 3-7, 2001, Proceedings},
  editor = {Robert Nieuwenhuis and Andrei Voronkov},
  volume = {2250},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42957-3},
}

@inproceedings{SchreyeS02,
  title = {Acceptability with General Orderings},
  author = {Danny De Schreye and Alexander Serebrenik},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2407/24070187.htm},
  researchr = {https://researchr.org/publication/SchreyeS02},
  cites = {0},
  citedby = {0},
  pages = {187-210},
  booktitle = {Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I},
  editor = {Antonis C. Kakas and Fariba Sadri},
  volume = {2407},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-43959-5},
}

@inproceedings{SerebrenikS01a,
  title = {Inference of Termination Conditions for Numerical Loops in Prolog},
  author = {Alexander Serebrenik and Danny De Schreye},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2250/22500654.htm},
  tags = {Prolog, termination},
  researchr = {https://researchr.org/publication/SerebrenikS01a},
  cites = {0},
  citedby = {0},
  pages = {654-668},
  booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning, 8th International Conference, LPAR 2001, Havana, Cuba, December 3-7, 2001, Proceedings},
  editor = {Robert Nieuwenhuis and Andrei Voronkov},
  volume = {2250},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42957-3},
}

@article{SerebrenikS04,
  title = {Inference of termination conditions for numerical loops in Prolog},
  author = {Alexander Serebrenik and Danny De Schreye},
  year = {2004},
  tags = {Prolog, termination},
  researchr = {https://researchr.org/publication/SerebrenikS04},
  cites = {0},
  citedby = {0},
  journal = {TPLP},
  volume = {4},
  number = {5-6},
  pages = {719-751},
}

@inproceedings{SerebrenikS00a,
  title = {Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings},
  author = {Alexander Serebrenik and Danny De Schreye},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/2042/20420069.htm},
  tags = {rule-based, program analysis, analysis, termination, logic programming, logic, higher-order transformations, transformation, program transformation},
  researchr = {https://researchr.org/publication/SerebrenikS00a},
  cites = {0},
  citedby = {0},
  pages = {69-85},
  booktitle = {Logic Based Program Synthesis and Transformation, 10th International Workshop, LOPSTR 2000 London, UK, July 24-28, 2000, Selected Papers},
  editor = {Kung-Kiu Lau},
  volume = {2042},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42127-0},
}

@inproceedings{SerebrenikS03:0,
  title = {Hasta-La-Vista: Termination Analyser for Logic Programs},
  author = {Alexander Serebrenik and Danny De Schreye},
  year = {2003},
  tags = {termination, logic programming, logic},
  researchr = {https://researchr.org/publication/SerebrenikS03%3A0},
  cites = {0},
  citedby = {0},
  pages = {60-74},
  booktitle = {Proceedings of the 13th International Workshop on Logic Programming Environments, Tata Institute of Fundamental Research, Mumbai, India, December 8, 2003},
  editor = {Frédéric Mesnard and Alexander Serebrenik},
  volume = {CW371},
  series = {Report},
  publisher = {Katholieke Universiteit Leuven, Department of Computer Science, Celestijnenlaan 200A, B-3001 Heverlee (Belgium)},
}

@inproceedings{SerebrenikS02,
  title = {On Termination of Logic Programs with Floating Point Computations},
  author = {Alexander Serebrenik and Danny De Schreye},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2477/24770151.htm},
  tags = {termination, logic programming, logic},
  researchr = {https://researchr.org/publication/SerebrenikS02},
  cites = {0},
  citedby = {0},
  pages = {151-164},
  booktitle = {Static Analysis, 9th International Symposium, SAS 2002, Madrid, Spain, September 17-20, 2002, Proceedings},
  editor = {Manuel V. Hermenegildo and Germán Puebla},
  volume = {2477},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-44235-9},
}

@article{SerebrenikS05:0,
  title = {Termination of Floating-Point Computations},
  author = {Alexander Serebrenik and Danny De Schreye},
  year = {2005},
  doi = {10.1007/s10817-005-6546-z},
  url = {http://dx.doi.org/10.1007/s10817-005-6546-z},
  tags = {termination},
  researchr = {https://researchr.org/publication/SerebrenikS05%3A0},
  cites = {0},
  citedby = {0},
  journal = {Journal of Automated Reasoning},
  volume = {34},
  number = {2},
  pages = {141-177},
}

@inproceedings{SerebrenikS00,
  title = {Non-tranformational termination analysis of logic programs, based on general term-orderings},
  author = {Alexander Serebrenik and Danny De Schreye},
  year = {2000},
  tags = {rule-based, program analysis, analysis, termination, logic programming, logic},
  researchr = {https://researchr.org/publication/SerebrenikS00},
  cites = {0},
  citedby = {0},
  booktitle = {Logic Based Program Synthesis and Transformation, 10th International Workshop, LOPSTR 2000 London, UK, July 24-28, 2000, Selected Papers},
  editor = {Kung-Kiu Lau},
  volume = {2042},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42127-0},
}

@article{SerebrenikS05,
  title = {On termination of meta-programs},
  author = {Alexander Serebrenik and Danny De Schreye},
  year = {2005},
  doi = {10.1017/S1471068404002248},
  url = {http://dx.doi.org/10.1017/S1471068404002248},
  tags = {meta programming, meta-model, termination, Meta-Environment, meta-objects},
  researchr = {https://researchr.org/publication/SerebrenikS05},
  cites = {0},
  citedby = {0},
  journal = {TPLP},
  volume = {5},
  number = {3},
  pages = {355-390},
}

@inproceedings{SerebrenikS03,
  title = {Proving Termination with Adornments},
  author = {Alexander Serebrenik and Danny De Schreye},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3018&spage=108},
  tags = {termination},
  researchr = {https://researchr.org/publication/SerebrenikS03},
  cites = {0},
  citedby = {0},
  pages = {108-109},
  booktitle = {Logic Based Program Synthesis and Transformation, 13th International Symposium LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Papers},
  editor = {Maurice Bruynooghe},
  volume = {3018},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-22174-3},
}