BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × France
1 × Ireland
1 × Italy
1 × Portugal
1 × United Kingdom
10 × USA
2 × China
2 × Germany
2 × Spain
Collaborated with:
B.Burgstaller J.Blieberger E.Eckstein E.Mehofer N.Hollingum Y.Ko C.Zhang C.Cifuentes H.Jordan P.Subotic S.M.Farhad R.Koschke A.Krall N.Allen P.Krishnan J.Dietrich S.K.Jain R.N.Horspool J.Knoop M.Probst T.Fahringer N.Keynes L.Li T.Westmann M.Raghothaman Jonathan Mendelson David Zhao M.Naik D.Ebner F.Brandner P.Wiedermann A.Kadlec N.Grech Michael Kong Anton Jurisevic Lexi Brent Y.Smaragdakis
Talks about:
program (10) analysi (10) framework (3) symbol (3) stream (3) detect (3) optim (3) flow (3) data (3) base (3)

Person: Bernhard Scholz

DBLP DBLP: Scholz:Bernhard

Contributed to:

CC 20152015
OOPSLA 20152015
PLDI 20152015
LCTES 20122012
PEPM 20122012
ASPLOS 20112011
WCRE 20112011
PEPM 20092009
LCTES 20082008
SCAM 20082008
CC 20072007
Ada-Europe 20042004
LCTES 20042004
Ada-Europe 20032003
CGO 20032003
LCTES/SCOPES 20022002
WCRE 20022002
CC 20012001
PDP 20012001
Ada-Europe 20002000
PEPM 20002000
Ada-Europe 19991999
CC 20162016
CAV (2) 20162016
OOPSLA 20182018
POPL 20202020

Wrote 27 papers:

CC-2015-AllenSK #analysis #points-to #scalability #staged
Staged Points-to Analysis for Large Code Bases (NA, BS, PK), pp. 131–150.
CC-2015-HollingumS #context-free grammar #framework #reachability #scalability #towards
Towards a Scalable Framework for Context-Free Language Reachability (NH, BS), pp. 193–211.
OOPSLA-2015-DietrichHS #analysis #java #points-to
Giga-scale exhaustive points-to analysis for Java in under a minute (JD, NH, BS), pp. 535–551.
PLDI-2015-KoBS #named
LaminarIR: compile-time queues for structured streams (YK, BB, BS), pp. 121–130.
LCTES-2012-FarhadKBS #deployment #multi #source code
Profile-guided deployment of stream programs on multicores (SMF, YK, BB, BS), pp. 79–88.
PEPM-2012-JainZS #nondeterminism
Translating flowcharts to non-deterministic languages (SKJ, CZ, BS), pp. 155–162.
ASPLOS-2011-FarhadKBS #approximate #architecture #distributed #manycore #source code
Orchestration by approximation: mapping stream programs onto multicore architectures (SMF, YK, BB, BS), pp. 357–368.
WCRE-2011-ScholzK #multi #protocol #source code #thread
Object-Based Dynamic Protocol Recovery for Multi-Threading Programs (BS, RK), pp. 251–260.
PEPM-2009-CifuentesKLS #debugging #detection #program analysis #using
Program analysis for bug detection using parfait: invited talk (CC, NK, LL, BS), pp. 7–8.
LCTES-2008-EbnerBSKWK #using
Generalized instruction selection using SSA-graphs (DE, FB, BS, AK, PW, AK), pp. 31–40.
SCAM-2008-ScholzZC #analysis #dependence #graph #reachability
User-Input Dependence Analysis via Graph Reachability (BS, CZ, CC), pp. 25–34.
CC-2007-ScholzB #analysis #composition #data flow #framework #using
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees (BS, JB), pp. 202–217.
AdaEurope-2004-BurgstallerBS #ada #on the #source code
On the Tree Width of Ada Programs (BB, JB, BS), pp. 78–90.
LCTES-2004-ScholzHK #optimisation
Optimizing for space and time usage with speculative partial redundancy elimination (BS, RNH, JK), pp. 221–230.
AdaEurope-2003-BliebergerBS #analysis
Busy Wait Analysis (JB, BB, BS), pp. 142–152.
CGO-2003-EcksteinS
Addressing Mode Selection (EE, BS), pp. 337–346.
LCTES-SCOPES-2002-ScholzE #architecture
Register allocation for irregular architectures (BS, EE), pp. 139–148.
WCRE-2002-ProbstKS #analysis #liveness #optimisation
Register Liveness Analysis for Optimizing Dynamic Binary Translation (MP, AK, BS), pp. 35–44.
CC-2001-MehoferS #data flow #framework #novel #probability
A Novel Probabilistic Data Flow Framework (EM, BS), pp. 37–51.
PDP-2001-MehoferS #communication #optimisation #parallel #probability
Probabilistic Communication Optimizations and Parallelization for Distributed-Memory Systems (EM, BS), p. 186–?.
AdaEurope-2000-BliebergerBS #ada #analysis #data flow #detection #source code
Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs (JB, BB, BS), pp. 225–237.
PEPM-2000-ScholzBF #analysis #detection #memory management #pointer
Symbolic Pointer Analysis for Detecting Memory Leaks (BS, JB, TF), pp. 104–113.
AdaEurope-1999-BliebergerBS #ada #alias #evaluation #interprocedural #source code #symbolic computation
Interprocedural Symbolic Evaluation of Ada Programs with Aliases (JB, BB, BS), pp. 136–145.
CC-2016-ScholzJSW #datalog #on the #performance #program analysis #scalability
On fast large-scale program analysis in Datalog (BS, HJ, PS, TW), pp. 196–206.
CAV-2016-JordanSS #named #synthesis
Soufflé: On Synthesis of Program Analyzers (HJ, BS, PS), pp. 422–430.
OOPSLA-2018-GrechKJBSS #contract #named
MadMax: surviving out-of-gas conditions in Ethereum smart contracts (NG, MK, AJ, LB, BS, YS), p. 27.
POPL-2020-RaghothamanMZNS #datalog #source code #synthesis
Provenance-guided synthesis of Datalog programs (MR, JM, DZ, MN, BS), p. 27.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.