| Finding Invariants Of Distributed Systems: It'S A Small (Enough) World After All | 0 | 0.34 | 2021 |
| AlloyMax: bringing maximum satisfaction to relational specifications | 0 | 0.34 | 2021 |
| SyRust: automatic testing of Rust libraries with semantic-aware program synthesis | 0 | 0.34 | 2021 |
| Counterfeiting Congestion Control Algorithms | 0 | 0.34 | 2021 |
| FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions. | 0 | 0.34 | 2021 |
| Replication of SOAR: A Synthesis Approach for Data Science API Refactoring | 0 | 0.34 | 2021 |
| SOAR: A Synthesis Approach for Data Science API Refactoring | 0 | 0.34 | 2021 |
| SQUARES: a SQL synthesizer using query reverse engineering | 1 | 0.35 | 2020 |
| UnchartIt: an interactive framework for program recovery from charts | 0 | 0.34 | 2020 |
| SQUARES : A SQL Synthesizer Using Query Reverse Engineering. | 0 | 0.34 | 2020 |
| Coloring Unit-Distance Strips using SAT. | 0 | 0.34 | 2020 |
| Program Equivalence for Assisted Grading of Functional Programs (Extended Version) | 0 | 0.34 | 2020 |
| An Android Malware Detection Framework Using Graph Embeddings and Convolutional Neural Networks. | 0 | 0.34 | 2019 |
| Trinity: An Extensible Synthesis Framework for Data Science. | 0 | 0.34 | 2019 |
| Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT. | 1 | 0.36 | 2019 |
| MaxSAT Evaluation 2018: New Developments and Detailed Results. | 2 | 0.41 | 2019 |
| Trinity: An Extensible Synthesis Framework for Data Science. | 1 | 0.35 | 2019 |
| Maximal multi-layer specification synthesis. | 2 | 0.36 | 2019 |
| Automated Synthesis of Semantic Malware Signatures using Maximum Satisfiability. | 14 | 0.60 | 2017 |
| Incremental bounded model checking for embedded software. | 4 | 0.43 | 2017 |
| Component-based synthesis for complex APIs. | 16 | 0.59 | 2017 |
| Component-based Synthesis of Table Consolidation and Transformation Tasks from Examples. | 15 | 0.61 | 2017 |
| Relating Complexity-theoretic Parameters with SAT Solver Performance. | 0 | 0.34 | 2017 |
| Type-Directed Code Reuse using Integer Linear Programming. | 0 | 0.34 | 2016 |
| Hunter: next-generation code reuse for Java. | 5 | 0.38 | 2016 |
| Successful Use of Incremental BMC in the Automotive Industry | 3 | 0.39 | 2015 |
| Generalized Totalizer Encoding for Pseudo-Boolean Constraints | 4 | 0.41 | 2015 |
| From AgentSpeak to C for Safety Considerations in Unmanned Aerial Vehicles | 0 | 0.34 | 2015 |
| Deterministic Parallel Maxsat Solving | 0 | 0.34 | 2015 |
| Exploiting Resolution-Based Representations for MaxSAT Solving | 4 | 0.40 | 2015 |
| Improving linear search algorithms with model-based approaches for MaxSAT solving | 0 | 0.34 | 2015 |
| On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving. | 0 | 0.34 | 2014 |
| Open-WBO: A Modular MaxSAT Solver, . | 37 | 0.95 | 2014 |
| Community-Based partitioning for MaxSAT solving | 11 | 0.60 | 2013 |
| Parallel search for maximum satisfiability | 4 | 0.40 | 2012 |
| On Partitioning for Maximum Satisfiability. | 5 | 0.45 | 2012 |
| Clause sharing in parallel MaxSAT | 3 | 0.39 | 2012 |
| An overview of parallel SAT solving | 27 | 0.98 | 2012 |
| Exploiting Cardinality Encodings in Parallel Maximum Satisfiability | 4 | 0.43 | 2011 |
| Improving unsatisfiability-based algorithms for boolean optimization | 12 | 0.74 | 2010 |
| Improving Search Space Splitting for Parallel SAT Solving | 12 | 0.58 | 2010 |
