Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas (Q624386)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas |
scientific article |
Statements
Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas (English)
0 references
9 February 2011
0 references
free and liberal program schemas
0 references
Herbrand domain
0 references
program slicing
0 references
linear schemas
0 references
Weiser's algorithm
0 references
0 references
0 references
