{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:39:27Z","timestamp":1742395167270},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540409274"},{"type":"electronic","value":"9783540409281"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11860990_12","type":"book-chapter","created":{"date-parts":[[2006,9,15]],"date-time":"2006-09-15T23:05:22Z","timestamp":1158361522000},"page":"172-194","source":"Crossref","is-referenced-by-count":4,"title":["Symbolic Analysis of Imperative Programming Languages"],"prefix":"10.1007","author":[{"given":"Bernd","family":"Burgstaller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Scholz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johann","family":"Blieberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","volume-title":"Compilers\u2014Principles, Techniques, and Tools","author":"A.V. Aho","year":"1986","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers\u2014Principles, Techniques, and Tools. Addison-Wesley, Reading (1986)"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1145\/190347.190423","volume-title":"Proc.\u00a0of the Internat.\u00a0Symposium on Symbolic and Algebraic Computation","author":"O. Bachmann","year":"1994","unstructured":"Bachmann, O., Wang, P.S., Zima, E.V.: Chains of Recurrences \u2014 A Method to Expedite the Evaluation of Closed-Form Functions. In: Proc.\u00a0of the Internat.\u00a0Symposium on Symbolic and Algebraic Computation, pp. 242\u2013249. ACM Press, New York (1994)"},{"key":"12_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, New York (1998)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1014535317056","volume":"22","author":"J. Blieberger","year":"2002","unstructured":"Blieberger, J.: Data-Flow Frameworks for Worst-Case Execution Time Analysis. Real-Time Systems\u00a022, 183\u2013227 (2002)","journal-title":"Real-Time Systems"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0096-0551(94)90004-3","volume":"20","author":"J. Blieberger","year":"1994","unstructured":"Blieberger, J.: Discrete Loops and Worst Case Performance. Computer Languages\u00a020(3), 193\u2013212 (1994)","journal-title":"Computer Languages"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-48753-0_12","volume-title":"Reliable Software Technologies - Ada-Europe \u201999","author":"J. Blieberger","year":"1999","unstructured":"Blieberger, J., Burgstaller, B., Scholz, B.: Interprocedural Symbolic Evaluation of Ada Programs with Aliases. In: Gonz\u00e1lez Harbour, M., la de Puente, J.A. (eds.) Ada-Europe 1999. LNCS, vol.\u00a01622, pp. 136\u2013145. Springer, Heidelberg (1999)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/10722060_21","volume-title":"Reliable Software Technologies Ada-Europe 2000","author":"J. Blieberger","year":"2000","unstructured":"Blieberger, J., Burgstaller, B., Scholz, B.: Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs. In: Keller, H.B., Pl\u00f6dereder, E. (eds.) Ada-Europe 2000. LNCS, vol.\u00a01845, pp. 225\u2013237. Springer, Heidelberg (2000)"},{"issue":"2\/3","key":"12_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1023\/A:1008193114940","volume":"18","author":"J. Blieberger","year":"2000","unstructured":"Blieberger, J., Fahringer, T., Scholz, B.: Symbolic Cache Analysis for Real-Time Systems. Real-Time Systems\u00a018(2\/3), 181\u2013215 (2000)","journal-title":"Real-Time Systems"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/11767077_4","volume-title":"Reliable Software Technologies \u2013 Ada-Europe 2006","author":"B. Burgstaller","year":"2006","unstructured":"Burgstaller, B., Blieberger, J., Mittermayr, R.: Static Detection of Access Anomalies in Ada95. In: Pinho, L.M., Gonz\u00e1lez Harbour, M. (eds.) Ada-Europe 2006. LNCS, vol.\u00a04006, pp. 40\u201355. Springer, Heidelberg (2006)"},{"issue":"12","key":"12_CR10","doi-asserted-by":"publisher","first-page":"1180","DOI":"10.1109\/71.737695","volume":"9","author":"W. Blume","year":"1998","unstructured":"Blume, W., Eigenmann, R.: Nonlinear and Symbolic Data Dependence Testing. IEEE Transactions on Parallel and Distributed Systems\u00a09(12), 1180\u20131194 (1998)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"unstructured":"Burgstaller, B.: Symbolic Evaluation of Imperative Programming Languages. Technical Report 183\/1-138, Department of Automation, Vienna University of Technology (June 2005), http:\/\/www.auto.tuwien.ac.at\/~bburg\/reports.html","key":"12_CR11"},{"unstructured":"Burgstaller, B., Scholz, B., Blieberger, J.: Tour de Spec \u2014 A Collection of Spec95 Program Paths and Associated Costs for Symbolic Evaluation. Technical Report 183\/1-137, Department of Automation, Vienna University of Technology (June 2004), http:\/\/www.auto.tuwien.ac.at\/~bburg\/reports.html","key":"12_CR12"},{"doi-asserted-by":"crossref","unstructured":"Blieberger, J., Burgstaller, B.: Eliminating Redundant Range Checks in GNAT Using Symbolic Evaluation. In: Proc.\u00a0of the Ada-Europe International Conference on Reliable Software Technologies, Toulouse, France, pp. 153\u2013167 (June 2003)","key":"12_CR13","DOI":"10.1007\/3-540-44947-7_11"},{"unstructured":"http:\/\/www.it.usyd.edu.au\/~bburg\/symanalysis.html","key":"12_CR14"},{"key":"12_CR15","first-page":"264","volume-title":"Program Flow Analysis: Theory and Applications","author":"L.A. Clarke","year":"1981","unstructured":"Clarke, L.A., Richardson, D.J.: Symbolic Evaluation Methods for Program Analysis. In: Muchnick, S.S., Jones, N.D. (eds.) Program Flow Analysis: Theory and Applications, pp. 264\u2013300. Prentice-Hall, Englewood Cliffs (1981)"},{"doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract Intrepretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: Proc.\u00a0of POPL, pp. 238\u2013252 (January 1977)","key":"12_CR16","DOI":"10.1145\/512950.512973"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36614-8","volume-title":"Advanced Symbolic Analysis for Compilers","author":"T. Fahringer","year":"2003","unstructured":"Fahringer, T., Scholz, B.: Advanced Symbolic Analysis for Compilers. In: Fahringer, T., Scholz, B. (eds.) Advanced Symbolic Analysis for Compilers. LNCS, vol.\u00a02628. Springer, Heidelberg (2003)"},{"key":"12_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/b102438","volume-title":"Algorithms for Computer Algebra","author":"K.O. Geddes","year":"1992","unstructured":"Geddes, K.O., Czapor, S.R., Labahn, G.: Algorithms for Computer Algebra. Kluwer Academic Publishers, Dordrecht (1992)"},{"issue":"1","key":"12_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/200994.201003","volume":"17","author":"M.P. Gerlek","year":"1995","unstructured":"Gerlek, M.P., Stoltz, E., Wolfe, M.: Beyond Induction Variables: Detecting and Classifying Sequences Using a Demand-Driven SSA Form. TOPLAS\u00a017(1), 85\u2013122 (1995)","journal-title":"TOPLAS"},{"unstructured":"Goguen, J., Winkler, T., Meseguer, J., Futatsugi, K., Jouannaud, J.: Introducing OBJ. Draft, Oxford University Computing Laboratory, Oxford (1993)","key":"12_CR20"},{"key":"12_CR21","volume-title":"Mathematics For the Analysis of Algorithms","author":"D. Greene","year":"1982","unstructured":"Greene, D., Knuth, D.E.: Mathematics For the Analysis of Algorithms, 2nd edn. Birkh\u00e4user, Basel (1982)","edition":"2"},{"issue":"4","key":"12_CR22","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1145\/233561.233568","volume":"18","author":"M.R. Haghighat","year":"1996","unstructured":"Haghighat, M.R., Polychronopoulos, C.D.: Symbolic Analysis for Parallelizing Compilers. TOPLAS\u00a018(4), 477\u2013518 (1996)","journal-title":"TOPLAS"},{"unstructured":"Havlak, P.: Interprocedural Symbolic Analysis. Ph.D thesis, Dept.\u00a0of Computer Science, Rice University (May 1994)","key":"12_CR23"},{"key":"12_CR24","volume-title":"Flow Analysis of Computer Programs","author":"M.S. Hecht","year":"1977","unstructured":"Hecht, M.S.: Flow Analysis of Computer Programs. Elsevier, Amsterdam (1977)"},{"key":"12_CR25","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"issue":"4","key":"12_CR26","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/356827.356832","volume":"12","author":"G.S. Lueker","year":"1980","unstructured":"Lueker, G.S.: Some Techniques for Solving Recurrences. ACM Computing Surveys (CSUR)\u00a012(4), 419\u2013436 (1980)","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"6","key":"12_CR27","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1145\/945885.945888","volume":"25","author":"V. Menon","year":"2003","unstructured":"Menon, V., Pingali, K., Mateev, N.: Fractal Symbolic Analysis. TOPLAS\u00a025(6), 776\u2013813 (2003)","journal-title":"TOPLAS"},{"issue":"8","key":"12_CR28","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/135226.135233","volume":"35","author":"W. Pugh","year":"1992","unstructured":"Pugh, W.: The Omega Test: A Fast and Practical Integer Programming Algorithm for Dependence Analysis. Communications of the ACM\u00a035(8), 102\u2013114 (1992)","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Pugh, W.: Counting Solutions To Presburger Formulas: How and Why. In: Proc.\u00a0of PLDI, pp. 121\u2013134 (1994)","key":"12_CR29","DOI":"10.1145\/773473.178254"},{"unstructured":"Pugh, W., Wonnacott, D.: Nonlinear Array Dependence Analysis. Technical report, College Park, MD, USA (1994)","key":"12_CR30"},{"doi-asserted-by":"crossref","unstructured":"Rugina, R., Rinard, M.: Symbolic Bounds Analysis of Pointers, Array Indices, and Accessed Memory Regions. In: Proc.\u00a0of PLDI, pp. 182\u2013195 (2000)","key":"12_CR31","DOI":"10.1145\/358438.349325"},{"doi-asserted-by":"crossref","unstructured":"Scholz, B., Blieberger, J., Fahringer, T.: Symbolic Pointer Analysis for Detecting Memory Leaks. In: ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM 2000), Boston (January 2000)","key":"12_CR32","DOI":"10.1145\/328690.328704"},{"unstructured":"SPEC CPU95 Benchmark Suite, Version 1.10 (August 1995)","key":"12_CR33"},{"issue":"3","key":"12_CR34","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/322261.322272","volume":"28","author":"R.E. Tarjan","year":"1981","unstructured":"Tarjan, R.E.: A Unified Approach to Path Problems. Journal of the ACM\u00a028(3), 577\u2013593 (1981)","journal-title":"Journal of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Tu, P., Padua, D.A.: Gated SAA-Based Demand-Driven Symbolic Analysis for Parallelizing Compilers. In: International Conference on Supercomputing, pp. 414\u2013423 (1995)","key":"12_CR35","DOI":"10.1145\/224538.224648"},{"unstructured":"van Engelen, R.A.: The CR# Algebra and its Application in Loop Analysis and Optimization. Technical Report TR-041223, Department of Computer Science, Florida State University (December 2004)","key":"12_CR36"},{"key":"12_CR37","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1145\/1006209.1006226","volume-title":"ICS 2004: Proc.\u00a0of the 18th Annual International Conference on Supercomputing","author":"R.A. Engelen van","year":"2004","unstructured":"van Engelen, R.A., Birch, J., Shou, Y., Walsh, B., Gallivan, K.A.: A Unified Framework for Nonlinear Dependence Testing and Symbolic Analysis. In: ICS 2004: Proc.\u00a0of the 18th Annual International Conference on Supercomputing, pp. 106\u2013115. ACM Press, New York (2004)"},{"unstructured":"Wolfram, S.: The Mathematica Book. Wolfram Media, Incorporated (2003)","key":"12_CR38"},{"key":"12_CR39","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/220346.220352","volume-title":"ISSAC 1995: Proc.\u00a0of the 1995 International Symposium on Symbolic and Algebraic Computation","author":"E.V. Zima","year":"1995","unstructured":"Zima, E.V.: Simplification and Optimization Transformations of Chains of Recurrences. In: ISSAC 1995: Proc.\u00a0of the 1995 International Symposium on Symbolic and Algebraic Computation, pp. 42\u201350. ACM Press, New York (1995)"},{"key":"12_CR40","volume-title":"Supercompilers for Parallel and Vector Computers","author":"H. Zima","year":"1991","unstructured":"Zima, H., Chapman, B.: Supercompilers for Parallel and Vector Computers. ACM Press, New York (1991)"}],"container-title":["Lecture Notes in Computer Science","Modular Programming Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11860990_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:43:46Z","timestamp":1605624226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11860990_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540409274","9783540409281"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/11860990_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}