Gary T. Leavens, Matthew B. Dwyer
Proceedings of the 27th Conference on Object-Oriented Programming, Systems, Languages and Applications
OOPSLA, 2012.
@proceedings{OOPSLA-2012,
	acmid         = "2384616",
	address       = "Tucson, Arizona, USA",
	editor        = "Gary T. Leavens and Matthew B. Dwyer",
	isbn          = "978-1-4503-1561-6",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 27th Conference on Object-Oriented Programming, Systems, Languages and Applications}",
	year          = 2012,
}
Contents (59 items)
- OOPSLA-2012-SuenagaFI #concurrent #type system
 - Type-based safe resource deallocation for shared-memory concurrency (KS, RF, AI), pp. 1–20.
 - OOPSLA-2012-GordonPPBD #parallel
 - Uniqueness and reference immutability for safe parallelism (CSG, MJP, JP, AB, JD), pp. 21–40.
 - OOPSLA-2012-SreeramP #compilation #transaction
 - Safe compiler-driven transaction checkpointing and recovery (JS, SP), pp. 41–56.
 - OOPSLA-2012-MullerC #concurrent #towards
 - Towards a practical secure concurrent language (SM, SC), pp. 57–74.
 - OOPSLA-2012-ParizekL #abstraction #java #source code
 - Predicate abstraction of Java programs with collections (PP, OL), pp. 75–94.
 - OOPSLA-2012-SchillerE #specification
 - Reducing the barriers to writing verified specifications (TWS, MDE), pp. 95–112.
 - OOPSLA-2012-BettsCDQT #gpu #kernel #named #verification
 - GPUVerify: a verifier for GPU kernels (AB, NC, AFD, SQ, PT), pp. 113–132.
 - OOPSLA-2012-LogozzoB #automation #composition #program repair
 - Modular and verified automatic program repair (FL, TB), pp. 133–146.
 - OOPSLA-2012-KulkarniC #compilation #machine learning #optimisation #problem #using
 - Mitigating the compiler optimization phase-ordering problem using machine learning (SK, JC), pp. 147–162.
 - OOPSLA-2012-St-AmourTF #communication #optimisation
 - Optimization coaching: optimizers learn to communicate with programmers (VSA, STH, MF), pp. 163–178.
 - OOPSLA-2012-InoueHWN #adaptation #compilation #java #jit #multi
 - Adaptive multi-level compilation in a trace-based Java JIT compiler (HI, HH, PW, TN), pp. 179–194.
 - OOPSLA-2012-CastanosEINNOW #compilation #jit #on the #scripting language #static typing
 - On the benefits and pitfalls of extending a statically typed language JIT compiler for dynamic scripting languages (JGC, DE, KI, PN, TN, TO, PW), pp. 195–212.
 - OOPSLA-2012-CousotCLB #abstract interpretation #contract #framework #refactoring
 - An abstract interpretation framework for refactoring with application to extract methods with contracts (PC, RC, FL, MB), pp. 213–232.
 - OOPSLA-2012-Zhang0LZMY #android #java #on-demand #refactoring
 - Refactoring android Java code for on-demand computation offloading (YZ, GH, XL, WZ, HM, SY), pp. 233–248.
 - OOPSLA-2012-HaydenSDHF #c #named #performance
 - Kitsune: efficient, general-purpose dynamic software updating for C (CMH, EKS, MD, MH, JSF), pp. 249–264.
 - OOPSLA-2012-MagillHSM #automation
 - Automating object transformations for dynamic software updating (SM, MH, SS, KSM), pp. 265–280.
 - OOPSLA-2012-SartorE #concurrent #hardware #java #manycore #performance #thread
 - Exploring multi-threaded Java application performance on multicore hardware (JBS, LE), pp. 281–296.
 - OOPSLA-2012-KumarFBGT
 - Work-stealing without the baggage (VK, DF, SMB, DG, OT), pp. 297–314.
 - OOPSLA-2012-BocqD #monad #named #network #process #streaming #using #virtual machine
 - Molecule: using monadic and streaming I/O to compose process networks on the JVM (SB, KD), pp. 315–334.
 - OOPSLA-2012-KaliberaMJV #approach #black box #comprehension #concurrent
 - A black-box approach to understanding concurrency in DaCapo (TK, MM, REJ, JV), pp. 335–354.
 - OOPSLA-2012-JoK #automation #locality #traversal
 - Automatically enhancing locality for tree traversals with traversal splicing (YJ, MK), pp. 355–374.
 - OOPSLA-2012-PrountzosMP #concurrent #graph #named #source code
 - Elixir: a system for synthesizing concurrent graph programs (DP, RM, KP), pp. 375–394.
 - OOPSLA-2012-LiuSLG #algorithm #distributed #performance
 - From clarity to efficiency for distributed algorithms (YAL, SDS, BL, MG), pp. 395–410.
 - OOPSLA-2012-LeinoM
 - Program extrapolation with jennisys (KRML, AM), pp. 411–430.
 - OOPSLA-2012-KlingMCR #infinity #named #on-demand
 - Bolt: on-demand infinite loop escape in unmodified binaries (MK, SM, MC, MCR), pp. 431–450.
 - OOPSLA-2012-HuangZ #agile #concurrent #debugging #execution #named #reduction
 - LEAN: simplifying concurrency bug reproduction via replay-supported execution reduction (JH, CZ), pp. 451–466.
 - OOPSLA-2012-Effinger-DeanLCGB #concurrent #detection #named
 - IFRit: interference-free regions for dynamic data-race detection (LED, BL, LC, DG, HJB), pp. 467–484.
 - OOPSLA-2012-YuNPP #named #parallel #source code #testing #thread
 - Maple: a coverage-driven testing tool for multithreaded programs (JY, SN, CP, GP), pp. 485–502.
 - OOPSLA-2012-DubrauH #matlab
 - Taming MATLAB (AWD, LJH), pp. 503–522.
 - OOPSLA-2012-SiddiquiK #analysis #execution #scalability #symbolic computation #using
 - Scaling symbolic execution using ranged analysis (JHS, SK), pp. 523–536.
 - OOPSLA-2012-Tobin-HochstadtH #contract #execution #higher-order #symbolic computation
 - Higher-order symbolic execution via contracts (STH, DVH), pp. 537–554.
 - OOPSLA-2012-RosuS #logic #reachability #using
 - Checking reachability using matching logic (GR, AS), pp. 555–574.
 - OOPSLA-2012-ZhaoPYQWGOPMET #compilation #php
 - The HipHop compiler for PHP (HZ, IP, MY, XQ, MW, QG, GO, AP, SM, JE, ST), pp. 575–586.
 - OOPSLA-2012-ChughHJ #dependent type #javascript
 - Dependent types for JavaScript (RC, DH, RJ), pp. 587–606.
 - OOPSLA-2012-MeawadRMV #automation #exclamation #javascript #source code
 - Eval begone!: semi-automated removal of eval from javascript programs (FM, GR, FM, JV), pp. 607–620.
 - OOPSLA-2012-KangR #javascript #specification
 - Formal specification of a JavaScript module system (SK, SR), pp. 621–638.
 - OOPSLA-2012-BarowyCBM #framework #named #platform
 - AutoMan: a platform for integrating human-based and digital computation (DWB, CC, EDB, AM), pp. 639–654.
 - OOPSLA-2012-DattaSS #collaboration #developer #framework #platform
 - Talk versus work: characteristics of developer collaboration on the jazz platform (SD, RS, BS), pp. 655–668.
 - OOPSLA-2012-MusluBHEN #analysis #development #ide #recommendation
 - Speculative analysis of integrated development environment recommendations (KM, YB, RH, MDE, DN), pp. 669–682.
 - OOPSLA-2012-MayerHRTS #empirical #static typing #type system #usability
 - An empirical study of the influence of static type systems on the usability of undocumented software (CM, SH, RR, ÉT, AS), pp. 683–702.
 - OOPSLA-2012-TsengT #thread
 - Software data-triggered threads (HWT, DMT), pp. 703–716.
 - OOPSLA-2012-Anderson #fine-grained #parallel #policy #resource management #using
 - Efficiently combining parallel software using fine-grained, language-level, hierarchical resource management policies (ZRA), pp. 717–736.
 - OOPSLA-2012-HuangZ12a #concurrent #execution #source code
 - Execution privatization for scheduler-oblivious concurrent programs (JH, CZ), pp. 737–752.
 - OOPSLA-2012-ImamS #parallel
 - Integrating task parallelism with actors (SMI, VS), pp. 753–772.
 - OOPSLA-2012-KastnerOE #variability
 - A variability-aware module system (CK, KO, SE), pp. 773–792.
 - OOPSLA-2012-TakikawaSDTF #type system
 - Gradual typing for first-class classes (AT, TSS, CD, STH, MF), pp. 793–810.
 - OOPSLA-2012-TardieuNPS
 - Constrained kinds (OT, NN, IP, VAS), pp. 811–830.
 - OOPSLA-2012-CohenZSL #energy
 - Energy types (MC, HSZ, EES, YDL), pp. 831–850.
 - OOPSLA-2012-WuZSJGS #behaviour #correlation #predict
 - Exploiting inter-sequence correlations for program behavior prediction (BW, ZZ, XS, YJ, YG, RS), pp. 851–866.
 - OOPSLA-2012-AusielloDFF #profiling
 - k-Calling context profiling (GA, CD, IF, DF), pp. 867–878.
 - OOPSLA-2012-HuangMDE
 - Reim & ReImInfer: checking and inference of reference immutability and method purity (WH, AM, WD, MDE), pp. 879–896.
 - OOPSLA-2012-BaoZZ #nondeterminism #program analysis
 - White box sampling in uncertain data processing enabled by program analysis (TB, YZ, XZ), pp. 897–914.
 - OOPSLA-2012-LucasER #detection #distributed #problem #sequence
 - Detecting problematic message sequences and frequencies in distributed systems (CL, SGE, DSR), pp. 915–926.
 - OOPSLA-2012-GuBSS #debugging #reuse
 - Reusing debugging knowledge via trace-based bug search (ZG, ETB, DS, ZS), pp. 927–942.
 - OOPSLA-2012-StricklandTFF #runtime
 - Chaperones and impersonators: run-time support for reasonable interposition (TSS, STH, RBF, MF), pp. 943–962.
 - OOPSLA-2012-SolodkyyRS #c++ #performance
 - Open and efficient type switch for C++ (YS, GDR, BS), pp. 963–982.
 - OOPSLA-2012-TamayoABS #behaviour #comprehension #database
 - Understanding the behavior of database operations under program control (JMT, AA, NGB, MS), pp. 983–996.
 - OOPSLA-2012-MishneSY #code search #semantics #source code
 - Typestate-based semantic code search over partial programs (AM, SS, EY), pp. 997–1016.
 - OOPSLA-2012-Xu #data type #reuse
 - Finding reusable data structures (G(X), pp. 1017–1034.
 
9 ×#named
8 ×#concurrent
6 ×#source code
5 ×#compilation
5 ×#using
4 ×#automation
4 ×#execution
4 ×#java
4 ×#parallel
4 ×#performance
8 ×#concurrent
6 ×#source code
5 ×#compilation
5 ×#using
4 ×#automation
4 ×#execution
4 ×#java
4 ×#parallel
4 ×#performance











