{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:24:28Z","timestamp":1755221068567,"version":"3.43.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Real-Time Systems"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1023\/a:1008193114940","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:17:47Z","timestamp":1040545067000},"page":"181-215","source":"Crossref","is-referenced-by-count":12,"title":["Symbolic Cache Analysis for Real-Time Systems"],"prefix":"10.1007","volume":"18","author":[{"given":"Johann","family":"Blieberger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Fahringer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Scholz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"255148_CR1","doi-asserted-by":"crossref","unstructured":"Alt, M., Ferdinand, C., Martin, F., and Wilhelm, R. 1996. Cache behaviour prediction by abstract interpretation. Proc. of Static Analysis Symposium, pp. 52\u201366.","DOI":"10.1007\/3-540-61739-6_33"},{"key":"255148_CR2","unstructured":"Altenbernd, P. 1996. On the false path problem in hard real-time programs. Proc. Euromicro Workshop on Real-Time Systems."},{"key":"255148_CR3","doi-asserted-by":"crossref","unstructured":"Arnold, R., Mueller, F., Whalley, D., and Harmon, M. 1994. Bounding worst-case instruction cache performance. Proc. of the IEEE Real-Time Systems Symposium, pp. 172\u2013181.","DOI":"10.1109\/REAL.1994.342718"},{"issue":"3","key":"255148_CR4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0096-0551(94)90004-3","volume":"20","author":"J. Blieberger","year":"1994","unstructured":"Blieberger, J. 1994. Discrete loops and worst case performance. Computer Languages 20(3): 193\u2013212.","journal-title":"Computer Languages"},{"key":"255148_CR5","unstructured":"Blieberger, J. 1997. Data-flow frameworks for worst-case execution time analysis. To appear in Real-Time Systems."},{"key":"255148_CR6","doi-asserted-by":"crossref","unstructured":"Blieberger, J., and Burgstaller, B. 1998. Symbolic reaching definitions analysis of Ada programs. Proc. of the Ada-Europe International Conference on Reliable Software Technologies, pp. 238\u2013250.","DOI":"10.1007\/BFb0055009"},{"key":"255148_CR7","doi-asserted-by":"crossref","unstructured":"Blieberger, J., Burgstaller, B., and Scholz, B. 1999. Interprocedural symbolic analysis of Ada programs with aliases. Proc. of the Ada-Europe International Conference on Reliable Software Technologies. pp. 136\u2013145.","DOI":"10.1007\/3-540-48753-0_12"},{"issue":"2","key":"255148_CR8","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00365315","volume":"11","author":"J. Blieberger","year":"1996","unstructured":"Blieberger, J., and Lieger, R. 1996. Worst-case space and time complexity of recursive procedures. Real-Time Systems 11(2): 115\u2013144.","journal-title":"Real-Time Systems"},{"key":"255148_CR9","doi-asserted-by":"crossref","unstructured":"Callahan, D., Kennedy, K., and Portfield, A. 1990. Analyzing and Visualizing Performance of Memory Hierachies, Instrumentation for Visualization. ACM Press.","DOI":"10.1145\/100215.100233"},{"issue":"2","key":"255148_CR10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF00365316","volume":"11","author":"R. Chapman","year":"1996","unstructured":"Chapman, R., Burns, A., and Wellings, A. 1996. Combining static worst-case timing analysis and program proof. The Journal of Real-Time Systems 11(2): 145\u2013171.","journal-title":"The Journal of Real-Time Systems"},{"issue":"4","key":"255148_CR11","first-page":"403","volume":"5","author":"T. Cheatham","year":"1979","unstructured":"Cheatham, T., Holloway, H., and Townley, J. 1979. Symbolic evaluation and the analysis of programs. IEEE Trans. Software Eng. 5(4): 403\u2013417.","journal-title":"IEEE Trans. Software Eng."},{"key":"255148_CR12","volume-title":"A Discipline of Programming","author":"E. Dijkstra","year":"1976","unstructured":"Dijkstra, E. 1976. A Discipline of Programming. New Jersey: Prentice Hall."},{"key":"255148_CR13","unstructured":"Engblom, J., Altenbernd, P., and Ermedahl, A. 1998. Facilitating worst-case execution times analysis for optimized code. Proc. Euromicro Workshop on Real-Time Systems."},{"key":"255148_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1371-7","volume-title":"Automatic Performance Prediction of Parallel Programs","author":"T. Fahringer","year":"1996","unstructured":"Fahringer, T. 1996. Automatic Performance Prediction of Parallel Programs. Boston: Kluwer Academic Publishers."},{"key":"255148_CR15","doi-asserted-by":"crossref","unstructured":"Fahringer, T. 1997. Estimating cache performance for sequential and data parallel programs. Proc. of the International Conference and Exhibition on High-Performance Computing and Networking.","DOI":"10.1007\/BFb0031655"},{"key":"255148_CR16","unstructured":"Fahringer, T. 1998a. Efficient symbolic analysis for parallelizing compilers and performance estimators. Journal of Supercomputing, Kluwer Academic Publishers 12(3)."},{"key":"255148_CR17","first-page":"385","volume-title":"Journal of Future Generation Computer Systems","author":"T. Fahringer","year":"1998","unstructured":"Fahringer, T. 1998b. Symbolic analysis techniques for program parallelization. Journal of Future Generation Computer Systems, Elsevier Science, North-Holland 13(1997\/98): 385\u2013396."},{"key":"255148_CR18","doi-asserted-by":"crossref","unstructured":"Fahringer, T., and Scholz, B. 1997. Symbolic evaluation for parallelizing compilers. Proc. of the ACM International Conference on Supercomputing.","DOI":"10.1145\/263580.263648"},{"key":"255148_CR19","series-title":"Technical Report AURORA","volume-title":"Aunified symbolic evaluation framework for parallelizing compilers","author":"T. Fahringer","year":"1999","unstructured":"Fahringer, T., and Scholz, B. 1999. Aunified symbolic evaluation framework for parallelizing compilers. Technical Report AURORA TR1999-15 (http:\/\/www.vcpc.univie.ac.at\/aurora\/), University of Vienna, Austria."},{"key":"255148_CR20","unstructured":"Ferrante, J., Sarkar, V., and Trash, W. 1991. On estimating and enhancing cache effectiveness. Proc. of the Workshop on Languages and Compilers for Parallel Computing."},{"issue":"1","key":"255148_CR21","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/200994.201003","volume":"17","author":"M. P. Gerlek","year":"1995","unstructured":"Gerlek, M. P., Stoltz, E., and Wolfe, M. 1995. Beyond induction variables: Detecting and classifying sequences using a demand-driven SSA form. ACM Transactions on Programming Languages and Systems (TOPLAS) 17(1): 85\u2013122.","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"255148_CR22","doi-asserted-by":"crossref","unstructured":"Ghosh, S., Martonosi, M., and Malik, S. 1997. Cache miss equations: an analytical representation of cache misses. International Conference on Supercomputing.","DOI":"10.1145\/263580.263657"},{"key":"255148_CR23","doi-asserted-by":"crossref","unstructured":"Goldberg, A., and Hennessy, J. 1991. Performance debugging shared memory multiprocessor programs with MTOOL. Proc. of the Supercomputing Conference.","DOI":"10.1145\/125826.126075"},{"issue":"4","key":"255148_CR24","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1145\/233561.233568","volume":"18","author":"M. Haghighat","year":"1996","unstructured":"Haghighat, M., and Polychronopoulos, C. 1996. Symbolic analysis for parallelizing compilers. ACMTransactions on Programming Languages and Systems 18(4): 477\u2013518.","journal-title":"ACMTransactions on Programming Languages and Systems"},{"key":"255148_CR25","doi-asserted-by":"crossref","unstructured":"Healy, C., Whalley, D., and Harmon, M. 1995. Integrating the timing analysis of pipelining and instruction caching. Proc. of the IEEE Real-Time Systems Symposium, pp. 288\u2013297.","DOI":"10.1109\/REAL.1995.495218"},{"key":"255148_CR26","doi-asserted-by":"crossref","unstructured":"Healy, C. A., Arnold, R. D., Mueller, F., Whalley, D., and Harmon, M. G. 1999. Bounding pipeline and instruction cache performance. IEEE Transactions on Computers 48(1).","DOI":"10.1109\/12.743411"},{"key":"255148_CR27","volume-title":"Computer Architecture-A Quantitative Approach","author":"J. Hennessy","year":"1990","unstructured":"Hennessy, J., and Patterson, D. 1990. Computer Architecture-A Quantitative Approach. San Mateo, CA: Morgan Kaufmann."},{"key":"255148_CR28","volume-title":"Acme Cache Simulator","author":"B. Hunt","year":"1997","unstructured":"Hunt, B. 1997. Acme Cache Simulator. Parallel Architecture Research Laboratory (PARL), Klipsch School of Electrical and Computer Engineering, New Mexico. URL http:\/\/tracebase.nmsu.edu\/\u00bbacme\/acs.html."},{"key":"255148_CR29","unstructured":"Johnson, E., and Ha, J. 1994. PDATS lossless address trace compression for reducing file size and access time. Proc. of the IEEE International Phoenix Conference on omputers and Communication."},{"issue":"7","key":"255148_CR30","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/360248.360252","volume":"19","author":"J. King","year":"1976","unstructured":"King, J. 1976. Symbolic execution and program testing. Commun. ACM 19(7): 385\u2013394.","journal-title":"Commun. ACM"},{"key":"255148_CR31","doi-asserted-by":"crossref","unstructured":"Lam, M., Rothberg, E., and Wolf, M. 1991. The cache performance and optimization of blocked algorithms. Proc. of the Int. Conference on Architectural Support for Prog. Languages Operating Systems.","DOI":"10.1145\/106972.106981"},{"key":"255148_CR32","doi-asserted-by":"crossref","unstructured":"Lebeck, A., and Wood, D. 1994. Cache profiling and the SPEC benchmarks: A case study. IEEE Computer 27(10).","DOI":"10.1109\/2.318580"},{"key":"255148_CR33","unstructured":"Li, Y., Malik, S., and Wolfe, A. 1995. Performance estimation of embedded software with instruction cache modeling. Proc. of the ACM\/IEEE International Conference on Computer-Aided Design."},{"key":"255148_CR34","unstructured":"Li, Y., Malik, S., and Wolfe, A. 1996. Cache modeling for real-time software: Beyond direct mapped instruction caches. Proc. of the IEEE Real-Time Systems Symposium."},{"key":"255148_CR35","doi-asserted-by":"crossref","unstructured":"Lim, S., Bae, Y., Jang, G., Rhee, B., Min, S., Park, C., Shin, H., Park, K., and Kim, C. 1994. An accurate worst case timing analysis technique for RISC processors. Proc. of the IEEE Real-Time Systems Symposium, pp. 97\u2013108.","DOI":"10.1109\/REAL.1994.342726"},{"key":"255148_CR36","doi-asserted-by":"crossref","unstructured":"Liu, J., and Lee, H. 1994. Deterministic upperbounds of the worst-case execution times of cached programs. Proc. of the IEEE Real-Time Systems Symposium, pp. 182\u2013191.","DOI":"10.1109\/REAL.1994.342717"},{"issue":"4","key":"255148_CR37","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/356827.356832","volume":"12","author":"G. S. Lueker","year":"1980","unstructured":"Lueker, G. S. 1980. Some techniques for solving recurrences. ACM Computing Surveys 12(4): 419\u2013435.","journal-title":"ACM Computing Surveys"},{"key":"255148_CR38","unstructured":"Mueller, F. 1997. Generalizing timing predictions to set-associative caches. Proc. of the EuroMicro, Workshop on Real Time Systems."},{"key":"255148_CR39","doi-asserted-by":"crossref","unstructured":"Nilsen, K., and Rygg, B. 1995. Worst-case execution time analysis on modern processors. Proc. of ACMSIGPLAN, Workshop on Languages, Computer and Tool Support for Real-Time Systems, pp. 20\u201330.","DOI":"10.1145\/216636.216650"},{"key":"255148_CR40","unstructured":"Ottosson, G., and Sjoedin, M. 1997. Worst case execution time analysis for modern hardware architectures. Proc. of ACM SIGPLAN, Workshop on Languages, Compilers and Tools for Real-Time Systems."},{"key":"255148_CR41","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01088696","volume":"5","author":"C. Park","year":"1993","unstructured":"Park, C. 1993. Predicting program execution times by analyzing static and dynamic program paths. The Journal of Real-Time Systems 5: 31\u201362.","journal-title":"The Journal of Real-Time Systems"},{"key":"255148_CR42","unstructured":"Ploedereder, E. 1980. A semantic model for the analysis and verification of programs in general, higher-level languages. Ph.D. thesis, Harvard University."},{"key":"255148_CR43","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00571421","volume":"1","author":"P. Puschner","year":"1989","unstructured":"Puschner, P., and Koza, C. 1989. Calculating the maximum execution time of real-time programs. The Journal of Real-Time Systems 1: 159\u2013176.","journal-title":"The Journal of Real-Time Systems"},{"key":"255148_CR44","unstructured":"Rawat, J. 1993. Static analysis of cache performance for real-time programming. Master's thesis, Iowa State University of Science and Technology, Dept. of Computer Science."},{"key":"255148_CR45","unstructured":"Scheibl, M., Celic, A., and Fahringer, T. 1996. Interfacing Mathematica from the Vienna Fortran compilation system. Technical Report, Institute for Software Technology and Parallel Systems, Univ. of Vienna."},{"key":"255148_CR46","doi-asserted-by":"crossref","unstructured":"Smith, A. 1982. Cache memories. Computing Surveys 14(3).","DOI":"10.1145\/356887.356892"},{"key":"255148_CR47","doi-asserted-by":"crossref","unstructured":"Temam, O., Fricker, C., and Jalby, W. 1994. Cache interference phenomena. Proc. of the ACM SIGMETRICS Conference.","DOI":"10.1145\/183018.183047"},{"key":"255148_CR48","unstructured":"Theiling, H., and Ferdinand, C. 1998. Combining abstract interpretation and ILP for microarchitecture modelling and program path analysis. Proc. of the IEEE Real-Time Systems Symposium."}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008193114940.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008193114940\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008193114940.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T07:19:51Z","timestamp":1754637591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008193114940"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":48,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["255148"],"URL":"https:\/\/doi.org\/10.1023\/a:1008193114940","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"type":"print","value":"0922-6443"},{"type":"electronic","value":"1573-1383"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}