The following pages link to CSSV (Q25615):
Displaying 16 items.
- Efficient SAT-based bounded model checking for software verification (Q947794) (← links)
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses (Q988565) (← links)
- Loop summarization using state and transition invariants (Q2248058) (← links)
- (Q3499221) (← links)
- Loop Summarization Using Abstract Transformers (Q3540068) (← links)
- Taming the Wrapping of Integer Arithmetic (Q3611998) (← links)
- Program Analysis Using Symbolic Ranges (Q3612010) (← links)
- Static Analysis in Disjunctive Numerical Domains (Q3613374) (← links)
- Static Analysis of String Manipulations in Critical Embedded C Programs (Q3613377) (← links)
- Symbolic String Verification: Combining String Analysis and Size Analysis (Q3617765) (← links)
- Statically Inferring Complex Heap, Array, and Numeric Invariants (Q4930717) (← links)
- SPEED (Q5261512) (← links)
- A combination framework for tracking partition sizes (Q5261520) (← links)
- Compiler Construction (Q5308721) (← links)
- Programming Languages and Systems (Q5493397) (← links)
- Static Analysis (Q5897439) (← links)
