{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T20:40:31Z","timestamp":1738960831768,"version":"3.37.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,2,19]],"date-time":"2009-02-19T00:00:00Z","timestamp":1235001600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Autom Softw Eng"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s10515-009-0050-3","type":"journal-article","created":{"date-parts":[[2009,2,18]],"date-time":"2009-02-18T20:01:09Z","timestamp":1234987269000},"page":"263-290","source":"Crossref","is-referenced-by-count":2,"title":["On temporal path conditions in dependence graphs"],"prefix":"10.1007","volume":"16","author":[{"given":"Andreas","family":"Lochbihler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregor","family":"Snelting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,2,19]]},"reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"Ammons, G., Bodik, R., Larus, J.R.: Mining specifications. In: Symposium on Principles of Programming Languages, pp. 4\u201316 (2002)","DOI":"10.1145\/503272.503275"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Ball, T., Rajamani, S.K.: Bebop: a path-sensitive interprocedural dataflow engine. In: Workshop on Program Analysis for Software Tools and Engineering, pp. 97\u2013103 (2001)","DOI":"10.1145\/379605.379690"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Ball, T., Rajamani, S.K.: The SLAM project: debugging system software via static analysis. In: Symposium on Principles of Programming Languages, pp.\u00a01\u20133 (2002)","DOI":"10.1145\/503272.503274"},{"key":"50_CR4","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/S0950-5849(98)00086-X","volume":"30","author":"G. Canfora","year":"1998","unstructured":"Canfora, G., Cimitile, A., De Lucia, A.: Conditioned program slicing. Inf. Softw. Technol. 30, 595\u2013607 (1998)","journal-title":"Inf. Softw. Technol."},{"key":"50_CR5","series-title":"Lect. Notes Comp. Sci.","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/3-540-48683-6_44","volume-title":"International Conference on Computer Aided Verification","author":"A. Cimatti","year":"1999","unstructured":"Cimatti, A., Clarke, E.M., Giunchiglia, F., Roveri, M.: NuSMV: A new symbolic model verifier. In: International Conference on Computer Aided Verification. Lect. Notes Comp. Sci., vol. 1633, pp. 495\u2013499. Springer, Berlin (1999)"},{"key":"50_CR6","volume-title":"Model Checking","author":"E.M. Clarke Jr.","year":"2000","unstructured":"Clarke, Jr., E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (2000)"},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Corbett, J.C., Dwyer, M.B., Hatcliff, J., Laubach, S., P\u0103s\u0103reanu, C.S., Robby, Zheng, H.: Bandera: Extracting finite-state models from Java source code. In: International Conference on Software Engineering, pp. 439\u2013448 (2000)","DOI":"10.1145\/337180.337234"},{"issue":"4","key":"50_CR8","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., Zadeck, F.K.: Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst. 13(4), 451\u2013490 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"50_CR9","series-title":"Lect. Notes Comp. Sci.","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/978-3-540-32004-3_20","volume-title":"International Conference on Security in Pervasive Computing","author":"A. Darvas","year":"2005","unstructured":"Darvas, A., H\u00e4hnle, R., Sands, D.: A theorem proving approach to analysis of secure information flow. In: International Conference on Security in Pervasive Computing. Lect. Notes Comp. Sci., vol. 3450, pp. 193\u2013209. Springer, Berlin (2005)"},{"key":"50_CR10","doi-asserted-by":"crossref","unstructured":"Das, M., Lerner, S., Seigle, M.: ESP: Path-sensitive program verification in polynomial time. In: Prog. Lang. Des. Implement., pp. 57\u201368. (2002)","DOI":"10.1145\/543552.512538"},{"key":"50_CR11","series-title":"Lect. Notes Comp. Sci.","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/11823230_27","volume-title":"Static Analysis Symposium","author":"D. Dhurjati","year":"2006","unstructured":"Dhurjati, D., Das, M., Yang, Y.: Path-sensitive dataflow analysis with iterative refinement. In: Static Analysis Symposium. Lect. Notes Comp. Sci., vol. 4134, pp. 425\u2013442. Springer, Berlin (2006)"},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"Dwyer, M.B., Hatcliff, J., Joehanes, R., Laubach, S., P\u0103s\u0103reanu, C.S., Robby, Visser, W., Zheng, H.: Tool-supported program abstraction for finite-state verification. In: International Conference on Software Engineering, pp. 177\u2013187 (2001)","DOI":"10.1109\/ICSE.2001.919092"},{"key":"50_CR13","doi-asserted-by":"crossref","unstructured":"Fischer, J., Jhala, R., Majumdar, R.: Joining dataflow with predicates. In: Found. Softw. Eng., pp. 227\u2013236 (2005)","DOI":"10.1145\/1081706.1081742"},{"key":"50_CR14","unstructured":"Hammer, C., Krinke, J., Snelting, G.: Information flow control for Java based on path conditions in dependence graphs. In: International Symposium on Secure Software Engineering, pp. 87\u201396 (2006)"},{"key":"50_CR15","doi-asserted-by":"crossref","unstructured":"Hampapuram, H., Yang, Y., Das, M.: Symbolic path simulation in path-sensitive dataflow analysis. In: Workshop on Program Analysis for Software Tools and Engineering, pp. 52\u201358 (2005)","DOI":"10.1145\/1108792.1108808"},{"key":"50_CR16","volume-title":"The SPIN Model Checker: Primer and Reference Manual","author":"G.J. Holzmann","year":"2003","unstructured":"Holzmann, G.J.: The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley, Reading (2003)"},{"key":"50_CR17","doi-asserted-by":"crossref","unstructured":"Hong, H.S., Cha, S.D., Lee, I., Sokolsky, O., Ural, H.: Data flow testing as model checking. In: International Conference on Software Engineering, pp. 232\u2013242 (2003)","DOI":"10.1109\/ICSE.2003.1201203"},{"key":"50_CR18","unstructured":"Krinke, J.: Advanced slicing of sequential and concurrent programs. PhD thesis, Universit\u00e4t Passau (2003)"},{"key":"50_CR19","doi-asserted-by":"crossref","unstructured":"Lochbihler, A.: Temporal path conditions in dependence graphs. Master\u2019s thesis, Universit\u00e4t Passau (2006)","DOI":"10.1109\/SCAM.2007.10"},{"key":"50_CR20","doi-asserted-by":"crossref","unstructured":"Lochbihler, A., Snelting, G.: On temporal path conditions in dependence graphs. In: International Working Conference on Source Code Analysis and Manipulation, pp. 49\u201358 (2007)","DOI":"10.1109\/SCAM.2007.10"},{"key":"50_CR21","doi-asserted-by":"crossref","unstructured":"McMillan, K.L.: Symbolic model checking. PhD thesis, Carnegie Mellon University (1992)","DOI":"10.1007\/978-1-4615-3190-6"},{"issue":"5","key":"50_CR22","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/1275497.1275502","volume":"29","author":"V.P. Ranganath","year":"2007","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. 29(5), 27 (2007)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"50_CR23","unstructured":"Robschink, T.: Pfadbedingungen in Abh\u00e4ngigkeitsgraphen und ihre Anwendung in der Softwaresicherheitstechnik. PhD thesis, Universit\u00e4t Passau (2005)"},{"key":"50_CR24","doi-asserted-by":"crossref","unstructured":"Robschink, T., Snelting, G.: Efficient path conditions in dependence graphs. In: International Conference on Software Engineering, pp. 478\u2013488 (2002)","DOI":"10.1145\/581396.581398"},{"issue":"1","key":"50_CR25","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/JSAC.2002.806121","volume":"21","author":"A. Sabelfeld","year":"2003","unstructured":"Sabelfeld, A., Myers, A.C.: Language-based information-flow security. IEEE J. Sel. Areas Commun. 21(1), 5\u201319 (2003)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"50_CR26","series-title":"Lect. Notes Comp. Sci.","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-61739-6_51","volume-title":"Static Analysis Symposium","author":"G. Snelting","year":"1996","unstructured":"Snelting, G.: Combining slicing and constraint solving for validation of measurement software. In: Static Analysis Symposium. Lect. Notes Comp. Sci., vol. 1145, pp. 332\u2013348. Springer, Berlin (1996)"},{"issue":"4","key":"50_CR27","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1145\/1178625.1178628","volume":"15","author":"G. Snelting","year":"2006","unstructured":"Snelting, G., Robschink, T., Krinke, J.: Efficient path conditions in dependence graphs for software safety analysis. ACM Trans. Softw. Eng. Methodol. 15(4), 410\u2013457 (2006)","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"issue":"3","key":"50_CR28","first-page":"121","volume":"3","author":"F. Tip","year":"1995","unstructured":"Tip, F.: A survey of program slicing techniques. J. Program. Lang. 3(3), 121\u2013189 (1995)","journal-title":"J. Program. Lang."},{"key":"50_CR29","unstructured":"Xie, Y., Chou, A.: Path sensitive program analysis using Boolean satisfiability. Technical report, Stanford University (2002)"}],"container-title":["Automated Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10515-009-0050-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10515-009-0050-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10515-009-0050-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T20:08:46Z","timestamp":1738958926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10515-009-0050-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,19]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["50"],"URL":"https:\/\/doi.org\/10.1007\/s10515-009-0050-3","relation":{},"ISSN":["0928-8910","1573-7535"],"issn-type":[{"type":"print","value":"0928-8910"},{"type":"electronic","value":"1573-7535"}],"subject":[],"published":{"date-parts":[[2009,2,19]]}}}