Automated strategies for specializing constraint logic programs

DOI10.1007/3-540-45142-0_8MaRDI QIDQ4421875zbMATH OpenFDO

Authors Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti

Publication date 1 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2042/20420125.htm

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 1497831
• scientific article; zbMATH DE number 1420816
• Specialization of Concurrent Guarded Multi-set Transformation Rules
• A framework for bottom up specialisation of logic programs
• Using real relaxations during program specialization

Cited in

(8)

• Program specialization for verifying infinite state systems: an experimental evaluation
• Convex hull abstractions in specialization of CLP programs
• Learning of constraint logic programs by combining unfolding and slicing techniques
• A framework for bottom up specialisation of logic programs
• scientific article; zbMATH DE number 1497831 (Why is no real title available?)
• Using real relaxations during program specialization
• Specialization of Concurrent Guarded Multi-set Transformation Rules
• Analysis and Transformation of Constrained Horn Clauses for Program Verification

Describes a project that uses

Uses Software

• ECCE

This page was built for publication: Automated strategies for specializing constraint logic programs

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