Discovery and exploitation of general reductions: a constraint based approach
No abstract available.
Related papers
- ICE-Based Refinement Type Discovery for Higher-Order Functional Programs TACAS 2018
- Example-guided synthesis of relational queries PLDI 2021
- Integrated instruction selection and register allocation for compact code generation exploiting freeform mixing of 16- and 32-bit instructions CGO 2010
- Efficient Directed Hybrid Fuzzing via Target-Centric Seed Selection and Generation OOPSLA 2026
- A Constraint Oriented Proof Methodology Based on Modal Transition Systems TACAS 1995
- Synthesis of layout engines from relational constraints OOPSLA 2015
- Automatic discovery of covariant read-only fields TOPLAS 2005
- Constrained Dynamic Partial Order Reduction CAV 2018