Sciweavers

    248 search results - page 32 / 50
    » Circuit-based Boolean Reasoning
    Sort
    View
    ENTCS
    2007
    119views more  ENTCS 2007»
    Interpolant Learning and Reuse in SAT-Based Model Checking
    13 years 9 months ago
    Interpolant Learning and Reuse in SAT-Based Model Checking
    Download  eprints.ecs.soton.ac.uk
    Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
    João Marques-Silva
    claim paper
    Read More »
    STTT
    2008
    90views more  STTT 2008»
    A uniform framework for weighted decision diagrams and its implementation
    13 years 9 months ago
    A uniform framework for weighted decision diagrams and its implementation
    Download  jossowski.de
    1 This papers introduces a generic framework for OBDD variants with weighted edges. It covers many boolean and multi-valued OBDD-variants that have been studied in the literature a...
    Jörn Ossowski, Christel Baier
    claim paper
    Read More »
    JLP
    2010
    85views more  JLP 2010»
    Synchronous Kleene algebra
    13 years 3 months ago
    Synchronous Kleene algebra
    Download  folk.uio.no
    The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner's SCCS calculus. The resulting algebraic structure ...
    Cristian Prisacariu
    claim paper
    Read More »
    PLDI
    2010
    ACM
    233views Programming Languages» more  PLDI 2010»
    The Reachability-Bound Problem
    14 years 6 months ago
    The Reachability-Bound Problem
    Download  research.microsoft.com
    We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
    Sumit Gulwani, Florian Zuleger
    claim paper
    Read More »
    DLOG
    2008
    120views Automated Reasoning» more  DLOG 2008»
    Identifying Objects Over Time with Description Logics
    13 years 11 months ago
    Identifying Objects Over Time with Description Logics
    Download  www.cs.uwaterloo.ca
    A fundamental requirement for cooperating agents is to agree on a selection of component values of objects that can be used for reliably communicating references to the objects, to...
    David Toman, Grant E. Weddell
    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.