Generating incremental implementations of object-set queries

Rothamel, Tom; Liu, Yanhong A.

doi:10.1145/1449913.1449923

Cited by 18 publications

(25 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The approach is further automated in a follow-up work by Rothamel and Liu [39]. Compared to JQL, the solution proposed by Rothamel and Liu better integrates in the Object-oriented model, and supports aliasing (e.g., updates to fields referred to by other object fields), which results in a broader set of queries that can be expressed.…”

Section: Related Workmentioning

confidence: 99%

i3QL

Mitschke

Erdweg

Köhler

et al. 2014

Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages &Amp; Applications

View full text Add to dashboard Cite

An incremental computation updates its result based on a change to its input, which is often an order of magnitude faster than a recomputation from scratch. In particular, incrementalization can make expensive computations feasible for settings that require short feedback cycles, such as interactive systems, IDEs, or (soft) real-time systems.This paper presents i3QL, a general-purpose programming language for specifying incremental computations. i3QL provides a declarative SQL-like syntax and is based on incremental versions of operators from relational algebra, enriched with support for general recursion. We integrated i3QL into Scala as a library, which enables programmers to use regular Scala code for non-incremental subcomputations of an i3QL query and to easily integrate incremental computations into larger software projects. To improve performance, i3QL optimizes user-defined queries by applying algebraic laws and partial evaluation. We describe the design and implementation of i3QL and its optimizations, demonstrate its applicability, and evaluate its performance.

show abstract

Section: Related Workmentioning

confidence: 99%

i3QL

Mitschke

Erdweg

Köhler

et al. 2014

Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages &Amp; Applications

View full text Add to dashboard Cite

show abstract

“…Efficient incremental updates have been investigated by the database research community for a long time in the context of the view maintenance problem [8]. More recently, researchers introduced these solutions into programming languages, intercepting the updates via AspectJ [44] or using code generation techniques [41] to trigger the updates on the dependencies. Off-the-shelf libraries include LiveLinq [29] and Glazed Lists [23].…”

Section: Reactive Collectionsmentioning

confidence: 99%

“…We will provide a variety of efficient operators that seamlessly operate on reactive collections and reactive abstractions. Highly efficient libraries will be designed along the lines of [44,41], but integrated with the abstractions of existing reactive languages. For example, by allowing behaviorlike expressions in the predicate of a filter operator or by modeling the result of the reactive operators as behaviors.…”

Section: Efficient Reactive Expressionsmentioning

confidence: 99%

Reactive behavior in object-oriented applications

Salvaneschi

Mezini

2013

Proceedings of the 12th Annual International Conference on Aspect-Oriented Software Development

View full text Add to dashboard Cite

Reactive applications are difficult to implement. Traditional solutions based on event systems and the Observer pattern have a number of inconveniences, but programmers bear them in return for the benefits of OO design. On the other hand, reactive approaches based on automatic updates of dependencies -like functional reactive programming and dataflow languages -provide undoubted advantages but do not fit well with mutable objects.In this paper, we provide a research roadmap to overcome the limitations of the current approaches and to support reactive applications in the OO setting. To establish a solid background for our investigation, we propose a conceptual framework to model the design space of reactive applications and we study the flaws of the existing solutions. Then we highlight how reactive languages have the potential to address those issues and we formulate our research plan.

show abstract

“…There are methods to automatically derive large classes of invariant rules [Liu et al 2006, Rothamel andLiu 2008], including rules for join queries, which are well known to be difficult, and queries over objects, which are even harder because of aliasing between object references. Still, some invariant rules will be developed manually, for example, to capture new data structures.…”

Section: Additional Invariant Rule Examplesmentioning

confidence: 99%

“…Figure 7 in Section 6 gives examples for which we have used invariant rules for optimization, runtime verification, debugging, refactoring, etc. The rules for optimization by incrementally maintaining queries over objects and sets were developed manually, following a systematic method [Liu et al 2006, Rothamel andLiu 2008]; such rules are difficult to develop without the systematic method. The method is still being extended but has partly been automated for runtime invariant checking [Gorbovitski et al 2008a] and query-based debugging [Gorbovitski et al 2008b].…”

Section: Additional Invariant Rule Examplesmentioning

confidence: 99%

A language and framework for invariant-driven transformations

Liu

Gorbovitski

Stoller

2009

Proceedings of the Eighth International Conference on Generative Programming and Component Engineering

Self Cite

View full text Add to dashboard Cite

This paper describes a language and framework that allow coordinated transformations driven by invariants to be specified declaratively, as invariant rules, and applied automatically. The framework supports incremental maintenance of invariants for program design and optimization, as well as general transformations for instrumentation, refactoring, and other purposes. This paper also describes our implementations for transforming Python and C programs and experiments with successful applications of the systems in generating efficient implementations from clear and modular specifications, in instrumenting programs for runtime verification, profiling, and debugging, and in code refactoring.

show abstract

Generating incremental implementations of object-set queries

Cited by 18 publications

References 29 publications

i3QL

i3QL

Reactive behavior in object-oriented applications

A language and framework for invariant-driven transformations

Contact Info

Product

Resources

About