40 papers:
SAC-2015-DabrowskiLP #compilation #concurrent #thread- Nested atomic sections with thread escape: compilation (FD, FL, TP), pp. 2099–2106.
LCTES-2015-StilkerichLES #analysis #embedded #realtime- A Practical Getaway: Applications of Escape Analysis in Embedded Real-Time Systems (IS, CL, CE, MS), p. 11.
SAC-2014-DabrowskiLP #concurrent #thread- Nested atomic sections with thread escape: a formal definition (FD, FL, TP), pp. 1585–1592.
CGO-2014-StadlerWM #analysis #java- Partial Escape Analysis and Scalar Replacement for Java (LS, TW, HM), p. 165.
RecSys-2013-TaramigkouBCAM #music- Escape the bubble: guided exploration of music preferences for serendipity and novelty (MT, EB, KC, DA, GM), pp. 335–338.
SAS-2012-Midtgaard0M #proving- A Structural Soundness Proof for Shivers’s Escape Technique — A Case for Galois Connections (JM, MDA, MM), pp. 352–369.
Onward-2012-McDirmid- Escaping the maze of twisty classes (SM), pp. 127–138.
OOPSLA-2012-KlingMCR #infinity #named #on-demand- Bolt: on-demand infinite loop escape in unmodified binaries (MK, SM, MC, MCR), pp. 431–450.
DAC-2011-MaYW #algorithm- An optimal algorithm for layer assignment of bus escape routing on PCBs (QM, EFYY, MDFW), pp. 176–181.
DATE-2011-TsaiLCKCK #bound #on the- On routing fixed escaped boundary pins for high speed boards (TYT, RJL, CYC, CYK, HMC, YK), pp. 461–466.
ECOOP-2011-CarbinMKR #detection #infinity- Detecting and Escaping Infinite Loops with Jolt (MC, SM, MK, MCR), pp. 609–633.
SCAM-2010-EdvinssonLL #analysis #parallel #reachability- Parallel Reachability and Escape Analyses (ME, JL, WL), pp. 125–134.
DAC-2009-YanW #network- A correct network flow model for escape routing (TY, MDFW), pp. 332–335.
CBSE-2008-RusselloMD #component #framework #named #policy- ESCAPE: A Component-Based Policy Framework for Sense and React Applications (GR, LM, ND), pp. 212–229.
SAS-2008-PrabhuS #analysis #array #java #pointer #using- Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSA (PP, PS), pp. 110–127.
CHI-2008-YataniPBN #gesture #named #using- Escape: a target selection technique using visually-cued gestures (KY, KP, MWB, MWN), pp. 285–294.
DAC-2007-Ozdal #clustering- Escape Routing For Dense Pin Clusters In Integrated Circuits (MMO), pp. 49–54.
ICFP-2007-Herman #functional #how- Functional pearl: the great escape or, how to jump the border without getting caught (DH), pp. 157–164.
CC-2007-CheremR #analysis #lightweight #summary- A Practical Escape and Effect Analysis for Building Lightweight Method Summaries (SC, RR), pp. 172–186.
CGO-2007-KotzmannM #analysis #optimisation #runtime- Run-Time Support for Optimizations Based on Escape Analysis (TK, HM), pp. 49–60.
DAC-2006-ShiC #array #performance- Efficient escape routing for hexagonal array of high density I/Os (RS, CKC), pp. 1003–1008.
SAC-2006-WangS #analysis- Escape analysis for synchronization removal (LW, XS), pp. 1419–1423.
HT-2005-Walker #hypermedia- Feral hypertext: when hypertext literature escapes control (JW), pp. 46–53.
VLDB-2005-DittrichSKB #named- iMeMex: Escapes from the Personal Information Jungle (JPD, MAVS, DK, LB), pp. 1306–1309.
SCAM-2005-ShiN #component #java #static analysis- Static Analysis for Computing Escapability and Mutability for Java Components (AS, GN), pp. 119–128.
ECOOP-2004-BeersSF #analysis- Efficiently Verifiable Escape Analysis (MQB, CHS, MF), pp. 75–95.
ICSM-2002-SouterP #analysis #testing- Putting Escape Analysis to Work for Software Testing (ALS, LLP), pp. 430–439.
VMCAI-2002-HillS #refinement- A Refinement of the Escape Property (PMH, FS), pp. 154–166.
PLDI-2001-VivienR #analysis #pointer- Incrementalized Pointer and Escape Analysis (FV, MCR), pp. 35–46.
PPoPP-2001-SalcianuR #analysis #parallel #pointer #source code #thread- Pointer and escape analysis for multithreaded programs (AS, MCR), pp. 12–23.
CC-2000-GayS #analysis #performance #source code #stack- Fast Escape Analysis and Stack Allocation for Object-Based Programs (DG, BS), pp. 82–93.
OOPSLA-1999-Blanchet #analysis #java #object-oriented- Escape Analysis for Object-Oriented Languages: Application to Java (BB), pp. 20–34.
OOPSLA-1999-ChoiGSSM #analysis #java- Escape Analysis for Java (JDC, MG, MJS, VCS, SPM), pp. 1–19.
OOPSLA-1999-WhaleyR #analysis #composition #java #pointer #source code- Compositional Pointer and Escape Analysis for Java Programs (JW, MCR), pp. 187–206.
POPL-1998-Blanchet #analysis #correctness #implementation #proving- Escape Analysis: Correctness Proof, Implementation and Experimental Results (BB), pp. 25–37.
POPL-1997-Deutsch #analysis #complexity #on the- On the Complexity of Escape Analysis (AD), pp. 358–371.
PLDI-1992-ParkG #analysis- Escape Analysis on Lists (YGP, BG), pp. 116–127.
WSA-1992-TangJ #analysis #control flow- Control-Flow Effects for Escape Analysis (YMT, PJ), pp. 313–321.
PEPM-1991-ParkG #analysis #optimisation- Reference Escape Analysis: Optimizing Reference Counting based on the Lifetime of References (YGP, BG), pp. 178–189.
ESOP-1990-GoldbergP #analysis #functional #higher-order #implementation #optimisation #stack- Higher Order Escape Analysis: Optimizing Stack Allocation in Functional Program Implementations (BG, YGP), pp. 152–160.