Effective generation of verification conditions for non-deterministic unstructured programs (Q2882984)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6033066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Effective generation of verification conditions for non-deterministic unstructured programs |
scientific article; zbMATH DE number 6033066 |
Statements
11 May 2012
0 references
assertion language
0 references
Hoare triple
0 references
Floyd method
0 references
verification conditions
0 references
Effective generation of verification conditions for non-deterministic unstructured programs (English)
0 references
0.8287318348884583
0 references
0.7732259035110474
0 references
0.7229666709899902
0 references
0.7215331792831421
0 references
0.7073401212692261
0 references
