Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates

Albert, Elvira; Puebla, Germán; Gallagher, John P.

doi:10.1007/11680093_8

Cited by 17 publications

(24 citation statements)

References 18 publications

(37 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, hom emb aggr and hom emb cons are unfolding rules which are both based on homeomorphic embedding for flagging possible non-termination (see [17] for more details). In both cases, non-leftmost unfolding is performed only when it is guaranteed to be safe (see [1]). However, the first one is more aggressive, whereas the second one is more conservative.…”

Section: Resultsmentioning

confidence: 99%

Poly-controlled partial evaluation in practice

Ochoa

Puebla

2007

Proceedings of the 2007 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Self Cite

View full text Add to dashboard Cite

Poly-Controlled Partial Evaluation (PCPE) is a powerful approach to partial evaluation, which has recently been proposed. PCPE takes into account sets of control strategies instead of a single one. Thus, different control strategies can be assigned to different call patterns, possibly obtaining results that cannot be obtained using a single control strategy. PCPE can be implemented as a searchbased algorithm, producing sets of candidate optimized programs. The quality of each of these programs is assessed through the use of a fitness function, which can be resource aware, in the sense that it can take multiple factors into account, such as run-time and code size. Unfortunately, PCPE suffers from an inherent blowup of its search space when implemented as an all-solutions, searchbased algorithm. Thus, in order to use it in practice we must be able to prune its search space without losing the (most) interesting solutions. In this work we explore several techniques for pruning the search space of PCPE. Some of these techniques are based on heuristics, while others are based on branch and bound and are guaranteed to obtain an optimal solution. Our experimental results show that, when combined with the proposed pruning techniques, PCPE can cope with realistic programs. Also, that the solutions obtained by PCPE outperform the solutions found by PE under similar conditions.

show abstract

Section: Resultsmentioning

confidence: 99%

Poly-controlled partial evaluation in practice

Ochoa

Puebla

2007

Proceedings of the 2007 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Self Cite

View full text Add to dashboard Cite

show abstract

“…Type-based homeomorphic embedding ( T ) [4] has been used both at the local and global control to decide when to stop derivations and when to generalize calls so that effectiveness of the decompilation can be obtained in the presence of integers without compromising termination. The unfolding operator must also be able to accurately handle built-in predicates and to safely perform nonleftmost unfolding steps as in [6]. The operator abstract must incorporate a polyvariance control mechanism [18] which avoids performing useless specializations that can introduce superfluous decompiled code and thus degrade the decompilation effectiveness.…”

Section: The (Non-modular) Lp-decompilation Of P Bc Can Be Obtained Asmentioning

confidence: 99%

Decompilation of Java bytecode to Prolog by partial evaluation

Gómez-Zamalloa

Albert

Puebla

2009

Information and Software Technology

Self Cite

View full text Add to dashboard Cite

Reasoning about Java bytecode (JBC) is complicated due to its unstructured control-flow, the use of three-address code combined with the use of an operand stack, etc. Therefore, many static analyzers and model checkers for JBC first convert the code into a higher-level representation. In contrast to traditional decompilation, such representation is often not Java source, but rather some intermediate language which is a good input for the subsequent phases of the tool. Interpretive decompilation consists in partially evaluating an interpreter for the compiled language (in this case JBC) written in a high-level language w.r.t. the code to be decompiled. There have been proofs-of-concept that interpretive decompilation is feasible, but there remain important open issues when it comes to decompile a real language such as JBC. This paper presents, to the best of our knowledge, the first modular scheme to enable interpretive decompilation of a realistic programming language to a high-level representation, namely of JBC to Prolog. We introduce two notions of optimality which together require that decompilation does not generate code more than once for each program point. We demonstrate the impact of our modular approach and optimality issues on a series of realistic benchmarks. Decompilation times and decompiled program sizes are linear with the size of the input bytecode program. This demonstrates empirically the scalability of modular decompilation of JBC by partial evaluation.

show abstract

“…As mentioned in the introduction, analyzing the strong quasi-termination of programs is essential because liberal selection policies are often mandatory to achieve a good specialization during partial evaluation (see, e.g., [1,25]). …”

Section: From Termination To Quasi-terminationmentioning

confidence: 99%

“…all possible computation rules. This is essential because liberal selection policies are often mandatory to achieve a good specialization (see, e.g., [1,25]). Therefore, we consider strong termination [2]: a program P and query Q strongly terminate if they universally terminate (i.e., the computation of all solutions terminate) w.r.t.…”

Section: Introductionmentioning

confidence: 99%

Quasi-terminating logic programs for ensuring the termination of partial evaluation

Vidal

2007

Proceedings of the 2007 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

View full text Add to dashboard Cite

Abstract. A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This notion of quasi-termination, though stronger than related notions that only consider Prolog's computation rule, is essential for ensuring the termination of partial evaluation, where liberal selection policies are often mandatory to achieve a good specialization. In this paper, we introduce sufficient conditions for the strong termination and quasi-termination of logic programs which are based on the construction of size-change graphs. The class of strongly quasi-terminating logic programs, however, is too restricted. Therefore, we also introduce an annotation procedure that annotates those predicate arguments which are responsible of the non-quasi-termination. As a consequence, the annotated program behaves like a quasi-terminating program if annotated arguments are generalized (i.e., replaced by a fresh variable) when they occur in a computation. We illustrate the usefulness of our approach by designing a simple partial evaluator in which global termination is always ensured offline (i.e., statically). A prototype implementation demonstrates its viability.

show abstract

Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates

Cited by 17 publications

References 18 publications

Poly-controlled partial evaluation in practice

Poly-controlled partial evaluation in practice

Decompilation of Java bytecode to Prolog by partial evaluation

Quasi-terminating logic programs for ensuring the termination of partial evaluation

Contact Info

Product

Resources

About