Removing Superfluous Versions in Polyvariant Specialization of Prolog Programs

DOI10.1007/11680093_6MaRDI QIDQ5302881zbMATH OpenOpenAlexFDO

Authors Claudio Ochoa, Germán Puebla, Manuel Hermenegildo

Publication date 15 January 2009

Published in Logic Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL http://oa.upm.es/14354/

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Abstract multiple specialization and its application to program parallelization
• Derivation of efficient logic programs by specialization and reduction of nondeterminism
• Maximally-polyvariant partial evaluation in polynomial time
• Controlling polyvariance for specialization-based verification
• A scheme for effective specialization of imperative programs

Cited in

(2)

• A study on the practicality of poly-controlled partial evaluation
• Analysis and Transformation of Constrained Horn Clauses for Program Verification

Describes a project that uses

Uses Software

• ECCE

This page was built for publication: Removing Superfluous Versions in Polyvariant Specialization of Prolog Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5302881)