Tag #for free
47 papers:
TAP-2019-AngelisFPPP #generative #testing- Property-Based Test Case Generators for Free (EDA, FF, AP, AP, MP), pp. 186–206.
- ICFP-2018-TabareauTS #effectiveness #parametricity
- Equivalences for free: univalent parametricity for effective transport (NT, ÉT, MS), p. 29.
- ICFP-2017-AhmedJSW #parametricity #theorem
- Theorems for free for free: parametricity, with and without types (AA, DJ, JGS, PW), p. 28.
POPL-2017-AhmanHMMPPRS #monad- Dijkstra monads for free (DA, CH, KM, GM, GDP, JP, AR, NS), pp. 515–529.
- ICFP-2016-PirogW #diagrams #functional #monad #string
- String diagrams for free monads (functional pearl) (MP, NW), pp. 490–501.
- POPL-2016-GilrayL0MH #analysis #automaton #control flow
- Pushdown control-flow analysis for free (TG, SL, MDA0, MM, DVH), pp. 691–704.
ICFP-2015-BowmanA - Noninterference for free (WJB, AA), pp. 101–113.
ICML-2015-WangFS #monte carlo #privacy #probability- Privacy for Free: Posterior Sampling and Stochastic Gradient Monte Carlo (YXW, SEF, AJS), pp. 2493–2502.
ASPLOS-2015-GoiriNB #named- CoolAir: Temperature- and Variation-Aware Management for Free-Cooled Datacenters (IG, TDN, RB), pp. 253–265.
Haskell-2013-BernardyP #polymorphism- Names for free: polymorphic views of names and binders (JPB, NP), pp. 13–24.
HCI-III-2013-LinWWJ #human-computer #interface #mobile- A Mobile Brain-Computer Interface for Freely Moving Humans (YPL, YW, CSW, TPJ), pp. 448–453.
PPDP-2013-MatsudaW #approach #bidirectional #problem #runtime- Bidirectionalization for free with runtime recording: or, a light-weight approach to the view-update problem (KM, MW), pp. 297–308.
DocEng-2011-PiccoliCCOM #documentation #interactive #layout #novel- A novel physics-based interaction model for free document layout (RFBP, RC, NCC, JBSdO, IHM), pp. 153–162.
QAPL-2011-SeidelV - Improvements for Free (DS, JV), pp. 89–103.
SAS-2010-Might - Abstract Interpreters for Free (MM), pp. 407–421.
ICSE-2010-KumarSS - Can we certify systems for freedom from malware (NVNK, HJS, RKS), pp. 175–178.
TLCA-2009-Atkey #parametricity #representation #syntax #using- Syntax for Free: Representing Syntax with Binding Using Parametricity (RA), pp. 35–49.
- POPL-2009-Voigtlander #bidirectional #exclamation
- Bidirectionalization for free! (Pearl) (JV), pp. 165–176.
PDP-2009-GonzalezVTOACGS #grid- Increasing GP Computing Power for Free via Desktop GRID Computing and Virtualization (DLG, FFdV, LT, GO, LA, PAC, JJMG, KS), pp. 419–423.
ESOP-2009-Sumii #formal method #memory management- A Theory of Non-monotone Memory (Or: Contexts for free) (ES), pp. 237–251.
FLOPS-2008-ChristiansenF #named #testing- EasyCheck — Test Data for Free (JC, SF), pp. 322–336.
DATE-2008-LuMGB #algorithm #performance- An efficient algorithm for free resources management on the FPGA (YL, TM, GG, KB), pp. 1095–1098.
PLDI-2007-RenganarayananKRS - Parameterized tiled loops for free (LR, DK, SVR, MMS), pp. 405–414.
ICALP-2004-SeidlSMH - Counting in Trees for Free (HS, TS, AM, PH), pp. 1136–1149.
RTA-2003-BrandMV #exclamation #term rewriting- Environments for Term Rewriting Engines for Free! (MvdB, PEM, JJV), pp. 424–435.
- ICFP-2002-Voigtlander
- Concatenate, reverse and map vanish for free (JV), pp. 14–25.
CHI-2002-Rekimoto #framework #interactive #named- SmartSkin: an infrastructure for freehand manipulation on interactive surfaces (JR), pp. 113–120.
ICPR-v3-2002-BoyerSF #multi #recognition- Multiscale Surface Organization and Description for Free Form bject Recognition (KLB, RS, PJF), pp. 569–572.
VLDB-2001-GravanoIJKMS #approximate #database #string- Approximate String Joins in a Database (Almost) for Free (LG, PGI, HVJ, NK, SM, DS), pp. 491–500.
SIGMOD-2000-RiedelFGN #data mining #mining- Data Mining on an OLTP System (Nearly) for Free (ER, CF, GRG, DN), pp. 13–21.
- ICFP-2000-PottierC #data flow
- Information flow inference for free (FP, SC), pp. 46–57.
- PLDI-1999-MarletCB #incremental #performance #runtime
- Efficient Incremental Run-Time Specialization for Free (RM, CC, PB), pp. 281–292.
- ICPR-1998-SchutzJH #3d #algorithm #multi
- Multi-feature matching algorithm for free-form 3D surface registration (CS, TJ, HH), pp. 982–984.
- RTA-1997-Struth #on the #problem #word
- On the Word Problem for Free Lattices (GS), pp. 128–141.
- ICPR-1996-BrunnstromS #algorithm #search-based
- Genetic algorithms for free-form surface matching (KB, AJS), pp. 689–693.
TACAS-1995-KnoopSV #analysis #exclamation #explosion #parallel- Parallelism for Free: Bitvector Analyses -> No State Explosion! (JK, BS, JV), pp. 264–289.
TAPSOFT-1995-BrandV #asf+sdf #documentation #exclamation #ide #tool support- The Asf+Sdf Meta-Environment Documentation Tools for Free! (MvdB, EV), pp. 803–804.
- HCI-SHI-1993-PalanqueBD #design
- Contextual Help for Free with Formal Dialogue Design (PAP, RB, LD), pp. 615–620.
CIKM-1993-Sussna #ambiguity #network #semantics #using #word- Word Sense Disambiguation for Free-text Indexing Using a Massive Semantic Network (MS), pp. 67–74.
- PLDI-1993-BallL #branch #predict
- Branch Prediction For Free (TB, JRL), pp. 300–313.
- POPL-1992-Remy #type system
- Typing Record Concatenation for Free (DR), pp. 166–176.
- ESOP-1990-NielsonN #exclamation
- Eureka Definitions for Free! or Disagreement Points for Fold/Unford Transformations (HRN, FN), pp. 291–305.
FPCA-1989-Wadler #exclamation #theorem- Theorems for Free! (PW), pp. 347–359.
- ICALP-1988-Diekert #commutative #monad #transitive
- Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids (VD), pp. 176–187.
- ICALP-1985-Pin #finite #monad
- Finite Group Topology and p-Adic Topology for Free Monoids (JÉP), pp. 445–455.
- ASPLOS-1982-DitzelM #c #stack
- Register Allocation for Free: The C Machine Stack Cache (DRD, HRM), pp. 48–56.
- ICALP-1978-FortuneHS #complexity #equivalence
- The Complexity of Equivalence and Containment for Free Single Variable Program Schemes (SF, JEH, EMS), pp. 227–240.
