Abstract Program Slicing

DOI10.1145/3029052zbMath1367.68070arXiv1605.05104OpenAlexW2401455848MaRDI QIDQ5278199

Isabella Mastroeni, Damiano Zanardini

Publication date: 13 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

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

zbMATH Keywords

static analysissemanticsprogram slicingabstract interpretation

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Twinning automata and regular expressions for string static analysis

Uses Software

• Tukra

Cites Work

• Unnamed Item
• Unnamed Item
• A unifying theory of control dependence and its application to arbitrary program structures
• A logic for information flow analysis with an application to forward slicing of simple imperative programs
• Dynamic program slicing
• Algebraic properties of program integration
• Dijkstra-Scholten predicate calculus: Concepts and misconceptions
• Assertion-based slicing and slice graphs
• Reachability-based acyclicity analysis by abstract interpretation
• Theoretical foundations of dynamic program slicing
• A formalisation of the relationship between forms of program slicing
• Program Slicing
• Abstract non-interference
• Specifying Imperative Data Obfuscations
• Guarded commands, nondeterminacy and formal derivation of programs
• Systematic design of program transformation frameworks by abstract interpretation
• Computer Science Logic
• Making abstract interpretations complete
• An axiomatic basis for computer programming
• Static Analysis
• Static Analysis
• Verification, Model Checking, and Abstract Interpretation