Author:
Amtoft Torben,Banerjee Anindya
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Amtoft, T.: Slicing for modern program structures: a theory for eliminating irrelevant loops. Inf. Process. Lett. 106(2), 45–51 (2008)
2. Amtoft, T., Banerjee, A.: A theory of slicing for probabilistic control flow graphs. Technical Report CIS TR 2015-1, Kansas State University, July 2015.
http://people.cis.ksu.edu/~tamtoft/Papers/Amt+Ban:ProbSlice-2015/long.pdf
3. Lecture Notes in Computer Science;T Ball,1993
4. Blazy, S., Maroneze, A., Pichardie, D.: Verified validation of program slicing. In: Proceedings of the 2015 Conference on Certified Programs and Proofs, CPP 2015, pp. 109–117. ACM, New York (2015)
5. Danicic, S., Barraclough, R.W., Harman, M., Howroyd, J.D., Kiss, Á., Laurence, M.R.: A unifying theory of control dependence and its application to arbitrary program structures. Theor. Comput. Sci. 412(49), 6809–6842 (2011)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficient computation of arbitrary control dependencies;Theoretical Computer Science;2023-08
2. Slicing of probabilistic programs based on specifications;Science of Computer Programming;2022-08
3. A Theory of Slicing for Imperative Probabilistic Programs;ACM Transactions on Programming Languages and Systems;2020-05-27
4. Evaluating lexical approximation of program dependence;Journal of Systems and Software;2020-02
5. Storm: program reduction for testing and debugging probabilistic programming systems;Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2019-08-12