The following pages link to KLEE (Q17045):
Displayed 39 items.
- LCTD: test-guided proofs for C programs on LLVM (Q338629) (← links)
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning (Q457250) (← links)
- The configurable SAT solver challenge (CSSC) (Q502389) (← 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)
- Z3str2: an efficient solver for strings, regular expressions, and length constraints (Q526767) (← links)
- Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists (Q746778) (← links)
- Leveraging compiler intermediate representation for multi- and cross-language verification (Q784116) (← links)
- Harnessing static analysis to help learn pseudo-inverses of string manipulating procedures for automatic test generation (Q784127) (← links)
- Symbolic computation via program transformation (Q1623144) (← links)
- Effective use of SMT solvers for program equivalence checking through invariant-sketching and query-decomposition (Q1656596) (← links)
- Incremental bounded model checking for embedded software (Q1682291) (← links)
- TASS: the toolkit for accurate scientific software (Q1949767) (← links)
- FEVS: a functional equivalence verification suite for high-performance scientific computing (Q1949768) (← links)
- Symbolic execution formally explained (Q1982639) (← links)
- Model checking boot code from AWS data centers (Q2050104) (← links)
- Verifying Whiley programs with Boogie (Q2102933) (← links)
- Algorithm selection for dynamic symbolic execution: a preliminary study (Q2119113) (← links)
- Syntax-guided rewrite rule enumeration for SMT solvers (Q2181939) (← links)
- Efficient strategies for CEGAR-based model checking (Q2209549) (← links)
- Scalable and precise refinement of cache timing analysis via path-sensitive verification (Q2251379) (← links)
- Wombit: a portfolio bit-vector solver using word-level propagation (Q2323450) (← links)
- Constraint programming for dynamic symbolic execution of JavaScript (Q2327235) (← links)
- Automatically proving termination and memory safety for programs with pointer arithmetic (Q2362494) (← links)
- Executing and verifying higher-order functional-imperative programs in Maude (Q2409629) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- Loop Invariant Symbolic Execution for Parallel Programs (Q2891433) (← links)
- Sigma* (Q2931821) (← links)
- Collective Assertions (Q3075497) (← links)
- Efficient Loop Navigation for Symbolic Execution (Q3172934) (← links)
- Combining Model Checking and Testing (Q3176377) (← links)
- Connecting Program Synthesis and Reachability: Automatic Program Repair Using Test-Input Generation (Q3303900) (← links)
- Symbolic Memory with Pointers (Q3457810) (← links)
- Automation of Quantitative Information-Flow Analysis (Q5300883) (← links)
- Beginner's luck: a language for property-based generators (Q5370850) (← links)
- An Introduction to Test Specification in FQL (Q5391520) (← links)
- A sound and complete abstraction for reasoning about parallel prefix sums (Q5408435) (← links)
- A Slice-Based Decision Procedure for Type-Based Partial Orders (Q5747758) (← links)