21 citations · 41 across the 9 of their papers we have counts for
10 papers
A Machine Learning-based Approach for Solving Recurrence Relations and its use in Cost Analysis of Logic Programs
Louis Rustenholz, Maximiliano Klemen, Miguel Ángel Carreira-Perpiñán +1
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…
Solving Recurrence Relations using Machine Learning, with Application to Cost Analysis
Maximiliano Klemen, Miguel Á. Carreira-Perpiñán, Pedro Lopez-Garcia
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…
Regular Path Clauses and Their Application in Solving Loops
Bishoksan Kafle, John P. Gallagher, Manuel V. Hermenegildo +3
A well-established approach to reasoning about loops during program analysis is to capture the effect of a loop by extracting recurrences from the loop; these express relationships…
From Big-Step to Small-Step Semantics and Back with Interpreter Specialisation
John P. Gallagher, Manuel Hermenegildo, Bishoksan Kafle +3
We investigate representations of imperative programs as constrained Horn clauses. Starting from operational semantics transition rules, we proceed by writing interpreters as const…
Towards a General Framework for Static Cost Analysis of Parallel Logic Programs
Maximiliano Klemen, Pedro Lopez-Garcia, John P. Gallagher +2
The estimation and control of resource usage is now an important challenge in an increasing number of computing systems. In particular, requirements on timing and energy arise in a…
An Approach to Static Performance Guarantees for Programs with Run-time Checks
Maximiliano Klemen, Nataliia Stulova, Pedro Lopez-Garcia +2
Instrumenting programs for performing run-time checking of properties, such as regular shapes, is a common and useful technique that helps programmers detect incorrect program beha…