Design wizards and visual programming environments for GenVoca generators

Batory, Don; Chen, Gang; Robertson, Eric P.; Wang, Tao

doi:10.1109/32.846301

Cited by 59 publications

(28 citation statements)

References 33 publications

(38 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As mentioned in Section 1, the idea of compiling programs that work on relations into specialized data structures originated with [5], and its various developments [1,2,22]. Earlier work explored data structure selection for sets in SETL [7,19].…”

Section: Discussion and Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Concurrent data representation synthesis

Hawkins

Aiken

Fisher

et al. 2012

Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

We describe an approach for synthesizing data representations for concurrent programs. Our compiler takes as input a program written using concurrent relations and synthesizes a representation of the relations as sets of cooperating data structures as well as the placement and acquisition of locks to synchronize concurrent access to those data structures. The resulting code is correct by construction: individual relational operations are implemented correctly and the aggregate set of operations is serializable and deadlock free. The relational specification also permits a high-level optimizer to choose the best performing of many possible legal data representations and locking strategies, which we demonstrate with an experiment autotuning a graph benchmark.

show abstract

Section: Discussion and Related Workmentioning

confidence: 99%

“…Query plan (2) was not the only possible query plan, even under the same decomposition and lock placement. Another possible query plan uses edges ρx and xy instead of the edge ρy.…”

Section: Query Expressionsmentioning

confidence: 99%

Concurrent data representation synthesis

Hawkins

Aiken

Fisher

et al. 2012

Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

show abstract

“…Literature on lightweight databases also advocates a programming model based on relations, which are implemented in the backend using container data structures [7,22,3,2]. A novel aspect of our approach is that our relations can have specified restrictions (specifically, functional dependencies).…”

Section: Discussion and Related Workmentioning

confidence: 99%

An introduction to data representation synthesis

et al. 2012

View full text Add to dashboard Cite

We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative and results in provably correct code. In our approach, abstract data types are specified using relational algebra and functional dependencies. We describe a language of decompositions that permits the user to specify different concrete representations for relations, and show that operations on concrete representations soundly implement their relational specification. We also describe an auto-tuner that automatically identifies the best decomposition for a particular workload. It is easy to incorporate data representations synthesized by our compiler into existing systems, leading to code that is simpler, correct by construction, and comparable in performance to the code it replaces.

show abstract

“…al. ([BG97], [BCRW00]) propose a similar model for the composition of components in GenVoca architectures (layered systems). The entities subject to composition are components, implemented as classes, and are used in layered compositions that can be seen as components being put on top of each other.…”

Section: Discussion and Related Workmentioning

confidence: 99%

Automating Decisions in Component Composition Based on Propagation of Requirements

Şora

Creţu

Verbaeten

et al. 2004

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. Automatic component composition is a way to achieve selfcustomizable systems that are able to adapt themselves through structural configuration to changing conditions in their environment. In this paper, we propose an automatic composition strategy for multi-flow architectures with hierarchically composable components. Our composition strategy takes automatic decisions for the composition of a target that is specified through a set of required properties imposed over its given structural constraints. The composition decisions are taken knowing the properties provided by individual available components. Properties characterize functional or non-functional aspects of a component. The composition strategy is driven by a mechanism of propagation of required properties, detailed in this paper.

show abstract

Design wizards and visual programming environments for GenVoca generators

Cited by 59 publications

References 33 publications

Concurrent data representation synthesis

Concurrent data representation synthesis

An introduction to data representation synthesis

Automating Decisions in Component Composition Based on Propagation of Requirements

Contact Info

Product

Resources

About