Skip to main content
Springer Nature Link
Log in

Reachability of Patterned Conditional Pushdown Systems

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Conditional pushdown systems (CPDSs) extend pushdown systems by associating each transition rule with a regular language over the stack alphabet. The goal is to model program verification problems that need to examine the runtime call stack of programs. Examples include security property checking of programs with stack inspection, compatibility checking of HTML5 parser specifications, etc. Esparza et al. proved that the reachability problem of CPDSs is EXPTIME-complete, which prevents the existence of an algorithm tractable for all instances in general. Driven by the practical applications of CPDSs, we study the reachability of patterned CPDS (pCPDS) that is a practically important subclass of CPDS, in which each transition rule carries a regular expression obeying certain patterns. First, we present new saturation algorithms for solving state and configuration reachability of pCPDSs. The algorithms exhibit the exponential-time complexity in the size of atomic patterns in the worst case. Next, we show that the reachability of pCPDSs carrying simple patterns is solvable in fixed-parameter polynomial time and space. This answers the question on whether there exist tractable reachability analysis algorithms of CPDSs tailored for those practical instances that admit efficient solutions such as stack inspection without exception handling. We have evaluated the proposed approach, and our experiments show that the pattern-driven algorithm steadily scales on pCPDSs with simple patterns.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Schwoon S. Model-checking pushdown systems [Ph.D. Thesis]. Department of Computer Science, Technische Universität München, 2002.

  2. Suwimonteerabuth D, Berger F, Schwoon S, Esparza J. jMoped: A test environment for Java programs. In Proc. the 33rd International Conference on Computer-Aided Verification, July 2017, pp.164-167.

  3. Ball T, Rajamani S K. The SLAM project: Debugging system software via static analysis. In Proc. the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 2002, pp.1-3.

  4. Reps T W, Schwoon S, Jha S, Melski D. Weighted pushdown systems and their application to interprocedural dataflow analysis. Sci. Comput. Program., 2005, 58(1/2): 206-263.

    Article  MathSciNet  Google Scholar 

  5. Song F, Touili T. PuMoC: A CTL model-checker for sequential programs. In Proc. the 27th IEEE/ACM International Conference on Automated Software Engineering, September 2012, pp.346-349.

  6. Hague M, Ong C H L. Analysing mu-calculus properties of pushdown systems. In Proc. the 17th International SPIN Workshop on Model Checking Software, September 2010, pp.187-192.

  7. Bouajjani A, Müller-Olm M, Touili T. Regular symbolic analysis of dynamic networks of pushdown systems. In Proc. the 16th International Conference on Concurrency Theory, August 2005, pp.473-487.

  8. Cai X J, Ogawa M. Well-structured pushdown systems. In Proc. the 24th International Conference on Concurrency Theory, August 2013, pp.121-136.

  9. Abdulla P A, Atig M F, Stenman J. Dense-timed pushdown automata. In Proc. the 27th Annual IEEE Symposium on Logic in Computer Science, June 2012, pp.35-44.

  10. Abdulla P A, Atig M F, Stenman J. Computing optimal reachability costs in priced dense-timed pushdown automata. In Proc. the 8th International Conference Language and Automata Theory and Applications, March 2014, pp.62-75.

  11. Esparza J, Kucera A, Schwoon S. Model-checking LTL with regular valuations for pushdown systems. In Proc. the 4th International Symposium on Theoretical Aspects of Computer Software, October 2001, pp.316-339.

  12. Li X, Ogawa M. Conditional weighted pushdown systems and applications. In Proc. the 2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, January 2010, pp.141-150.

  13. Minamide Y, Mori S. Reachability analysis of the HTML5 parser specification and its application to compatibility testing. In Proc. the 18th International Symposium on Formal Methods, August 2012, pp.293-307.

  14. Johnson J I, Sergey I, Earl C, Might M, van Horn D. Pushdown flow analysis with abstract garbage collection. Journal of Functional Programming, 2014, 24(2/3): 218-283.

    Article  MathSciNet  Google Scholar 

  15. Nitta N, Takata Y, Seki H. An efficient security verification method for programs with stack inspection. In Proc. the 8th ACM Conference on Computer and Communications Security, November 2001, pp.68-77.

  16. Shivers O G. Control-flow analysis of higher order languages or taming lambda [Ph.D. Thesis]. Carnegie Mellon University, 1991.

  17. Bravenboer M, Smaragdakis Y. Strictly declarative specification of sophisticated points-to analyses. In Proc. the 24th ACM SIGPLAN Conference on Object Oriented Programming Systems Languages and Applications, October 2009, pp.243-262.

  18. Lhoták O, Hendren L. Context-sensitive points-to analysis: Is it worth it? In Proc. the 15th International Conference on Compiler Construction, March 2006, pp.47-64.

  19. Thanh H V L, Li X. An on-the-fly algorithm for conditional weighted pushdown systems. Journal of Information Processing, 2014, 22(4): 1-7.

    Google Scholar 

  20. Uezato Y, Minamide Y. Pushdown systems with stack manipulation. In Proc. the 11th International Symposium on Automated Technology for Verification and Analysis, October 2013, pp.412-426.

  21. Song F, Miao W K, Pu G G, Zhang M. On reachability analysis of pushdown systems with transductions: Application to Boolean programs with call-by-reference. In Proc. the 26th International Conference on Concurrency Theory, September 2015, pp.383-397.

  22. Esparza J, Ganty P. Complexity of pattern-based verification for multithreaded programs. In Proc. the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 2011, pp.499-510.

Download references

Author information

Authors and Affiliations

  1. Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, 200062, China

    Xin Li, Patrick Gardy & Yu-Xin Deng

  2. Graduate School of Informatics, Nagoya University, Nagoya, 464-8601, Japan

    Hiroyuki Seki

Authors
  1. Xin Li
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Patrick Gardy
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Yu-Xin Deng
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Hiroyuki Seki
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Yu-Xin Deng.

Supplementary Information

ESM 1

(PDF 192 kb)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, X., Gardy, P., Deng, YX. et al. Reachability of Patterned Conditional Pushdown Systems. J. Comput. Sci. Technol. 35, 1295–1311 (2020). https://doi.org/10.1007/s11390-020-0541-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-020-0541-z

Keywords