Selected publications by Stefan Schwoon

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.

@inproceedings{SSE-atva06,
   address = {Beijing, China},
   author = {Suwimonteerabuth, Dejvuth and Schwoon, Stefan and Esparza, Javier},
   booktitle = {{P}roceedings of the 4th {I}nternational {S}ymposium on {A}utomated {T}echnology for {V}erification and {A}nalysis ({ATVA}'06)},
   DOI = {10.1007/11901914_13},
   editor = {Graf, Susanne and Zhang, Wenhui},
   month = oct,
   pages = {141-153},
   publisher = {Springer},
   series = {Lecture Notes in Computer Science},
   title = {Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains},
   url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/SSE-atva06.pdf},
   volume = {4218},
   year = {2006},
}

About LSV