Skip to main navigation Skip to search Skip to main content

Automatically Proving Termination Where Simplification Orderings Fail

  • T. Arts
  • , J. Giesl
  • extern

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Original languageUndefined/Unknown
Title of host publicationProceedings Colloquium on Trees in Algebra and Programming, Lille, France
Place of PublicationBerlin
PublisherSpringer
Pages261-272
Number of pages12
Publication statusPublished - 1997

Cite this