Cited in
(30)- SPEED: precise and efficient static estimation of program computational complexity
- Loop summarization using state and transition invariants
- A combination framework for tracking partition sizes
- Statically inferring complex heap, array, and numeric invariants
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses
- Efficient SAT-based bounded model checking for software verification
- Static Analysis in Disjunctive Numerical Domains
- Program Analysis Using Symbolic Ranges
- Static Analysis of String Manipulations in Critical Embedded C Programs
- Symbolic String Verification: Combining String Analysis and Size Analysis
- Static Analysis
- DiVer
- Compiler Construction
- Consit
- SPEED
- CCured
- RacerX
- TVLA
- aiT
- ASTREE
- FunArray
- Octagon
- Scapy
- Privtrans
- Cibai
- Taming the Wrapping of Integer Arithmetic
- SOBER
- Value-range analysis of C programs. Towards proving the absence of buffer overflow vulnerabilities
- Loop Summarization Using Abstract Transformers
- Programming Languages and Systems
This page was built for software: CSSV
