A Theory of Slicing for Probabilistic Control Flow Graphs

DOI10.1007/978-3-662-49630-5_11zbMath1475.68074arXiv1711.02246OpenAlexW2468557771MaRDI QIDQ2811339

Torben Amtoft, Anindya Banerjee

Publication date: 10 June 2016

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

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

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Efficient computation of arbitrary control dependencies ⋮ A Theory of Slicing for Probabilistic Control Flow Graphs

Cites Work

• Unnamed Item
• A unifying theory of control dependence and its application to arbitrary program structures
• Slicing for modern program structures: a theory for eliminating irrelevant loops
• Semantics of probabilistic programs
• A Theory of Slicing for Probabilistic Control Flow Graphs
• Program Slicing

This page was built for publication: A Theory of Slicing for Probabilistic Control Flow Graphs