Weakest-precondition of unstructured programs.
Program verification systems typically transform a program into a logical expression which is then fed to a theorem prover. The logical expression represents the weakest precondition of the program relative to its specification; when (and if!) the theorem prover is able to prove the expression, then...
| 发表在: | Software engineering notes. 31, 1 (2006). |
|---|---|
| 主要作者: | |
| 格式: | 文件 |
| 语言: | 英语 |
| 主题: |