{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T20:23:45Z","timestamp":1794515025803,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662496299","type":"print"},{"value":"9783662496305","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49630-5_11","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T05:04:32Z","timestamp":1458536672000},"page":"180-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Theory of Slicing for Probabilistic Control Flow Graphs"],"prefix":"10.1007","author":[{"given":"Torben","family":"Amtoft","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anindya","family":"Banerjee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.ipl.2007.10.002","volume":"106","author":"T Amtoft","year":"2008","unstructured":"Amtoft, T.: Slicing for modern program structures: a theory for eliminating irrelevant loops. Inf. Process. Lett. 106(2), 45\u201351 (2008)","journal-title":"Inf. Process. Lett."},{"key":"11_CR2","unstructured":"Amtoft, T., Banerjee, A.: A theory of slicing for probabilistic control flow graphs. Technical Report CIS TR 2015-1, Kansas State University, July 2015. \n                      http:\/\/people.cis.ksu.edu\/~tamtoft\/Papers\/Amt+Ban:ProbSlice-2015\/long.pdf"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/BFb0019410","volume-title":"Automated and Algorithmic Debugging","author":"T Ball","year":"1993","unstructured":"Ball, T., Horwitz, S.: Slicing programs with arbitrary control flow. In: Fritzson, P.A. (ed.) AADEBUG 1993. LNCS, vol. 749, pp. 206\u2013222. Springer, Heidelberg (1993)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013117. ACM, New York (2015)","DOI":"10.1145\/2676724.2693169"},{"issue":"49","key":"11_CR5","doi-asserted-by":"publisher","first-page":"6809","DOI":"10.1016\/j.tcs.2011.08.033","volume":"412","author":"S Danicic","year":"2011","unstructured":"Danicic, S., Barraclough, R.W., Harman, M., Howroyd, J.D., Kiss, \u00c1., Laurence, M.R.: A unifying theory of control dependence and its application to arbitrary program structures. Theor. Comput. Sci. 412(49), 6809\u20136842 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Gordon, A.D., Henzinger, T.A., Nori, A.V., Rajamani, S.K.: Probabilistic programming. In: Dwyer, M.B., Herbsleb, J. (eds.) ICSE, Future of Software Engineering track, FOSE 2014, pp. 167\u2013181. ACM, New York (2014)","DOI":"10.1145\/2593882.2593900"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Hur, C.-K., Nori, A.V., Rajamani, S.K., Samuel, S.: Slicing probabilistic programs. In: Pingali, K. (ed.) Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2014, pp. 133\u2013144. ACM, New York (2014)","DOI":"10.1145\/2666356.2594303"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0022-0000(81)90036-2","volume":"22","author":"D Kozen","year":"1981","unstructured":"Kozen, D.: Semantics of probabilistic programs. J. Comput. Syst. Sci. 22, 328\u2013350 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR9","doi-asserted-by":"publisher","DOI":"10.1142\/p595","volume-title":"Labelled Markov Processes","author":"P Panangaden","year":"2009","unstructured":"Panangaden, P.: Labelled Markov Processes. Imperial College Press, London (2009)"},{"issue":"9","key":"11_CR10","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1109\/32.58784","volume":"16","author":"A Podgurski","year":"1990","unstructured":"Podgurski, A., Clarke, L.A.: A formal model of program dependences and its implications for software testing, debugging, and maintenance. IEEE Trans. Softw. Eng. 16(9), 965\u2013979 (1990)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Ranganath, V.P., Amtoft, T., Banerjee, A., Hatcliff, J., Dwyer, M.B.: A new foundation for control dependence and slicing for modern program structures. ACM Trans. Program. Lang. Syst. (TOPLAS), 29(5), Aug 2007. (A special issue with extended versions of selected papers from the 14th European Symposium on Programming (ESOP\u201905))","DOI":"10.1145\/1275497.1275502"},{"key":"11_CR12","first-page":"121","volume":"3","author":"F Tip","year":"1995","unstructured":"Tip, F.: A survey of program slicing techniques. J. Program. Lang. 3, 121\u2013189 (1995)","journal-title":"J. Program. Lang."},{"key":"11_CR13","unstructured":"Wasserrab, D.: From Formal Semantics to Verified Slicing. Ph.D. thesis, Karlsruher Institut f\u00fcr Technologie (2010)"},{"issue":"4","key":"11_CR14","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1109\/TSE.1984.5010248","volume":"10","author":"M Weiser","year":"1984","unstructured":"Weiser, M.: Program slicing. IEEE Trans. Softw. Eng. 10(4), 352\u2013357 (1984)","journal-title":"IEEE Trans. Softw. Eng."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49630-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T21:06:52Z","timestamp":1584997612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49630-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496299","9783662496305"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49630-5_11","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-662-49630-5","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}