Decision problems for pushdown threads

Authors:
Jan A. Bergstra;Inge Bethke;Alban Ponse
Affiliations:
University of Amsterdam, Faculty of Science, Programming Research Group, Amsterdam, The Netherlands and Department of Philosophy, Applied Logic Group, Utrecht University, Utrecht, The Netherlands;af1 University of Amsterdam, Faculty of Science, Programming Research Group, Amsterdam, The Netherlands;af1 University of Amsterdam, Faculty of Science, Programming Research Group, Amsterdam, The Netherlands
Venue:
Acta Informatica
Year:
2007

Citing 0
Cited 1

Transmission Protocols for Instruction Streams

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.