Eelco Visser, Yannis Smaragdakis
Proceedings of the 31st Conference on Object-Oriented Programming, Systems, Languages and Applications
OOPSLA, 2016.
@proceedings{OOPSLA-2016,
doi = "10.1145/2983990",
editor = "Eelco Visser and Yannis Smaragdakis",
isbn = "978-1-4503-4444-9",
publisher = "{ACM}",
title = "{Proceedings of the 31st Conference on Object-Oriented Programming, Systems, Languages and Applications}",
year = 2016,
}
Contents (52 items)
- OOPSLA-2016-PaiP #algorithm #compilation #graph #optimisation #throughput
- A compiler for throughput optimization of graph algorithms on GPUs (SP, KP), pp. 1–19.
- OOPSLA-2016-SurendranS #automation #parallel #synthesis
- Automatic parallelization of pure method calls via conditional future synthesis (RS, VS), pp. 20–38.
- OOPSLA-2016-SorensenDBGR
- Portable inter-workgroup barrier synchronisation for GPUs (TS0, AFD, MB, GG, ZR), pp. 39–58.
- OOPSLA-2016-DoeraeneS #incremental #optimisation #parallel #scala
- Parallel incremental whole-program optimizations for Scala.js (SD, TS), pp. 59–73.
- OOPSLA-2016-StefanescuPYLR #semantics #verification
- Semantics-based program verifiers for all languages (AS, DP0, SY, YL, GR), pp. 74–91.
- OOPSLA-2016-SergeyNBD #concurrent #correctness #hoare #specification
- Hoare-style specifications as correctness conditions for non-linearizable concurrent objects (IS, AN, AB0, GAD), pp. 92–110.
- OOPSLA-2016-NienhuisMS #concurrent #semantics
- An operational semantics for C/C++11 concurrency (KN, KM, PS), pp. 111–128.
- OOPSLA-2016-DanLHV #analysis #memory management #modelling #programming
- Modeling and analysis of remote memory access programming (AMD, PL0, TH, MTV), pp. 129–144.
- OOPSLA-2016-Itzhaky0SYLLC #algorithm #divide and conquer #programming #using
- Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations (SI, RS0, ASL, KY, YL, CEL, RAC), pp. 145–164.
- OOPSLA-2016-SrinivasanSR #synthesis
- Speeding up machine-code synthesis (VS, TS, TWR), pp. 165–180.
- OOPSLA-2016-PanchekhaT #automation #layout #reasoning #web
- Automated reasoning for web page layout (PP, ET), pp. 181–194.
- OOPSLA-2016-WangGS #named #spreadsheet #using
- FIDEX: filtering spreadsheet data using examples (XW0, SG, RS), pp. 195–213.
- OOPSLA-2016-MooreDFFC #contract #data access
- Extensible access control with authorization contracts (SM, CD, RBF, MF, SC), pp. 214–233.
- OOPSLA-2016-OsvaldEWAR
- Gentrification gone too far? affordable 2nd-class values for fun and (co-)effect (LO, GME, XW, LIGA, TR), pp. 234–251.
- OOPSLA-2016-DiLorenzoZMFF #domain-specific language #incremental
- Incremental forest: a DSL for efficiently managing filestores (JD, RZ, EM, KF, NF), pp. 252–271.
- OOPSLA-2016-HallerL #lightweight #named #scala
- LaCasa: lightweight affinity and object capabilities in Scala (PH, AL), pp. 272–291.
- OOPSLA-2016-RossoJ #concept #git
- Purposes, concepts, misfits, and a redesign of git (SPDR, DJ0), pp. 292–310.
- OOPSLA-2016-KimK0KPZR #automation #fault #named #programming
- Apex: automatic programming assignment error explanation (DK, YK, PL0, ILK, DMP, XZ0, GRR), pp. 311–327.
- OOPSLA-2016-HanappiHD #configuration management #convergence #reliability
- Asserting reliable convergence for configuration management scripts (OH, WH, SD), pp. 328–343.
- OOPSLA-2016-TreichlerBSSA #clustering
- Dependent partitioning (ST, MB, RS0, ES, AA), pp. 344–358.
- OOPSLA-2016-KulkarniMZN #analysis
- Accelerating program analyses by cross-program training (SK, RM, XZ, MN), pp. 359–377.
- OOPSLA-2016-SrinivasanR #algorithm #slicing
- An improved algorithm for slicing machine code (VS, TWR), pp. 378–393.
- OOPSLA-2016-PetrashkoULO #graph #morphism #parametricity #polymorphism
- Call graphs for languages with parametric polymorphism (DP, VU, OL, MO), pp. 394–409.
- OOPSLA-2016-ChandraGJSSTC #compilation #javascript #type inference
- Type inference for static compilation of JavaScript (SC, CSG, JBJ, CS, MS, FT, YIC), pp. 410–429.
- OOPSLA-2016-SamakTR #concurrent #synthesis
- Directed synthesis of failing concurrent executions (MS, OT, MKR), pp. 430–446.
- OOPSLA-2016-Huang0 #reduction
- Maximal causality reduction for TSO and PSO (SH, JH0), pp. 447–461.
- OOPSLA-2016-HuangR #concurrent #detection #precise
- Precise and maximal race detection from incomplete traces (JH0, AKR), pp. 462–476.
- OOPSLA-2016-BlumG #model checking
- Stateless model checking with data-race preemption points (BB, GAG), pp. 477–493.
- OOPSLA-2016-GollamudiC #automation #policy #security #using
- Automatic enforcement of expressive security policies using enclaves (AG, SC), pp. 494–513.
- OOPSLA-2016-ColinL #named #reliability #source code
- Chain: tasks and channels for reliable intermittent programs (AC, BL), pp. 514–530.
- OOPSLA-2016-BonettaSMB #named #parallel #programming
- GEMs: shared-memory parallel programming for Node.js (DB, LS, SM, WB), pp. 531–547.
- OOPSLA-2016-PetersKTC #approach #named
- OrcO: a concurrency-first approach to objects (AMP, DK, JAT, WRC), pp. 548–567.
- OOPSLA-2016-AnconaC #imperative #object-oriented #semantics #type system
- Semantic subtyping for imperative object-oriented languages (DA, AC), pp. 568–587.
- OOPSLA-2016-BrachthauserRO #parsing
- Parsing with first-class derivatives (JIB, TR, KO), pp. 588–606.
- OOPSLA-2016-KellMS #semantics
- The missing link: explaining ELF static linking, semantically (SK, DPM, PS), pp. 607–623.
- OOPSLA-2016-RompfA
- Type soundness for dependent object types (DOT) (TR, NA), pp. 624–641.
- OOPSLA-2016-DalozeMBM #dynamic typing #performance #thread
- Efficient and thread-safe objects for dynamically-typed languages (BD, SM, DB, HM), pp. 642–659.
- OOPSLA-2016-ChapmanHM #hybrid #transaction
- Hybrid STM/HTM for nested transactions on OpenJDK (KC, ALH, JEBM), pp. 660–676.
- OOPSLA-2016-BhandariCB #memory management #named #performance
- Makalu: fast recoverable allocation of non-volatile memory (KB, DRC, HJB), pp. 677–694.
- OOPSLA-2016-NunezGB #garbage collection
- Prioritized garbage collection: explicit GC support for software caches (DN, SZG, EDB), pp. 695–710.
- OOPSLA-2016-SteimannHU #attribute grammar #constraints #source code #using
- Computing repair alternatives for malformed programs using constraint attribute grammars (FS, JH, BU), pp. 711–730.
- OOPSLA-2016-RaychevBV #probability
- Probabilistic model for code with decision trees (VR, PB, MTV), pp. 731–747.
- OOPSLA-2016-BarmanCBG #automation #named #web
- Ringer: web automation by demonstration (SB, SC, RB, SG), pp. 748–764.
- OOPSLA-2016-WeitzWTEKT #protocol #scalability #smt #verification
- Scalable verification of border gateway protocol configurations with an SMT solver (KW, DW, ET, MDE, AK, ZT), pp. 765–780.
- OOPSLA-2016-Loncaric0SS #fault #framework #type inference
- A practical framework for type inference error explanation (CL, SC0, CS, MS), pp. 781–799.
- OOPSLA-2016-Kell #fault
- Dynamically diagnosing type errors in unsafe code (SK), pp. 800–819.
- OOPSLA-2016-LongLR #programming
- First-class effect reflection for effect-guided programming (YL, YDL, HR), pp. 820–837.
- OOPSLA-2016-AminT #java #null #pointer #scala #type system
- Java and scala's type systems are unsound: the existential crisis of null pointers (NA, RT), pp. 838–848.
- OOPSLA-2016-SunLS #compilation #debugging
- Finding compiler bugs via live code mutation (CS, VL, ZS), pp. 849–863.
- OOPSLA-2016-ShanAN #android #fault
- Finding resume and restart errors in Android applications (ZS, TA, IN), pp. 864–880.
- OOPSLA-2016-ZuoFKXL #abstraction #automation #debugging #refinement #statistics
- Low-overhead and fully automated statistical debugging with abstraction refinement (ZZ0, LF, SCK, G(X, SL), pp. 881–896.
- OOPSLA-2016-BavishiPR #debugging #precise
- To be precise: regression aware debugging (RB, AP, SR), pp. 897–915.