DART

swMATH7260MaRDI QIDQ19309FDOQ19309

Author name not available (Why is that?)

Cited In (59)

• A non-termination criterion for binary constraint logic programs
• A Myhill-Nerode theorem for register automata and symbolic trace languages
• Symbolic execution formally explained
• Test generation from event system abstractions to cover their states and transitions
• Constraint programming for dynamic symbolic execution of JavaScript
• Not all bugs are created equal, but robust reachability can tell the difference
• Runtime Exception Detection in Java Programs Using Symbolic Execution
• Structural Statistical Software Testing with Active Learning in a Graph
• Concolic execution in functional programming by program instrumentation
• Automation of broad sanity test generation
• An Evaluation of Automata Algorithms for String Analysis
• Exploiting binary floating-point representations for constraint propagation
• Algorithm selection for dynamic symbolic execution: a preliminary study
• Recognizing malicious software behaviors with tree automata inference
• Path Feasibility Analysis for String-Manipulating Programs
• Collaborative verification and testing with explicit assumptions
• Scalable and precise refinement of cache timing analysis via path-sensitive verification
• Symbolic execution based on language transformation
• Matching multiplications in bit-vector formulas
• Formal testing for separation assurance
• Discovering invariants via simple component analysis
• An introduction to test specification in FQL
• Efficient loop navigation for symbolic execution
• Model Checking Software
• Observations in using parallel and sequential evolutionary algorithms for automatic software testing
• Combining model checking and testing
• Concolic testing in logic programming
• Model-Based Test Selection for Infinite-State Reactive Systems
• Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning
• Concolic testing in CLP
• A random testing approach using pushdown automata
• Automation of quantitative information-flow analysis
• A canonical form based decision procedure and model checking approach for propositional projection temporal logic
• LCTD: test-guided proofs for C programs on LLVM
• Compositional may-must program analysis: unleashing the power of alternation
• Software Model Checking: Searching for Computations in the Abstract or the Concrete
• Beginner's luck: a language for property-based generators
• Back to the future, revisiting precise program verification using SMT solvers
• Test selection for traces refinement
• Dual analysis for proving safety and finding bugs
• Integration of verification methods for program systems
• Full simulation coverage for SystemC transaction-level models of systems-on-a-chip
• Strategies for scalable symbolic execution-driven test generation for programs
• Improving Symbolic Automata Learning with Concolic Execution
• Symbolic Model-based Test Selection
• Introduction to model checking
• A generic framework for symbolic execution: a coinductive approach
• Stimuli generation for functional hardware verification with constraint programming
• Executing and verifying higher-order functional-imperative programs in Maude
• Alternating control flow reconstruction
• Model Checking MSVL Programs Based on Dynamic Symbolic Execution
• Dashed strings for string constraint solving
• \texttt{vlogsl}: a strategy language for simulation-based verification of hardware
• Orion: High-Precision Methods for Static Error Analysis of C and C++ Programs
• Machine learning steered symbolic execution framework for complex software code
• Decision procedures. An algorithmic point of view
• Association of under-approximation techniques for generating tests from models
• Dynamic Path Reduction for Software Model Checking
• Connecting program synthesis and reachability: automatic program repair using test-input generation

This page was built for software: DART