Sciweavers

    608 search results - page 3 / 122
    » Tests, Proofs and Refinements
    Sort
    View
    TLCA
    2009
    Springer
    129views Theoretical Computer Science» more  TLCA 2009»
    Refinement Types as Proof Irrelevance
    13 years 10 months ago
    Refinement Types as Proof Irrelevance
    Download  www.cs.cmu.edu
    William Lovas, Frank Pfenning
    claim paper
    Read More »
    SIAMCOMP
    2000
    86views more  SIAMCOMP 2000»
    On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
    13 years 5 months ago
    On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
    Download  www.lsi.upc.edu
    An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
    Maria Luisa Bonet, Juan Luis Esteban, Nicola Gales...
    claim paper
    Read More »
    ICFEM
    2007
    Springer
    123views Software Engineering» more  ICFEM 2007»
    Automating Refinement Checking in Probabilistic System Design
    13 years 10 months ago
    Automating Refinement Checking in Probabilistic System Design
    Download  web.science.mq.edu.au
    Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
    Carlos Gonzalia, Annabelle McIver
    claim paper
    Read More »
    FAC
    2008
    67views more  FAC 2008»
    Specification, proof, and model checking of the Mondex electronic purse using RAISE
    13 years 6 months ago
    Specification, proof, and model checking of the Mondex electronic purse using RAISE
    Download  www.vdmportal.org
    This paper describes how the communication protocol of Mondex electronic purses can be specified and verified against desired security properties. The specification is developed by...
    Chris George, Anne Elisabeth Haxthausen
    claim paper
    Read More »
    FUIN
    2006
    145views more  FUIN 2006»
    Negative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming
    13 years 6 months ago
    Negative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming
    Download  www.mimuw.edu.pl
    We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...
    Linh Anh Nguyen
    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.