Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
Proving Termination Properties with mu-term
verfasst von : Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas, Rafael Navarro-Marset
Erschienen in: Algebraic Methodology and Software Technology
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
mu-term
is a tool which can be used to verify a number of termination properties of (variants of) Term Rewriting Systems (TRSs): termination of rewriting, termination of innermost rewriting, termination of order-sorted rewriting, termination of context-sensitive rewriting, termination of innermost context-sensitive rewriting and termination of rewriting modulo specific axioms. Such termination properties are essential to prove termination of programs in sophisticated rewriting-based programming languages. Specific methods have been developed and implemented in
mu-term
in order to efficiently deal with most of them. In this paper, we report on these new features of the tool.