Programming by example (PBE) is an important subproblem of program synthesis, and PBE
techniques have been applied to many domains. Though many techniques for accelerating …

In syntax-guided synthesis (SyGuS), a synthesizer's goal is to automatically generate a
program belonging to a grammar of possible implementations that meets a logical …

Code obfuscation aims at protecting Intellectual Property and other secrets embedded into
software from being retrieved. Recent works leverage advances in artificial intelligence (AI) …

The generalizability of PBE solvers is the key to the empirical synthesis performance.
Despite the importance of generalizability, related studies on PBE solvers are still limited. In …

Code obfuscation aims at protecting Intellectual Property and other secrets embedded into
software from being retrieved. Recent works leverage advances in artificial intelligence with …

Loop invariant inference, a key component in program verification, is a challenging task due
to the inherent undecidability and complex loop behaviors in practice. Recently, machine …

Algorithmic paradigms such as divide-and-conquer (D&C) are proposed to guide
developers in designing efficient algorithms, but it can still be difficult to apply algorithmic …

Automated synthesis of inductive invariants is an important problem in software verification.
Once all the invariants have been specified, software verification reduces to checking of …

The generalizability of PBE solvers is the key to the empirical synthesis performance.
Despite the importance of generalizability, related studies on PBE solvers are still limited. In …

Algorithm synthesis is a newly emerging branch of program synthesis, targeting to
automatically apply a predefined class of algorithms to a user-provided program. In …