Does “N+1 times” prove more programs correct than “N times”? (Q5887528)
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 7673912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Does “N+1 times” prove more programs correct than “N times”? |
scientific article; zbMATH DE number 7673912 |
Statements
Does “N+1 times” prove more programs correct than “N times”? (English)
0 references
12 April 2023
0 references
temporal logic
0 references
Kripke model
0 references
dynamic logic
0 references
verification system
0 references
validity relation
0 references
0.8300914168357849
0 references
0.7939590811729431
0 references
0.7915451526641846
0 references
