Sharpening constraint programming approaches for bit-vector theory (Q2011567): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPBPV / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SMT-LIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Chaff / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVC4 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MathSAT5 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OSMOSE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TCAS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2619890504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Alternative to SAT-Based Approaches for Bit-Vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quantified verification conditions using satisfiability modulo theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taking Satisfiability to the Next Level with Z3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Bit-Vector Arithmetic with Abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The MathSAT5 SMT Solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting search with variable elimination in constraint optimization and constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decision Procedure for Bit-Vectors and Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2767075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lazy abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lazy Abstraction with Interpolants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Social processes and proofs of theorems and programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplification by Cooperating Decision Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constraint Solver Based on Abstract Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bit-Vector Solver with Word-Level Propagation / rank
 
Normal rank

Latest revision as of 05:03, 14 July 2024

scientific article
Language Label Description Also known as
English
Sharpening constraint programming approaches for bit-vector theory
scientific article

    Statements

    Sharpening constraint programming approaches for bit-vector theory (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 August 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers