Search Results for author:
Found 6 papers, 1 papers with code
MELT: Mining Effective Lightweight Transformations from Pull Requests
By leveraging code examples mined from the library source and automatically generated code examples based on the pull requests, we infer transformation rules in \comby, a language for structural code search and replace.
New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization
In the last decade, a plethora of algorithms for single-objective Boolean optimization has been proposed that rely on the iterative usage of a highly effective Propositional Satisfiability (SAT) solver.
Exact and approximate determination of the Pareto set using minimal correction subsets
First, we show that it is possible to use MCS enumeration to solve MOBO problems such that each MCS necessarily corresponds to a Pareto-optimal solution.
FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions
Experimental results show that FOREST successfully returns the desired regular expression in 72% of the instances and outperforms REGEL, a state-of-the-art regular expression synthesizer.
DistMS: A Non-Portfolio Distributed Solver for Maximum Satisfiability
The most successful parallel SAT and MaxSAT solvers follow a portfolio approach, where each thread applies a different algorithm (or the same algorithm configured differently) to solve a given problem instance.
Exploiting Resolution-based Representations for MaxSAT Solving
Usually, these MaxSAT algorithms perform better when small unsatisfiable subformulas are found early.
