Pages that link to "Item:Q5429343"

The following pages link to A Decision Procedure for Bit-Vectors and Arrays (Q5429343):

Displayed 31 items.

• STP (Q46504) ‎ (← links)
• Simulating circuit-level simplifications on CNF (Q352967) ‎ (← links)
• Complexity of fixed-size bit-vector logics (Q504997) ‎ (← links)
• Z3str2: an efficient solver for strings, regular expressions, and length constraints (Q526767) ‎ (← links)
• Propagation based local search for bit-precise reasoning (Q1688546) ‎ (← links)
• Parallelizing SMT solving: lazy decomposition and conciliation (Q1749390) ‎ (← links)
• Sharpening constraint programming approaches for bit-vector theory (Q2011567) ‎ (← links)
• Optimization modulo the theories of signed bit-vectors and floating-point numbers (Q2051569) ‎ (← links)
• Automatic search for bit-based division property (Q2146095) ‎ (← links)
• A bit-vector differential model for the modular addition by a constant and its applications to differential and impossible-differential cryptanalysis (Q2161424) ‎ (← links)
• Parameterized synthesis for fragments of first-order logic over data words (Q2200816) ‎ (← links)
• Local search with a SAT oracle for combinatorial optimization (Q2233496) ‎ (← links)
• The SAT+CAS method for combinatorial search with applications to best matrices (Q2294574) ‎ (← links)
• Optimization modulo the theory of floating-point numbers (Q2305439) ‎ (← links)
• Wombit: a portfolio bit-vector solver using word-level propagation (Q2323450) ‎ (← links)
• Array theory of bounded elements and its applications (Q2351149) ‎ (← links)
• Combining SAT solvers with computer algebra systems to verify combinatorial conjectures (Q2360872) ‎ (← links)
• A layered algorithm for quantifier elimination from linear modular constraints (Q2363817) ‎ (← links)
• Efficiently solving quantified bit-vector formulas (Q2441770) ‎ (← links)
• A bit-vector differential model for the modular addition by a constant (Q2692348) ‎ (← links)
• Cryptanalysis of Ascon (Q2790053) ‎ (← links)
• Automatic Differential Analysis of ARX Block Ciphers with Application to SPECK and LEA (Q2817825) ‎ (← links)
• Deciding Bit-Vector Formulas with mcSAT (Q2818018) ‎ (← links)
• Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem (Q2938540) ‎ (← links)
• Satisfiability Modulo Theories (Q3176369) ‎ (← links)
• MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers (Q3454125) ‎ (← links)
• Satisfiability Checking: Theory and Applications (Q4571125) ‎ (← links)
• Highly Automated Formal Proofs over Memory Usage of Assembly Code (Q5164171) ‎ (← links)
• Symbolic Execution as DPLL Modulo Theories (Q5240106) ‎ (← links)
• On the field-based division property: applications to MiMC, Feistel MiMC and GMiMC (Q6135435) ‎ (← links)
• Related-key differential cryptanalysis of GMiMC used in post-quantum signatures (Q6176048) ‎ (← links)