Combined static and dynamic assertion-based debugging of constraint logic programs

DOI10.1007/10720327_16MaRDI QIDQ2723933zbMATH OpenFDO

Authors Germán Puebla, F. Bueno, Manuel Hermenegildo

Publication date 8 July 2001

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

Full work available at URL https://doi.org/10.1007/10720327_16

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Using global analysis, partial specifications, and an extensible assertion language for program validation and debugging
• A logical framework for debugging in declarative constraint programming
• Declarative debugging of functional logic programs
• Context-Sensitive Multivariant Assertion Checking in Modular Programs
• A debugging scheme for functional logic programs

Cited in

(24)

• Testing your (static analysis) truths
• Efficient safety enforcement for Maude programs via program specialization in the \textsf{ÁTAME} system
• Safety enforcement via programmable strategies in Maude
• Using parametric set constraints for locating errors in CLP programs
• scientific article; zbMATH DE number 2079805 (Why is no real title available?)
• scientific article; zbMATH DE number 1497828 (Why is no real title available?)
• scientific article; zbMATH DE number 1497834 (Why is no real title available?)
• scientific article; zbMATH DE number 1497843 (Why is no real title available?)
• Practical run-time checking via unobtrusive property caching
• Description and optimization of abstract machines in a dialect of Prolog
• Semantic code browsing
• Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption
• Using global analysis, partial specifications, and an extensible assertion language for program validation and debugging
• scientific article; zbMATH DE number 7453099 (Why is no real title available?)
• Incremental analysis of logic programs with assertions and open predicates
• Computing abstract distances in logic programs
• An integrated approach to assertion-based random testing in Prolog
• Integrated Formal Methods
• VeriFly: On-the-fly Assertion Checking via Incrementality
• Fifty Years of Prolog and Beyond
• Analysis and Transformation of Constrained Horn Clauses for Program Verification
• An assertion language for slicing constraint logic languages
• Exploiting multiple abstract call patterns for optimizing run-time checks
• Abstraction-carrying code: a model for mobile code safety

This page was built for publication: Combined static and dynamic assertion-based debugging of constraint logic programs

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