Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology

Doh, Kyung-Goo; Kim, Hyunha; Schmidt, David A.

doi:10.1007/978-3-642-03237-0_18

Cited by 27 publications

(23 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Two main representations for approximated values were used so far. In [4], [2], [3] the sets of potential string values are described using regular expressions; in [9] approximations are represented in more implicit form as a solutions of a system of (recursive) dataflow equations.…”

Section: Graph-based Input Representationmentioning

confidence: 99%

“…Our approach for abstract traslation borrows the idea of reusing the control structures used in classical parsing from [9]. Control tables of LALR analyzer may be generated by some conventional tool (e.g.…”

Section: Abstract Translation Algorithmmentioning

confidence: 99%

“…In abstract parsing the source code of a host application is statically analyzed to provide some constructive representation of the set of stringembedded language clauses which can possible be generated at run time [9], [4]. This representation is then analyzed by a certain parsing algorithm which is usually derived from some existing one for plain strings [5].…”

Section: Introductionmentioning

confidence: 99%

“…The conventional solution which is provided by a number of tools is based on run-time translation. We present a static abstract translation approach which originates from the abstract parsing technique [9] initially developed for syntax analysis of string-embedded languages. We present abstract translation algorithm and some optimization techniques, and discuss the results of its evaluation on a real-world industrial application.…”

mentioning

confidence: 99%

See 3 more Smart Citations

From Abstract Parsing to Abstract Translation

Grigoriev¹,

Kirilenko

2014

Proceedings of the Spring/Summer Young Researchers' Colloquium on Software Engineering

View full text Add to dashboard Cite

Abstract-String-embedded language transformation is one of the problems which can be faced during database and information system migration. The conventional solution which is provided by a number of tools is based on run-time translation. We present a static abstract translation approach which originates from the abstract parsing technique [9] initially developed for syntax analysis of string-embedded languages. We present abstract translation algorithm and some optimization techniques, and discuss the results of its evaluation on a real-world industrial application.

show abstract

Section: Graph-based Input Representationmentioning

confidence: 99%

Section: Abstract Translation Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

From Abstract Parsing to Abstract Translation

Grigoriev¹,

Kirilenko

2014

Proceedings of the Spring/Summer Young Researchers' Colloquium on Software Engineering

View full text Add to dashboard Cite

show abstract

“…Doh et al [8] proposed a technique called "abstract parsing": it combines LR(k)-parsing technology and data-flow analysis to analyse dynamically generated documents. Their technique is quite precise, but the level of abstraction is fixed, and it cannot be tuned at different levels of precision and efficiency.…”

Section: Related Workmentioning

confidence: 99%

Static Analysis of String Values

Costantini

Ferrara

Cortesi

2011

Formal Methods and Software Engineering

View full text Add to dashboard Cite

show abstract

A suite of abstract domains for static analysis of string values

2013

View full text Add to dashboard Cite

Strings are widely used in modern programming languages in various scenarios. For instance, strings are used to build up Structured Query Language (SQL) queries that are then executed. Malformed strings may lead to subtle bugs, as well as non-sanitized strings may raise security issues in an application. For these reasons, the application of static analysis to compute safety properties over string values at compile time is particularly appealing. In this article, we propose a generic approach for the static analysis of string values based on abstract interpretation. In particular, we design a suite of abstract semantics for strings, where each abstract domain tracks a different kind of information. We discuss the trade-off between efficiency and accuracy when using such domains to catch the properties of interest. In this way, the analysis can be tuned at different levels of precision and efficiency, and it can address specific properties. The concrete semantics of these operators is approximated in different ways by the five different abstract domains. In addition, after 30 years of practice with numerical domains, it is clear that a monolithic domain precise on any program and property (e.g., Polyhedra [14]) gives up in terms of efficiency, whereas to achieve scalability, we need specific approximations on a given property (e.g., Pentagons [17]) or class of programs (e.g., ASTRÉE [18]). With this scenario in mind, we develop several domains inside the same framework to tune the analysis at different levels of precision and efficiency with respect to the analyzed class of programs and property. Other abstractions are possible and welcomed, and we expect our framework to be generic enough to support them.This article ‡ is structured as follows. In the rest of this section, we introduce two running examples, and we recall some basic concepts of abstract interpretation. Section 2 defines the syntax of the string operators that we will consider in the rest of the article. Section 3 introduces their concrete semantics, whereas in Section 4, the five abstract domains and the core of this work are formalized and are used to analyze the running examples. In Section 5, more experimental results are presented. Finally, Section 6 discusses the related work, and Section 7 concludes. Running examplesThroughout all the article, we will always refer to the two examples reported in Figures 1(a) and 1(b).The first Java program, prog1, is taken from [7], and it dynamically builds an SQL query by concatenating several strings. One of these concatenations applies only if a given input value, unknown at compile time, is not null. We are interested in checking if the SQL query resulting by ‡ The article is a fully revised and extended version of [19]

show abstract

Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology

Cited by 27 publications

References 18 publications

From Abstract Parsing to Abstract Translation

From Abstract Parsing to Abstract Translation

Static Analysis of String Values

A suite of abstract domains for static analysis of string values

Contact Info

Product

Resources

About