Conditional weighted pushdown systems and applications

Li, Xin; Ogawa, Mizuhito

doi:10.1145/1706356.1706382

Cited by 13 publications

(12 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We expect that our analysis would likely excel at analysing problem instances generated by the analysis and verification of object-oriented programs as originally discussed in Ref. [1], which do not contain as many as distinguished regular conditions as those in Ref. [2], and targets of interest in program analysis and verification are in those simple forms as discussed above.…”

Section: Discussionmentioning

confidence: 99%

“…Program analysis yielded by WPDSs are context-sensitive in terms of valid paths. Li et al [1] further extended WPDSs to Conditional Weighted Pushdown Systems (CWPDSs), in which each transition is guarded by a regular language that specifies conditions under which the transition can be applied. The extension is motivated by the observation that, WPDSs are not precise enough to model objected-oriented programs like Java in program analysis.…”

Section: Introductionmentioning

confidence: 99%

“…A points-to analysis algorithm was designed in the framework of CWPDSs, which enjoys context-sensitivity beyond valid paths regarding heap abstraction, call graph construction, and heap access [1]. Besides modelling objected-oriented program features, it can yield algorithms for generating stack-based access control policies for programs that employ stack-based ac- 1 University of Science -Ho Chi Minh City, Vietnam. li-xin@kb.is.s.u-tokyo.ac.jp cess control mechanism, such as Java or and Microsoft CLR (common language runtime) [7].…”

Section: Introductionmentioning

confidence: 99%

“…It was shown that the model checking problem on CWPDSs can be reduced to that on WPDSs, and an offline algorithm was given, which translates CWPSs to WPDSs by synchronizing the underlying pushdown system and finite state automata built for regular conditions [1]. The translation, however, can cause an exponential blow-up of the system, and prohibits the offline algorithm from practical applications.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

An On-The-Fly Algorithm for Conditional Weighted Pushdown Systems

Thanh

2014

IPSJ Online Transactions

Self Cite

View full text Add to dashboard Cite

Pushdown systems (PDSs) are well-understood as abstract models of recursive sequential programs, and weighted pushdown systems (WPDSs) are a general framework for solving certain meet-over-all-path problems in program analysis. Conditional WPDSs (CWPDSs) further extend WPDSs to enhance the expressiveness of WPDSs, in which each transition is guarded by a regular language over the stack that specifies conditions under which a transition rule can be applied. CWPDSs or its instance are shown to have wide applications in analysis of objected-oriented programs, access rights analysis, etc. Model checking CWPDSs was shown to be reduced to model checking WPDSs, and an offline algorithm was given that translates CWPSs to WPDSs by synchronizing the underlying PDS and finite state automata accepting regular conditions. The translation, however, can cause an exponential blow-up of the system. This paper presents an on-the-fly model checking algorithm for CWPDSs that synchronizes the computing machineries on-demand while computing post-images of regular configurations. We developed an on-the-fly model checker for CWPDSs and apply it to models generated from the reachability analysis of the HTML5 parser specification. Our preliminary experiments show that, the on-the-fly algorithm drastically outperforms the offline algorithm regarding both practical space and time efficiency.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An On-The-Fly Algorithm for Conditional Weighted Pushdown Systems

Thanh

2014

IPSJ Online Transactions

Self Cite

View full text Add to dashboard Cite

show abstract

“…Conditional pushdown systems extend pushdown systems with the ability to check the whole stack content against a regular language [EKS03,LO10]. We proposed an algorithm of their reachability analysis in our previous work on the analysis of the HTML 5 parser specification [MM12].…”

Section: Introductionmentioning

confidence: 99%

Weighted Pushdown Systems with Indexed Weight Domains

Minamide¹

2016

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. The reachability analysis of weighted pushdown systems is a very powerful technique in verification and analysis of recursive programs. Each transition rule of a weighted pushdown system is associated with an element of a bounded semiring representing the weight of the rule. However, we have realized that the restriction of the boundedness is too strict and the formulation of weighted pushdown systems is not general enough for some applications.To generalize weighted pushdown systems, we first introduce the notion of stack signatures that summarize the effect of a computation of a pushdown system and formulate pushdown systems as automata over the monoid of stack signatures. We then generalize weighted pushdown systems by introducing semirings indexed by the monoid and weaken the boundedness to local boundedness.

show abstract

Pushdown Systems with Stack Manipulation

Uezato

Minamide

2013

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

Conditional weighted pushdown systems and applications

Cited by 13 publications

References 15 publications

An On-The-Fly Algorithm for Conditional Weighted Pushdown Systems

An On-The-Fly Algorithm for Conditional Weighted Pushdown Systems

Weighted Pushdown Systems with Indexed Weight Domains

Pushdown Systems with Stack Manipulation

Contact Info

Product

Resources

About