Reachability analysis of rewriting for software verification

T Genet - 2009 - theses.hal.science
This work is about proving safety properties on programs. Such proof can be done by
showing that" forbidden" program states, violating the property, are unreachable. For proving …

[PDF][PDF] Reachability analysis of rewriting for software verification

This work is concerned with software verification techniques, ie how to prove properties on
softwares. The techniques we focus on do not require to execute the program. These …