Sciweavers

    CADE
    2012
    Springer
    204views Logical Reasoning» more  CADE 2012»

    Proving Non-looping Non-termination Automatically

    12 years 1 months ago
    Proving Non-looping Non-termination Automatically
    Download  verify.rwth-aachen.de
    We introduce a technique to prove non-termination of term rewrite systems automatically. Our technique improves over previous approaches substantially, as it can also detect non-looping non-termination.
    Fabian Emmes, Tim Enger, Jürgen Giesl
    claim paper
    Added 29 Sep 2012
    Updated 29 Sep 2012
    Type Journal
    Year 2012
    Where CADE
    Authors Fabian Emmes, Tim Enger, Jürgen Giesl
    Comments (0)
    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.