Search results for "AF-heap"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
181	Mazen Kharbutli, Xiaowei Jiang, Yan Solihin, Guru Venkataramani, Milos Prvulovic	Comprehensively and efficiently protecting the heap.	ASPLOS	2006	DBLP DOI BibTeX RDF	heap attacks, heap security, heap server, computer security
118	Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa	Heap space analysis for java bytecode.	ISMM	2007	DBLP DOI BibTeX RDF	heap consumption, heap space analysis, Java bytecode, low-level languages
103	Heikki Verta, Titos Saridakis	Detection of Heap Management Flaws in Component-Based Software.	EUROMICRO	2004	DBLP DOI BibTeX RDF
95	Yoonseo Choi, Hwansoo Han	Shared heap management for memory-limited java virtual machines.	ACM Trans. Embed. Comput. Syst.	2008	DBLP DOI BibTeX RDF	heap sharing, memory protection unit, garbage collection, Dynamic memory management
95	Guangyu Chen, Mahmut T. Kandemir, Narayanan Vijaykrishnan, Mary Jane Irwin, Bernd Mathiske, Mario Wolczko	Heap compression for memory-constrained Java environments.	OOPSLA	2003	DBLP DOI BibTeX RDF	memory compression, garbage collection, Java virtual machine, heap
94	Bernard Chazelle	The soft heap: an approximate priority queue with optimal error rate.	J. ACM	2000	DBLP DOI BibTeX RDF	amoritization, soft heap, priority queue, heap
87	Haim Kaplan, Robert Endre Tarjan	Thin heaps, thick heaps.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	binomial queue, decrease key operation, fibonacci heap, melding, thick heap, thin heap, Data structure, priority queue, heap
87	Trishul M. Chilimbi, Vinod Ganapathy	HeapMD: identifying heap-based bugs using anomaly detection.	ASPLOS	2006	DBLP DOI BibTeX RDF	metrics, debugging, anomaly detection, bugs, heap
79	Mohammad Reza Meybodi	Concurrent Data Structures for Hypercube Machine.	PARLE	1992	DBLP DOI BibTeX RDF	Banyan Heap, Parallel Algorithm, Hypercube, Concurrent Data Structure
79	Ting Yang, Matthew Hertz, Emery D. Berger, Scott F. Kaplan, J. Eliot B. Moss	Automatic heap sizing: taking real memory into account.	ISMM	2004	DBLP DOI BibTeX RDF	garbage collection, virtual memory, paging
79	Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa	Live heap space analysis for languages with garbage collection.	ISMM	2009	DBLP DOI BibTeX RDF	live heap space analysis, peak memory consumption, java bytecode, low-level languages
79	Aggelos Ioannou, Manolis Katevenis	Pipelined heap (priority queue) management for advanced scheduling in high-speed networks.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	high-speed network scheduling, pipelined hard-ware heap, synthesizable core, weighted fair queueing, priority queue, weighted round robin
79	Uday P. Khedker, Amitabha Sanyal, Amey Karkare	Heap reference analysis using access graphs.	ACM Trans. Program. Lang. Syst.	2007	DBLP DOI BibTeX RDF	heap references, data flow analysis, liveness, Aliasing
79	Sajal K. Das 0001, Wen-Bing Horng	Managing a Parallel Heap Efficiently.	PARLE (1)	1991	DBLP DOI BibTeX RDF	optimal speedup, parallel algorithm, data structure, priority queue, Algorithm analysis, heap, EREW PRAM
71	Stephen Chong, Radu Rugina	Static Analysis of Accessed Regions in Recursive Data Structures.	SAS	2003	DBLP DOI BibTeX RDF
71	Chengliang Zhang, Kirk Kelsey, Xipeng Shen, Chen Ding 0001, Matthew Hertz, Mitsunori Ogihara	Program-level adaptive memory management.	ISMM	2006	DBLP DOI BibTeX RDF	heap sizing, program-level, adaptive, garbage collection, paging
71	Martin T. Vechev, Eran Yahav, Greta Yorsh	PHALANX: parallel checking of expressive heap assertions.	ISMM	2010	DBLP DOI BibTeX RDF	parallel garbage collector, virtual machine, ownership
71	Evan K. Maxwell, Godmar Back, Naren Ramakrishnan	Diagnosing memory leaks using graph mining on heap dumps.	KDD	2010	DBLP DOI BibTeX RDF	heap profiling, graph mining, graph grammars, memory leaks, dominator tree
71	Y. C. Tay, X. R. Zong	A page fault equation for dynamic heap sizing.	WOSP/SIPEW	2010	DBLP DOI BibTeX RDF	dynamic tuning, heap size, garbage collection, page faults
71	Rehan Akbani, Turgay Korkmaz, G. V. S. Raju 0001	HEAP: hop-by-hop efficient authentication protocol for Mobile Ad-hoc Networks.	SpringSim (1)	2007	DBLP BibTeX RDF	security, MANETs, mobile ad-hoc networks, authentication, HEAP
71	Zoltan Somogyi, Peter J. Stuckey	Using the heap to eliminate stack accesses.	PPDP	2002	DBLP DOI BibTeX RDF	heap cells, stack accesses, stack frames, maximal matching
71	Tong Chen 0010, Jin Lin, Wei-Chung Hsu, Pen-Chung Yew	On the Impact of Naming Methods for Heap-Oriented Pointers in C Programs.	ISPAN	2002	DBLP DOI BibTeX RDF	points-to set, heap-oriented pointer, flow-sensitivity and context sensitivity, profiling, instrumentation
71	Amer Diwan, David Tarditi, J. Eliot B. Moss	Memory System Performance of Programs with Intensive Heap Allocation	ACM Trans. Comput. Syst.	1995	DBLP DOI BibTeX RDF	automatic storage reclamation, copying garbage collection, heap allocation, page mode, subblock placement, write through, write-back, write-miss policy, garbage collection, generational garbage collection, write-policy, write-buffer
69	Mooly Sagiv, Arnd Poetzsch-Heffter, Peter W. O'Hearn	09301 Executive Summary - Typing, Analysis, and Verification of Heap-Manipulating Programs.	Typing, Analysis and Verification of Heap-Manipulating Programs	2009	DBLP BibTeX RDF
69	Mooly Sagiv, Arnd Poetzsch-Heffter, Peter W. O'Hearn	09301 Abstracts Collection - Typing, Analysis, and Verification of Heap-Manipulating Programs.	Typing, Analysis and Verification of Heap-Manipulating Programs	2009	DBLP BibTeX RDF
63	Viktor Kuncak, Martin C. Rinard	Existential Heap Abstraction Entailment Is Undecidable.	SAS	2003	DBLP DOI BibTeX RDF	Program Verification, Shape Analysis, Type Checking, Monadic Second-Order Logic, Typestate, Graph Homomorphism, Post Correspondence Problem
63	Yoo C. Chung, Soo-Mook Moon, Kemal Ebcioglu, Dan Sahlin	Reducing Sweep Time for a Nearly Empty Heap.	POPL	2000	DBLP DOI BibTeX RDF
63	Elliot K. Kolodner, William E. Weihl	Atomic Incremental Garbage Collection and Recovery for a Large Stable Heap.	SIGMOD Conference	1993	DBLP DOI BibTeX RDF
63	Michael L. Fredman, Dan E. Willard	Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths	FOCS	1990	DBLP DOI BibTeX RDF	Fibonacci heap, trans-dichotomous algorithms, fusion tree method, information-theoretic limitations, atomic heap, amortized time, heap size, AF-heap, data structure, shortest paths, minimum spanning trees, linear-time algorithm, shortest-path algorithm
63	Jennifer B. Sartor, Martin Hirzel, Kathryn S. McKinley	No bit left behind: the limits of heap data compression.	ISMM	2008	DBLP DOI BibTeX RDF	compression, heap
63	Myra B. Cohen, Shiu Beng Kooi, Witawas Srisa-an	Clustering the heap in multi-threaded applications for improved garbage collection.	GECCO	2006	DBLP DOI BibTeX RDF	heap clustering, virtual machines, garbage collection, hill climbing, search based software engineering
55	Kiyokuni Kawachiya, Kazunori Ogata, Tamiya Onodera	Analysis and reduction of memory inefficiencies in Java strings.	OOPSLA	2008	DBLP DOI BibTeX RDF	footprint analysis and reduction, java, garbage collection, memory management, string
55	Feng Mao, Eddy Z. Zhang, Xipeng Shen	Influence of program inputs on the selection of garbage collectors.	VEE	2009	DBLP DOI BibTeX RDF	cross-input program analysis, input-specific selection, minimum possible heap size, selection of garbage collectors, profiling
55	Doina Bein, Ajoy Kumar Datta, Vincent Villain	Snap-Stabilizing Optimal Binary Search Tree.	Self-Stabilizing Systems	2005	DBLP DOI BibTeX RDF	self-stabilization, heap, Binary search tree, snap-stabilization
55	Zhenjiang Wang, Chenggang Wu 0002, Pen-Chung Yew	On improving heap memory layout by dynamic pool allocation.	CGO	2010	DBLP DOI BibTeX RDF	adaptive partial call chain, pool allocation, dynamic optimization, data layout
55	Guoqing Xu 0001, Atanas Rountev	Merging equivalent contexts for scalable heap-cloning-based context-sensitive points-to analysis.	ISSTA	2008	DBLP DOI BibTeX RDF	pointer analysis, context sensitivity, points-to analysis
55	Mayumi Kato, Chia-Tien Dan Lo	A heap de/compression module for wireless Java.	PPPJ	2004	DBLP DOI BibTeX RDF
55	Jarrod A. Lewis, Mikko H. Lipasti, Bryan Black	Avoiding Initialization Misses to the Heap.	ISCA	2002	DBLP DOI BibTeX RDF	invalid memory traffic, initializing stores, cache installation, allocation range cache
55	Christof Fetzer, Zhen Xiao	Detecting Heap Smashing Attacks through Fault Containment Wrappers.	SRDS	2001	DBLP DOI BibTeX RDF
55	Olin Shivers, James W. Clark, Roland McGrath	Atomic Heap Transactions and Fine-grain Interrupts.	ICFP	1999	DBLP DOI BibTeX RDF
55	James W. O'Toole Jr., Scott Nettles, David K. Gifford	Concurrent Compacting Garbage Collection of a Persistent Heap.	SOSP	1993	DBLP DOI BibTeX RDF
55	Leena Unnikrishnan, Scott D. Stoller	Parametric heap usage analysis for functional programs.	ISMM	2009	DBLP DOI BibTeX RDF	live heap space analysis, garbage collection, functional languages, recurrence relations
55	Edward Aftandilian, Samuel Z. Guyer	GC assertions: using the garbage collector to check heap properties.	PLDI	2009	DBLP DOI BibTeX RDF	heap properties, garbage collection, dynamic analysis
55	Ju Qian, Baowen Xu, Hongbo Min	Interstatement must aliases for data dependence analysis of heap locations.	PASTE	2007	DBLP DOI BibTeX RDF	must alias, data dependence, pointer analysis, heap
55	Marina Polishchuk, Ben Liblit, Chloë W. Schulze	Dynamic heap type inference for program understanding and debugging.	POPL	2007	DBLP DOI BibTeX RDF	dynamic type inference, heap visualization, physical subtyping, constraints, debugging tools, conservative garbage collection
55	Tim Brecht, Eshrat Arjomandi, Chang Li, Hang Pham	Controlling garbage collection and heap growth to reduce the execution time of Java applications.	ACM Trans. Program. Lang. Syst.	2006	DBLP DOI BibTeX RDF	heap growth, Java, implementation, programming languages, Garbage collection, memory management, performance measurement
55	Kewei Sun, Ying Li 0012, Matt Hogstrom, Ying Chen 0004	Sizing multi-space in heap for application isolation.	OOPSLA Companion	2006	DBLP DOI BibTeX RDF	Java heap, multiple spaces, resonant model, isolation
55	Jianli Shen, Guru Venkataramani, Milos Prvulovic	Tradeoffs in fine-grained heap memory protection.	ASID	2006	DBLP DOI BibTeX RDF	heap security, protection granularity, memory protection
55	Erik M. Nystrom, Hong-Seok Kim, Wen-mei W. Hwu	Importance of heap specialization in pointer analysis.	PASTE	2004	DBLP DOI BibTeX RDF	heap specialization, pointer analysis, context sensitivity
55	Rezaul Alam Chowdhury, Vijaya Ramachandran	Cache-oblivious shortest paths in graphs using buffer heap.	SPAA	2004	DBLP DOI BibTeX RDF	buffer heap, cache-aware model, cache-oblivious model, decrease-key, tournament tree, shortest paths, priority queue
55	Sushil K. Prasad, Nikhil Junankar	Parallelizing a sequential logic simulator using an optimistic framework based on a global parallel heap event queue: an experience and performance report.	PADS	2000	DBLP DOI BibTeX RDF	parallel heap, parallelizing framework, parallel discrete event simulation, logic simulation
55	Víctor A. Braberman, Federico Javier Fernández, Diego Garbervetsky, Sergio Yovine	Parametric prediction of heap memory requirements.	ISMM	2008	DBLP DOI BibTeX RDF	heap consumption, heap space analysis, java, memory regions
55	Xinan Tang, Rakesh Ghiya, Laurie J. Hendren, Guang R. Gao	Heap Analysis and Optimizations for Threaded Programs.	IEEE PACT	1997	DBLP DOI BibTeX RDF	threaded programs, traditional compiler optimizations, loop invariant removal, common sub-expression elimination, dynamically allocated data structures, heap pointer analyses, dependence testing, high quality code generation, EARTH-C compiler, generated multithreaded code, dynamic measurements, performance tradeoffs, optimizations, parallel programming, optimizing compilers, multithreaded architectures, multithreaded programs, heap analysis
54	Peter W. O'Hearn, Arnd Poetzsch-Heffter, Mooly Sagiv (eds.)	Typing, Analysis and Verification of Heap-Manipulating Programs, 19.07. - 24.07.2009	Typing, Analysis and Verification of Heap-Manipulating Programs	2009	DBLP BibTeX RDF
54	David G. Clarke, Tobias Wrigstad, Johan Östlund, Einar Broch Johnsen	Minimal Ownership for Active Objects.	Typing, Analysis and Verification of Heap-Manipulating Programs	2009	DBLP BibTeX RDF
48	Maria Jump, Kathryn S. McKinley	Cork: dynamic memory leak detection for garbage-collected languages.	POPL	2007	DBLP DOI BibTeX RDF	memory leak detection, garbage collection, dynamic, runtime analysis, memory leaks
48	Tadao Takaoka	Theory of Trinomial Heaps.	COCOON	2000	DBLP DOI BibTeX RDF
48	Svante Carlsson, Jingsen Chen, Christer Mattsson	Heaps with Bits.	ISAAC	1994	DBLP DOI BibTeX RDF
47	Surupa Biswas, Thomas W. Carley, Matthew S. Simpson, Bhuvan Middha, Rajeev Barua	Memory overflow protection for embedded systems using run-time checks, reuse, and compression.	ACM Trans. Embed. Comput. Syst.	2006	DBLP DOI BibTeX RDF	Out-of-memory errors, reliability, data compression, reuse, run-time checks, heap overflow, stack overflow
47	Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore	On Self-stabilizing Search Trees.	DISC	2006	DBLP DOI BibTeX RDF	min-max heap, Distributed algorithm, self-stabilization, search tree
47	Andreas Podelski, Andrey Rybalchenko, Thomas Wies	Heap Assumptions on Demand.	CAV	2008	DBLP DOI BibTeX RDF
47	Chenguang Luo, Guanhua He, Shengchao Qin	A Heap Model for Java Bytecode to Support Separation Logic.	APSEC	2008	DBLP DOI BibTeX RDF
47	Yuji Chiba	Heap protection for Java virtual machines.	PPPJ	2006	DBLP DOI BibTeX RDF
47	Nicolas Marti, Reynald Affeldt, Akinori Yonezawa	Formal Verification of the Heap Manager of an Operating System Using Separation Logic.	ICFEM	2006	DBLP DOI BibTeX RDF
47	Madanlal Musuvathi, David L. Dill	An Incremental Heap Canonicalization Algorithm.	SPIN	2005	DBLP DOI BibTeX RDF
47	Chris Lattner, Vikram S. Adve	Automatic pool allocation: improving performance by controlling data structure layout in the heap.	PLDI	2005	DBLP DOI BibTeX RDF	pool allocation, cache, static analysis, data layout, recursive data structure
47	Eran Yahav, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm	Verifying Temporal Heap Properties Specified via Evolution Logic.	ESOP	2003	DBLP DOI BibTeX RDF
47	Jesper Bojesen, Jyrki Katajainen, Maz Spork	Performance Engineering Case Study: Heap Construction.	WAE	1999	DBLP BibTeX RDF
47	Bernard Chazelle	Car-Pooling as a Data Structuring Device: The Soft Heap.	ESA	1998	DBLP DOI BibTeX RDF
47	Sajal K. Das 0001, Maria Cristina Pinotti	O(log log N) Time Algorithms for Hamiltonian-Suffix and Min-Max-Pair Heap Operations on Hypercube Multicomputers.	IPPS	1997	DBLP DOI BibTeX RDF
47	Niklas Röjemo, Colin Runciman	Lag, Drag, Void and Use - Heap Profiling and Space-Efficient Compilation Revisited.	ICFP	1996	DBLP DOI BibTeX RDF
47	Svante Carlsson, Jingsen Chen	Heap Construction: Optimal in Both Worst and Average Cases?	ISAAC	1995	DBLP DOI BibTeX RDF
47	Jingsen Chen	Parallel Heap Construction Using Multiple Selection.	CONPAR	1994	DBLP DOI BibTeX RDF	double-ended priority queues, multiple selection, parallel algorithms, Data structures, priority queues
47	Ingo Wegener	The Worst Case Complexity of McDiarmid and Reed's Variant of Bottom-Up-Heap Sort is Less Than n log n + 1.1n.	STACS	1991	DBLP DOI BibTeX RDF
47	Elliot K. Kolodner, Barbara Liskov, William E. Weihl	Atomic Garbage Collection: Managing a Stable Heap.	SIGMOD Conference	1989	DBLP DOI BibTeX RDF	C++
47	Fariborz Mahmoudi, Rasul Enayatifar, Mohsen Mirzashaeri	Image Encryption Using Chaotic Signal and Max-Heap Tree.	e-Forensics	2009	DBLP DOI BibTeX RDF	Max-Heap Tree, Chaotic Signal, Image Encryption
47	Yoonseo Choi, Hwansoo Han	Protected heap sharing for memory-constrained java environments.	CASES	2006	DBLP DOI BibTeX RDF	heap sharing, memory protection unit, garbage collection, dynamic memory management
47	Guangyu Chen, Mahmut T. Kandemir, Mary Jane Irwin	Exploiting frequent field values in java objects for reducing heap memory requirements.	VEE	2005	DBLP DOI BibTeX RDF	frequent field value, garbage collection, Java virtual machine, heap
47	Martin Hofmann 0001, Steffen Jost	Static prediction of heap space usage for first-order functional programs.	POPL	2003	DBLP DOI BibTeX RDF	program analysis, functional programming, garbage collection, resources, heap
47	Jie Wu 0001	On Sorting an Intransitive Total Ordered Set Using Semi-Heap.	IPDPS	2000	DBLP DOI BibTeX RDF	Data structure, sorting, directed graph, Hamiltonian path, heap, total order
47	Jack B. Dennis	General Parallel Computation can be Performed with a Cycle-Free Heap.	IEEE PACT	1998	DBLP DOI BibTeX RDF	heap storage management, nondeterminate merge, stream processing, functional programming languages
47	Mark Marron, Darko Stefanovic, Deepak Kapur, Manuel V. Hermenegildo	Identification of Heap-Carried Data Dependence Via Explicit Store Heap Models.	LCPC	2008	DBLP DOI BibTeX RDF
47	Ingo Wegener	Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small).	MFCS	1990	DBLP DOI BibTeX RDF
40	Mooly Sagiv	Thread-Modular Shape Analysis.	VMCAI	2009	DBLP DOI BibTeX RDF
40	Davide Frey, Rachid Guerraoui, Anne-Marie Kermarrec, Boris Koldehofe, Martin Mogensen, Maxime Monod, Vivien Quéma	Heterogeneous Gossip.	Middleware	2009	DBLP DOI BibTeX RDF
40	Mark Marron, Mario Méndez-Lojo, Manuel V. Hermenegildo, Darko Stefanovic, Deepak Kapur	Sharing analysis of arrays, collections, and recursive structures.	PASTE	2008	DBLP DOI BibTeX RDF	shared structures, parallelism, shape analysis
40	Shiro Kawai	Efficient floating-point number handling for dynamically typed scripting languages.	DLS	2008	DBLP DOI BibTeX RDF
40	Christopher Dahn, Spiros Mancoridis	Using Program Transformation to Secure C Programs Against Buffer Overflows.	WCRE	2003	DBLP DOI BibTeX RDF
40	Haim Kaplan, Nira Shafrir, Robert Endre Tarjan	Meldable heaps and boolean union-find.	STOC	2002	DBLP DOI BibTeX RDF
40	Andrew D. Gordon 0001, Don Syme	Typing a multi-language intermediate code.	POPL	2001	DBLP DOI BibTeX RDF
40	Kenichi Asai	Integrating Partial Evaluators into Interpreters.	SAIG	2001	DBLP DOI BibTeX RDF
40	Anthony J. H. Simons	Borrow, Copy or Steal? Loans and Larceny in the Orthodox Canonical Form.	OOPSLA	1998	DBLP DOI BibTeX RDF	borrowing, larceny, stealing, transfer of ownership, C++, C++, memory management, copy-on-write, implementation strategies
40	Lorenz Huelsbergen, James R. Larus	Dynamic Program Parallelization.	LISP and Functional Programming	1992	DBLP DOI BibTeX RDF	ML
40	Qin Huang, William E. Weihl	An evaluation of concurrent priority queue algorithms.	SPDP	1991	DBLP DOI BibTeX RDF
40	Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert Endre Tarjan	Faster Algorithms for the Shortest Path Problem	J. ACM	1990	DBLP DOI BibTeX RDF
39	Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa	Parametric inference of memory requirements for garbage collected languages.	ISMM	2010	DBLP DOI BibTeX RDF	live heap space analysis, peak memory consumption, garbage collection, java bytecode, low-level languages
39	Shuvendu K. Lahiri, Shaz Qadeer	Verifying properties of well-founded linked lists.	POPL	2006	DBLP DOI BibTeX RDF	first-order axiomatization, heap abstraction, well-founded linked lists, decision procedure, automated theorem proving
39	Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore	Self-stabilizing Space Optimal Synchronization Algorithms on Trees.	SIROCCO	2006	DBLP DOI BibTeX RDF	local mutual exclusion, self-stabilization, heap
39	Surupa Biswas, Matthew S. Simpson, Rajeev Barua	Memory overflow protection for embedded systems using run-time checks, reuse and compression.	CASES	2004	DBLP DOI BibTeX RDF	out-of-memory errors, reliability, data compression, reuse, runtime checks, heap overflow, stack overflow
39	Stephan Olariu, Zhaofang Wen	Optimal Parallel Initialization Algorithms for a Class of Priority Queues.	IEEE Trans. Parallel Distributed Syst.	1991	DBLP DOI BibTeX RDF	parallel initialization algorithms, adaptive parallel algorithm, priority queue structure, n-element array, parallel construction algorithms, heap-like structures, double-endedpriority queues, min-max heaps, deeps, min-max-pair heaps, exclusive-read-exclusive-write parallel random-access machine, parallel algorithms, data structures, queueing theory, processors, computationalcomplexity