We present a method for the static resource usage analysis of MiniZinc models. The analysis can infer upper bounds on the usage that a MiniZinc model will make of some resources such as the number of constraints of a given type (equality, disequality, global constraints, etc.), the number of variables (search variables or temporary variables), or the size of the expressions before calling the solver. These bounds are obtained from the models independently of the concrete input data (the instance data) and are in general functions of sizes of such data. In our approach, MiniZinc models are translated into Ciao programs which are then analysed by the CiaoPP system. CiaoPP includes a parametric analysis framework for resource usage in which ...
MiningZinc offers a framework for modeling and solving constraint-based mining problems. The languag...
We present a methodology to reason about resource usage (acquisition, release, revision, and so on) ...
We present a programming language in which every well-typed program halts in time polynomial with re...
We present a method for the static resource usage analysis of MiniZinc models. The analysis can inf...
We present a generic analysis that infers both upper and lower bounds on the usage that a program ma...
We present a novel general resource analysis for logic programs based on sized types. Sized types a...
We present a novel general resource analysis for logic programs based on sized types.Sized types are...
For some applications, standard resource analyses do not provide the information required. Such anal...
Traditional static resource analyses estimate the total resource usage of a program, without executi...
MiniZinc is a free and open-source constraint modelling language. You can use MiniZinc to model cons...
Abstract. Resource usage is one of the most important characteristics of programs. Automatically gen...
In many applications it is important to ensure conformance with respect to specifications that cons...
We present a framework for (static) verification of general resource usage program properties. The f...
In an increasing number of applications (e.g., in embedded, real-time, or mobile systems) it is imp...
Resource analysis aims at automatically inferring upper/lower bounds on the worst/best-case cost of ...
MiningZinc offers a framework for modeling and solving constraint-based mining problems. The languag...
We present a methodology to reason about resource usage (acquisition, release, revision, and so on) ...
We present a programming language in which every well-typed program halts in time polynomial with re...
We present a method for the static resource usage analysis of MiniZinc models. The analysis can inf...
We present a generic analysis that infers both upper and lower bounds on the usage that a program ma...
We present a novel general resource analysis for logic programs based on sized types. Sized types a...
We present a novel general resource analysis for logic programs based on sized types.Sized types are...
For some applications, standard resource analyses do not provide the information required. Such anal...
Traditional static resource analyses estimate the total resource usage of a program, without executi...
MiniZinc is a free and open-source constraint modelling language. You can use MiniZinc to model cons...
Abstract. Resource usage is one of the most important characteristics of programs. Automatically gen...
In many applications it is important to ensure conformance with respect to specifications that cons...
We present a framework for (static) verification of general resource usage program properties. The f...
In an increasing number of applications (e.g., in embedded, real-time, or mobile systems) it is imp...
Resource analysis aims at automatically inferring upper/lower bounds on the worst/best-case cost of ...
MiningZinc offers a framework for modeling and solving constraint-based mining problems. The languag...
We present a methodology to reason about resource usage (acquisition, release, revision, and so on) ...
We present a programming language in which every well-typed program halts in time polynomial with re...