{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:46:08Z","timestamp":1725515168290},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540691631"},{"type":"electronic","value":"9783540691662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69166-2_7","type":"book-chapter","created":{"date-parts":[[2008,7,13]],"date-time":"2008-07-13T09:25:03Z","timestamp":1215941103000},"page":"93-109","source":"Crossref","is-referenced-by-count":5,"title":["Solving Multiple Dataflow Queries Using WPDSs"],"prefix":"10.1007","author":[{"given":"Akash","family":"Lal","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Reps","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Compiler Construction","author":"G. Balakrishnan","year":"2004","unstructured":"Balakrishnan, G., Reps, T.: Analyzing memory accesses in x86 executables. In: Duesterwald, E. (ed.) CC 2004. LNCS, vol.\u00a02985, Springer, Heidelberg (2004)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Esparza, J., Touili, T.: A generic approach to the static analysis of concurrent programs with procedures. In: POPL (2003)","DOI":"10.1145\/604131.604137"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bourdoncle, F.: Efficient chaotic iteration strategies with widenings. In: FMPA (1993)","DOI":"10.1007\/BFb0039704"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Cai, J., Paige, R.: Program derivation by fixed point computation. SCP\u00a011(3) (1989)","DOI":"10.1016\/0167-6423(88)90033-0"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"C.L. Conway","year":"2005","unstructured":"Conway, C.L., Namjoshi, K.S., Dams, D., Edwards, S.A.: Incremental algorithms for inter-procedural analysis of safety properties. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, Springer, Heidelberg (2005)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Duesterwald, E., Gupta, R., Soffa, M.L.: Demand-driven computation of interprocedural data flow. In: POPL (1995)","DOI":"10.1145\/199448.199461"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Graham, S., Wegman, M.: A fast and usually linear algorithm for global flow analysis. J. ACM\u00a023(1) (1976)","DOI":"10.1145\/321921.321939"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Compiler Construction","author":"J. Knoop","year":"1992","unstructured":"Knoop, J., Steffen, B.: The interprocedural coincidence theorem. In: Pfahler, P., Kastens, U. (eds.) CC 1992. LNCS, vol.\u00a0641, Springer, Heidelberg (1992)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_32","volume-title":"Computer Aided Verification","author":"A. Lal","year":"2006","unstructured":"Lal, A., Reps, T.: Improving pushdown system model checking. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, Springer, Heidelberg (2006)"},{"key":"7_CR10","unstructured":"Lal, A., Reps, T.: Solving multiple dataflow queries using WPDSs. Technical Report 1632, University of Wisconsin-Madison (March 2008)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Liu, Y.A., Stoller, S.D., Teitelbaum, T.: Static caching for incremental computation. TOPLAS\u00a020(3) (1998)","DOI":"10.1145\/291889.291895"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Programming Languages and Systems","author":"M. M\u00fcller-Olm","year":"2005","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Analysis of modular arithmetic. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, Springer, Heidelberg (2005)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Qadeer","year":"2005","unstructured":"Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, Springer, Heidelberg (2005)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Ramalingam, G., Reps, T.W.: A categorized bibliography on incremental computation. In: POPL (1993)","DOI":"10.1145\/158511.158710"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Compiler Construction","author":"T. Reps","year":"1994","unstructured":"Reps, T.: Solving demand versions of interprocedural analysis problems. In: Fritzson, P.A. (ed.) CC 1994. LNCS, vol.\u00a0786, Springer, Heidelberg (1994)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: POPL (1995)","DOI":"10.1145\/199448.199462"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77050-3_4","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"T. Reps","year":"2007","unstructured":"Reps, T., Lal, A., Kidd, N.: Program analysis using weighted pushdown systems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, Springer, Heidelberg (2007)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Reps, T., Schwoon, S., Jha, S., Melski, D.: Weighted pushdown systems and their application to interprocedural dataflow analysis. In: SCP, vol.\u00a058 (2005)","DOI":"10.1016\/j.scico.2005.02.009"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Sagiv, S., Reps, T., Horwitz, S.: Precise interprocedural dataflow analysis with applications to constant propagation. Theor. Comput. Sci.\u00a0167(1&2) (1996)","DOI":"10.1016\/0304-3975(96)00072-2"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"Logic Programming","author":"D. Saha","year":"2003","unstructured":"Saha, D., Ramakrishnan, C.R.: Incremental evaluation of tabled logic programs. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, Springer, Heidelberg (2003)"},{"key":"7_CR21","unstructured":"Schwoon, S.: Model-Checking Pushdown Systems. PhD thesis, Technical Univ. of Munich, Munich, Germany (July 2002)"},{"key":"7_CR22","volume-title":"Program Flow Analysis: Theory and Applications","author":"M. Sharir","year":"1981","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In: Program Flow Analysis: Theory and Applications, Prentice-Hall, Englewood Cliffs (1981)"},{"issue":"3","key":"7_CR23","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1145\/322261.322273","volume":"28","author":"R.E. Tarjan","year":"1981","unstructured":"Tarjan, R.E.: Fast algorithms for solving path problems. J. ACM\u00a028(3), 594\u2013614 (1981)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69166-2_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:30:16Z","timestamp":1620016216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69166-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540691631","9783540691662"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69166-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}