Static and dynamic slicing of constraint logic programs

DOI10.1023/A:1013280119003MaRDI QIDQ1857275zbMATH OpenFDO

Authors Gyöngyi Szilágyi, T. Gyimóthy, Jan Maluszyński

Publication date 17 February 2003

Published in Automated Software Engineering (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0012014

zbMATH Keywords

Constraint Logic Programming (CLP)debuggingLogic Programming (LP)program analysisslicing

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Logic programming (68N17) Computing methodologies and applications (68U99)

Abstract: Slicing is a program analysis technique originally developed for imperative languages. It facilitates understanding of data flow and debugging. This paper discusses slicing of Constraint Logic Programs. Constraint Logic Programming (CLP) is an emerging software technology with a growing number of applications. Data flow in constraint programs is not explicit, and for this reason the concepts of slice and the slicing techniques of imperative languages are not directly applicable. This paper formulates declarative notions of slice suitable for CLP. They provide a basis for defining slicing techniques (both dynamic and static) based on variable sharing. The techniques are further extended by using groundness information. A prototype dynamic slicer of CLP programs implementing the presented ideas is briefly described together with the results of some slicing experiments.

Recommendations

• Program Slicing
• A backward slicing algorithm for Prolog
• scientific article; zbMATH DE number 1870455
• Understanding program slices
• Programming Languages and Systems

Cited in

(26)

• Dynamic program slicing
• Issues in slicing PROMELA and its applications to model checking, protocol understanding, and simulation
• Combining dynamic and static slicing for analysing assembler
• Theoretical foundations of dynamic program slicing
• Static slicing of rewrite systems
• A vocabulary of program slicing-based techniques
• Forward slicing of multi-paradigm declarative programs based on partial evaluation
• Rete network slicing for model queries
• Forward slicing of functional logic programs by partial evaluation
• An overview of slicing techniques for object-oriented programs
• The MEB and CEB Static Analysis for CSP Specifications
• Learning of constraint logic programs by combining unfolding and slicing techniques
• scientific article; zbMATH DE number 148937 (Why is no real title available?)
• Static slicing of explicitly synchronized languages
• scientific article; zbMATH DE number 1061007 (Why is no real title available?)
• scientific article; zbMATH DE number 1870455 (Why is no real title available?)
• scientific article; zbMATH DE number 2090549 (Why is no real title available?)
• Understanding program slices
• Dynamic slicing: a generic analysis based on a natural semantics format
• A backward slicing algorithm for Prolog
• Combining slicing and constraint solving for validation of measurement software
• Generalization-Driven Semantic Clone Detection in CLP
• A Program Slicing Based Method to Filter XML/DTD Documents
• Inter-procedural static slicing using advanced caching algorithm
• An assertion language for slicing constraint logic languages
• A parallel algorithm for static program slicing

Describes a project that uses

Uses Software

• Mercury

This page was built for publication: Static and dynamic slicing of constraint logic programs

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