Sökning: "angela wallenburg"
Hittade 2 avhandlingar innehållade orden angela wallenburg.
1. Induction Rules for Proving Correctness of Imperative Programs
Sammanfattning : This thesis is aimed at simplifying the user-interaction in semi-interactive theorem proving for imperative programs. More specifically, we describe the creation of customised induction rules that are tailor-made for the specific program to verify and thus make the resulting proof simpler. LÄS MER
2. Induction rules for proving correctness of imperative programs
Sammanfattning : .... LÄS MER
Resultatsidor:
1