{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:59:43Z","timestamp":1743152383568,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319471655"},{"type":"electronic","value":"9783319471662"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-47166-2_16","type":"book-chapter","created":{"date-parts":[[2016,10,4]],"date-time":"2016-10-04T18:07:34Z","timestamp":1475604454000},"page":"227-242","source":"Crossref","is-referenced-by-count":2,"title":["Sparse Analysis of Variable Path Predicates Based upon SSA-Form"],"prefix":"10.1007","author":[{"given":"Thomas S.","family":"Heinze","sequence":"first","affiliation":[]},{"given":"Wolfram","family":"Amme","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,5]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Bod\u00edk, R., Gupta, R., Soffa, M.L.: Refining data flow information using infeasible paths. In: ESEC-FSE 1997, Proceeding, pp. 361\u2013377. ACM (1997)","DOI":"10.1007\/3-540-63531-9_25"},{"key":"16_CR2","series-title":"LNCS","first-page":"154","volume-title":"CAV 2000","author":"E Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, M.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 154\u2013169. Springer, Heidelberg (2000)"},{"issue":"4","key":"16_CR3","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R Cytron","year":"1991","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N.: Efficiently computing static single assignment form and the control dependence graph. ACM TOPLAS 13(4), 451\u2013490 (1991)","journal-title":"ACM TOPLAS"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Das, M., Lerner, S., Seigle, M.: ESP: path-sensitive program verification in polynomial time. In: PLDI 2002, Proceeding, pp. 57\u201368. ACM (2002)","DOI":"10.1145\/543552.512538"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/11823230_27","volume-title":"Static Analysis","author":"D Dhurjati","year":"2006","unstructured":"Dhurjati, D., Das, M., Yang, Y.: Path-sensitive dataflow analysis with iterative refinement. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, pp. 425\u2013442. Springer, Heidelberg (2006)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Fischer, J., Jhala, R., Majumdar, R.: Joining dataflow with predicates. In: ESEC-FSE 2005, Proceeding, pp. 227\u2013236. ACM (2005)","DOI":"10.1145\/1095430.1081742"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-63166-6_10","volume-title":"CAV1997","author":"S Graf","year":"1997","unstructured":"Graf, S., Saidi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV1997. LNCS, vol. 1254, pp. 72\u201383. Springer, Heidelberg (1997)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Hammer, C., Schaade, R., Snelting, G.: Static path conditions for Java. In: PLAS 2008, Proceeding, pp. 57\u201366. ACM (2008)","DOI":"10.1145\/1375696.1375704"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Hardekopf, B., Lin, C.: Semi-sparse flow-sensitive pointer analysis. In: POPL 2009, Proceeding, pp. 226\u2013238. ACM (2009)","DOI":"10.1145\/1594834.1480911"},{"key":"16_CR10","unstructured":"Heinze, T.S., Amme, W.: Sparse analysis of variable path predicates (2016). http:\/\/swt.informatik.uni-jena.de\/swt_multimedia\/SWT\/PDFs\/heinze16.pdf"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/978-3-642-03848-8_15","volume-title":"Business Process Management","author":"TS Heinze","year":"2009","unstructured":"Heinze, T.S., Amme, W., Moser, S.: A restructuring method for WS-BPEL business processes based on extended workflow graphs. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 211\u2013228. Springer, Heidelberg (2009)"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Heinze, T.S., Amme, W., Moser, S.: Compiling more precise petri net models for an improved verification of service implementations. In: SOCA 2014, Proceeding, pp. 25\u201332. IEEE (2014)","DOI":"10.1109\/SOCA.2014.8"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Holley, L.H., Rosen, B.K.: Qualified data flow problems. In: POPL 1980, Proceeding, pp. 68\u201382. ACM (1980)","DOI":"10.1145\/567446.567454"},{"issue":"3","key":"16_CR14","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF00290339","volume":"7","author":"JB Kam","year":"1977","unstructured":"Kam, J.B., Ullman, J.D.: Monotone data flow analysis frameworks. Acta Inf. 7(3), 305\u2013317 (1977)","journal-title":"Acta Inf."},{"key":"16_CR15","unstructured":"Murphy, B.R.: Frameworks for precise program analysis. Ph.D. thesis, Stanford University (2001)"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-61739-6_51","volume-title":"Static Analysis","author":"G Snelting","year":"1996","unstructured":"Snelting, G.: Combining slicing and constraint solving for validation of measurement software. In: Cousot, R., Schmidt, D.A. (eds.) SAS 1996. LNCS, vol. 1145, pp. 332\u2013348. Springer, Heidelberg (1996)"},{"issue":"2","key":"16_CR17","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/103135.103136","volume":"13","author":"MN Wegman","year":"1991","unstructured":"Wegman, M.N., Zadeck, F.K.: Constant propagation with conditional branches. ACM TOPLAS 13(2), 181\u2013210 (1991)","journal-title":"ACM TOPLAS"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/978-3-642-41202-8_27","volume-title":"Formal Methods and Software Engineering","author":"K Winter","year":"2013","unstructured":"Winter, K., Zhang, C., Hayes, I.J., Keynes, N., Cifuentes, C., Li, L.: Path-sensitive data flow analysis simplified. In: Groves, L., Sun, J. (eds.) ICFEM 2013. LNCS, vol. 8144, pp. 415\u2013430. Springer, Heidelberg (2013)"},{"key":"16_CR19","unstructured":"Web Services Business Process Execution Language Version 2.0. OASIS Standard (2007). http:\/\/docs.oasis-open.org\/wsbpel\/2.0\/wsbpel-v2.0.html"}],"container-title":["Lecture Notes in Computer Science","Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-47166-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T20:22:05Z","timestamp":1498335725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-47166-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319471655","9783319471662"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47166-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}