On Computability of Logical Approaches to Branching-Time Property Verification of Programs (Q5145688)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On Computability of Logical Approaches to Branching-Time Property Verification of Programs |
scientific article; zbMATH DE number 7299520
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Computability of Logical Approaches to Branching-Time Property Verification of Programs |
scientific article; zbMATH DE number 7299520 |
Statements
On Computability of Logical Approaches to Branching-Time Property Verification of Programs (English)
0 references
21 January 2021
0 references
analytical hierarchy
0 references
branching-time property
0 references
computability
0 references
constrained Horn clause
0 references
fixed-point logic
0 references
program verification
0 references
0.9075853
0 references
0.90328056
0 references
0.8888071
0 references
0.8866814
0 references
0.88494426
0 references
0 references
0.8818475
0 references
0.8805546
0 references
