Cristina Videira Lopes, Kathleen Fisher
Proceedings of the 26th Conference on Object-Oriented Programming, Systems, Languages and Applications
OOPSLA, 2011.

@proceedings{OOPSLA-2011,
	address       = "Portland, Oregon, USA",
	editor        = "Cristina Videira Lopes and Kathleen Fisher",
	isbn          = "978-1-4503-0940-0",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 26th Conference on Object-Oriented Programming, Systems, Languages and Applications}",
	year          = 2011,
}

Contents (62 items)

13 ×#named
7 ×#programming
6 ×#parallel
5 ×#analysis
5 ×#java
3 ×#automation
3 ×#composition
3 ×#concurrent
3 ×#detection
3 ×#testing

OOPSLA-2011-Sutherland

The sequential prison (IS), pp. 1–2.

OOPSLA-2011-LiuB #automation #detection #named #precise

SHERIFF: precise detection and automatic mitigation of false sharing (TL, EDB), pp. 3–18.

OOPSLA-2011-WeeratungeZJ #using

Accentuating the positive: atomicity inference and enforcement using correct executions (DW, XZ, SJ), pp. 19–34.

OOPSLA-2011-LiSD #analysis #concurrent #detection #named

SOS: saving time in dynamic race detection with stationary analysis (DL, WSa, MBD), pp. 35–50.

OOPSLA-2011-ShachamBASVY #concurrent #testing

Testing atomicity of composed concurrent operations (OS, NGB, AA, MS, MTV, EY), pp. 51–64.

OOPSLA-2011-YessenovXS #data-driven #framework #object-oriented #synthesis

Data-driven synthesis for object-oriented frameworks (KY, ZX, ASL), pp. 65–82.

OOPSLA-2011-PuBS #algorithm #first-order #programming #synthesis

Synthesis of first-order dynamic programming algorithms (YP, RB, SS), pp. 83–98.

OOPSLA-2011-DohertyHR #analysis #matlab

Kind analysis for MATLAB (JD, LJH, SR), pp. 99–118.

OOPSLA-2011-FeldthausMMST #javascript #refactoring

Tool-supported refactoring for JavaScript (AF, TDM, AM, MS, FT), pp. 119–138.

OOPSLA-2011-KatsVV #development #testing

Integrated language definition testing: enabling test-driven language development (LCLK, RV, EV), pp. 139–154.

OOPSLA-2011-JovicAH #debugging #detection #performance

Catch me if you can: performance bug detection in the wild (MJ, AA, MH), pp. 155–170.

OOPSLA-2011-JoshiGS #injection #multi #named #programmable

PREFAIL: a programmable tool for multiple-failure injection (PJ, HSG, KS), pp. 171–188.

OOPSLA-2011-ThummalapentaXTHS #sequence #testing

Synthesizing method sequences for high-coverage testing (ST, TX, NT, JdH, ZS), pp. 189–206.

OOPSLA-2011-TrippYFS #data flow #effectiveness #named #parallel

HAWKEYE: effective discovery of dataflow impediments to parallelization (OT, GY, JF, MS), pp. 207–224.

OOPSLA-2011-Golan-GuetaBARSY #automation #using

Automatic fine-grain locking using shape properties (GGG, NGB, AA, GR, MS, EY), pp. 225–242.

OOPSLA-2011-KeLZBJD #dependence #parallel #programming #using

Safe parallel programming using dynamic dependence hints (CK, LL, CZ, TB, BJ, CD), pp. 243–258.

OOPSLA-2011-RamanYVY #named

Sprint: speculative prefetching of remote data (AR, GY, MTV, EY), pp. 259–274.

OOPSLA-2011-AftandilianGVY

Asynchronous assertions (EA, SZG, MTV, EY), pp. 275–288.

OOPSLA-2011-HoffmanME #memory management #named #programming

Ribbons: a partially shared memory programming model (KJH, HM, PE), pp. 289–306.

OOPSLA-2011-YangBFSM #matter #why

Why nothing matters: the impact of zeroing (XY, SMB, DF, JBS, KSM), pp. 307–324.

OOPSLA-2011-DarulovaK #scala

Trustworthy numerical computation in Scala (ED, VK), pp. 325–344.

OOPSLA-2011-LiT #exception #interface #java #named

JET: exception checking in the Java native interface (SL, GT), pp. 345–358.

OOPSLA-2011-DavidC #precise #specification #verification

Immutable specifications for more concise and precise verification (CD, WNC), pp. 359–374.

OOPSLA-2011-ShaliC #hybrid #partial evaluation

Hybrid partial evaluation (AS, WRC), pp. 375–390.

OOPSLA-2011-ErdwegRKO #named

SugarJ: library-based syntactic language extensibility (SE, TR, CK, KO), pp. 391–406.

OOPSLA-2011-DemetrescuFR #constraints #data flow #imperative #programming

Reactive imperative programming with dataflow constraints (CD, IF, AR), pp. 407–426.

OOPSLA-2011-BurckhardtLSYB #incremental #parallel

Two for the price of one: a model for parallel and incremental computation (SB, DL, CS, JY, TB), pp. 427–444.

OOPSLA-2011-TianZS #integration #optimisation #towards

A step towards transparent integration of input-consciousness into dynamic program optimizations (KT, EZZ, XS), pp. 445–462.

OOPSLA-2011-JoK #locality #recursion #traversal

Enhancing locality for recursive traversals of recursive structures (YJ, MK), pp. 463–482.

OOPSLA-2011-AdamsKMMCD #polynomial

Flow-sensitive type recovery in linear-log time (MDA, AWK, JM, MM, AC, RKD), pp. 483–498.

OOPSLA-2011-AcarCR #parallel #scheduling

Oracle scheduling: controlling granularity in implicitly parallel languages (UAA, AC, MR), pp. 499–518.

OOPSLA-2011-JeonGLT #named #parallel #source code

Kismet: parallel speedup estimates for serial programs (DJ, SG, CML, MBT), pp. 519–536.

OOPSLA-2011-CledatKP #programming

Efficiently speeding up sequential computation through the n-way programming model (RC, TK, SP), pp. 537–554.

OOPSLA-2011-PylaRV #parallel

Exploiting coarse-grain speculative parallelism (HKP, CJR, SV), pp. 555–574.

OOPSLA-2011-TuronR #scalability

Scalable join patterns (AJT, CVR), pp. 575–594.

OOPSLA-2011-DelawareCB #product line #theorem

Product lines of theorems (BD, WRC, DSB), pp. 595–608.

OOPSLA-2011-InaI #type system

Gradual typing for generics (LI, AI), pp. 609–624.

OOPSLA-2011-TovP #formal method

A theory of substructural types and control (JAT, RP), pp. 625–642.

OOPSLA-2011-BuseSW #evaluation #re-engineering #research

Benefits and barriers of user evaluation in software engineering research (RPLB, CS, WW), pp. 643–656.

OOPSLA-2011-SeweMSB #analysis #benchmark #design #java #metric #scala #virtual machine

Da capo con scala: design and analysis of a scala benchmark suite for the java virtual machine (AS, MM, AS, WB), pp. 657–676.

OOPSLA-2011-RichardsGEV #automation #benchmark #javascript #metric

Automated construction of JavaScript benchmarks (GR, AG, BE, JV), pp. 677–694.

OOPSLA-2011-HemelV #mobile #programming #web

Declaratively programming the mobile web with Mobl (ZH, EV), pp. 695–712.

OOPSLA-2011-SunshineNSAT

First-class state change in plaid (JS, KN, SS, JA, ÉT), pp. 713–732.

OOPSLA-2011-LorenzR #named #programming

Cedalion: a language for language oriented programming (DHL, BR), pp. 733–752.

OOPSLA-2011-HammerNCA #self #stack

Self-adjusting stack machines (MAH, GN, YC, UAA), pp. 753–772.

OOPSLA-2011-Kulkarni #compilation #jit #policy

JIT compilation policy for modern machines (PAK), pp. 773–788.

OOPSLA-2011-WuHIN #java #performance #scalability

Reducing trace selection footprint for large-scale Java applications without performance loss (PW, HH, HI, TN), pp. 789–804.

OOPSLA-2011-KastnerGREOB #compilation #metaprogramming #parsing #variability

Variability-aware parsing in the presence of lexical macros and conditional compilation (CK, PGG, TR, SE, KO, TB), pp. 805–824.

OOPSLA-2011-WurthingerABWM #aspect-oriented #evolution #java #runtime

Safe and atomic run-time code evolution for Java and its application to dynamic AOP (TW, DA, WB, CW, HM), pp. 825–844.

OOPSLA-2011-PintoDDGW #abstraction #concurrent

A simple abstraction for complex concurrent indexes (PdRP, TDY, MD, PG, MJW), pp. 845–864.

OOPSLA-2011-AndersonG #composition

Composable, nestable, pessimistic atomic statements (ZRA, DG), pp. 865–884.

OOPSLA-2011-LublinermanZBCS

Delegated isolation (RL, JZ, ZB, SC, VS), pp. 885–902.

OOPSLA-2011-HarrisAIM #composition #named

AC: composable asynchronous IO for native languages (TH, MA, RI, RM), pp. 903–920.

OOPSLA-2011-AustinDF

Virtual values for language extension (THA, TD, CF), pp. 921–938.

OOPSLA-2011-PalmerS #difference #java #metaprogramming

Backstage Java: making a difference in metaprogramming (ZP, SFS), pp. 939–958.

OOPSLA-2011-VerwaestBLN #flexibility #lightweight

Flexible object layouts: enabling lightweight language extensions by intercepting slot access (TV, CB, ML, ON), pp. 959–972.

OOPSLA-2011-AllenHKLRCS #composition #inheritance #morphism #multi #parametricity #polymorphism #type checking

Type checking modular multiple dispatch with parametric polymorphism and multiple inheritance (EEA, JH, SK, VL, SR, DC, GLSJ), pp. 973–992.

OOPSLA-2011-ImNGP #recursion #type system

A syntactic type system for recursive modules (HI, KN, JG, SP), pp. 993–1012.

OOPSLA-2011-SummersM #lightweight #type system

Freedom before commitment: a lightweight type system for object initialisation (AJS, PM), pp. 1013–1032.

OOPSLA-2011-MadhavanK #analysis #approximate #null #verification

Null dereference verification via over-approximated weakest pre-conditions analysis (RM, RK), pp. 1033–1052.

OOPSLA-2011-SridharanAPGTB #analysis #named #web

F4F: taint analysis of framework-based web applications (MS, SA, MP, SG, OT, RB), pp. 1053–1068.

OOPSLA-2011-SonMS #named #security #what

RoleCast: finding missing security checks when you do not know what checks are (SS, KSM, VS), pp. 1069–1084.