5 citations · 5 across the 4 of their papers we have counts for
5 papers
Towards an Automated Reasoning Tool for Complexity Analysis of Automated Reasoners
Louis Rustenholz, Manuel V. Hermenegildo, Pedro Lopez-Garcia +3
We present the theory underpinning a complexity analysis tool (under development) that aims at automating tedious parts of the analysis of complex algorithms originating from the f…
Abstractions of Sequences, Functions and Operators
Louis Rustenholz, Pedro Lopez-Garcia, Manuel V. Hermenegildo
We present theoretical and practical results on the order theory of lattices of functions, focusing on Galois connections that abstract (sets of) functions - a topic known as highe…
An Order Theory Framework of Recurrence Equations for Static Cost Analysis Dynamic Inference of Non-Linear Inequality Invariants
Louis Rustenholz, Pedro Lopez-Garcia, José F. Morales +1
Recurrence equations have played a central role in static cost analysis, where they can be viewed as abstractions of programs and used to infer resource usage information without a…
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…
Static analysis of ReLU neural networks with tropical polyhedra
Eric Goubault, Sébastien Palumby, Sylvie Putot +2
This paper studies the problem of range analysis for feedforward neural networks, which is a basic primitive for applications such as robustness of neural networks, compliance to s…