activity
20152021
most citedRelating Complexity-theoretic Parameters with SAT Solver Performance

5 citations · 6 across the 6 of their papers we have counts for

collaborators

8 papers

cs.SE2021

SOAR: A Synthesis Approach for Data Science API Refactoring

Ansong Ni, Daniel Ramos, Aidan Yang +4

With the growth of the open-source data science community, both the number of data science libraries and the number of versions for the same library are increasing rapidly. To matc…

cs.FL2020

FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions

Margarida Ferreira, Miguel Terra-Neves, Miguel Ventura +2

Form validators based on regular expressions are often used on digital forms to prevent users from inserting data in the wrong format. However, writing these validators can pose a…

cs.PL2020

Program Equivalence for Assisted Grading of Functional Programs (Extended Version)

Joshua Clune, Vijay Ramamurthy, Ruben Martins +1

In courses that involve programming assignments, giving meaningful feedback to students is an important challenge. Human beings can give useful feedback by manually grading the pro…

cs.LO2019

Reflections on "Incremental Cardinality Constraints for MaxSAT"

Ruben Martins, Saurabh Joshi, Vasco Manquinho +1

To celebrate the first 25 years of the International Conference on Principles and Practice of Constraint Programming (CP) the editors invited the authors of the most cited paper of…

cs.LO2018

Approximation Strategies for Incomplete MaxSAT

Saurabh Joshi, Prateek Kumar, Ruben Martins +1

Incomplete MaxSAT solving aims to quickly find a solution that attempts to minimize the sum of the weights of the unsatisfied soft clauses without providing any optimality guarante…

cs.PL20171 cited

Program Synthesis using Conflict-Driven Learning

Yu Feng, Ruben Martins, Osbert Bastani +1

We propose a new conflict-driven program synthesis technique that is capable of learning from past mistakes. Given a spurious program that violates the desired specification, our s…