The following pages link to STP (Q46504):
Displaying 41 items.
- (Q50498) (redirect page) (← links)
- LCTD: test-guided proofs for C programs on LLVM (Q338629) (← links)
- Strategies for scalable symbolic execution-driven test generation for programs (Q350939) (← links)
- Simulating circuit-level simplifications on CNF (Q352967) (← links)
- Formal testing for separation assurance (Q434444) (← links)
- Discovering invariants via simple component analysis (Q435979) (← links)
- Black-box testing based on colorful taint analysis (Q439720) (← links)
- Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning (Q457250) (← links)
- Simple linear string constraints (Q469349) (← links)
- Complexity of fixed-size bit-vector logics (Q504997) (← links)
- Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution (Q507359) (← links)
- A generic framework for symbolic execution: a coinductive approach (Q507361) (← links)
- Integration of verification methods for program systems (Q1040327) (← links)
- Propagation based local search for bit-precise reasoning (Q1688546) (← links)
- Algorithm and tools for constructing canonical forms of linear semi-algebraic formulas (Q1735326) (← links)
- Symbolic execution based on language transformation (Q1749128) (← links)
- Parallelizing SMT solving: lazy decomposition and conciliation (Q1749390) (← links)
- Symbolic execution formally explained (Q1982639) (← 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)
- On the hierarchical community structure of practical Boolean formulas (Q2118321) (← 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)
- Test generation from event system abstractions to cover their states and transitions (Q2216864) (← links)
- The SAT+CAS method for combinatorial search with applications to best matrices (Q2294574) (← 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)
- Executing and verifying higher-order functional-imperative programs in Maude (Q2409629) (← links)
- Efficiently solving quantified bit-vector formulas (Q2441770) (← links)
- A bit-vector differential model for the modular addition by a constant (Q2692348) (← links)
- Automatic Differential Analysis of ARX Block Ciphers with Application to SPECK and LEA (Q2817825) (← links)
- Learning Rate Based Branching Heuristic for SAT Solvers (Q2818006) (← links)
- Deciding Bit-Vector Formulas with mcSAT (Q2818018) (← links)
- Association of Under-Approximation Techniques for Generating Tests from Models (Q3012965) (← links)
- Satisfiability Modulo Theories (Q3176369) (← links)
- Combining Model Checking and Testing (Q3176377) (← links)
- Dynamic Path Reduction for Software Model Checking (Q3605478) (← links)
- Path Feasibility Analysis for String-Manipulating Programs (Q3617764) (← links)
- Symbolic Execution as DPLL Modulo Theories (Q5240106) (← links)
