STP
From MaRDI portal
Software:46504
swMATH34795MaRDI QIDQ46504FDOQ46504
Author name not available (Why is that?)
Source code repository: https://github.com/stp/stp
Cited In (40)
- Symbolic execution formally explained
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
- Test generation from event system abstractions to cover their states and transitions
- Wombit: a portfolio bit-vector solver using word-level propagation
- Learning Rate Based Branching Heuristic for SAT Solvers
- On the hierarchical community structure of practical Boolean formulas
- Path Feasibility Analysis for String-Manipulating Programs
- Association of Under-Approximation Techniques for Generating Tests from Models
- Array theory of bounded elements and its applications
- Symbolic execution based on language transformation
- Parallelizing SMT solving: lazy decomposition and conciliation
- Formal testing for separation assurance
- Discovering invariants via simple component analysis
- Automatic Differential Analysis of ARX Block Ciphers with Application to SPECK and LEA
- Black-box testing based on colorful taint analysis
- A bit-vector differential model for the modular addition by a constant
- Automatic search for bit-based division property
- Symbolic Execution as DPLL Modulo Theories
- Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning
- Deciding Bit-Vector Formulas with mcSAT
- Efficiently solving quantified bit-vector formulas
- Simple linear string constraints
- A bit-vector differential model for the modular addition by a constant and its applications to differential and impossible-differential cryptanalysis
- LCTD: test-guided proofs for C programs on LLVM
- Optimization modulo the theories of signed bit-vectors and floating-point numbers
- Integration of verification methods for program systems
- Strategies for scalable symbolic execution-driven test generation for programs
- Simulating circuit-level simplifications on CNF
- A layered algorithm for quantifier elimination from linear modular constraints
- Combining Model Checking and Testing
- The SAT+CAS method for combinatorial search with applications to best matrices
- A generic framework for symbolic execution: a coinductive approach
- Propagation based local search for bit-precise reasoning
- Complexity of fixed-size bit-vector logics
- Executing and verifying higher-order functional-imperative programs in Maude
- Sharpening constraint programming approaches for bit-vector theory
- Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution
- Satisfiability Modulo Theories
- Algorithm and tools for constructing canonical forms of linear semi-algebraic formulas
- Dynamic Path Reduction for Software Model Checking
This page was built for software: STP
