Sciweavers

    83
    Voted
    SPIN
    2010
    Springer
    126views Theoretical Computer Science» more  SPIN 2010»
    An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models
    14 years 7 months ago
    An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models
    Download  spinroot.com
    This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relax...
    Alexander Linden, Pierre Wolper
    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.