Bidirectionalization transformation based on automatic derivation of view complement functions

Matsuda, Kazutaka; Hu, Zhenjiang; Nakano, Kazushi; Hamana, Makoto; Takeichi, Masato

doi:10.1145/1291151.1291162

Cited by 79 publications

(135 citation statements)

References 15 publications

Supporting

Mentioning

135

Contrasting

Order By: Relevance

“…Some approaches [17,22] compromise the expressiveness; others ignore the totality requirement [12,20,21]; others maintain totality, but weaken the round-tripping laws [6]; some relax both totality and round-tripping laws [13,10,9,8]; finally, it also possible to avoid compromising the laws by developing a more refined type system, as proposed in the original lens framework [5]: in order to preserve totality, a powerful semantic type system with invariants was used to specify the exact domain and range of lenses, which allowed the definition of duplication and conditional combinators as total well-behaved lenses. Unfortunately, to retain decidability in the type system, the expressiveness was still restricted by forcing composed lenses to agree not only on types but also on invariants.…”

Section: Application Scenario: Bidirectional Transformationsmentioning

confidence: 99%

“…Most BX approaches rely on more standard and decidable type systems, at the cost of a more limited expressiveness [17,22], by allowing partial transformations [12,20,21] or by assuming both partiality and weaker round-tripping laws [13,10,9,8]. More closely related to our approach, some frameworks derive the backward transformations by calculation, but are less expressive than ours.…”

Section: Related Workmentioning

confidence: 99%

“…More closely related to our approach, some frameworks derive the backward transformations by calculation, but are less expressive than ours. In [13], Put is derived by inverting injective forward transformations through algebraic reasoning, while [12] bidirectionalizes a restricted first-order language (namely, without duplication) based on a notion of view-update under constant complement. They also calculate an automata that matches the exact domain of the transformations, and acts similarly to our invariants.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Relations as Executable Specifications: Taming Partiality and Non-determinism Using Invariants

Macedo

Pacheco

Cunha

2012

Relational and Algebraic Methods in Computer Science

View full text Add to dashboard Cite

Abstract. The calculus of relations has been widely used in program specification and reasoning. It is very tempting to use such specifications as running prototypes of the desired program, but, even considering finite domains, the inherent partiality and non-determinism of relations makes this impractical and highly inefficient. To tame partiality we prescribe the usage of invariants, represented by coreflexives, to characterize the exact domains and codomains of relational specifications. Such invariants can be used as pre-condition checkers to avoid runtime errors. Moreover, we show how such invariants can be used to narrow the non-deterministic execution of relational specifications, making it viable for a relevant class of problems. In particular, we show how the proposed techniques can be applied to execute specifications of bidirectional transformations, a domain where partiality and non-determinism are paramount.

show abstract

Section: Application Scenario: Bidirectional Transformationsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Relations as Executable Specifications: Taming Partiality and Non-determinism Using Invariants

Macedo

Pacheco

Cunha

2012

Relational and Algebraic Methods in Computer Science

View full text Add to dashboard Cite

show abstract

“…Our work is greatly inspired by recent research on bidirectional languages and automatic bidirectionalization in the programming language community [10][11][12][13]. In particular, it has been recently shown [14] that a graph query algebra UnCAL can be fully bidirectionalized.…”

Section: Introductionmentioning

confidence: 99%

GRoundTram: An integrated framework for developing well-behaved bidirectional model transformations

et al. 2013

Self Cite

View full text Add to dashboard Cite

Abstract-Bidirectional model transformation is useful for maintaining consistency between two models, and has many potential applications in software development including model synchronization, round-trip engineering, and software evolution. Despite these attractive uses, the lack of a practical tool support for systematic development of well-behaved and efficient bidirectional model transformation prevents it from being widely used. In this paper, we solve this problem by proposing an integrated framework called GRoundTram, which is carefully designed and implemented for compositional development of well-behaved and efficient bidirectional model transformations. GRoundTram is built upon a well-founded bidirectional framework, and is equipped with a user-friendly language for coding bidirectional model transformation, a new tool for validating both models and bidirectional model transformations, an optimization mechanism for improving efficiency, and a powerful debugging environment for testing bidirectional behavior. GRoundTram has been used by people of other groups and their results show its usefulness in practice.

show abstract

“…The problem of program inversion -deriving a program computing f −1 from a program computing f , has been studied over decades [1, 7, 8, 11, 15-17, 25, 27, 30] and has many applications including providing support for undo/redo, deriving a deserializing program from a serializing program or vice versa, and serving as an auxiliary phase in other program transformations, such as bidirectionalization [21].…”

Section: Introductionmentioning

confidence: 99%

A Grammar-Based Approach to Invertible Programs

Matsuda

et al. 2010

Programming Languages and Systems

Self Cite

View full text Add to dashboard Cite

Abstract. Program inversion has many applications such as in the implementation of serialization/deserialization and in providing support for redo/undo, and has been studied by many researchers. However, little attention has been paid to two problems: how to characterize programs that are easy or hard to invert and whether, for each class of programs, efficient inverses can be obtained. In this paper, we propose an inversion framework that we call grammar-based inversion, where a program is associated with an unambiguous grammar describing the range of the program. The complexity of the grammar indicates how hard it is to invert the program, while the complexity is related to how efficient an inverse can be obtained.

show abstract

Bidirectionalization transformation based on automatic derivation of view complement functions

Cited by 79 publications

References 15 publications

Relations as Executable Specifications: Taming Partiality and Non-determinism Using Invariants

Relations as Executable Specifications: Taming Partiality and Non-determinism Using Invariants

GRoundTram: An integrated framework for developing well-behaved bidirectional model transformations

A Grammar-Based Approach to Invertible Programs

Contact Info

Product

Resources

About