The following pages link to Lazy abstraction (Q5178898):
Displaying 50 items.
- LCTD: test-guided proofs for C programs on LLVM (Q338629) (← links)
- Finding and fixing faults (Q414907) (← links)
- Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning (Q457250) (← links)
- An extension of lazy abstraction with interpolation for programs with arrays (Q479820) (← links)
- Component-wise incremental LTL model checking (Q510894) (← links)
- SMT-based model checking for recursive programs (Q518396) (← links)
- A new representation and associated algorithms for generalized planning (Q543617) (← links)
- A lazy approach to symmetry reduction (Q613132) (← links)
- An efficient approach for abstraction-refinement in model checking (Q690465) (← links)
- Lazy behavioral subtyping (Q710675) (← links)
- Under-approximating loops in C programs for fast counterexample detection (Q746774) (← links)
- Refining abstract interpretations (Q765513) (← links)
- Verifying time partitioning in the DEOS scheduling kernel (Q816194) (← links)
- Translating Java for multiple model checkers: The Bandera back-end (Q816196) (← links)
- Verifying distributed real-time properties of embedded systems via graph transformations and model checking (Q853626) (← links)
- Kleene getting lazy (Q870283) (← links)
- Closure properties and complexity of rational sets of regular languages (Q888431) (← links)
- Hybrid automata-based CEGAR for rectangular hybrid systems (Q888464) (← links)
- Verification of evolving software via component substitutability analysis (Q934712) (← links)
- On model checking multiple hybrid views (Q947781) (← links)
- Verification and falsification of programs with loops using predicate abstraction (Q968302) (← links)
- Partial model checking via abstract interpretation (Q990121) (← links)
- Reducing concurrent analysis under a context bound to sequential analysis (Q1039852) (← links)
- Theory decision by decomposition (Q1041591) (← links)
- A unifying view on SMT-based software verification (Q1703012) (← links)
- Parallelizing SMT solving: lazy decomposition and conciliation (Q1749390) (← links)
- Experience of improving the BLAST static verification tool (Q1758710) (← links)
- A local approach for temporal model checking of Java bytecode (Q1776379) (← links)
- Sharpening constraint programming approaches for bit-vector theory (Q2011567) (← links)
- Generating models of infinite-state communication protocols using regular inference with abstraction (Q2018056) (← links)
- Configurable verification of timed automata with discrete variables (Q2120808) (← links)
- Reusing predicate precision in value analysis (Q2165503) (← links)
- Efficient strategies for CEGAR-based model checking (Q2209549) (← links)
- Loop summarization using state and transition invariants (Q2248058) (← links)
- A framework for computing finite SLD trees (Q2258840) (← links)
- Translating Xd-C programs to MSVL programs (Q2290648) (← links)
- Specification and verification of concurrent programs through refinements (Q2351261) (← links)
- Infinite-state invariant checking with IC3 and predicate abstraction (Q2363814) (← links)
- Counterexample-guided predicate abstraction of hybrid systems (Q2368954) (← links)
- An automatic method for the dynamic construction of abstractions of states of a formal model (Q2452756) (← links)
- Lazy slicing for state-space exploration (Q2637297) (← links)
- Program verification with interacting analysis plugins (Q2642983) (← links)
- A Configurable CEGAR Framework with Interpolation-Based Refinements (Q2827465) (← links)
- Space-reduction strategies for model checking dynamic software (Q2845504) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- Whale: An Interpolation-Based Algorithm for Inter-procedural Verification (Q2891400) (← links)
- Dynamic Reductions for Model Checking Concurrent Software (Q2961569) (← links)
- An Assume Guarantee Approach for Checking Quantified Array Assertions (Q3067480) (← links)
- Refinement-Based CFG Reconstruction from Unstructured Programs (Q3075470) (← links)
- Automata Learning with Automated Alphabet Abstraction Refinement (Q3075487) (← links)
