Approximate bit dependency analysis to identify program synthesis problems as infeasible

DOI10.1007/978-3-030-67067-2_16zbMath1472.68037OpenAlexW3118342063MaRDI QIDQ2234084

Michael Philippsen, Marius Kamp

Publication date: 18 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-67067-2_16

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Approximate bit dependency analysis to identify program synthesis problems as infeasible

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Syntax-guided rewrite rule enumeration for SMT solvers
• Synthesizing JIT compilers for in-kernel DSLs
• Approximate bit dependency analysis to identify program synthesis problems as infeasible
• Optimizing synthesis with metasketches
• Graph Theory
• Functions realizable with word-parallel logical and two's-complement addition instructions
• Proving unrealizability for syntax-guided synthesis

This page was built for publication: Approximate bit dependency analysis to identify program synthesis problems as infeasible