7 citations · 13 across the 6 of their papers we have counts for
6 papers
SWE-Pruner Pro: The Coder LLM Already Knows What to Prune
Yuhang Wang, Yuling Shi, Shaoqiu Zhang +6
Pruning long context for coding agents has been a vital technology for efficient context management. While existing context pruning methods such as SWE-Pruner realize this by attac…
SWE-Explore: Benchmarking How Coding Agents Explore Repositories
Shaoqiu Zhang, Yuhang Wang, Jialiang Liang +8
Repository-level coding benchmarks such as SWE-bench have driven a rapid surge in the capabilities of coding agents. Yet they usually treat coding tasks as a holistic, binary predi…
Relating Complexity-theoretic Parameters with SAT Solver Performance
Edward Zulkoski, Ruben Martins, Christoph Wintersteiger +4
Over the years complexity theorists have proposed many structural parameters to explain the surprising efficiency of conflict-driven clause-learning (CDCL) SAT solvers on a wide va…
Adaptive Restart and CEGAR-based Solver for Inverting Cryptographic Hash Functions
Saeed Nejati, Jia Hui Liang, Vijay Ganesh +2
SAT solvers are increasingly being used for cryptanalysis of hash functions and symmetric encryption schemes. Inspired by this trend, we present MapleCrypt which is a SAT solver-ba…
SAT-based Analysis of Large Real-world Feature Models is Easy
Jia Hui Liang, Vijay Ganesh, Venkatesh Raman +1
Modern conflict-driven clause-learning (CDCL) Boolean SAT solvers provide efficient automatic analysis of real-world feature models (FM) of systems ranging from cars to operating s…
Understanding VSIDS Branching Heuristics in Conflict-Driven Clause-Learning SAT Solvers
Jia Hui Liang, Vijay Ganesh, Ed Zulkoski +2
Conflict-Driven Clause-Learning SAT solvers crucially depend on the Variable State Independent Decaying Sum (VSIDS) branching heuristic for their performance. Although VSIDS was pr…