.QL: Object-Oriented Queries Made Easy

Moor, Oege de; Sereni, Damien; Verbaere, Mathieu; Hajiyev, Elnar; Avgustinov, Pavel; Ekman, Torbjörn; Ongkingco, Neil; Tibble, Julian

doi:10.1007/978-3-540-88643-3_3

Cited by 33 publications

(30 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Passos et al [42] presented an overview of three approaches: a rule-based approach [10], an RM type approach [43], and an approach that allowed architects to visualize the system as a hierarchical dependency matrix of source code elements [44] with architectural rules embedded. They recommended RM for organizations interested in systematically incorporating architecture conformance checking into their software development process, due to a well-defined architecture conformance process, centred on holistic high-level models as defined by architects.…”

Section: Conformance By Extractionmentioning

confidence: 99%

“…This work is referred to in the literature as architecture reconciliation [7] architecture conformance [3] or compliance checking [9]. Several techniques have been proposed in this area, ranging from allowing architects probe the architecture of specific points in the system [10][11] by defining textual rules, to more system-encompassing specifications like Reflexion Modelling (RM). In Reflexion Modelling [12], for example, the architect is initially prompted to explicitly state their ideal (as-intended) architecture for the system, as a simple vertices-and-edges diagram in which vertices represent architectural modules and edges represent the expected/allowed dependencies between these modules.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Real-Time Reflexion Modelling in architecture reconciliation: A multi case study

Buckley

Alí

English

et al. 2015

Information and Software Technology

View full text Add to dashboard Cite

ContextReflexion Modelling is considered one of the more successful approaches to architecture reconciliation. Empirical studies strongly suggest that professional developers involved in real-life industrial projects find the information provided by variants of this approach useful and insightful, but the degree to which it resolves architecture conformance issues is still unclear. ObjectiveThis paper aims to assess the level of architecture conformance achieved by professional architects using Reflexion Modelling, and to determine how the approach could be extended to improve its suitability for this task. MethodAn in-vivo, multi-case-study protocol was adopted across five software systems, from four different financial services organizations. Think-aloud, video-tape and interview data from professional architects involved in Reflexion Modelling sessions were analysed qualitatively. ResultsThis study showed that (at least) four months after the Reflexion Modelling sessions less than 50% of the architectural violations identified were removed. The majority of participants who did remove violations favoured changes to the architectural model rather than to the code. Participants seemed to work off two specific architectural templates, and interactively explored their architectural model to focus in on the causes of violations, and to assess the ramifications of potential code changes. They expressed a desire for dependency analysis beyond static-source-code analysis and scalable visualizations. ConclusionThe findings support several interesting usage-in-practice traits, previously hinted at in the literature. These include 1) the iterative analysis of systems through Reflexion models, as a precursor to possible code change or as a focusing mechanism to identify the location of architecture conformance issues, 2) the extension of the approach with respect to dependency analysis of software systems and architectural modelling templates, 3) improved visualization support and 4) the insight that identification of architectural violations in itself does not lead to their removal in the majority of instances.

show abstract

Section: Conformance By Extractionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Real-Time Reflexion Modelling in architecture reconciliation: A multi case study

Buckley

Alí

English

et al. 2015

Information and Software Technology

View full text Add to dashboard Cite

show abstract

“…We also acknowledge less specific influences by systems like TXL [Cor06], ANTLR [Par07], JastAdd [HM03], Semmle [dMSV+08], DMS [BPM04], and various others. A first application of Rascal in the domain of refactoring is described in [KvdSV09].…”

Section: Rascalmentioning

confidence: 99%

EASY Meta-programming with Rascal

Klint

Storm

Vinju

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Rascal is a new language for meta-programming and is intended to solve problems in the domain of source code analysis and transformation. In this article we give a high-level overview of the language and illustrate its use by many examples. Rascal is a work in progress both regarding implementation and documentation. More information is available at http://www.meta-environment.org/MetaEnvironment/Rascal.Key words: source code analysis, source code transformation, metaprogramming. A New Language for Meta-ProgrammingMeta-programs are programs that analyze, transform or generate other programs. Ordinary programs work on data; meta-programs work on programs. The range of programs to which meta-programming can be applied is large: from programs in standard languages like C and Java to domain-specific languages for describing highlevel system models or applications in specialized areas like gaming or finance. In some cases, even test results or performance data are used as input for meta-programs. Rascal is a new language for meta-programming, this is the activity of writing meta-programs. The EASY ParadigmMany meta-programming problems follow a fixed pattern. Starting with some input system (a black box that we usually call system-of-interest), first relevant information is extracted from it and stored in an internal representation. This internal representation is then analyzed and used to synthesize results. If the synthesis indicates this, these steps can be repeated over and over again. These steps are shown in Figure 1.1, "EASY: the Extract-Analyze-Synthesize Paradigm". This is an abstract view on solving meta-programming problems, but is it uncommon? No, so let's illustrate it with a few examples. Finding security breachesAlice is system administrator of a large online marketplace and she is looking for security breaches in her system. The objects-of-interest are the system's log files. First relevant entries are extracted. This will include, for instance, messages from the SecureShell demon that reports failed login attempts. From each entry login name and originating IP address are extracted and put in a table (the internal representation in this example). These data are analyzed by detecting duplicates and counting frequencies. A Forensic DSL compilerBernd is a senior software engineer working at the Berlin headquarters of a forensic investigation lab of the German government. His daily work is to find common patterns in files stored on digital media that have been confiscated during criminal investigations. Text, audio and video files are stored in zillions of different data formats and each data format requires its own analysis technique. For each new investigation ad hoc combinations of tools are used. This makes the process very labour-intensive and errorprone. Bernd convinces his manager that designing a new domain-specific language (DSL) for forensic investigations may relieve the pressure on their lab. After designing the DSL---let's call it DERRICK---he makes an EASY implementation for it....

show abstract

“…The use of a database system as the backend, together with its powerful Rdbms optimizations, makes the evaluation mechanism of CodeQuest very scalable. A commercial version has been implemented on top of this work by Semmle [11]. It offers a complete code analysis environment, that stores Java projects as relational databases, and provides an object-oriented query language, called .Ql, to allow Sql-like queries on the databases.…”

Section: Datalog-based Program Analysismentioning

confidence: 99%

Datalog-Based Program Analysis with BES and RWL

et al. 2011

View full text Add to dashboard Cite

Alpuente Frasnedo, M.; Feliú Gabaldón, MA.; Joubert, C.; Villanueva García, A. (2011 Abstract. This paper describes two techniques for Datalog query evaluation and their application to object-oriented program analysis. The first technique transforms Datalog programs into an implicit Boolean Equation System (Bes) that can then be solved by using linear-time complexity algorithms that are available in existing, general purpose verification toolboxes such as Cadp. In order to improve scalability and to enable analyses involving advanced meta-programming features, we develop a second methodology that transforms Datalog programs into rewriting logic (Rwl) theories. This method takes advantage of the preeminent features and facilities that are available within the high-performance system Maude, which provides a very efficient implementation of Rwl. We provide evidence of the practicality of both approaches by reporting on some experiments with a number of real-world Datalog-based analyses.

show abstract

.QL: Object-Oriented Queries Made Easy

Cited by 33 publications

References 28 publications

Real-Time Reflexion Modelling in architecture reconciliation: A multi case study

Real-Time Reflexion Modelling in architecture reconciliation: A multi case study

EASY Meta-programming with Rascal

Datalog-Based Program Analysis with BES and RWL

Contact Info

Product

Resources

About