Inferring argument size relationships with CLP( $$\mathcal{R}$$ )

Benoy, Florence; King, Andy

doi:10.1007/3-540-62718-9_12

Cited by 55 publications

(78 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Inferring size relations, similarly to e.g. [8,1,2] is performed in two steps. The first one is abstract compilation of rules into linear constraints capturing relations between sizes of program variables.…”

Section: Inferring Size Relationsmentioning

confidence: 99%

“…In the second step the fixpoint of the linear constraints system is computed in a bottom-up fashion. We apply the approach and implementation of [8], which originally was designed to compute size relations in logic programs. Since we represent the tasks as rules rather than logic programs, we do compile our rules to constraint logic programs (CLP), but we use a different abstract compilation scheme, as described in the following section.…”

Section: Inferring Size Relationsmentioning

confidence: 99%

“…In this case a bottom-up fixpoint algorithm is applied to infer, for each procedure p, a set linear constraints φ p (or φ p [x, y] if we want to make the involved variables explicit). See [8] for the details of the fixpoint iteration algorithm. Theorem 1 states soundness of size relation inference.…”

Section: Fig 7 the Worked Example After Abstract Compilationmentioning

confidence: 99%

See 2 more Smart Citations

Live Heap Space Bounds for Real-Time Systems

Kero

Pietrzak

Nordlander

2010

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, where fragments of code execute concurrently and in orders determined by periodic and sporadic events. Schedulability analysis has shown that the programming model of real-time systems is not fundamentally in conflict with static predictability, but in contrast to accumulative properties like time, live heap space usage exhibits a very state-dependent behavior that renders direct application of schedulability analysis techniques unsuitable. In this paper we propose an analysis of live heap space upper bounds for real-time systems based on an accurate prediction of task execution orders. The key component of our analysis is the construction of a nondeterministic finite state machine capturing all task executions that are legal under given timing assumptions. By adding heap usage information inferred for each sequential task, our analysis finds an upper bound on the inter-task heap demands as the solution to an integer linear programming problem. Values so obtained are suitable inputs to other analyses depending on the size of a system's persistent state, such as running time prediction for a concurrent tracing garbage collector.

show abstract

Section: Inferring Size Relationsmentioning

confidence: 99%

Section: Inferring Size Relationsmentioning

confidence: 99%

See 1 more Smart Citation

Live Heap Space Bounds for Real-Time Systems

Kero

Pietrzak

Nordlander

2010

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…We thus use interargument relationships to capture this relation. Essentially, we define pdepth as the interargument relationship of the predicate psd r. [] Interargument relationships can be automatically deduced using, for example, the analysis described in [4]. …”

Section: P(t) E M(p) ~R P(t) E M(sdr(e)) []mentioning

confidence: 99%

Generating efficient, terminating logic programs

Martin

King

1997

TAPSOFT '97: Theory and Practice of Software Development

Self Cite

View full text Add to dashboard Cite

AbstracLThe objective of control generation in logic programming is to automatically derive a computation rule for a program that is efficient and yet does not compromise program correctness. Progress in solving this important problem has been slow and, to date, only partial solutions have been proposed where the generated programs are either incorrect or inefficient. We show how the control generation problem can be tackled with a simple automatic transformation that relies on information about the depths of SLD-trees. To prove correctness of our transform we introduce the notion of a semi delay recurrent program which generalises previous ideas in the termination literature for reasoning about logic programs with dynamic selection rules.

show abstract

“…Convex polyhedra are also used, among many other applications, for the analysis and verification of synchronous languages [7,24] and of linear hybrid automata (an extension of finite-state machines that models time requirements) [25,28], for the computer-aided formal verification of concurrent and reactive systems based on temporal specifications [30], for inferring argument size relationships in logic languages [5,6], for the automatic parallelization of imperative programs [32], for detecting buffer overflows in C [22], and for the automatic generation of the ranking functions needed to prove progress properties [11].…”

mentioning

confidence: 99%

Precise Widening Operators for Convex Polyhedra

et al. 2003

View full text Add to dashboard Cite

Abstract. Convex polyhedra constitute the most used abstract domain among those capturing numerical relational information. Since the domain of convex polyhedra admits infinite ascending chains, it has to be used in conjunction with appropriate mechanisms for enforcing and accelerating convergence of the fixpoint computation. Widening operators provide a simple and general characterization for such mechanisms. For the domain of convex polyhedra, the original widening operator proposed by Cousot and Halbwachs amply deserves the name of standard widening since most analysis and verification tools that employ convex polyhedra also employ that operator. Nonetheless, there is an unfulfilled demand for more precise widening operators. In this paper, after a formal introduction to the standard widening where we clarify some aspects that are often overlooked, we embark on the challenging task of improving on it. We present a framework for the systematic definition of new and precise widening operators for convex polyhedra. The framework is then instantiated so as to obtain a new widening operator that combines several heuristics and uses the standard widening as a last resort so that it is never less precise. A preliminary experimental evaluation has yielded promising results.

show abstract

Inferring argument size relationships with CLP( $$\mathcal{R}$$ )

Abstract: The version in the Kent Academic Repository may differ from the final published version. Users are advised to check http://kar.kent.ac.uk for the status of the paper. Users should always cite the published version of record.

Cited by 55 publications

References 13 publications

Live Heap Space Bounds for Real-Time Systems

Live Heap Space Bounds for Real-Time Systems

Generating efficient, terminating logic programs

Precise Widening Operators for Convex Polyhedra

Contact Info

Product

Resources

About