Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains

  • Dejvuth Suwimonteerabuth
  • Stefan Schwoon
  • Javier Esparza
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4218)

Abstract

Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. Although the algorithm is exponential, a careful analysis reveals that the exponent is usually small in typical applications. We show that the algorithm can be used to compute winning regions in pushdown games. In a second contribution, we observe that the algorithm runs in polynomial time for a certain subproblem, and show that the computation of certificate chains with threshold certificates in the SPKI/SDSI authorization framework can be reduced to this subproblem. We present a detailed complexity analysis of the algorithm and its application, and report on experimental results obtained with a prototype implementation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Burkart, O., Steffen, B.: Model checking the full modal mu-calculus for infinite sequential processes. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 419–429. Springer, Heidelberg (1997)Google Scholar
  2. 2.
    Walukiewicz, I.: Pushdown processes: Games and model checking. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 62–74. Springer, Heidelberg (1996)Google Scholar
  3. 3.
    Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135–150. Springer, Heidelberg (1997)Google Scholar
  4. 4.
    Finkel, A., Willems, B., Wolper, P.: A direct symbolic approach to model checking pushdown systems. ENTCS 9 (1997)Google Scholar
  5. 5.
    Esparza, J., Hansel, D., Rossmanith, P., Schwoon, S.: Efficient algorithms for model checking pushdown systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 232–247. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  6. 6.
    Ellison, C., Frantz, B., Lampson, B., Rivest, R., Thomas, B., Ylönen, T.: RFC 2693: SPKI Certificate Theory. The Internet Society (1999)Google Scholar
  7. 7.
    Jha, S., Reps, T.: Model checking SPKI/SDSI. JCS 12(3–4), 317–353 (2004)Google Scholar
  8. 8.
    Cachat, T.: Symbolic strategy synthesis for games on pushdown graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 704–715. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    Hohl, F., Kubach, U., Leonhardi, A., Rothermel, K., Schwehm, M.: Nexus - an open global infrastructure for spatial-aware applications. Technical Report 1999/02, Universität Stuttgart: SFB 627 (1999)Google Scholar
  10. 10.
    Suwimonteerabuth, D., Schwoon, S., Esparza, J.: Efficient algorithms for alternating pushdown systems: Application to certificate chain discovery with threshold subjects. Technical report, Universität Stuttgart (2006)Google Scholar
  11. 11.
    Chandra, A., Kozen, D., Stockmeyer, L.: Alternation. J. ACM 28(1), 114–133 (1981)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Li, N., Winsborough, W., Mitchell, J.: Distributed credential chain discovery in trust management. In: Proc. CCS, pp. 156–165. ACM Press, New York (2001)Google Scholar
  13. 13.
    Clarke, D., Elien, J., Ellison, C., Fredette, M., Morcos, A., Rivest, R.: Certificate chain discovery in SPKI/SDSI (1999), http://theory.lcs.mit.edu/~rivest/

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Dejvuth Suwimonteerabuth
    • 1
  • Stefan Schwoon
    • 1
  • Javier Esparza
    • 1
  1. 1.Institut für Formale Methoden der InformatikUniversität StuttgartStuttgartGermany

Personalised recommendations