Stem heap$ (all stems)

162 papers:

CASE-2015-Houssin #problem

An exension of the heap of pieces model for the Cyclic Jobshop Problem (LH), pp. 1182–1187.

ESOP-2015-DavidKL15a #reasoning #safety #source code #termination

Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs (CD, DK, ML), pp. 661–684.

SAS-2015-GargR #integer #linear #programming

Synthesizing Heap Manipulations via Integer Linear Programming (AG, SR), pp. 109–127.

ICALP-v1-2015-HansenKTZ

Hollow Heaps (TDH, HK, RET, UZ), pp. 689–700.

ICALP-v1-2015-LiP #fibonacci

Replacing Mark Bits with Randomness in Fibonacci Heaps (JL, JP), pp. 886–897.

ESEC-FSE-2015-BraioneDP #execution #source code #symbolic computation

Symbolic execution of programs with heap inputs (PB, GD, MP), pp. 602–613.

ISMM-2015-CameronSV #multi

The judgment of forseti: economic utility for dynamic heap sizing of multiple runtimes (CC, JS, DV), pp. 143–156.

VMCAI-2015-Ferrara0N #automation

Automatic Inference of Heap Properties Exploiting Value Domains (PF, PM, MN), pp. 393–411.

ESOP-2014-BrainDKS #generative #proving #source code

Model and Proof Generation for Heap-Manipulating Programs (MB, CD, DK, PS), pp. 432–452.

TACAS-2014-PiskacWZ #named #specification #verification

GRASShopper — Complete Heap Verification with Mixed Specifications (RP, TW, DZ), pp. 124–139.

ICALP-v1-2014-IaconoO #why

Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not (JI, ÖÖ), pp. 637–649.

POPL-2014-ItzhakyBILNS #composition #effectiveness #reasoning

Modular reasoning about heap paths via effectively propositional formulas (SI, AB, NI, OL, AN, MS), pp. 385–396.

HPCA-2014-KannanGS #cost analysis #persistent

Reducing the cost of persistence for nonvolatile heaps in end user devices (SK, AG, KS), pp. 512–523.

ISMM-2014-BaconCS #configuration management #garbage collection #hardware #parallel #realtime

Parallel real-time garbage collection of multiple heaps in reconfigurable hardware (DFB, PC, SS), pp. 117–127.

ISMM-2014-LiDL #liveness #modelling #using

Modeling heap data growth using average liveness (PL, CD, HL), pp. 71–82.

VMCAI-2014-Chang #reachability

Refuting Heap Reachability (BYEC), pp. 137–141.

VMCAI-2014-Ferrara #abstract interpretation #analysis

Generic Combination of Heap and Value Analyses in Abstract Interpretation (PF), pp. 302–321.

DATE-2013-BaiS #architecture #automation #data transformation #manycore #memory management #performance

Automatic and efficient heap data management for limited local memory multicore architectures (KB, AS), pp. 593–598.

ESOP-2013-HofmannR #analysis #automation #type inference

Automatic Type Inference for Amortised Heap-Space Analysis (MH, DR), pp. 593–613.

PASTE-2013-VitasekBH #java #named

ShadowData: shadowing heap objects in Java (MV, WB, MH), pp. 17–24.

PLDI-2013-BlackshearCS #named #precise #reachability

Thresher: precise refutations for heap reachability (SB, BYEC, MS), pp. 275–286.

SAS-2013-Roy #source code

From Concrete Examples to Heap Manipulating Programs (SR), pp. 126–149.

ECOOP-2013-ZhuL #composition #linear #programming

Heap Decomposition Inference with Linear Programming (HSZ, YDL), pp. 104–128.

CGO-2013-SuiLX #adaptation #compilation #optimisation

Query-directed adaptive heap cloning for optimizing compilers (YS, YL, JX), p. 11.

ISMM-2013-AignerK #benchmark #metric #named #towards

ACDC: towards a universal mutator for benchmarking heap management systems (MA, CMK), pp. 75–84.

ISMM-2013-WhiteSAJ

Control theory for principled heap sizing (DRW, JS, JMA, REJ), pp. 27–38.

ICLP-J-2013-AlbertBGRS #generative #testing

A CLP heap solver for test case generation (EA, MJGdlB, MGZ, JMR, PJS), pp. 721–735.

ICST-2013-HillTB #bound #c++ #named

GrowthTracker: Diagnosing Unbounded Heap Growth in C++ Software (EH, DJT, SB), pp. 134–143.

ISSTA-2013-BarrBM

Collecting a heap of shapes (ETB, CB, MM), pp. 123–133.

FASE-2012-AlbertBGHR #source code

Verified Resource Guarantees for Heap Manipulating Programs (EA, RB, SG, RH, GRD), pp. 130–145.

SAS-2012-Distefano

A Voyage to the Deep-Heap (DD), p. 3.

SAS-2012-MadhavanRV #analysis #composition #higher-order #source code

Modular Heap Analysis for Higher-Order Programs (RM, GR, KV), pp. 370–387.

STOC-2012-BrodalLT #fibonacci #strict

Strict fibonacci heaps (GSB, GL, RET), pp. 1177–1184.

ICFP-2012-StewartBA #proving #theorem proving

Verified heap theorem prover by paramodulation (GS, LB, AWA), pp. 3–14.

CC-2012-MarronLB #analysis #paradigm #programming

Programming Paradigm Driven Heap Analysis (MM, OL, AB), pp. 41–60.

CGO-2012-MatosevicA #analysis #bottom-up #data access #performance #summary

Efficient bottom-up heap analysis for symbolic path-based data access summaries (IM, TSA), pp. 252–263.

ASE-2011-AnandH #execution #java #source code #symbolic computation

Heap cloning: Enabling dynamic symbolic execution of java programs (SA, MJH), pp. 33–42.

ICSM-2011-MihaliczaPG #c++ #profiling

Type-preserving heap profiler for C++ (JM, ZP, AG), pp. 457–466.

PLDI-2011-DilligDAS #composition #precise #source code #summary

Precise and compact modular procedure summaries for heap manipulating programs (ID, TD, AA, MS), pp. 567–577.

PLDI-2011-PerezR #calculus #logic #proving #theorem proving

Separation logic + superposition calculus = heap theorem prover (JANP, AR), pp. 556–566.

PLDI-2011-ZengWL #concurrent #data type #monitoring #named #using

Cruiser: concurrent heap buffer overflow monitoring using lock-free data structures (QZ, DW, PL), pp. 367–377.

SAS-2011-GorogiannisKO #abduction #abstraction #complexity

The Complexity of Abduction for Separated Heap Abstractions (NG, MIK, PWO), pp. 25–42.

SAS-2011-MadhusudanQ #performance #using

Efficient Decision Procedures for Heaps Using STRAND (PM, XQ), pp. 43–59.

FM-2011-GherghinaDQC #source code #specification #verification

Structured Specifications for Better Verification of Heap-Manipulating Programs (CG, CD, SQ, WNC), pp. 386–401.

POPL-2011-MadhusudanPQ #decidability #logic

Decidable logics combining heap structures and data (PM, GP, XQ), pp. 611–622.

ICSE-2011-Malik #analysis #graph #using

Dynamic shape analysis of program heap using graph spectra (MZM), pp. 952–955.

ASPLOS-2011-CoburnCAGGJS #named #performance #persistent

NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories (JC, AMC, AA, LMG, RKG, RJ, SS), pp. 105–118.

ISMM-2011-MarlowJ #garbage collection #manycore

Multicore garbage collection with local heaps (SM, SLPJ), pp. 21–32.

ISMM-2011-Tarau #memory management #multi #prolog

Integrated symbol table, engine and heap memory management in multi-engine prolog (PT), pp. 129–138.

CADE-2011-BohmeM #automation #challenge #data type #proving

Heaps and Data Structures: A Challenge for Automated Provers (SB, MM), pp. 177–191.

CAV-2011-HabermehlHRSV #automaton #verification

Forest Automata for Verification of Heap Manipulation (PH, LH, AR, JS, TV), pp. 424–440.

FASE-2010-BeyerHTZ #analysis #refinement

Shape Refinement through Explicit Heap Analysis (DB, TAH, GT, DZ), pp. 263–277.

TACAS-2010-VillardLC

Tracking Heaps That Hop with Heap-Hop (JV, ÉL, CC), pp. 275–279.

SAS-2010-McCloskeyRS #array #invariant

Statically Inferring Complex Heap, Array, and Numeric Invariants (BM, TWR, MS), pp. 71–99.

ILC-2010-UgawaIY #garbage collection #incremental

Starvation-free heap size for replication-based incremental compacting garbage collection (TU, HI, TY), pp. 43–52.

SOFTVIS-2010-AftandilianKGRSG #comprehension #debugging #interactive #named #visualisation

Heapviz: interactive heap visualization for program understanding and debugging (EA, SK, CG, NPR, SLS, SZG), pp. 53–62.

SOFTVIS-2010-MyersD #abstraction #design #runtime

A map of the heap: revealing design abstractions in runtime structures (CM, DJD), pp. 63–72.

KDD-2010-MaxwellBR #graph #memory management #mining #using

Diagnosing memory leaks using graph mining on heap dumps (EKM, GB, NR), pp. 115–124.

OOPSLA-2010-DilligDA #abstraction #axiom #invariant #memory management

Symbolic heap abstraction with demand-driven axiomatization of memory invariants (ID, TD, AA), pp. 397–410.

OOPSLA-2010-LiangTNS #abstraction #evaluation #precise

A dynamic evaluation of the precision of static heap abstractions (PL, OT, MN, MS), pp. 411–427.

OOPSLA-2010-ReichenbachISAG #garbage collection #what

What can the GC compute efficiently?: a language for heap assertions at GC time (CR, NI, YS, EA, SZG), pp. 256–269.

POPL-2010-MagillTLT #abstraction #automation #source code

Automatic numeric abstractions for heap-manipulating programs (SM, MHT, PL, YKT), pp. 211–222.

POPL-2010-NanevskiVB #source code #verification

Structuring the verification of heap-manipulating programs (AN, VV, JB), pp. 261–274.

ICSE-2010-Reiss #java #visualisation

Visualizing the Java heap (SPR), pp. 251–254.

CGO-2010-WangWY #layout #memory management #on the

On improving heap memory layout by dynamic pool allocation (ZW, CW, PCY), pp. 92–100.

ISMM-2010-VechevYY #named #parallel

PHALANX: parallel checking of expressive heap assertions (MTV, EY, GY), pp. 41–50.

ASE-2009-VakilianDBOAJ #summary

Inferring Method Effect Summaries for Nested Heap Regions (MV, DD, RLBJ, JO, VSA, REJ), pp. 421–432.

ICSM-2009-Reiss09a #java #visualisation

Visualizing the Java heap demonstration proposal (SPR), pp. 389–390.

PLDI-2009-AftandilianG #garbage collection #using

GC assertions: using the garbage collector to check heap properties (EA, SZG), pp. 235–244.

ICALP-v2-2009-ScheidelerS #distributed

A Distributed and Oblivious Heap (CS, SS), pp. 571–582.

VISSOFT-2009-Reiss #detection #java #memory management #problem #visualisation

Visualizing the Java heap to detect memory problems (SPR), pp. 73–80.

ECOOP-2009-MitchellSS #scalability

Making Sense of Large Heaps (NM, ES, GS), pp. 77–97.

ISMM-2009-AlbertGG #analysis #garbage collection

Live heap space analysis for languages with garbage collection (EA, SG, MGZ), pp. 129–138.

ISMM-2009-MarronKH #identification

Identification of logically related heap regions (MM, DK, MVH), pp. 89–98.

ISMM-2009-UnnikrishnanS #analysis #functional #parametricity #source code

Parametric heap usage analysis for functional programs (LU, SDS), pp. 139–148.

CSL-2009-HofmannR #analysis #performance

Efficient Type-Checking for Amortised Heap-Space Analysis (MH, DR), pp. 317–331.

PEPM-2008-HageH #lazy evaluation

Heap recycling for lazy languages (JH, SH), pp. 189–197.

SAS-2008-ManevichLSRB #analysis #composition #concurrent

Heap Decomposition for Concurrent Shape Analysis (RM, TLA, MS, GR, JB), pp. 363–377.

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.

SEFM-2008-PhamTTC #algorithm #bound #java #memory management #performance

A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets (THP, AHT, NTT, WNC), pp. 259–267.

CC-2008-MarronHKS #analysis #graph #modelling #performance

Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models (MM, MVH, DK, DS), pp. 245–259.

ISMM-2008-BrabermanFGY #memory management #parametricity #predict #requirements

Parametric prediction of heap memory requirements (VAB, FJF, DG, SY), pp. 141–150.

ISMM-2008-MarlowHJJ #garbage collection #parallel

Parallel generational-copying garbage collection with a block-structured heap (SM, TH, RPJ, SLPJ), pp. 11–20.

ISMM-2008-McIlroyDS #memory management #performance

Efficient dynamic heap allocation of scratch-pad memory (RM, PD, JS), pp. 31–40.

ISMM-2008-SartorHM

No bit left behind: the limits of heap data compression (JBS, MH, KSM), pp. 111–120.

CAV-2008-AbdullaBCHR #abstraction #memory management #source code

Monotonic Abstraction for Programs with Dynamic Memory Heaps (PAA, AB, JC, FH, AR), pp. 341–354.

CAV-2008-PodelskiRW

Heap Assumptions on Demand (AP, AR, TW), pp. 314–327.

ISSTA-2008-XuR #analysis #points-to #scalability

Merging equivalent contexts for scalable heap-cloning-based context-sensitive points-to analysis (G(X, AR), pp. 225–236.

PASTE-2007-MarronSHK #analysis #library

Heap analysis in the presence of collection libraries (MM, DS, MVH, DK), pp. 31–36.

PASTE-2007-QianXM #alias #analysis #data flow #dependence

Interstatement must aliases for data dependence analysis of heap locations (JQ, BX, HM), pp. 17–24.

PLDI-2007-LattnerLA #analysis #points-to

Making context-sensitive points-to analysis with heap cloning practical for the real world (CL, AL, VSA), pp. 278–289.

POPL-2007-PolishchukLS #comprehension #debugging #type inference

Dynamic heap type inference for program understanding and debugging (MP, BL, CWS), pp. 39–46.

CC-2007-JeonSH #data access #layout #using

Layout Transformations for Heap Objects Using Static Access Patterns (JJ, KS, HH), pp. 187–201.

CGO-2007-GrzegorczykSKW #feedback #using

Isla Vista Heap Sizing: Using Feedback to Avoid Paging (CG, SS, CK, RW), pp. 325–340.

ISMM-2007-AlbertGG #analysis #bytecode #java

Heap space analysis for java bytecode (EA, SG, MGZ), pp. 105–116.

CAV-2007-GulwaniT #abstract domain #bytecode #low level

An Abstract Domain for Analyzing Heap-Manipulating Low-Level Software (SG, AT), pp. 379–392.

VMCAI-2007-BalabanPZ #analysis

Shape Analysis of Single-Parent Heaps (IB, AP, LDZ), pp. 91–105.

VMCAI-2007-RakamaricBH #data type #source code #verification

An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures (ZR, JDB, AJH), pp. 106–121.

ASE-2006-DengLR #bound #execution #named #symbolic computation

Bogor/Kiasan: A k-bounded Symbolic Execution for Checking Strong Heap Properties of Open Systems (XD, JL, R), pp. 157–166.

ESOP-2006-HofmannJ #analysis #type system

Type-Based Amortised Heap-Space Analysis (MH, SJ), pp. 22–37.

SAS-2006-BalakrishnanR

Recency-Abstraction for Heap-Allocated Storage (GB, TWR), pp. 221–239.

SAS-2006-GotsmanBC #abstraction #analysis #interprocedural

Interprocedural Shape Analysis with Separated Heap Abstractions (AG, JB, BC), pp. 240–260.

SEFM-2006-Khedker #perspective #source code #static analysis

Static Analysis of Programs: A Heap Centric View (UPK), p. 261.

GPCE-2006-PerryJW #contract #linear #logic

Expressing heap-shape contracts in linear logic (FP, LJ, DW), pp. 101–110.

ASPLOS-2006-ChilimbiG #debugging #detection #identification #named #using

HeapMD: identifying heap-based bugs using anomaly detection (TMC, VG), pp. 219–228.

ASPLOS-2006-KharbutliJSVP

Comprehensively and efficiently protecting the heap (MK, XJ, YS, GV, MP), pp. 207–218.

LCTES-2006-SpivakT #memory management #persistent #transaction

Storing a persistent transactional object heap on flash memory (MS, ST), pp. 22–33.

CAV-2006-BerdineCDO #automation #proving #source code #termination

Automatic Termination Proofs for Programs with Shape-Shifting Heaps (JB, BC, DD, PWO), pp. 386–400.

VMCAI-2006-BinghamR #abstraction #logic #source code

A Logic and Decision Procedure for Predicate Abstraction of Heap-Manipulating Programs (JDB, ZR), pp. 207–221.

PLDI-2005-LattnerA #automation #data type #layout #performance

Automatic pool allocation: improving performance by controlling data structure layout in the heap (CL, VSA), pp. 129–142.

SAS-2005-PodelskiW

Boolean Heaps (AP, TW), pp. 268–283.

OOPSLA-2005-ShankarSBS #analysis #runtime

Runtime specialization with optimistic heap analysis (AS, SSS, RB, JES), pp. 327–343.

POPL-2005-RinetzkyBRSW #abstraction #semantics

A semantics for procedure local heaps and its abstractions (NR, JB, TWR, SS, RW), pp. 296–309.

CC-2005-ConditN #independence #slicing

Data Slicing: Separating the Heap into Independent Regions (JC, GCN), pp. 172–187.

LCTES-2005-DefoeCC #bound

Upper bound for defragmenting buddy heaps (DCD, SRC, RC), pp. 222–229.

VMCAI-2005-ChangL #abstract interpretation

Abstract Interpretation with Alien Expressions and Heap Structures (BYEC, KRML), pp. 147–163.

PASTE-2004-NystromKH #analysis #pointer

Importance of heap specialization in pointer analysis (EMN, HSK, WmWH), pp. 43–48.

SAS-2004-ManevichSRF #abstraction

Partially Disjunctive Heap Abstraction (RM, SS, GR, JF), pp. 265–279.

OOPSLA-2004-AbuaiadhOPS #algorithm #parallel #performance

An efficient parallel heap compaction algorithm (DA, YO, EP, US), pp. 224–236.

CGO-2004-Adl-TabatabaiBCEFLMS #java #performance

Improving 64-Bit Java IPF Performance by Compressing Heap References (ARAT, JB, MC, ME, JF, BTL, BRM, JMS), pp. 100–110.

ISMM-2004-ChenKVI #analysis #embedded #java #optimisation

Field level analysis for heap space optimization in embedded java environments (GC, MTK, NV, MJI), pp. 131–142.

ISMM-2004-YangHBKM #automation #memory management

Automatic heap sizing: taking real memory into account (TY, MH, EDB, SFK, JEBM), pp. 61–72.

ESOP-2003-ReddyY #correctness #data transformation #data type

Correctness of Data Representations Involving Heap Data Structures (USR, HY), pp. 223–237.

ESOP-2003-YahavRSW #evolution #logic #verification

Verifying Temporal Heap Properties Specified via Evolution Logic (EY, TWR, SS, RW), pp. 204–222.

TACAS-2003-VaziriJ #constraints #theorem proving

Checking Properties of Heap-Manipulating Procedures with a Constraint Solver (MV, DJ), pp. 505–520.

SAS-2003-KuncakR #abstraction #decidability

Existential Heap Abstraction Entailment Is Undecidable (VK, MCR), pp. 418–438.

SAS-2003-ShahamYKS #memory management #safety

Establishing Local Temporal Heap Safety Properties with Applications to Compile-Time Memory Management (RS, EY, EKK, SS), pp. 483–503.

OOPSLA-2003-ChenKVIMW #java

Heap compression for memory-constrained Java environments (GC, MTK, NV, MJI, BM, MW), pp. 282–301.

POPL-2003-HofmannJ #first-order #functional #predict #source code

Static prediction of heap space usage for first-order functional programs (MH, SJ), pp. 185–197.

VMCAI-2003-UnnikrishnanSL #analysis #bound

Optimized Live Heap Bound Analysis (LU, SDS, YAL), pp. 70–85.

STOC-2002-KaplanST

Meldable heaps and boolean union-find (HK, NS, RET), pp. 573–582.

OOPSLA-2002-PrintezisJ #adaptation #framework #named #visualisation

GCspy: an adaptable heap visualisation framework (TP, REJ), pp. 343–358.

PPDP-2002-SomogyiS #stack #using

Using the heap to eliminate stack accesses (ZS, PJS), pp. 121–132.

ISMM-2002-DomaniGKLPS #java #thread

Thread-local heaps for Java (TD, GG, EKK, EL, EP, DS), pp. 183–194.

ISMM-2002-HirzelHDH #comprehension

Understanding the connectivity of heap objects (MH, JH, AD, MH), pp. 143–156.

ISMM-2002-JohanssonSW #architecture #concurrent #message passing #using

Heap architectures for concurrent languages using message passing (EJ, KFS, JW), pp. 195–206.

ISMM-2002-ShahamKS #impact analysis #java #liveness

Estimating the impact of heap liveness information on space consumption in Java (RS, EKK, SS), pp. 171–182.

ASE-2001-Iosif #model checking #symmetry

Exploiting Heap Symmetries in Explicit-State Model Checking of Software (RI), pp. 254–261.

PLDI-2001-ShahamKS #java #profiling

Heap Profiling for Space-Efficient Java (RS, EKK, SS), pp. 104–113.

OOPSLA-2001-BrechtALP #execution #garbage collection #java

Controlling Garbage Collection and Heap Growth to Reduce the Execution Time of Java Applications (TB, EA, CL, HP), pp. 353–366.

PPDP-2000-Li #memory management #performance #prolog #stack

Efficient memory management in a merged heap/stack prolog machine (XL), pp. 245–256.

PADL-2000-DemoenS #experience #garbage collection

Heap Garbage Collection in XSB: Practice and Experience (BD, KFS), pp. 93–108.

POPL-2000-ChungMES

Reducing Sweep Time for a Nearly Empty Heap (YCC, SMM, KE, DS), pp. 378–389.

ISMM-2000-ChilimbiJZ #design

Designing a Trace Format for Heap Allocation Events (TMC, REJ, BGZ), pp. 35–49.

ISMM-2000-Steensgaard #concurrent #multi #source code #thread

Thread-Specific Heaps for Multi-Threaded Programs (BS), pp. 18–24.

ICFP-1999-ShiversCM #transaction

Atomic Heap Transactions and Fine-grain Interrupts (OS, JWC, RM), pp. 48–59.

STOC-1998-Fredman

Information Theoretic Implications for Pairing Heaps (MLF), pp. 319–326.

ASPLOS-1998-SeidlZ #behaviour

Segregating Heap Objects by Reference Behavior and Lifetime (MLS, BGZ), pp. 12–23.

DAC-1997-KuehlmannK #equivalence #using

Equivalence Checking Using Cuts and Heaps (AK, FK), pp. 263–268.

IFL-1997-BoortzS #garbage collection

A Compacting Garbage Collector for Unidirectional Heaps (KB, DS), p. 358–?.

AFP-1996-RuncimanR96 #performance #profiling

Heap Profiling for Space Efficiency (CR, NR), pp. 159–183.

ICFP-1996-RojemoR #compilation #profiling #revisited

Lag, Drag, Void and Use — Heap Profiling and Space-Efficient Compilation Revisited (NR, CR), pp. 34–41.

IFL-1996-RuncimanR #matter #profiling

Two-Pass Heap Profiling: A Matter of Life and Death (CR, NR), pp. 222–232.

POPL-1996-GhiyaH #analysis #c #graph #pointer

Is it a Tree, a DAG, or a Cyclic Graph? A Shape Analysis for Heap-Directed Pointers in C (RG, LJH), pp. 1–15.

SIGMOD-1993-KolodnerW #garbage collection #incremental #scalability

Atomic Incremental Garbage Collection and Recovery for a Large Stable Heap (EKK, WEW), pp. 177–186.

SOSP-1993-OTooleNG #concurrent #garbage collection #persistent

Concurrent Compacting Garbage Collection of a Persistent Heap (JO, SN, DKG), pp. 161–174.

STOC-1990-Frederickson #bound

The Information Theory Bound Is Tight for Selection in a Heap (GNF), pp. 26–33.

SIGMOD-1989-KolodnerLW #garbage collection

Atomic Garbage Collection: Managing a Stable Heap (EKK, BL, WEW), pp. 15–25.

ICALP-1989-GambosiNT #data type

A Pointer-Free Data Structure for Merging Heaps and Min-Max Heaps (GG, EN, MT), pp. 405–422.

VDME-1987-George #development #specification

Heap Storage Specification and Development (CG), pp. 97–105.

FPCA-1985-Wise85 #design #multi

Design for a Multiprocessing Heap with On-board Reference Counting (DSW), pp. 289–304.

ICALP-1982-GonnetM

Heaps on Heaps (GHG, JIM), pp. 282–291.