Semantic code refactoring for abstract data types
Modifications to the data representation of an abstract data type (ADT) can require
significant semantic refactoring of the code. Motivated by this observation, this paper …
significant semantic refactoring of the code. Motivated by this observation, this paper …
WebRobot: web robotic process automation using interactive programming-by-demonstration
It is imperative to democratize robotic process automation (RPA), as RPA has become a
main driver of the digital transformation but is still technically very demanding to construct …
main driver of the digital transformation but is still technically very demanding to construct …
Inductive program synthesis via iterative forward-backward abstract interpretation
A key challenge in example-based program synthesis is the gigantic search space of
programs. To address this challenge, various work proposed to use abstract interpretation to …
programs. To address this challenge, various work proposed to use abstract interpretation to …
Programming-by-demonstration for long-horizon robot tasks
The goal of programmatic Learning from Demonstration (LfD) is to learn a policy in a
programming language that can be used to control a robot's behavior from a set of user …
programming language that can be used to control a robot's behavior from a set of user …
Synthesis-powered optimization of smart contracts via data type refactoring
Since executing a smart contract on the Ethereum blockchain costs money (measured in
gas), smart contract developers spend significant effort in reducing gas usage. In this paper …
gas), smart contract developers spend significant effort in reducing gas usage. In this paper …
Complexity-guided container replacement synthesis
Containers, such as lists and maps, are fundamental data structures in modern
programming languages. However, improper choice of container types may lead to …
programming languages. However, improper choice of container types may lead to …
Relational Synthesis of Recursive Programs via Constraint Annotated Tree Automata
In this paper, we present a new synthesis method based on the novel concept of a constraint
annotated tree automaton (CATA). A CATA is a variant of a finite tree automaton (FTA) …
annotated tree automaton (CATA). A CATA is a variant of a finite tree automaton (FTA) …
Automated translation of functional big data queries to SQL
Big data analytics frameworks like Apache Spark and Flink enable users to implement
queries over large, distributed databases using functional APIs. In recent years, these APIs …
queries over large, distributed databases using functional APIs. In recent years, these APIs …
[PDF][PDF] Program synthesis for robot learning from demonstrations
This paper presents a new synthesis-based approach for solving the Learning from
Demonstration (LfD) problem in robotics. Given a set of user demonstrations, the goal of …
Demonstration (LfD) problem in robotics. Given a set of user demonstrations, the goal of …
[LIBRO][B] Type-Directed Program Synthesis
T Knoth - 2023 - search.proquest.com
Program synthesis tools automate programming itself, generating executable code from a
high-level specification. In recent years, type systems have proved an effective specification …
high-level specification. In recent years, type systems have proved an effective specification …