Acta Informatica

, Volume 44, Issue 2, pp 75–90

Decision problems for pushdown threads

Open AccessOriginal Article

DOI: 10.1007/s00236-007-0040-5

Cite this article as:
Bergstra, J.A., Bethke, I. & Ponse, A. Acta Informatica (2007) 44: 75. doi:10.1007/s00236-007-0040-5


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.

Download to read the full article text

Copyright information

© Springer-Verlag 2007

Authors and Affiliations

  1. 1.Faculty of Science, Programming Research GroupUniversity of AmsterdamAmsterdamThe Netherlands
  2. 2.Utrecht UniversityDepartment of Philosophy, Applied Logic GroupUtrechtThe Netherlands