Sciweavers

    113
    Voted
    LMCS
    2007
    132views more  LMCS 2007»
    The Complexity of Model Checking Higher-Order Fixpoint Logic
    15 years 3 months ago
    The Complexity of Model Checking Higher-Order Fixpoint Logic
    Download  www2.tcs.ifi.lmu.de
    Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
    Roland Axelsson, Martin Lange, Rafal Somla
    claim paper
    Read More »
    LMCS
    2007
    61views more  LMCS 2007»
    Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
    15 years 3 months ago
    Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
    Download  research.microsoft.com
    Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Ben...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.