Unrolling heuristic for recursive functions is complete for first-order theories of algebraic datatypes combined with decidable quantifier-free background theories.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
A systematic mapping study of 248 papers introduces a taxonomy of synergistic effects, inter-analysis workflows, and mapping functions to catalog patterns in combined program analysis techniques.
citing papers explorer
-
Complete first-order reasoning for functional programs
Unrolling heuristic for recursive functions is complete for first-order theories of algebraic datatypes combined with decidable quantifier-free background theories.
-
Combined Program Analysis Techniques: A Systematic Mapping Study
A systematic mapping study of 248 papers introduces a taxonomy of synergistic effects, inter-analysis workflows, and mapping functions to catalog patterns in combined program analysis techniques.