default search action
Bernhard Scholz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [i12]Nathalie Bertrand, Pranav Ghorpade, Sasha Rubin, Bernhard Scholz, Pavle Subotic:
Reusable Formal Verification of DAG-based Consensus Protocols. CoRR abs/2407.02167 (2024) - 2023
- [j22]Xiaowen Hu
, Bernd Burgstaller
EVMTracer: Dynamic Analysis of the Parallelization and Redundancy Potential in the Ethereum Virtual Machine. IEEE Access 11: 47159-47178 (2023) - [c76]Jens Dietrich
Efficient Sink-Reachability Analysis via Graph Reduction (Extended Abstract). ICDE 2023: 3897-3898 - [c75]David Zhao
Automatic Rollback Suggestions for Incremental Datalog Evaluation. PADL 2023: 295-312 - [c74]Jay Hwan Lee
Julia Cloud Matrix Machine: Dynamic Matrix Language Acceleration on Multicore Clusters in the Cloud. PMAM@PPoPP 2023: 1-10 - 2022
- [j21]Herbert Jordan
Specializing parallel data structures for Datalog. Concurr. Comput. Pract. Exp. 34(2) (2022) - [j20]Valon Raca
Runtime and energy constrained work scheduling for heterogeneous systems. J. Supercomput. 78(15): 17150-17177 (2022) - [j19]Jens Dietrich
Efficient Sink-Reachability Analysis via Graph Reduction. IEEE Trans. Knowl. Data Eng. 34(11): 5321-5335 (2022) - [c73]Samuel Arch
Building a Join Optimizer for Soufflé. LOPSTR 2022: 83-102 - [p2]Dietmar Ebner, Andreas Krall, Bernhard Scholz:
Instruction Code Selection. SSA-based Compiler Design 2022: 257-268 - [e1]Bernhard Scholz, Yukiyoshi Kameyama:
Proceedings of the 21st ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences, GPCE 2022, Auckland, New Zealand, December 6-7, 2022. ACM 2022, ISBN 978-1-4503-9920-3 [contents] - [i11]Jay Hwan Lee, Yeonsoo Kim, Younghyun Ryu, Wasuwee Sodsong, Hyunjun Jeon, Jinsik Park, Bernd Burgstaller, Bernhard Scholz:
Cloud Matrix Machine for Julia and Implicit Parallelization for Matrix Languages. CoRR abs/2205.07421 (2022) - [i10]Shinhyung Yang
Cloudprofiler: TSC-based inter-node profiling and high-throughput data ingestion for cloud streaming workloads. CoRR abs/2205.09325 (2022) - 2021
- [c72]Xiaowen Hu
The Choice Construct in the Soufflé Language. APLAS 2021: 163-181 - [c71]Xiaowen Hu
An efficient interpreter for Datalog by de-specializing relations. PLDI 2021: 681-695 - [c70]David Zhao
Towards Elastic Incrementalization for Datalog. PPDP 2021: 20:1-20:16 - [c69]Yeonsoo Kim, Seongho Jeong, Kamil Jezek, Bernd Burgstaller, Bernhard Scholz:
An Off-The-Chain Execution Environment for Scalable Testing and Profiling of Smart Contracts. USENIX ATC 2021: 565-579 - [i9]Xiaowen Hu, Joshua Karp, David Zhao, Abdul Zreika, Xi Wu, Bernhard Scholz:
The Choice Construct in the Souffle Language. CoRR abs/2108.11212 (2021) - 2020
- [j18]Neville Grech, Michael Kong, Anton Jurisevic, Lexi Brent, Bernhard Scholz, Yannis Smaragdakis:
MadMax: analyzing the out-of-gas world of smart contracts. Commun. ACM 63(10): 87-95 (2020) - [j17]Mukund Raghothaman
Provenance-guided synthesis of Datalog programs. Proc. ACM Program. Lang. 4(POPL): 62:1-62:27 (2020) - [j16]David Zhao
Debugging Large-scale Datalog: A Scalable Provenance Evaluation Strategy. ACM Trans. Program. Lang. Syst. 42(2): 7:1-7:35 (2020) - [c68]Jixiang Shen, Xi Wu, Neville Grech, Bernhard Scholz, Yannis Smaragdakis:
Explaining bug provenance with trace witnesses. SOAP@PLDI 2020: 14-19 - [c67]Lexi Brent, Neville Grech, Sifis Lagouvardos
Ethainter: a smart contract security analyzer for composite vulnerabilities. PLDI 2020: 454-469
2010 – 2019
- 2019
- [c66]Patrick Nappa, David Zhao
Fast Parallel Equivalence Relations in a Datalog Compiler. PACT 2019: 82-96 - [c65]Neville Grech, Lexi Brent, Bernhard Scholz, Yannis Smaragdakis:
Gigahorse: thorough, declarative decompilation of smart contracts. ICSE 2019: 1176-1186 - [c64]Herbert Jordan, Pavle Subotic, David Zhao
Brie: A Specialized Trie for Concurrent Datalog. PMAM@PPoPP 2019: 31-40 - [c63]Herbert Jordan, Pavle Subotic, David Zhao
A specialized B-tree for concurrent datalog evaluation. PPoPP 2019: 327-339 - [i8]David Zhao, Pavle Subotic, Bernhard Scholz:
Provenance for Large-scale Datalog. CoRR abs/1907.05045 (2019) - [i7]Kirk Baird, Seongho Jeong, Yeonsoo Kim
The Economics of Smart Contracts. CoRR abs/1910.11143 (2019) - [i6]Alan D. Fekete, Brody Franks, Herbert Jordan, Bernhard Scholz:
Worst-Case Optimal Radix Triejoin. CoRR abs/1912.12747 (2019) - 2018
- [j15]Neville Grech
MadMax: surviving out-of-gas conditions in Ethereum smart contracts. Proc. ACM Program. Lang. 2(OOPSLA): 116:1-116:27 (2018) - [j14]Pavle Subotic, Herbert Jordan, Lijun Chang, Alan D. Fekete, Bernhard Scholz:
Automatic Index Selection for Large-Scale Datalog Computation. Proc. VLDB Endow. 12(2): 141-153 (2018) - [c62]Herbert Jordan, Bernhard Scholz, Pavle Subotic:
Two concurrent data structures for efficient datalog query processing. PPoPP 2018: 399-400 - [i5]Lexi Brent, Anton Jurisevic, Michael Kong, Eric Liu, François Gauthier, Vincent Gramoli
Vandal: A Scalable Security Analysis Framework for Smart Contracts. CoRR abs/1809.03981 (2018) - 2017
- [c61]Mitchell Jones
Towards Memory-Optimal Schedules for SDF. Euro-Par Workshops 2017: 94-105 - [c60]Nicholas Hollingum, Bernhard Scholz:
Cauliflower: a Solver Generator for Context-Free Language Reachability. LPAR 2017: 171-180 - [c59]Behnaz Hassanshahi, Raghavendra Kagalavadi Ramesh, Padmanabhan Krishnan, Bernhard Scholz, Yi Lu:
An efficient tunable selective points-to analysis for large codebases. SOAP@PLDI 2017: 13-18 - [i4]Herbert Jordan, Bernhard Scholz, Pavle Subotic:
Optimal On The Fly Index Selection in Polynomial Time. CoRR abs/1709.03685 (2017) - [i3]Wasuwee Sodsong, Bernhard Scholz, Sanjay Chawla:
SPARK: Static Program Analysis Reasoning and Retrieving Knowledge. CoRR abs/1711.01024 (2017) - 2016
- [c58]Herbert Jordan, Bernhard Scholz, Pavle Subotic:
Soufflé: On Synthesis of Program Analyzers. CAV (2) 2016: 422-430 - [c57]Bernhard Scholz, Herbert Jordan, Pavle Subotic, Till Westmann:
On fast large-scale program analysis in Datalog. CC 2016: 196-206 - [c56]Jens Dietrich, Nicholas Hollingum, Bernhard Scholz:
A Note on the Soundness of Difference Propagation. FTfJP@ECOOP 2016: 3 - 2015
- [j13]Vasvi Kakkad, Andrew E. Santosa
Computing end-to-end delays in stream query processing. Sci. Comput. Program. 105: 124-144 (2015) - [c55]Bernhard Scholz, Kostyantyn Vorobyov, Padmanabhan Krishnan, Till Westmann:
A Datalog Source-to-Source Translator for Static Program Analysis: An Experience Report. ASWEC 2015: 28-37 - [c54]Nicholas Allen, Bernhard Scholz, Padmanabhan Krishnan:
Staged Points-to Analysis for Large Code Bases. CC 2015: 131-150 - [c53]Nicholas Hollingum, Bernhard Scholz:
Towards a Scalable Framework for Context-Free Language Reachability. CC 2015: 193-211 - [c52]Jens Dietrich
Giga-scale exhaustive points-to analysis for Java in under a minute. OOPSLA 2015: 535-551 - [c51]Nicholas Allen, Padmanabhan Krishnan, Bernhard Scholz:
Combining type-analysis with points-to analysis for analyzing Java library source-code. SOAP@PLDI 2015: 13-18 - [c50]Yousun Ko, Bernd Burgstaller, Bernhard Scholz:
LaminarIR: compile-time queues for structured streams. PLDI 2015: 121-130 - 2014
- [j12]Vasvi Kakkad, Saeed Attar, Andrew E. Santosa, Alan D. Fekete, Bernhard Scholz:
Curracurrong: a stream programming environment for wireless sensor networks. Softw. Pract. Exp. 44(2): 175-199 (2014) - [c49]Vasvi Kakkad, Akon Dey, Alan D. Fekete, Bernhard Scholz:
Curracurrong cloud: Stream processing in the cloud. ICDE Workshops 2014: 207-214 - 2013
- [c48]Linsey Xiaolin Pang
A Scalable Approach for LRT Computation in GPGPU Environments. APWeb 2013: 595-608 - [c47]Yousun Ko, Bernd Burgstaller, Bernhard Scholz:
Parallel from the beginning: the case for multicore programming in thecomputer science undergraduate curriculum. SIGCSE 2013: 415-420 - 2012
- [j11]Bernd Burgstaller, Bernhard Scholz, Johann Blieberger:
A symbolic analysis framework for static analysis of imperative programming languages. J. Syst. Softw. 85(6): 1418-1439 (2012) - [j10]Kirak Hong, Jiin Park, Sungho Kim, Taekhoon Kim, Hwangho Kim, Bernd Burgstaller, Bernhard Scholz:
TinyVM: an energy-efficient execution infrastructure for sensor networks. Softw. Pract. Exp. 42(10): 1193-1209 (2012) - [c46]Weisheng Si, Bernhard Scholz, Joachim Gudmundsson
On graphs supporting greedy forwarding for directional wireless networks. ICC 2012: 751-756 - [c45]Bernhard Scholz, Sang-Min Choi, Sang-Ki Ko, Hae-Sung Eom, Yo-Sub Han:
A recommendation system based on a subset of raters. ICUIMC 2012: 99:1-99:9 - [c44]Sardar M. Farhad, Yousun Ko, Bernd Burgstaller, Bernhard Scholz:
Profile-guided deployment of stream programs on multicores. LCTES 2012: 79-88 - [c43]Vasvi Kakkad, Andrew E. Santosa, Bernhard Scholz:
Migrating operator placement for compositional stream graphs. MSWiM 2012: 125-134 - [c42]Surinder Kumar Jain, Chenyi Zhang
Translating flowcharts to non-deterministic languages. PEPM 2012: 155-162 - 2011
- [j9]Raymes Khoury, Bernd Burgstaller, Bernhard Scholz:
Accelerating the Execution of Matrix Languages on the Cell Broadband Engine Architecture. IEEE Trans. Parallel Distributed Syst. 22(1): 7-21 (2011) - [c41]Sardar M. Farhad, Yousun Ko, Bernd Burgstaller, Bernhard Scholz:
Orchestration by approximation: mapping stream programs onto multicore architectures. ASPLOS 2011: 357-368 - [c40]Bernhard Scholz, Sang-Min Choi, Sang-Ki Ko, Hae-Sung Eom, Yo-Sub Han:
Analyzing category correlations for recommendation system. ICUIMC 2011: 1 - [c39]Bernhard Scholz, Rainer Koschke:
Object-Based Dynamic Protocol Recovery for Multi-Threading Programs. WCRE 2011: 251-260 - [c38]Jiin Park, Jinhyung Park, Wonjoon Song, Songwook Yoon, Bernd Burgstaller, Bernhard Scholz:
Treegraph-based Instruction Scheduling for Stack-based Virtual Machines. Bytecode@ETAPS 2011: 33-45 - 2010
- [c37]Raymes Khoury, Tim Dawborn, Bulat Gafurov, Glen Pink, Edmund Tse, Quincy Tse, Khaled Almiani, Mohamed Medhat Gaber
Corona: Energy-Efficient Multi-query Processing in Wireless Sensor Networks. DASFAA (2) 2010: 416-419
2000 – 2009
- 2009
- [c36]Dietmar Ebner, Bernhard Scholz, Andreas Krall:
Progressive spill code placement. CASES 2009: 77-86 - [c35]Taekhoon Kim, Sungho Kim, Kirak Hong, Hwangho Kim, Jiin Park, Yousun Ko, Bernd Burgstaller, Bernhard Scholz:
An Efficient Mixed-Mode Execution Environment for C on Mobile Phone Platforms. CSIE (1) 2009: 320-328 - [c34]Cristina Cifuentes, Nathan Keynes, Lian Li, Bernhard Scholz:
Program analysis for bug detection using parfait: invited talk. PEPM 2009: 7-8 - [c33]Kirak Hong, Jiin Park, Taekhoon Kim, Sungho Kim, Hwangho Kim, Yousun Ko, Jongtae Park, Bernd Burgstaller, Bernhard Scholz:
TinyVM, an efficient virtual machine infrastructure for sensor networks. SenSys 2009: 399-400 - [i2]Raymes Khoury, Bernd Burgstaller, Bernhard Scholz:
Accelerating the Execution of Matrix Languages on the Cell Broadband Engine Architecture. CoRR abs/0910.2324 (2009) - 2008
- [j8]Bernhard Scholz, Bernd Burgstaller, Jingling Xue
Minimal placement of bank selection instructions for partitioned memory architectures. ACM Trans. Embed. Comput. Syst. 7(2): 12:1-12:32 (2008) - [c32]Dietmar Ebner, Florian Brandner
Generalized instruction selection using SSA-graphs. LCTES 2008: 31-40 - [c31]Bernhard Scholz, Chenyi Zhang
User-Input Dependence Analysis via Graph Reachability. SCAM 2008: 25-34 - [p1]Bernd Burgstaller, Bernhard Scholz:
Program Assemblers. Wiley Encyclopedia of Computer Science and Engineering 2008 - [i1]Cristina Cifuentes, Bernhard Scholz:
Parfait - Designing a Scalable Bug Checker. Scalable Program Analysis 2008 - 2007
- [c30]Bernhard Scholz, Johann Blieberger
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees. CC 2007: 202-217 - [c29]Zhiquan Zhou, Bernhard Scholz, Giovanni Denaro
Automated Software Testing and Analysis: Techniques, Practices and Tools. HICSS 2007: 260 - [c28]Bernhard Scholz, Mohamed Medhat Gaber, Tim Dawborn
Efficient Time Triggered Query Processing in Wireless Sensor Networks. ICESS 2007: 391-402 - [c27]S. Selvakennedy, Uwe Röhm
Event Processing Middleware for Wireless Sensor Networks. ICPP Workshops 2007: 65 - [c26]Uwe Röhm
On the Integration of Data Stream Clustering into a Query Processor for Wireless Sensor Networks. MDM 2007: 331-335 - [c25]Stefan Schäfer, Bernhard Scholz:
Optimal chain rule placement for instruction selection based on SSA graphs. SCOPES 2007: 91-100 - [c24]Quan Hoang Nguyen, Bernhard Scholz:
Computing SSA Form with Matrices. Bytecode@ETAPS 2007: 121-132 - 2006
- [c23]Bernhard Scholz, Bernd Burgstaller, Jingling Xue
Minimizing bank selection instructions for partitioned memory architecture. CASES 2006: 201-211 - [c22]Bernd Burgstaller, Bernhard Scholz, M. Anton Ertl:
An Embedded Systems Programming Environment for C. Euro-Par 2006: 1204-1216 - [c21]Bernd Burgstaller, Bernhard Scholz, Johann Blieberger
Symbolic Analysis of Imperative Programming Languages. JMLC 2006: 172-194 - [c20]Lang Hames, Bernhard Scholz:
Nearly Optimal Register Allocation with PBQP. JMLC 2006: 346-361 - [c19]R. Nigel Horspool, David J. Pereira, Bernhard Scholz:
Fast Profile-Based Partial Redundancy Elimination. JMLC 2006: 362-376 - 2004
- [c18]Bernd Burgstaller, Johann Blieberger, Bernhard Scholz:
On the Tree Width of Ada Programs. Ada-Europe 2004: 78-90 - [c17]Bernhard Scholz, R. Nigel Horspool, Jens Knoop:
Optimizing for space and time usage with speculative partial redundancy elimination. LCTES 2004: 221-230 - 2003
- [b1]Thomas Fahringer, Bernhard Scholz:
Advanced Symbolic Analysis for Compilers: New Techniques and Algorithms for Symbolic Program Analysis and Optimization. Lecture Notes in Computer Science 2628, Springer 2003, ISBN 3-540-01185-4 - [j7]Bernhard Scholz, Eduard Mehofer, R. Nigel Horspool:
Predicated Partial Redundancy Elimination Using A Cost Analysis. Parallel Process. Lett. 13(4): 525-536 (2003) - [c16]Johann Blieberger, Bernd Burgstaller, Bernhard Scholz:
Busy Wait Analysis. Ada-Europe 2003: 142-152 - [c15]Erik Eckstein, Bernhard Scholz:
Addressing Mode Selection. CGO 2003: 337-346 - [c14]Bernhard Scholz, Eduard Mehofer, R. Nigel Horspool:
Partial Redundancy Elimination with Predication Techniques. Euro-Par 2003: 242-250 - [c13]Ulrich Hirnschrott, Andreas Krall, Bernhard Scholz:
Graph Coloring vs. Optimal Register Allocation for Optimizing Compilers. JMLC 2003: 202-213 - [c12]Erik Eckstein, Oliver König, Bernhard Scholz:
Code Instruction Selection Based on SSA-Graphs. SCOPES 2003: 49-65 - 2002
- [j6]Bernhard Scholz:
Towards Virtual Electrical Breast Biopsy: Space-frequency MUSIC for Trans-Admittance Data. IEEE Trans. Medical Imaging 21(6): 588-595 (2002) - [c11]Bernhard Scholz, Eduard Mehofer:
Dataflow Frequency Analysis Based on Whole Program Paths. IEEE PACT 2002: 95-103 - [c10]Bernhard Scholz, Erik Eckstein:
Register allocation for irregular architectures. LCTES-SCOPES 2002: 139-148 - [c9]Mark Probst, Andreas Krall, Bernhard Scholz:
Register Liveness Analysis for Optimizing Dynamic Binary Translation. WCRE 2002: 35-44 - 2001
- [j5]Thomas Fahringer, Peter Blaha, A. Hössinger, J. Luitz, Eduard Mehofer, Hans Moritsch, Bernhard Scholz:
Development and performance analysis of real-world applications for distributed and parallel architectures. Concurr. Comput. Pract. Exp. 13(10): 841-868 (2001) - [c8]Eduard Mehofer, Bernhard Scholz:
A Novel Probabilistic Data Flow Framework. CC 2001: 37-51 - [c7]Eduard Mehofer, Bernhard Scholz:
Probabilistic Communication Optimizations and Parallelization for Distributed-Memory Systems. PDP 2001: 186- - 2000
- [j4]Johann Blieberger
Symbolic Cache Analysis for Real-Time Systems. Real Time Syst. 18(2/3): 181-215 (2000) - [j3]Thomas Fahringer, Bernhard Scholz:
A Unified Symbolic Evaluation Framework for Parallelizing Compilers. IEEE Trans. Parallel Distributed Syst. 11(11): 1105-1125 (2000) - [c6]Johann Blieberger
Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs. Ada-Europe 2000: 225-237 - [c5]Eduard Mehofer, Bernhard Scholz:
Probabilistic data flow system with two-edge profiling. Dynamo 2000: 65-72 - [c4]Bernhard Scholz, Johann Blieberger
Symbolic Pointer Analysis for Detecting Memory Leaks. PEPM 2000: 104-113 - [c3]Thomas Fahringer, Bernhard Scholz, Xian-He Sun:
Execution-driven performance analysis for distributed and parallel systems. Workshop on Software and Performance 2000: 204-215
1990 – 1999
- 1999
- [c2]Johann Blieberger, Bernd Burgstaller, Bernhard Scholz:
Interprocedural Symbolic Evaluation of Ada Programs with Aliases. Ada-Europe 1999: 136-145 - 1997
- [c1]Thomas Fahringer, Bernhard Scholz:
Symbolic Evaluation for Parallelizing Compilers. International Conference on Supercomputing 1997: 261-268 - 1994
- [j2]Bernhard Scholz, Günter Schwierz:
Probability-based current dipole localization from biomagnetic fields. IEEE Trans. Biomed. Eng. 41(8): 735-742 (1994) - [j1]Kensuke Sekihara, Bernhard Scholz, Herbert Bruder:
Reconstructing current distributions from biomagnetic measurements under large external noise disturbances. IEEE Trans. Medical Imaging 13(1): 144-151 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-14 22:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: