Antony L. Hosking, Patrick Th. Eugster, Cristina Videira Lopes
Proceedings of the 28th Conference on Object-Oriented Programming, Systems, Languages and Applications
OOPSLA, 2013.

@proceedings{OOPSLA-2013,
	acmid         = "2509136",
	address       = "Indianapolis, Indiana, USA",
	editor        = "Antony L. Hosking and Patrick Th. Eugster and Cristina Videira Lopes",
	isbn          = "978-1-4503-2374-1",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 28th Conference on Object-Oriented Programming, Systems, Languages and Applications}",
	year          = 2013,
}

Contents (50 items)

7 ×#named
5 ×#concurrent
5 ×#detection
5 ×#parallel
4 ×#analysis
4 ×#performance
4 ×#source code
3 ×#javascript
3 ×#multi
3 ×#optimisation

OOPSLA-2013-MeyerovichR #analysis #empirical #programming language

Empirical analysis of programming language adoption (LAM, ASR), pp. 1–18.

OOPSLA-2013-LiSWL #execution #symbolic computation

Steering symbolic execution to less traveled paths (YL, ZS, LW, XL), pp. 19–32.

OOPSLA-2013-CarbinMR #hardware #reliability #source code #verification

Verifying quantitative reliability for programs that execute on unreliable hardware (MC, SM, MCR), pp. 33–52.

OOPSLA-2013-HuangB #analysis #context-sensitive grammar #memory management #performance

Efficient context sensitivity for dynamic analyses via calling context uptrees and customized memory management (JH, MDB), pp. 53–72.

OOPSLA-2013-UrecheTO #morphism #named #parametricity #polymorphism #trade-off

Miniboxing: improving the speed to code size tradeoff in parametric polymorphism translations (VU, CT, MO), pp. 73–92.

OOPSLA-2013-ShahriyarBYM

Taking off the gloves with reference counting Immix (RS, SMB, XY, KSM), pp. 93–110.

OOPSLA-2013-Xu #named #optimisation #profiling #source code

Resurrector: a tunable object lifetime profiling technique for optimizing real-world programs (G(X), pp. 111–130.

OOPSLA-2013-NorrisD #c #c++ #concurrent #data type #named

CDSchecker: checking concurrent data structures written with C/C++ atomics (BN, BD), pp. 131–150.

OOPSLA-2013-RaychevVS #concurrent #detection #effectiveness #source code

Effective race detection for event-driven programs (VR, MTV, MS), pp. 151–166.

OOPSLA-2013-BolzDT

Storage strategies for collections in dynamically typed languages (CFB, LD, LT), pp. 167–182.

OOPSLA-2013-MillerHBO #combinator #generative #object-oriented #performance

Instant pickles: generating object-oriented pickler combinators for fast and extensible serialization (HM, PH, EB, MO), pp. 183–202.

OOPSLA-2013-SalkeldK

Interacting with dead objects (RS, GK), pp. 203–216.

OOPSLA-2013-PolitzMMWPLCK #named #python

Python: the full monty (JGP, AM, MM, SW, DP, JL, AC, SK), pp. 217–232.

OOPSLA-2013-GerakiosBS #inheritance

Forsaking inheritance: supercharged delegation in DelphJ (PG, AB, YS), pp. 233–252.

OOPSLA-2013-SmaragdakisBK #analysis #points-to #preprocessor

Set-based pre-processing for points-to analysis (YS, GB, GK), pp. 253–270.

OOPSLA-2013-TetaliLMM #named #static analysis

MrCrypt: static analysis for secure cloud computations (SDT, ML, RM, TDM), pp. 271–286.

OOPSLA-2013-DeLozierENOMZ #c++ #set #type safety

Ironclad C++: a library-augmented type-safe subset of c++ (CD, RAE, SN, PMO, MMKM, SZ), pp. 287–304.

OOPSLA-2013-RichardsHNJV #data access #flexibility #javascript

Flexible access control for javascript (GR, CH, FZN, SJ, JV), pp. 305–322.

OOPSLA-2013-FeldthausM #automation #javascript #refactoring

Semi-automatic rename refactoring for JavaScript (AF, AM), pp. 323–338.

OOPSLA-2013-RaychevSSV #refactoring #synthesis

Refactoring with synthesis (VR, MS, MS, MTV), pp. 339–354.

OOPSLA-2013-BoisSEE #concurrent #graph #multi #scalability #thread #visualisation

Bottle graphs: visualizing scalability bottlenecks in multi-threaded applications (KDB, JBS, SE, LE), pp. 355–372.

OOPSLA-2013-DEliaD #multi #profiling

Ball-Larus path profiling across multiple loop iterations (DCD, CD), pp. 373–390.

OOPSLA-2013-SharmaSCA #data-driven #equivalence

Data-driven equivalence checking (RS, ES, BRC, AA), pp. 391–406.

OOPSLA-2013-KneussKKS #recursion #synthesis

Synthesis modulo recursive functions (EK, IK, VK, PS), pp. 407–426.

OOPSLA-2013-ShiBH #optimisation #using

Code optimizations using formally verified properties (YS, BB, GH), pp. 427–442.

OOPSLA-2013-DilligDLM #abduction #generative #induction #invariant

Inductive invariant generation via abductive inference (ID, TD, BL, KLM), pp. 443–456.

OOPSLA-2013-HoppeH #comparison #developer #empirical #java

Do developers benefit from generic types?: an empirical comparison of generic and raw types in java (MH, SH), pp. 457–474.

OOPSLA-2013-DimoulasFF #contract

Option contracts (CD, RBF, MF), pp. 475–494.

OOPSLA-2013-TreichlerBA #clustering

Language support for dynamic, hierarchical data partitioning (ST, MB, AA), pp. 495–514.

OOPSLA-2013-BalatsourasS #graph

Class hierarchy complementation: soundly completing a partial type graph (GB, YS), pp. 515–532.

OOPSLA-2013-RavichandranP #distributed #multi #named

Multiverse: efficiently supporting distributed high-level speculation (KR, SP), pp. 533–552.

OOPSLA-2013-ClebschD #concurrent #garbage collection #manycore

Fully concurrent garbage collection of actors on many-core machines (SC, SD), pp. 553–570.

OOPSLA-2013-ZhaoLBCS #parallel

Isolation for nested task parallelism (JZ, RL, ZB, SC, VS), pp. 571–588.

OOPSLA-2013-TrippKS #nondeterminism #parallel

Turning nondeterminism into parallelism (OT, EK, MS), pp. 589–604.

OOPSLA-2013-ChongDKKQ #abstraction #analysis #gpu #invariant #kernel

Barrier invariants: a shared state abstraction for the analysis of data-dependent GPU kernels (NC, AFD, PHJK, JK, SQ), pp. 605–622.

OOPSLA-2013-ChoiNS #android #approximate #learning #testing #user interface

Guided GUI testing of android apps with minimal restart and approximate learning (WC, GCN, KS), pp. 623–640.

OOPSLA-2013-AzimN #android #testing

Targeted and depth-first exploration for systematic testing of android apps (TA, IN), pp. 641–660.

OOPSLA-2013-KansalSBMMZ #abstraction #energy #latency #mobile #performance

The latency, accuracy, and battery (LAB) abstraction: programmer productivity and energy efficiency for continuous mobile context sensing (AK, TSS, AJBB, KSM, TM, RZ), pp. 661–676.

OOPSLA-2013-BerganCG #parallel #source code #thread

Input-covering schedules for multithreaded programs (TB, LC, DG), pp. 677–692.

OOPSLA-2013-BondKCZSBSH #dependence #named #thread

OCTET: capturing and controlling cross-thread dependences efficiently (MDB, MK, MC, MZ, MFS, SB, AS, JH), pp. 693–712.

OOPSLA-2013-NollG #java #online #optimisation #parallel

Online feedback-directed optimizations for parallel Java code (AN, TRG), pp. 713–728.

OOPSLA-2013-HerhutHSS #javascript #parallel

River trail: a path to parallelism in JavaScript (SH, RLH, TS, JS), pp. 729–744.

OOPSLA-2013-BhattacharyaGN #detection #program analysis

Combining concern input with program analysis for bloat detection (SB, KG, MGN), pp. 745–764.

OOPSLA-2013-Zhang0K #developer #evolution #fault #injection #locality

Injecting mechanical faults to localize developer faults for evolving software (LZ, LZ, SK), pp. 765–784.

OOPSLA-2013-Deng0L #detection #performance

Efficient concurrency-bug detection across inputs (DD, WZ, SL), pp. 785–802.

OOPSLA-2013-ZhongS #api #detection #documentation #fault

Detecting API documentation errors (HZ, ZS), pp. 803–816.

OOPSLA-2013-BaoZ #detection #execution #float #on the fly #problem

On-the-fly detection of instability problems in floating-point program execution (TB, XZ), pp. 817–832.

OOPSLA-2013-CoonsMM #bound #partial order #reduction

Bounded partial-order reduction (KEC, MM, KSM), pp. 833–848.

OOPSLA-2013-MitchellS #capacity #on the fly

On-the-fly capacity planning (NM, PFS), pp. 849–866.

OOPSLA-2013-VafeiadisN #concurrent #logic

Relaxed separation logic: a program logic for C11 concurrency (VV, CN), pp. 867–884.