Abstract

In recent works on program analysis, transformations of various programming languages to term rewriting are used. In this setting, constraints appear naturally. Several definitions which combine rewriting with logical constraints, or with separate rules for integer functions, have been proposed. This paper seeks to unify and generalise these proposals.

BibTeX

@inproceedings{CKNN-FroCoS13,
  author    = "Cynthia Kop and Naoki Nishida",
  title     = "Term Rewriting with Logical Constraints",
  booktitle = "Proceedings of the 9th International Symposium on
               Frontiers of Combining Systems",
  editor    = "Pascal Fontaine and Christophe Ringeissen and
               Renate A. Schmidt",
  series    = "Lecture Notes in Artificial Intelligence",
  volume    = 8152,
  pages     = "343--358",
  publisher = "Springer-Verlag",
  year      = 2013,
  doi       = "10.1007/978-3-642-40885-4_24"
}