On the edge of decidability in complexity analysis of loop programs (Q4923290)
From MaRDI portal
!
WARNING
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 6171175
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the edge of decidability in complexity analysis of loop programs |
scientific article; zbMATH DE number 6171175 |
Statements
ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS (English)
0 references
6 June 2013
0 references
static analysis
0 references
loop programs
0 references
subrecursive programming languages
0 references
0.7036309242248535
0 references
0.7014672160148621
0 references
0.695593535900116
0 references
0.6927469968795776
0 references
