Open Access
Original Article

Acta Informatica

, Volume 44, Issue 2, pp 75-90

Decision problems for pushdown threads

Authors

  • Jan A. Bergstra
    • Faculty of Science, Programming Research GroupUniversity of Amsterdam
    • Utrecht UniversityDepartment of Philosophy, Applied Logic Group
  • Inge Bethke
    • Faculty of Science, Programming Research GroupUniversity of Amsterdam
  • Alban Ponse
    • Faculty of Science, Programming Research GroupUniversity of Amsterdam

DOI: 10.1007/s00236-007-0040-5

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.

Copyright information

© Springer-Verlag 2007