![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Design Datalog Templates for Synthesizing Bidirectional Programs from Tabular Examples
In the database community, many synthesizers have been proposed to synthesize unidirectional programs (queries) from tabular examples, but it remains as a challenge to synthesize bidirectional programs (view upda...
-
Chapter and Conference Paper
Exploring the Devil in Graph Spectral Domain for 3D Point Cloud Attacks
With the maturity of depth sensors, point clouds have received increasing attention in various applications such as autonomous driving, robotics, surveillance, etc., while deep point cloud learning models have sh...
-
Chapter and Conference Paper
Towards Automatic Synthesis of View Update Programs on Relations
Automatic synthesis of bidirectional programs on relations has not been well studied yet. As an attempt to solve the problem, we propose an approach to synthesizing view update strategies on relations written ...
-
Chapter and Conference Paper
Bidirectional Collaborative Frameworks for Decentralized Data Management
Along with the continuous evolution of data management systems for the new market requirements, we are moving from centralized systems towards decentralized systems, where data are maintained in different site...
-
Chapter and Conference Paper
A Lazy Desugaring System for Evaluating Programs with Sugars
Extending a programming language with syntactic sugars is common practice in language design. Given a core language, one can define a surface language on top of it with sugars. We propose a lazy desugaring sys...
-
Chapter and Conference Paper
Data Integration Models and Architectures for Service Alliances
In recent years, providers offering similar services have increasingly formed alliances to increase their opportunities for matching customers. Moreover, it is no longer uncommon for one provider to participat...
-
Chapter and Conference Paper
A Cheap Implementation of Resugaring in BIRDS Based on Bidirectional Transformation
Syntactic sugar refers to a certain syntactic structure added to the programming language. This syntactic structure has no effect on the function of the language, but is more convenient for programmers to use....
-
Chapter and Conference Paper
Dynamic Gas Estimation of Loops Using Machine Learning
Smart contracts on Ethereum can encode business logic and have been applied to many areas, such as token exchange, games, and others. Unlike general programs, the computations of contracts on Ethereum are rest...
-
Chapter and Conference Paper
Toward Programmable Strategy for Co-existence of Relational Schemes
The co-existence of relational schemas is an important feature of a database. A schema evolves to new versions, and then these multiple schema versions concurrently serve to multiple application versions evolv...
-
Chapter and Conference Paper
An Efficient Composition of Bidirectional Programs by Memoization and Lazy Update
Bidirectional transformations (BX) are a solution to the view update problem and widely used for synchronizing data. The semantics and correctness of bidirectional programs have been investigated intensively d...
-
Chapter and Conference Paper
A Counterexample-Guided Debugger for Non-recursive Datalog
The Datalog language is used in many potential applications including database queries, program analysis, bidirectional transformations, and so forth. In practice, such a Datalog program is expected to be well...
-
Chapter and Conference Paper
Optimizing Declarative Parallel Distributed Graph Processing by Using Constraint Solvers
Vertex-centric graph processing is a promising approach for facilitating development of parallel distributed graph processing programs. Each vertex is regarded as a tiny thread and graph processing is describe...
-
Chapter and Conference Paper
Palgol: A High-Level DSL for Vertex-Centric Graph Processing with Remote Data Access
Pregel is a popular distributed computing model for dealing with large-scale graphs. However, it can be tricky to implement graph algorithms correctly and efficiently in Pregel’s vertex-centric model, especial...
-
Chapter and Conference Paper
A Clear Picture of Lens Laws
A lens is an optical device which refracts light. Properly adjusted, it can be used to project sharp images of objects onto a screen—a principle underlying photography as well as human vision. Striving for cla...
-
Chapter and Conference Paper
Towards Bidirectional Higher-Order Transformation for Model-Driven Co-evolution
In model-driven development (MDD), numerous metamodels, models, and model transformations need to be taken into account. These MDD-based artifacts—although highly interdependent—are autonomously maintained. Ch...
-
Chapter and Conference Paper
Validity Checking of Putback Transformations in Bidirectional Programming
A bidirectional transformation consists of pairs of transformations —a forward transformation get produces a target view from a source, while a putback transformation put puts back modifications on the view to th...
-
Chapter and Conference Paper
Programming with BSP Homomorphisms
Algorithmic skeletons in conjunction with list homomorphisms play an important role in formal development of parallel algorithms. We have designed a notion of homomorphism dedicated to bulk synchronous paralle...
-
Chapter and Conference Paper
Marker-Directed Optimization of UnCAL Graph Transformations
Buneman et al. proposed a graph algebra called UnCAL (Unstructured CALculus) for compositional graph transformations based on structural recursion, and we have recently applied to model transformations. The co...
-
Chapter and Conference Paper
Generate, Test, and Aggregate
MapReduce, being inspired by the map and reduce primitives available in many functional languages, is the de facto standard for large scale data-intensive parallel programming. Although it has succeeded in pop...
-
Chapter and Conference Paper
Towards Systematic Parallel Programming over MapReduce
MapReduce is a useful and popular programming model for data-intensive distributed parallel computing. But it is still a challenge to develop parallel programs with MapReduce systematically, since it is usuall...