Proceedings of the 34th Conference on Object-Oriented Programming, Systems, Languages and Applications
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


Proceedings of the 34th Conference on Object-Oriented Programming, Systems, Languages and Applications
OOPSLA, 2019.

OOP
no DBLP info
Scholar
Full names Links ISxN
@proceedings{OOPSLA-2019,
	journal       = "{Proceedings of the ACM on Programming Languages}",
	month         = "October",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 34th Conference on Object-Oriented Programming, Systems, Languages and Applications}",
	volume        = 3,
	year          = 2019,
}

Contents (73 items)

OOPSLA-2019-WangHZTT #named #performance #polymorphism #type system
IVT: an efficient method for sharing subtype polymorphic objects (YPW, XQH, ZXZ, WT, GT), p. 22.
OOPSLA-2019-Adams #float
Ryū revisited: printf floating point conversion (UA), p. 23.
OOPSLA-2019-BastianKN #performance #reliability #stack
Reliable and fast DWARF-based stack unwinding (TB, SK, FZN), p. 24.
OOPSLA-2019-BenavidesV0 #distributed #named #profiling
DProf: distributed profiler with strong guarantees (ZB, KV, RG0), p. 24.
OOPSLA-2019-YamazakiNIC #api #generative #lr #syntax
Generating a fluent API with syntax checking from an LR grammar (TY, TN, KI, SC), p. 24.
OOPSLA-2019-MarianoRXNQFS #algebra #library #specification #synthesis
Program synthesis with algebraic library specifications (BM, JR, SX, TN, XQ, JSF, ASL), p. 25.
OOPSLA-2019-JangdaPBG #formal method
Formal foundations of serverless computing (AJ, DP, YB, AG), p. 26.
OOPSLA-2019-Kokologiannakis #effectiveness #model checking
Effective lock handling in stateless model checking (MK, AR, VV), p. 26.
OOPSLA-2019-PanchekhaETK #composition #layout #verification #web
Modular verification of web page layout (PP, MDE, ZT, SK), p. 26.
OOPSLA-2019-ZurielFSCP #performance #set
Efficient lock-free durable sets (YZ, MF, GS, NC, EP), p. 26.
OOPSLA-2019-BaderSP0 #automation #debugging #learning #named
Getafix: learning to fix bugs automatically (JB, AS, MP, SC0), p. 27.
OOPSLA-2019-BarikSRC #optimisation #protocol
Optimization of swift protocols (RB, MS, MKR, MC), p. 27.
OOPSLA-2019-Bastani0S #probability #verification
Probabilistic verification of fairness properties via concentration (OB, XZ0, ASL), p. 27.
OOPSLA-2019-BavishiLFSS #generative #named #synthesis
AutoPandas: neural-backed generators for program synthesis (RB, CL, RF, KS, IS), p. 27.
OOPSLA-2019-GoelV #design #implementation #lazy evaluation #on the #using
On the design, implementation, and use of laziness in R (AG, JV), p. 27.
OOPSLA-2019-RaadWV #formal method #modelling #semantics #transaction
Weak persistency semantics from the ground up: formalising the persistency semantics of ARMv8 and transactional models (AR, JW, VV), p. 27.
OOPSLA-2019-SjobergSWS #named
DeepSEA: a language for certified system software (VS, YS, SCW, ZS), p. 27.
OOPSLA-2019-BenderP #concurrent #formal method #java
A formalization of Java's concurrent access modes (JB, JP), p. 28.
OOPSLA-2019-BiswasE #complexity #consistency #on the #transaction
On the complexity of checking transactional consistency (RB, CE), p. 28.
OOPSLA-2019-CambroneroR #learning #named #source code
AL: autogenerating supervised learning programs (JPC, MCR), p. 28.
OOPSLA-2019-CelikNRG #bytecode #design #implementation #java
Design, implementation, and application of GPU-based Java bytecode interpreters (, PN, CJR, MG), p. 28.
OOPSLA-2019-HenriksenBP #approach #parsing
Derivative grammars: a symbolic approach to parsing with derivatives (IH, GB, KP), p. 28.
OOPSLA-2019-KeidelE #abstract interpretation #component #reuse
Sound and reusable components for abstract interpretation (SK, SE), p. 28.
OOPSLA-2019-KrikavaMV #scala #scalability #using
Scala implicits are everywhere: a large-scale study of the use of Scala implicits in the wild (FK, HM, JV), p. 28.
OOPSLA-2019-LuanYBS0 #code search #named #recommendation
Aroma: code recommendation via structural code search (SL, DY, CB, KS, SC0), p. 28.
OOPSLA-2019-RahmaniNDJ #consistency #database #generative #named #testing
CLOTHO: directed test generation for weakly consistent database systems (KR, KN, BD, SJ), p. 28.
OOPSLA-2019-ShenZZLJW #named #refactoring
IntelliMerge: a refactoring-aware software merging technique (BS, WZ, HZ, GL, ZJ, QW), p. 28.
OOPSLA-2019-Ter-GabrielyanS #composition #logic #reachability #verification
Modular verification of heap reachability properties in separation logic (ATG, AJS, PM0), p. 28.
OOPSLA-2019-WattRP
Weakening WebAssembly (CW, AR, JPP), p. 28.
OOPSLA-2019-AbdullaAJLNS #consistency #equivalence #model checking
Optimal stateless model checking for reads-from equivalence under sequential consistency (PAA, MFA, BJ, ML, TPN, KS), p. 29.
OOPSLA-2019-ChatterjeePT #partial order #reduction
Value-centric dynamic partial order reduction (KC, AP, VT), p. 29.
OOPSLA-2019-FernandoJM #approximate #canonical #parallel #safety #source code #verification
Verifying safety and accuracy of approximate parallel programs via canonical sequentialization (VF, KJ, SM), p. 29.
OOPSLA-2019-GreenmanFD #monitoring
Complete monitors for gradual types (BG, MF, CD), p. 29.
OOPSLA-2019-Huang0CG #composition #probability #source code #termination #verification
Modular verification for almost-sure termination of probabilistic programs (MH, HF0, KC, AKG), p. 29.
OOPSLA-2019-KakiPSJ #data type
Mergeable replicated data types (GK, SP, KCS, SJ), p. 29.
OOPSLA-2019-Lampropoulos0P #testing
Coverage guided, property based testing (LL, MH0, BCP), p. 29.
OOPSLA-2019-LuX #analysis #context-sensitive grammar #performance #pointer
Precision-preserving yet fast object-sensitive pointer analysis with partial context sensitivity (JL, JX), p. 29.
OOPSLA-2019-MarcozziTDC #compilation #fuzzing #how #matter #question
Compiler fuzzing: how much does it matter? (MM, QT0, AFD, CC), p. 29.
OOPSLA-2019-MiltnerGLLRSTU #on the #on the fly #synthesis
On the fly synthesis of edit suggestions (AM, SG, VL, AL, AR, GS, AT0, AU), p. 29.
OOPSLA-2019-MogkDSM #distributed #fault tolerance #interactive #programming
A fault-tolerant programming model for distributed interactive applications (RM, JD, GS, MM), p. 29.
OOPSLA-2019-OzkanMO #distributed #random testing #testing
Trace aware random testing for distributed systems (BKO, RM, SO), p. 29.
OOPSLA-2019-PadhyeLSSV #fuzzing #named
FuzzFactory: domain-specific fuzzing with waypoints (RP, CL, KS, LS, HV), p. 29.
OOPSLA-2019-PanHXD #automation #regular expression
Automatic repair of regular expressions (RP, QH, GX, LD), p. 29.
OOPSLA-2019-RapoportL #dependent type #formal method
A path to DOT: formalizing fully path-dependent types (MR, OL), p. 29.
OOPSLA-2019-ShajiiNBBA #named
Seq: a high-performance language for bioinformatics (AS, IN, RB, BB, SPA), p. 29.
OOPSLA-2019-ShiHZML #testing
Reflection-aware static regression test selection (AS, MHT, LZ, DM, OL), p. 29.
OOPSLA-2019-SiraichiSCP #morphism #quantum
Qubit allocation as a combination of subgraph isomorphism and token swapping (MYS, VFdS, CC, FMQP), p. 29.
OOPSLA-2019-SteinNCM #refinement #static analysis
Static analysis with demand-driven value refinement (BS0, BBN, BYEC, AM), p. 29.
OOPSLA-2019-WangZS #contract #debugging #detection #nondeterminism
Detecting nondeterministic payment bugs in Ethereum smart contracts (SW, CZ, ZS), p. 29.
OOPSLA-2019-WimmerSHJWKPW #performance
Initialize once, start fast: application initialization at build time (CW, CS, PH, VJ, PW, PBK, OP, TW), p. 29.
OOPSLA-2019-AntonopoulosKL #refinement #specification
Specification and inference of trace refinement relations (TA, EK, TCL), p. 30.
OOPSLA-2019-Astrauskas0PS #composition #rust #specification #verification
Leveraging rust types for modular specification and verification (VA, PM0, FP, AJS), p. 30.
OOPSLA-2019-CairesT #programming #refinement #type safety
Refinement kinds: type-safe programming with practical type-level computation (LC, BT), p. 30.
OOPSLA-2019-ChenWFBD #learning #relational #using #verification
Relational verification using reinforcement learning (JC, JW, YF, OB, ID), p. 30.
OOPSLA-2019-EssertelWR #precise #reasoning
Precise reasoning with structured time, structured heaps, and collective operations (GME, GW, TR), p. 30.
OOPSLA-2019-GencRXB #bound #concurrent #detection #predict
Dependence-aware, unbounded sound predictive race detection (KG, JR, YX, MDB), p. 30.
OOPSLA-2019-HamzaVK #verification
System FR: formalized foundations for the stainless verifier (JH, NV, VK), p. 30.
OOPSLA-2019-KonnovKT #model checking
TLA+ model checking made symbolic (IK, JK, THT), p. 30.
OOPSLA-2019-LiWNN #debugging #detection #learning #network #representation
Improving bug detection via context-based code representation learning and attention-based neural networks (YL, SW0, TNN, SVN), p. 30.
OOPSLA-2019-Nanevski0DF #concurrent #logic #morphism #simulation #source code #specification
Specifying concurrent programs in separation logic: morphisms and simulations (AN, AB0, GAD, IF), p. 30.
OOPSLA-2019-NearDASGWSZSSS #difference #higher-order #linear #named #privacy #type system
Duet: an expressive higher-order language and linear type system for statically enforcing differential privacy (JPN, DD, CA, TS, PG, LW, NS, MZ0, NS, AS, DS), p. 30.
OOPSLA-2019-SalvaneschiKSHE #distributed #privacy #query
Language-integrated privacy-aware distributed queries (GS, MK, DS, PH, SE, MM), p. 30.
OOPSLA-2019-SergeyNJ0TH #contract #programming
Safer smart contract programming with Scilla (IS, VN, JJ, AK0, AT, KCGH), p. 30.
OOPSLA-2019-SharifSHKJSZAMA #compilation #information retrieval #named #optimisation
ApproxHPVM: a portable compiler IR for accuracy-aware optimizations (HS, PS, MH, MK, KJ, YS, NZ, VSA, SM, SVA), p. 30.
OOPSLA-2019-SongLO #automation #detection #fault #functional #logic #programming #scalability
Automatic and scalable detection of logical errors in functional programming assignments (DS, ML, HO), p. 30.
OOPSLA-2019-ToschBBJM #named #online
PlanAlyzer: assessing threats to the validity of online experiments (ET, EB, EDB, DDJ, JEBM), p. 30.
OOPSLA-2019-WangCMH #c #data type #source code
Certifying graph-manipulating C programs via localizations within data structures (SW, QC, AM, AH), p. 30.
OOPSLA-2019-WuCHS0 #approach #fault #generative #learning #precise #specification
Generating precise error specifications for C: a zero shot learning approach (BW, JPCI, YH, AS, SC0), p. 30.
OOPSLA-2019-MastrangeloHN #empirical #java #source code
Casting about in the dark: an empirical study of cast operations in Java programs (LM, MH, NN), p. 31.
OOPSLA-2019-SurbatovichJL #debugging
I/O dependent idempotence bugs in intermittent systems (MS, LJ, BL), p. 31.
OOPSLA-2019-ZhangYTWK0 #abstract interpretation #analysis #bytecode #dependence #named
BDA: practical dependence analysis for binary executables by unbiased whole-program path sampling and per-path abstract interpretation (ZZ0, WY, GT, GW, YK, XZ0), p. 31.
OOPSLA-2019-VukoticRV #fault #named
Asphalion: trustworthy shielding against Byzantine faults (IV, VR, PJEV), p. 32.
OOPSLA-2019-WeiCR #composition #metaprogramming #performance #program analysis #staged
Staged abstract interpreters: fast and modular whole-program analysis via meta-programming (GW, YC, TR), p. 32.

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.