A Concurrent Approach to String Transformation Synthesis
summary
Claims a first concurrent synthesis algorithm for string transformations that pairs an asynchronous deducer with a multi-request enumerator and uses an accumulative case splitter to grow decision trees. Implementation Synthphonia (≈7,000 Rust LOC) runs concurrent deduction/enumeration, produces explicit operators and splits, and outperforms prior tools: 116 previously unsolved tasks solved uniquely, 531 benchmarks solved overall, and consistently faster times in evaluation.
AI-written summary · about
chapters (8)
- 0:00String transformation synthesis intro
- 1:44Challenges in synthesis
- 3:49Concurrent framework proposal
- 6:16Motivating example
- 8:27Concurrent solver architecture
- 9:07If-then-else with decision trees
- 13:30Experimental results
- 15:41Q&A
related talks
44mCAN WE FREE CONCURRENT PROGRAMMING FROM THE MONADIC STYLE
30mCalculating Compilers for Concurrency
39mThe best multicore-parallelization refactoring you've never heard of
41mConcurrent Stream Processing
36mConcurrent ML - The One That Got Away
41mDeclarative concurrent programming with Chymyst
39mConcurrent Languages are Functional
24mA Concurrent Program Logic with a Future and History