Sökning: "Floyd-Hoare logic"
Hittade 1 uppsats innehållade orden Floyd-Hoare logic.
1. Provably Sound and Secure Automatic Proving and Generation of Verification Conditions
Master-uppsats, KTH/Teoretisk datalogi, TCSSammanfattning : Formal verification of programs can be done with the aid of an interactive theorem prover. The program to be verified is represented in an intermediate language representation inside the interactive theorem prover, after which statements and their proofs can be constructed. This is a process that can be automated to a high degree. LÄS MER
Resultatsidor:
1