Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time (Q875512)
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 5142386
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time |
scientific article; zbMATH DE number 5142386 |
Statements
Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time (English)
0 references
13 April 2007
0 references
structured program schemas
0 references
conservative schemas
0 references
liberal schemas
0 references
free schemas
0 references
linear schemas
0 references
schema equivalence
0 references
static analysis
0 references
program slicing
0 references
0 references
0.913167119026184
0 references
0.8671441674232483
0 references
0.7724781632423401
0 references
0.7651255130767822
0 references
0.7611312866210938
0 references
