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
• An Introduction to Test Specification in FQL
• 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
• Alternating Control Flow Reconstruction
• Stimuli Generation for Functional Hardware Verification with Constraint Programming
• Runtime Exception Detection in Java Programs Using Symbolic Execution
• Structural Statistical Software Testing with Active Learning in a Graph
• Concolic Testing in CLP
• 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
• Automation of Quantitative Information-Flow Analysis
• Association of Under-Approximation Techniques for Generating Tests from Models
• Scalable and precise refinement of cache timing analysis via path-sensitive verification
• Compositional may-must program analysis
• Symbolic execution based on language transformation
• Connecting Program Synthesis and Reachability: Automatic Program Repair Using Test-Input Generation
• Formal testing for separation assurance
• Discovering invariants via simple component analysis
• Model Checking Software
• Observations in using parallel and sequential evolutionary algorithms for automatic software 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
• Matching Multiplications in Bit-Vector Formulas
• A canonical form based decision procedure and model checking approach for propositional projection temporal logic
• LCTD: test-guided proofs for C programs on LLVM
• Software Model Checking: Searching for Computations in the Abstract or the Concrete
• vlogsl: A Strategy Language for Simulation-Based Verification of Hardware
• Beginner's luck: a language for property-based generators
• Test selection for traces refinement
• Efficient Loop Navigation for Symbolic Execution
• 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
• Combining Model Checking and Testing
• A generic framework for symbolic execution: a coinductive approach
• A Random Testing Approach Using Pushdown Automata
• Executing and verifying higher-order functional-imperative programs in Maude
• Collaborative Verification and Testing with Explicit Assumptions
• Model Checking MSVL Programs Based on Dynamic Symbolic Execution
• Concolic Execution in Functional Programming by Program Instrumentation
• Dashed strings for string constraint solving
• 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
• Back to the future
• Dynamic Path Reduction for Software Model Checking
• Introduction to Model Checking

This page was built for software: DART