Sciweavers

    117 search results - page 24 / 24
    » On Complexity of Model-Checking for the TQL Logic
    Sort
    View
    POPL
    2005
    ACM
    124views Programming Languages» more  POPL 2005»
    Transition predicate abstraction and fair termination
    14 years 6 months ago
    Transition predicate abstraction and fair termination
    Download  www.cs.sunysb.edu
    on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
    Andreas Podelski, Andrey Rybalchenko
    claim paper
    Read More »
    SP
    2010
    IEEE
    152views Security Privacy» more  SP 2010»
    Scalable Parametric Verification of Secure Systems: How to Verify Reference Monitors without Worrying about Data Structure Size
    13 years 3 months ago
    Scalable Parametric Verification of Secure Systems: How to Verify Reference Monitors without Worrying about Data Structure Size
    Download  www.cs.cmu.edu
    The security of systems such as operating systems, hypervisors, and web browsers depend critically on reference monitors to correctly enforce their desired security policy in the ...
    Jason Franklin, Sagar Chaki, Anupam Datta, Arvind ...
    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.