Approximate bit dependency analysis to identify program synthesis problems as infeasible

DOI10.1007/978-3-030-67067-2_16MaRDI QIDQ2234084zbMATH OpenOpenAlexFDO

Authors Marius Kamp, Michael Philippsen

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)

Recommendations

• Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution
• Logical approximation for program analysis
• Program synthesis in the presence of infinite number of inaccuracies
• scientific article; zbMATH DE number 2077170
• scientific article; zbMATH DE number 4049027
• On the inference of approximate programs
• Analyzing program termination and complexity automatically with \textsf{AProVE}
• Program analysis is harder than verification: a computability perspective

Cites work

• scientific article; zbMATH DE number 5852793 (Why is no real title available?)
• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• Approximate bit dependency analysis to identify program synthesis problems as infeasible
• Functions realizable with word-parallel logical and two's-complement addition instructions
• Graph theory
• Optimizing synthesis with metasketches
• Proving unrealizability for syntax-guided synthesis
• Syntax-guided rewrite rule enumeration for SMT solvers
• Synthesizing JIT compilers for in-kernel DSLs

Cited in

(1)

• Approximate bit dependency analysis to identify program synthesis problems as infeasible

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2234084)