Decision problems for pushdown threads
Threads as contained in a thread algebra emerge from the behavioral abstraction from programs in an appropriate program algebra. Threads may make use of services such as stacks, and a thread using a single stack is called a pushdown thread. Equivalence of pushdown threads is shown decidable whereas...
Saved in:
Published in | Acta informatica Vol. 44; no. 2; pp. 75 - 90 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Berlin
Springer
01.05.2007
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Threads as contained in a thread algebra emerge from the behavioral abstraction from programs in an appropriate program algebra. Threads may make use of services such as stacks, and a thread using a single stack is called a pushdown thread. Equivalence of pushdown threads is shown decidable whereas pushdown thread inclusion is undecidable. This is again an example of a borderline crossing where the equivalence problem is decidable, whereas the inclusion problem is not. [PUBLICATION ABSTRACT] |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
ISSN: | 0001-5903 1432-0525 |
DOI: | 10.1007/s00236-007-0040-5 |