Pages that link to "Item:Q1888196"
From MaRDI portal
The following pages link to Predicate abstraction of ANSI-C programs using SAT (Q1888196):
Displaying 16 items.
- Interprocedural and flow-sensitive type analysis for memory and type safety of C code (Q835770) (← links)
- Efficient SAT-based bounded model checking for software verification (Q947794) (← links)
- Verification and falsification of programs with loops using predicate abstraction (Q968302) (← links)
- CPBPV: a constraint-programming framework for bounded program verification (Q968353) (← links)
- Verification by gambling on program slices (Q2147204) (← links)
- Loop summarization using state and transition invariants (Q2248058) (← links)
- Ranking function synthesis for bit-vector relations (Q2248069) (← links)
- Verification of SpecC using predicate abstraction (Q2369884) (← links)
- Verification of Boolean programs with unbounded thread creation (Q2464944) (← links)
- SAT-Based Model Checking (Q3176368) (← links)
- Abstraction and Abstraction Refinement (Q3176371) (← links)
- Verifying Heap-Manipulating Programs in an SMT Framework (Q3510799) (← links)
- Using Counterexample Analysis to Minimize the Number of Predicates for Predicate Abstraction (Q3510827) (← links)
- Loop Summarization Using Abstract Transformers (Q3540068) (← links)
- Implementing Efficient All Solutions SAT Solvers (Q5266602) (← links)
- Game-Based Probabilistic Predicate Abstraction in PRISM (Q5415661) (← links)
