Search Results for author:
Found 2 papers, 0 papers with code
A Machine Learning-based Approach for Solving Recurrence Relations and its use in Cost Analysis of Logic Programs
Such recurrence solving is a bottleneck in current tools: many of the recurrences that arise during the analysis cannot be solved with state-of-the-art solvers, including Computer Algebra Systems (CASs), so that specific methods for different classes of recurrences need to be developed.
Solving Recurrence Relations using Machine Learning, with Application to Cost Analysis
Automatic static cost analysis infers information about the resources used by programs without actually running them with concrete data, and presents such information as functions of input data sizes.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
