1. Kakkad, V., Santosa, A. E., Fekete, A., & Scholz, B. (2015). Computing end-to-end delays in stream query processing. Sci. Comput. Program., 105(C), 124–144. doi:http://dx.doi.org/10.1016/j.scico.2015.04.003
  2. Ko, Y., Burgstaller, B., & Scholz, B. (2015). LaminarIR: compile-time queues for structured streams. In PLDI 2015: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 121–130). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/2737924.2737994
  3. Allen, N., Krishnan, P., & Scholz, B. (2015). Combining type-analysis with points-to analysis for analyzing Java library source-code. In SOAP 2015: Proceedings of the 4th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis (pp. 13–18). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/2771284.2771287
  4. Ko, Y., Burgstaller, B., & Scholz, B. (2013). Parallel from the beginning: the case for multicore programming in thecomputer science undergraduate curriculum. In SIGCSE ’13: Proceeding of the 44th ACM technical symposium on Computer science education (pp. 415–420). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/2445196.2445320
  5. Kakkad, V., Santosa, A. E., & Scholz, B. (2012). Migrating operator placement for compositional stream graphs. In MSWiM ’12: Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems (pp. 125–134). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/2387238.2387261
  6. Hong, K., Park, J., Kim, S., Kim, T., Kim, H., Burgstaller, B., & Scholz, B. (2012). TinyVM: an energy-efficient execution infrastructure for sensor networks. Softw. Pract. Exper., 42(10), 1193–1209. doi:http://dx.doi.org/10.1002/spe.1123
  7. Farhad, S. M., Ko, Y., Burgstaller, B., & Scholz, B. (2012). Profile-guided deployment of stream programs on multicores. In LCTES ’12: Proceedings of the 13th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, Tools and Theory for Embedded Systems (pp. 79–88). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/2248418.2248430
  8. Burgstaller, B., Scholz, B., & Blieberger, J. (2012). A symbolic analysis framework for static analysis of imperative programming languages. J. Syst. Softw., 85(6), 1418–1439. doi:http://dx.doi.org/10.1016/j.jss.2011.11.1039
  9. Scholz, B., Choi, S.-M., Ko, S.-K., Eom, H.-S., & Han, Y.-S. (2012). A recommendation system based on a subset of raters. In ICUIMC ’12: Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication (pp. 1–9). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/2184751.2184866
  10. Jain, S. K., Zhang, C., & Scholz, B. (2012). Translating flowcharts to non-deterministic languages. In PEPM ’12: Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation (pp. 155–162). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/2103746.2103775
  11. Khoury, R., Burgstaller, B., & Scholz, B. (2011). Accelerating the Execution of Matrix Languages on the Cell Broadband Engine Architecture. IEEE Trans. Parallel Distrib. Syst., 22(1), 7–21. doi:http://dx.doi.org/10.1109/TPDS.2010.58
  12. Farhad, S. M., Ko, Y., Burgstaller, B., & Scholz, B. (2011). Orchestration by approximation: mapping stream programs onto multicore architectures. In ASPLOS XVI: Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems (pp. 357–368). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/1950365.1950406
  13. Park, J., Park, J., Song, W., Yoon, S., Burgstaller, B., & Scholz, B. (2011). Treegraph-based Instruction Scheduling for Stack-based Virtual Machines. Electron. Notes Theor. Comput. Sci., 279(1), 33–45. doi:http://dx.doi.org/10.1016/j.entcs.2011.11.004
  14. Scholz, B., Choi, S.-M., Ko, S.-K., Eom, H.-S., & Han, Y.-S. (2011). Analyzing category correlations for recommendation system. In ICUIMC ’11: Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication (pp. 1–7). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/1968613.1968615
  15. Khoury, R., Dawborn, T., Gafurov, B., Pink, G., Tse, E., Tse, Q., … Scholz, B. (2010). Corona: energy-efficient multi-query processing in wireless sensor networks. In DASFAA’10: Proceedings of the 15th international conference on Database Systems for Advanced Applications (pp. 416–419). Berlin, Heidelberg: Springer-Verlag. doi:http://dx.doi.org/10.1007/978-3-642-12098-5_39
  16. Ebner, D., Scholz, B., & Krall, A. (2009). Progressive spill code placement. In CASES ’09: Proceedings of the 2009 international conference on Compilers, architecture, and synthesis for embedded systems (pp. 77–86). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/1629395.1629408
  17. Evans, S. C., Markham, T. S., Bejtlich, R., Barnett, B., Scholz, B., Mitchell, R., … Impson, J. (2009). Network attack visualization and response through intelligent icons. In MILCOM’09: Proceedings of the 28th IEEE conference on Military communications (pp. 2062–2068). Piscataway, NJ, USA: IEEE Press.
  18. Evans, S. C., Yan, W., Scholz, B. J., Barnett, B., Markham, T. S., Impson, J., & Steinbrecher, E. (2009). Towards modeling and detection of polymorphic network attacks using grammar based learning with support vector machines. In MILCOM’09: Proceedings of the 28th IEEE conference on Military communications (pp. 2049–2055). Piscataway, NJ, USA: IEEE Press.
  19. Hong, K., Park, J., Kim, T., Kim, S., Kim, H., Ko, Y., … Scholz, B. (2009). TinyVM, an efficient virtual machine infrastructure for sensor networks. In SenSys ’09: Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems (pp. 399–400). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/1644038.1644121
  20. Cifuentes, C., Hoermann, C., Keynes, N., Li, L., Long, S., Mealy, E., … Scholz, B. (2009). BegBunch: benchmarking for C bug detection tools. In DEFECTS ’09: Proceedings of the 2nd International Workshop on Defects in Large Software Systems (pp. 16–20). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/1555860.1555866
  21. Kim, T.-hoon, Kim, S., Hong, K., Kim, H., Park, J., Ko, Y., … Scholz, B. (2009). An Efficient Mixed-Mode Execution Environment for C on Mobile Phone Platforms. In CSIE ’09: Proceedings of the 2009 WRI World Congress on Computer Science and Information Engineering (pp. 320–328). Washington, DC, USA: IEEE Computer Society. doi:http://dx.doi.org/10.1109/CSIE.2009.909
  22. Cifuentes, C., Keynes, N., Li, L., & Scholz, B. (2009). Program analysis for bug detection using parfait: invited talk. In PEPM ’09: Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation (pp. 7–8). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/1480945.1480947
  23. Cifuentes, C., & Scholz, B. (2008). Parfait: designing a scalable bug checker. In SAW ’08: Proceedings of the 2008 workshop on Static analysis (pp. 4–11). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/1394504.1394505
  24. Ebner, D., Brandner, F., Scholz, B., Krall, A., Wiedermann, P., & Kadlec, A. (2008). Generalized instruction selection using SSA-graphs. In LCTES ’08: Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems (pp. 31–40). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/1375657.1375663
  25. Burgstaller, B., Scholz, B., & Blieberger, J. (2008). Symbolic Analysis. Saarbrücken, Germany, Germany: VDM Verlag.
  26. Scholz, B., Zhang, C., & Cifuentes, C. (2008). User-input dependence analysis via graph reachability. Mountain View, CA, USA: Sun Microsystems, Inc.
  27. Scholz, B., Burgstaller, B., & Xue, J. (2008). Minimal placement of bank selection instructions for partitioned memory architectures. ACM Trans. Embed. Comput. Syst., 7(2), 1–32. doi:http://doi.acm.org/10.1145/1331331.1331336
  28. Selvakennedy, S., Rohm, U., & Scholz, B. (2007). Event Processing Middleware for Wireless Sensor Networks. In ICPPW ’07: Proceedings of the 2007 International Conference on Parallel Processing Workshops (p. 65). Washington, DC, USA: IEEE Computer Society. doi:http://dx.doi.org/10.1109/ICPPW.2007.42
  29. Nguyen, Q. H., & Scholz, B. (2007). Computing SSA Form with Matrices. Electron. Notes Theor. Comput. Sci., 190(1), 121–132. doi:http://dx.doi.org/10.1016/j.entcs.2007.02.064
  30. Scholz, B., Gaber, M. M., Dawborn, T., Khoury, R., & Tse, E. (2007). Efficient Time Triggered Query Processing in Wireless Sensor Networks. In ICESS ’07: Proceedings of the 3rd international conference on Embedded Software and Systems (pp. 391–402). Berlin, Heidelberg: Springer-Verlag. doi:http://dx.doi.org/10.1007/978-3-540-72685-2_37
  31. Rohm, U., Scholz, B., & Gaber, M. M. (2007). On the Integration of Data Stream Clustering into a Query Processor for Wireless Sensor Networks. In MDM ’07: Proceedings of the 2007 International Conference on Mobile Data Management (pp. 331–335). Washington, DC, USA: IEEE Computer Society. doi:http://dx.doi.org/10.1109/MDM.2007.70
  32. Schäfer, S., & Scholz, B. (2007). Optimal chain rule placement for instruction selection based on SSA graphs. In SCOPES ’07: Proceedingsof the 10th international workshop on Software & compilers for embedded systems (pp. 91–100). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/1269843.1269857
  33. Scholz, B., & Blieberger, J. (2007). A new elimination-based data flow analysis framework using annotated decomposition trees. In CC’07: Proceedings of the 16th international conference on Compiler construction (pp. 202–217). Berlin, Heidelberg: Springer-Verlag.
  34. Zhou, Z. Q., Scholz, B., & Denaro, G. (2007). Automated Software Testing and Analysis: Techniques, Practices and Tools. In HICSS ’07: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (p. 260). Washington, DC, USA: IEEE Computer Society. doi:http://dx.doi.org/10.1109/HICSS.2007.96
  35. Scholz, B., Burgstaller, B., & Xue, J. (2006). Minimizing bank selection instructions for partitioned memory architecture. In CASES ’06: Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems (pp. 201–211). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/1176760.1176786
  36. Burgstaller, B., Scholz, B., & Blieberger, J. (2006). Symbolic analysis of imperative programming languages. In JMLC’06: Proceedings of the 7th joint conference on Modular Programming Languages (pp. 172–194). Berlin, Heidelberg: Springer-Verlag. doi:http://dx.doi.org/10.1007/11860990_12
  37. Horspool, R. N., Pereira, D. J., & Scholz, B. (2006). Fast profile-based partial redundancy elimination. In JMLC’06: Proceedings of the 7th joint conference on Modular Programming Languages (pp. 362–376). Berlin, Heidelberg: Springer-Verlag. doi:http://dx.doi.org/10.1007/11860990_22
  38. Burgstaller, B., Scholz, B., & Ertl, A. (2006). An embedded systems programming environment for c. In Euro-Par’06: Proceedings of the 12th international conference on Parallel Processing (pp. 1204–1216). Berlin, Heidelberg: Springer-Verlag. doi:http://dx.doi.org/10.1007/11823285_127
  39. Hames, L., & Scholz, B. (2006). Nearly optimal register allocation with PBQP. In JMLC’06: Proceedings of the 7th joint conference on Modular Programming Languages (pp. 346–361). Berlin, Heidelberg: Springer-Verlag. doi:http://dx.doi.org/10.1007/11860990_21
  40. Chalermkraivuth, K. C., Bollapragada, S., Clark, M. C., Deaton, J., Kiaer, L., Murdzek, J. P., … Toledano, D. (2005). GE Asset Management, Genworth Financial, and GE Insurance Use a Sequential-Linear-Programming Algorithm to Optimize Portfolios. Interfaces, 35(5), 370–380. doi:http://dx.doi.org/10.1287/inte.1050.0164
  41. Scholz, B., Horspool, N., & Knoop, J. (2004). Optimizing for space and time usage with speculative partial redundancy elimination. In LCTES ’04: Proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems (pp. 221–230). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/997163.997195
  42. Blieberger, J., Burgstaller, B., & Scholz, B. (2003). Busy wait analysis. In Ada-Europe’03: Proceedings of the 8th Ada-Europe international conference on Reliable software technologies (pp. 142–152). Berlin, Heidelberg: Springer-Verlag.
  43. Eckstein, E., & Scholz, B. (2003). Addressing mode selection. In CGO ’03: Proceedings of the international symposium on Code generation and optimization (pp. 337–346). Washington, DC, USA: IEEE Computer Society.
  44. Fahringer, T., & Scholz, B. (2003). Advanced symbolic analysis for compilers: new techniques and algorithms for symbolic program analysis and optimization. Berlin, Heidelberg: Springer-Verlag.
  45. Scholz, B., & Mehofer, E. (2002). Dataflow Frequency Analysis Based on Whole Program Paths. In PACT ’02: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (pp. 95–103). Washington, DC, USA: IEEE Computer Society.
  46. Scholz, B., & Eckstein, E. (2002). Register allocation for irregular architectures. In LCTES/SCOPES ’02: Proceedings of the joint conference on Languages, compilers and tools for embedded systems (pp. 139–148). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/513829.513854
  47. Mehofer, E., & Scholz, B. (2001). A Novel Probabilistic Data Flow Framework. In CC ’01: Proceedings of the 10th International Conference on Compiler Construction (pp. 37–51). London, UK, UK: Springer-Verlag.
  48. Fahringer, T., Scholz, B., & Sun, X.-H. (2000). Execution-driven performance analysis for distributed and parallel systems. In WOSP ’00: Proceedings of the 2nd international workshop on Software and performance (pp. 204–215). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/350391.350433
  49. Fahringer, T., & Scholz, B. (2000). A Unified Symbolic Evaluation Framework for Parallelizing Compilers. IEEE Trans. Parallel Distrib. Syst., 11(11), 1105–1125. doi:http://dx.doi.org/10.1109/71.888633
  50. Blieberger, J., Burgstaller, B., & Scholz, B. (2000). Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs. In Ada-Europe ’00: Proceedings of the 5th Ada-Europe International Conference on Reliable Software Technologies (pp. 225–237). London, UK, UK: Springer-Verlag.
  51. Blieberger, J., Fahringer, T., & Scholz, B. (2000). Symbolic Cache Analysis for Real-Time Systems. Real-Time Syst., 18(2/3), 181–215. doi:http://dx.doi.org/10.1023/A:1008193114940
  52. Mehofer, E., & Scholz, B. (2000). Probabilistic data flow system with two-edge profiling. In DYNAMO ’00: Proceedings of the ACM SIGPLAN workshop on Dynamic and adaptive compilation and optimization (pp. 65–72). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/351397.351418
  53. Scholz, B., Blieberger, J., & Fahringer, T. (1999). Symbolic pointer analysis for detecting memory leaks. In PEPM ’00: Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation (pp. 104–113). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/328690.328704
  54. Blieberger, J., Burgstaller, B., & Scholz, B. (1999). Interprocedural Symbolic Evaluation of Ada Programs with Aliases. In Ada-Europe ’99: Proceedings of the 1999 Ada-Europe International Conference on Reliable Software Technologies (pp. 136–145). London, UK, UK: Springer-Verlag.
  55. Fahringer, T., & Scholz, B. (1997). Symbolic evaluation for parallelizing compilers. In ICS ’97: Proceedings of the 11th international conference on Supercomputing (pp. 261–268). New York, NY, USA: ACM. doi:http://doi.acm.org/10.1145/263580.263648