Sciweavers

    12 search results - page 3 / 3
    » Termination Analysis by Dependency Pairs and Inductive Theor...
    Sort
    View
    PEPM
    2010
    ACM
    234views Software Engineering» more  PEPM 2010»
    A3PAT, an approach for certified automated termination proofs
    13 years 8 months ago
    A3PAT, an approach for certified automated termination proofs
    Download  cedric.cnam.fr
    Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
    Evelyne Contejean, Andrey Paskevich, Xavier Urbain...
    claim paper
    Read More »
    AISC
    2008
    Springer
    147views Artificial Intelligence» more  AISC 2008»
    Search Techniques for Rational Polynomial Orders
    13 years 8 months ago
    Search Techniques for Rational Polynomial Orders
    Download  verify.rwth-aachen.de
    Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
    Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto,...
    claim paper
    Read More »
    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.