S. Jarzabek. Design of flexible static program analyzers with PQL. IEEE Transactions on Software Engineering, 24(3):197--215, March 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Representing and Accessing Extracted Information - Cox, Clarke (2001) (3 citations) (Correct)
....data match a predefined entity relationship based model, specifically designed for C . Jupiter is more general in applicability being language independent. Instead of focusing on the data representation, it is possible to design a repository around its query facilities. SCA [33] and PQL [24] are examples of custom query languages explicitly designed for querying source code repositories. The main drawback of this approach is the requirement for the language designer to anticipate the needs of future users. By providing both a general purpose text retrieval language and a functional ....
S. Jarzabek. Design of flexible static program analyzers with PQL. IEEE Transactions on Software Engineering, 24(3):197--215, March 1998.
A Model Independent Source Code Repository - Cox, Clarke, Sim (1999) (Correct)
....the source code must be abstracted in some manner so that it satisfies the requirements of the data model supported by the chosen database system. Databases applied to the management of source code are known as software repositories and to date, the use of entity relationship [4] object oriented [14], graph based [8] and relational [16] data models has been documented. Software engineers frequently use the term conceptual model to refer to the instance of the data model (the data schema) that is used in the repository. CIA [4] stores a conceptual program model based on the ....
....The algebra is highly dependent upon an object oriented data model and only considers syntactic (and not semantic) information found in source code. The actual implementation uses the database from the REFINE system as its repository. Jarzabek, in his PQL (Program Query Language) system [14] advocates a repository system independent of its implementation. PQL relies on extended Object Modeling Technology (OMT) 20] to describe source files. These OMT models are then translated into entity relationship data models for storage in a database. Kamp [15] considers a repository as ....
Stan Jarzabek. Design of flexible static program analyzers with PQL. IEEE Transactions on Software Engineering, 24(3):197--215, March 1998.
Using View-Based Models to Formalize Architecture Description - Lichtner, Alencar, Cowan (1998) (Correct)
....2a) for determining precisely how and to what extent each ADL supports the view, and to what extent the ADLs differ in their support for similar features. 2. 2 Architecture Analysis While formal models of programming languages have been used to develop static analysis environments for programs [12], to the best of our knowledge this approach has not been applied to architecture description. The concept, however, is quite similar, consisting of two main components: an architecture knowledge base (AKB) which stores the details of an architectural description, and a facility for querying the ....
....Elements from within an architectural specification are converted into a data representation based on the formal model. Once the specification has been parsed and the resulting facts stored in a knowledge base, the architect can use the query facility (similar to a standard query language [12]) to ask questions about the design. To illustrate, the following are examples of queries pertaining to the structural aspects of an architectural design (based on the model in Figure 1) ffl What is the set of elements in configuration conf1 Select element.name such that element of (element, ....
Stan Jarzabek, "Design of Flexible Static Program Analyzers with PQL", IEEE Transactions on Software Engineering, pp. 197--215, Mar. 1998.
From an Object Semantic Model to a Design of SPA - Jin Song Dong Self-citation (Jarzabek) (Correct)
....that enhance program understanding during maintenance by answering queries about programs. SPAs can store source code information in a database, attribute syntax tree, dependency graphs, etc. Queries are evaluated based on that information. A number of program query languages have been proposed [1, 8, 10]. The design of some static program analyzers has been based on these languages. However, few of these program query languages have a formal foundation. As a result, the interpretations of many program queries tend to be ambiguous, which often lead to an imprecise design of static program ....
....However, few of these program query languages have a formal foundation. As a result, the interpretations of many program queries tend to be ambiguous, which often lead to an imprecise design of static program analyzers. Our earlier experience on the design and development an SPA based on PQL [8] has demonstrated that it is difficult to come up with a rigorous design of an SPA without defining the precise models of the relationships between program objects, e.g. the hierarchic relationships between programs and procedures, the relationship between procedures and their corresponding ....
[Article contains additional citation context not shown here]
S. Jarzabek. Design of Flexible Static Program Analyzers with PQL. IEEE Trans. Software Eng., pages 197--215, March 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC