Pex
From MaRDI portal
Software:19312
swMATH7263MaRDI QIDQ19312FDOQ19312
Author name not available (Why is that?)
Cited In (25)
- Test generation from event system abstractions to cover their states and transitions
- An Evaluation of Automata Algorithms for String Analysis
- Algorithm selection for dynamic symbolic execution: a preliminary study
- A decision procedure for regular membership and length constraints over unbounded strings
- Path Feasibility Analysis for String-Manipulating Programs
- Collaborative verification and testing with explicit assumptions
- Symbolic execution based on language transformation
- Formal testing for separation assurance
- Discovering invariants via simple component analysis
- Efficient loop navigation for symbolic execution
- Combining model checking and testing
- Static contract checking with abstract interpretation
- On theorem prover-based testing
- URSA: a system for uniform reduction to SAT
- Test selection for traces refinement
- Integration of verification methods for program systems
- Test case generation for object-oriented imperative languages in CLP
- A generic framework for symbolic execution: a coinductive approach
- Verifying data- and control-oriented properties combining static and runtime verification: theory and tools
- Interleaving symbolic execution and partial evaluation
- Executing and verifying higher-order functional-imperative programs in Maude
- A first step in the design of a formally verified constraint-based testing tool: FocalTest
- Machine learning steered symbolic execution framework for complex software code
- An efficient SMT solver for string constraints
- Symbolic memory with pointers
This page was built for software: Pex
