Sciweavers

    RTA   2005 International Conference on Rewriting Techniques and Applications
    Wall of Fame | Most Viewed RTA-2005 Paper
    RTA
    2005
    Springer
    197views Theoretical Computer Science» more  RTA 2005»
    On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
    14 years 5 months ago
    On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
    Download  www.imn.htwk-leipzig.de
    We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
    Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...
    claim paper
    Read More »
    Disclaimer and Copyright Notice
    Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
    IdReadViewsTitleStatus
    1Download preprint from source197
    On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
    claim
    2Download preprint from source172
    Arithmetic as a Theory Modulo
    claim
    3Download preprint from source137
    Orderings for Innermost Termination
    claim
    4Download preprint from source129
    Proving Positive Almost-Sure Termination
    claim
    5Download preprint from source128
    Abstract Modularity
    claim
    6Download preprint from source128
    Universal Algebra for Termination of Higher-Order Rewriting
    claim
    7Download preprint from source126
    Natural Narrowing for General Term Rewriting Systems
    claim
    8Download preprint from source125
    Intruder Deduction for AC-Like Equational Theories with Homomorphisms
    claim
    9Download preprint from source121
    Proof-Producing Congruence Closure
    claim
    10Download preprint from source121
    The Algebra of Equality Proofs
    claim
    11Download preprint from source120
    Automata and Logics for Unranked and Unordered Trees
    claim
    12Download preprint from source117
    Call-by-Value Is Dual to Call-by-Name - Reloaded
    claim
    13Download preprint from source111
    A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code
    claim
    14Download preprint from source110
    Partial Inversion of Constructor Term Rewriting Systems
    claim
    15Download preprint from source96
    Twenty Years Later
    claim
    16Download preprint from source95
    Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics
    claim
    17Download preprint from source93
    Open. Closed. Open
    claim
    18Download preprint from source87
    Termination of Single-Threaded One-Rule Semi-Thue Systems
    claim
    19Download preprint from source81
    Leanest Quasi-orderings
    claim
    20Download preprint from source79
    Tyrolean Termination Tool
    claim
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.