Sciweavers

    2 search results - page 1 / 1
    » Simulating Reachability Using First-Order Logic with Applica...
    Sort
    View
    CADE
    2005
    Springer
    117views Logical Reasoning» more  CADE 2005»
    Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures
    16 years 3 months ago
    Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures
    Download  www.cs.wisc.edu
    Greta Yorsh, Neil Immerman, Shmuel Sagiv, Siddhart...
    claim paper
    Read More »
    CADE
    2005
    Springer
    195views Logical Reasoning» more  CADE 2005»
    An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
    16 years 3 months ago
    An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
    Download  people.csail.mit.edu
    We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
    Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.