Sciweavers

    1528 search results - page 44 / 306
    » Performance Assertion Checking
    Sort
    View
    FMOODS
    2007
    96views Formal Methods» more  FMOODS 2007»
    On Formal Analysis of OO Languages Using Rewriting Logic: Designing for Performance
    13 years 10 months ago
    On Formal Analysis of OO Languages Using Rewriting Logic: Designing for Performance
    Download  fsl.cs.uiuc.edu
    Rewriting logic provides a powerful, flexible mechanism for language definition and analysis. This flexibility in design can lead to problems during analysis, as different desi...
    Mark Hills, Grigore Rosu
    claim paper
    Read More »
    TIT
    2002
    146views more  TIT 2002»
    Bounds on the performance of belief propagation decoding
    13 years 8 months ago
    Bounds on the performance of belief propagation decoding
    Download  www.eng.tau.ac.il
    We consider Gallager's soft decoding (belief propagation) algorithm for decoding low density parity check (LDPC) codes, when applied to an arbitrary binary-input symmetric-ou...
    David Burshtein, Gadi Miller
    claim paper
    Read More »
    ISSTA
    2006
    ACM
    134views Software Engineering» more  ISSTA 2006»
    Using model checking with symbolic execution to verify parallel numerical programs
    14 years 2 months ago
    Using model checking with symbolic execution to verify parallel numerical programs
    Download  ext.math.umass.edu
    We present a method to verify the correctness of parallel programs that perform complex numerical computations, including computations involving floating-point arithmetic. The me...
    Stephen F. Siegel, Anastasia Mironova, George S. A...
    claim paper
    Read More »
    DLOG
    2008
    103views Automated Reasoning» more  DLOG 2008»
    Checking DL-Lite Modularity with QBF Solvers
    13 years 11 months ago
    Checking DL-Lite Modularity with QBF Solvers
    Download  sunsite.informatik.rwth-aachen.de
    We show how the reasoning tasks of checking various versions of conservativity for the description logic DL-Litebool can be reduced to satisfiability of quantified Boolean formulas...
    Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter...
    claim paper
    Read More »
    QEST
    2010
    IEEE
    182views Modeling and Simulation» more  QEST 2010»
    Automatic Compositional Reasoning for Probabilistic Model Checking of Hardware Designs
    13 years 6 months ago
    Automatic Compositional Reasoning for Probabilistic Model Checking of Hardware Designs
    Download  faculty.ece.illinois.edu
    Adaptive techniques like voltage and frequency scaling, process variations and the randomness of input data contribute signi cantly to the statistical aspect of contemporary hardwa...
    Jayanand Asok Kumar, Shobha Vasudevan
    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.