Sciweavers

    LICS
    2006
    IEEE
    157views Automated Reasoning» more  LICS 2006»
    On Model-Checking Trees Generated by Higher-Order Recursion Schemes
    14 years 11 months ago
    On Model-Checking Trees Generated by Higher-Order Recursion Schemes
    Download  users.comlab.ox.ac.uk
    We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
    C.-H. Luke Ong
    claim paper
    Read More »
    FOSSACS
    2009
    Springer
    160views Software Engineering» more  FOSSACS 2009»
    On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
    14 years 12 months ago
    On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
    Download  users.comlab.ox.ac.uk
    Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
    Christopher Broadbent, C.-H. Luke Ong
    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-2025, USA.