|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1277 occurrences of 618 keywords
|
|
|
Results
Found 1598 publication records. Showing 1573 according to the selection in the facets
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASPLOS ![In: Proceedings of the 12th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2006, San Jose, CA, USA, October 21-25, 2006, pp. 207-218, 2006, ACM, 1-59593-451-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Proceedings of the 6th International Symposium on Memory Management, ISMM 2007, Montreal, Quebec, Canada, October 21-22, 2007, pp. 105-116, 2007, ACM, 978-1-59593-893-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROMICRO ![In: 30th EUROMICRO Conference 2004, 31 August - 3 September 2004, Rennes, France, pp. 583-590, 2004, IEEE Computer Society, 0-7695-2199-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
95 | Yoonseo Choi, Hwansoo Han |
Shared heap management for memory-limited java virtual machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Embed. Comput. Syst. ![In: ACM Trans. Embed. Comput. Syst. 7(2), pp. 13:1-13:32, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OOPSLA ![In: Proceedings of the 2003 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications, OOPSLA 2003, October 26-30, 2003, Anaheim, CA, USA, pp. 282-301, 2003, ACM, 1-58113-712-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 47(6), pp. 1012-1027, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
amoritization, soft heap, priority queue, heap |
87 | Haim Kaplan, Robert Endre Tarjan |
Thin heaps, thick heaps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(1), pp. 3:1-3:14, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASPLOS ![In: Proceedings of the 12th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2006, San Jose, CA, USA, October 21-25, 2006, pp. 219-228, 2006, ACM, 1-59593-451-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
metrics, debugging, anomaly detection, bugs, heap |
79 | Mohammad Reza Meybodi |
Concurrent Data Structures for Hypercube Machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARLE ![In: PARLE '92: Parallel Architectures and Languages Europe, 4th International PARLE Conference, Paris, France, June 15-18, 1992, Proceedings, pp. 703-724, 1992, Springer, 3-540-55599-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Proceedings of the 4th International Symposium on Memory Management, ISMM 2004, Vancouver, BC, Canada, October 24-25, 2004, pp. 61-72, 2004, ACM, 1-58113-945-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Proceedings of the 8th International Symposium on Memory Management, ISMM 2009, Dublin, Ireland, June 19-20, 2009, pp. 129-138, 2009, ACM, 978-1-60558-347-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 15(2), pp. 450-461, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 30(1), pp. 1, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARLE (1) ![In: PARLE '91: Parallel Architectures and Languages Europe, Volume I: Parallel Architectures and Algorithms, Eindhoven, The Netherlands, June 10-13, 1991, Proceedings, pp. 270-287, 1991, Springer, 3-540-54151-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 10th International Symposium, SAS 2003, San Diego, CA, USA, June 11-13, 2003, Proceedings, pp. 463-482, 2003, Springer, 3-540-40325-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
71 | Chengliang Zhang, Kirk Kelsey, Xipeng Shen, Chen Ding 0001, Matthew Hertz, Mitsunori Ogihara |
Program-level adaptive memory management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Proceedings of the 5th International Symposium on Memory Management, ISMM 2006, Ottawa, Ontario, Canada, June 10-11, 2006, pp. 174-183, 2006, ACM, 1-59593-221-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Proceedings of the 9th International Symposium on Memory Management, ISMM 2010, Toronto, Ontario, Canada, June 5-6, 2010, pp. 41-50, 2010, ACM, 978-1-4503-0054-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, July 25-28, 2010, pp. 115-124, 2010, ACM, 978-1-4503-0055-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WOSP/SIPEW ![In: Proceedings of the first joint WOSP/SIPEW International Conference on Performance Engineering, San Jose, California, USA, January 28-30, 2010, pp. 201-206, 2010, ACM, 978-1-60558-563-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SpringSim (1) ![In: Proceedings of the 2007 Spring Simulation Multiconference, SpringSim 2007, Norfolk, Virginia, USA, March 25-29, 2007, Volume 1, pp. 157-165, 2007, SCS/ACM, 1-56555-312-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, October 6-8, 2002, Pittsburgh, PA, USA (Affiliated with PLI 2002), pp. 121-132, 2002, ACM. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: International Symposium on Parallel Architectures, Algorithms and Networks, ISPAN 2002, May 22-24, 2002, Makati City, Metro Manila, Philippines, pp. 251-, 2002, IEEE Computer Society, 0-7695-1579-7. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Syst. ![In: ACM Trans. Comput. Syst. 13(3), pp. 244-273, 1995. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Typing, Analysis and Verification of Heap-Manipulating Programs ![In: Typing, Analysis and Verification of Heap-Manipulating Programs, 19.07. - 24.07.2009, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Typing, Analysis and Verification of Heap-Manipulating Programs ![In: Typing, Analysis and Verification of Heap-Manipulating Programs, 19.07. - 24.07.2009, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
63 | Viktor Kuncak, Martin C. Rinard |
Existential Heap Abstraction Entailment Is Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 10th International Symposium, SAS 2003, San Diego, CA, USA, June 11-13, 2003, Proceedings, pp. 418-438, 2003, Springer, 3-540-40325-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: POPL 2000, Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Boston, Massachusetts, USA, January 19-21, 2000, pp. 378-389, 2000, ACM, 1-58113-125-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
63 | Elliot K. Kolodner, William E. Weihl |
Atomic Incremental Garbage Collection and Recovery for a Large Stable Heap. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, DC, USA, May 26-28, 1993., pp. 177-186, 1993, ACM Press, 978-0-89791-592-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
63 | Michael L. Fredman, Dan E. Willard |
Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 719-725, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Proceedings of the 7th International Symposium on Memory Management, ISMM 2008, Tucson, AZ, USA, June 7-8, 2008, pp. 111-120, 2008, ACM, 978-1-60558-134-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2006, Proceedings, Seattle, Washington, USA, July 8-12, 2006, pp. 1901-1908, 2006, ACM, 1-59593-186-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OOPSLA ![In: Proceedings of the 23rd Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2008, October 19-23, 2008, Nashville, TN, USA, pp. 385-402, 2008, ACM, 978-1-60558-215-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VEE ![In: Proceedings of the 5th International Conference on Virtual Execution Environments, VEE 2009, Washington, DC, USA, March 11-13, 2009, pp. 91-100, 2009, ACM, 978-1-60558-375-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Self-Stabilizing Systems ![In: Self-Stabilizing Systems, 7th International Symposium, SSS 2005, Barcelona, Spain, October 26-27, 2005, Proceedings, pp. 1-17, 2005, Springer, 3-540-29814-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CGO ![In: Proceedings of the CGO 2010, The 8th International Symposium on Code Generation and Optimization, Toronto, Ontario, Canada, April 24-28, 2010, pp. 92-100, 2010, ACM, 978-1-60558-635-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSTA ![In: Proceedings of the ACM/SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2008, Seattle, WA, USA, July 20-24, 2008, pp. 225-236, 2008, ACM, 978-1-60558-050-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPPJ ![In: Proceedings of the 3rd International Symposium on Principles and Practice of Programming in Java, PPPJ 2004, Las Vegas, Nevada, USA, June 16-18, 2004, pp. 91-99, 2004, ACM, 1-59593-171-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
55 | Jarrod A. Lewis, Mikko H. Lipasti, Bryan Black |
Avoiding Initialization Misses to the Heap. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCA ![In: 29th International Symposium on Computer Architecture (ISCA 2002), 25-29 May 2002, Anchorage, AK, USA, pp. 183-194, 2002, IEEE Computer Society, 0-7695-1605-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SRDS ![In: 20th Symposium on Reliable Distributed Systems (SRDS 2001), 28-31 October 2001, New Orleans, LA, USA, pp. 80-89, 2001, IEEE Computer Society, 0-7695-1366-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
55 | Olin Shivers, James W. Clark, Roland McGrath |
Atomic Heap Transactions and Fine-grain Interrupts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), Paris, France, September 27-29, 1999., pp. 48-59, 1999, ACM, 1-58113-111-9. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
55 | James W. O'Toole Jr., Scott Nettles, David K. Gifford |
Concurrent Compacting Garbage Collection of a Persistent Heap. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSP ![In: Proceedings of the Fourteenth ACM Symposium on Operating System Principles, SOSP 1993, The Grove Park Inn and Country Club, Asheville, North Carolina, USA, December 5-8, 1993, pp. 161-174, 1993, ACM, 0-89791-632-8. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
55 | Leena Unnikrishnan, Scott D. Stoller |
Parametric heap usage analysis for functional programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Proceedings of the 8th International Symposium on Memory Management, ISMM 2009, Dublin, Ireland, June 19-20, 2009, pp. 139-148, 2009, ACM, 978-1-60558-347-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2009, Dublin, Ireland, June 15-21, 2009, pp. 235-244, 2009, ACM, 978-1-60558-392-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PASTE ![In: Proceedings of the 7th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, PASTE'07, San Diego, California, USA, June 13-14, 2007, pp. 17-24, 2007, ACM, 978-1-59593-595-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2007, Nice, France, January 17-19, 2007, pp. 39-46, 2007, ACM, 1-59593-575-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 28(5), pp. 908-941, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OOPSLA Companion ![In: Companion to the 21th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2006, October 22-26, 2006, Portland, Oregon, USA, pp. 647-648, 2006, ACM, 1-59593-491-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASID ![In: Proceedings of the 1st Workshop on Architectural and System Support for Improving Software Dependability, ASID 2006, San Jose, California, USA, October 21, 2006, pp. 52-57, 2006, ACM, 1-59593-576-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PASTE ![In: Proceedings of the 2004 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis For Software Tools and Engineering, PASTE'04, Washington, DC, USA, June 7-8, 2004, pp. 43-48, 2004, ACM, 1-58113-910-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 27-30, 2004, Barcelona, Spain, pp. 245-254, 2004, ACM, 1-58113-840-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PADS ![In: Proceedings of the 14th Workshop on Parallel and Distributed Simulation, PADS 2000, Bologna, Italy, May 28-31, 2000, pp. 111-118, 2000, IEEE Computer Society, 0-7695-0667-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Proceedings of the 7th International Symposium on Memory Management, ISMM 2008, Tucson, AZ, USA, June 7-8, 2008, pp. 141-150, 2008, ACM, 978-1-60558-134-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE PACT ![In: Proceedings of the 1997 Conference on Parallel Architectures and Compilation Techniques (PACT '97), San Francisco, CA, USA, October 11-15, 1997, pp. 14-25, 1997, IEEE Computer Society, 0-8186-8090-3. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
Typing, Analysis and Verification of Heap-Manipulating Programs ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
54 | David G. Clarke, Tobias Wrigstad, Johan Östlund, Einar Broch Johnsen |
Minimal Ownership for Active Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Typing, Analysis and Verification of Heap-Manipulating Programs ![In: Typing, Analysis and Verification of Heap-Manipulating Programs, 19.07. - 24.07.2009, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
48 | Maria Jump, Kathryn S. McKinley |
Cork: dynamic memory leak detection for garbage-collected languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2007, Nice, France, January 17-19, 2007, pp. 31-38, 2007, ACM, 1-59593-575-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
memory leak detection, garbage collection, dynamic, runtime analysis, memory leaks |
48 | Tadao Takaoka |
Theory of Trinomial Heaps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings, pp. 362-372, 2000, Springer, 3-540-67787-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
48 | Svante Carlsson, Jingsen Chen, Christer Mattsson |
Heaps with Bits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, pp. 288-296, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Embed. Comput. Syst. ![In: ACM Trans. Embed. Comput. Syst. 5(4), pp. 719-752, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings, pp. 76-89, 2006, Springer, 3-540-44624-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 20th International Conference, CAV 2008, Princeton, NJ, USA, July 7-14, 2008, Proceedings, pp. 314-327, 2008, Springer, 978-3-540-70543-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
47 | Chenguang Luo, Guanhua He, Shengchao Qin |
A Heap Model for Java Bytecode to Support Separation Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APSEC ![In: 15th Asia-Pacific Software Engineering Conference (APSEC 2008), 3-5 December 2008, Beijing, China, pp. 127-134, 2008, IEEE Computer Society, 978-0-7695-3446-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
47 | Yuji Chiba |
Heap protection for Java virtual machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPPJ ![In: Proceedings of the 4th International Symposium on Principles and Practice of Programming in Java, PPPJ 2006, Mannheim, Germany, August 30 - September 1, 2006, pp. 103-112, 2006, ACM, 3-939352-05-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFEM ![In: Formal Methods and Software Engineering, 8th International Conference on Formal Engineering Methods, ICFEM 2006, Macao, China, November 1-3, 2006, Proceedings, pp. 400-419, 2006, Springer, 3-540-47460-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
47 | Madanlal Musuvathi, David L. Dill |
An Incremental Heap Canonicalization Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIN ![In: Model Checking Software, 12th International SPIN Workshop, San Francisco, CA, USA, August 22-24, 2005, Proceedings, pp. 28-42, 2005, Springer, 3-540-28195-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
47 | Chris Lattner, Vikram S. Adve |
Automatic pool allocation: improving performance by controlling data structure layout in the heap. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation, Chicago, IL, USA, June 12-15, 2005, pp. 129-142, 2005, ACM, 1-59593-056-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESOP ![In: Programming Languages and Systems, 12th European Symposium on Programming, ESOP 2003, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings, pp. 204-222, 2003, Springer, 3-540-00886-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
47 | Jesper Bojesen, Jyrki Katajainen, Maz Spork |
Performance Engineering Case Study: Heap Construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAE ![In: Algorithm Engineering, 3rd International Workshop, WAE '99, London, UK, July 19-21, 1999, Proceedings, pp. 302-316, 1999, Springer, 3-540-66427-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP BibTeX RDF |
|
47 | Bernard Chazelle |
Car-Pooling as a Data Structuring Device: The Soft Heap. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings, pp. 35-42, 1998, Springer, 3-540-64848-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: 11th International Parallel Processing Symposium (IPPS '97), 1-5 April 1997, Geneva, Switzerland, Proceedings, pp. 507-511, 1997, IEEE Computer Society, 0-8186-7792-9. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
47 | Niklas Röjemo, Colin Runciman |
Lag, Drag, Void and Use - Heap Profiling and Space-Efficient Compilation Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, ICFP 1996, Philadelphia, Pennsylvania, USA, May 24-26, 1996., pp. 34-41, 1996, ACM, 0-89791-770-7. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
47 | Svante Carlsson, Jingsen Chen |
Heap Construction: Optimal in Both Worst and Average Cases? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings, pp. 254-263, 1995, Springer, 3-540-60573-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
47 | Jingsen Chen |
Parallel Heap Construction Using Multiple Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONPAR ![In: Parallel Processing: CONPAR 94 - VAPP VI, Third Joint International Conference on Vector and Parallel Processing, Linz, Austria, September 6-8, 1994, Proceedings, pp. 371-380, 1994, Springer, 3-540-58430-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991, Proceedings, pp. 137-147, 1991, Springer, 3-540-53709-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
47 | Elliot K. Kolodner, Barbara Liskov, William E. Weihl |
Atomic Garbage Collection: Managing a Stable Heap. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, Portland, Oregon, USA, May 31 - June 2, 1989., pp. 15-25, 1989, ACM Press, 978-0-89791-317-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
C++ |
47 | Fariborz Mahmoudi, Rasul Enayatifar, Mohsen Mirzashaeri |
Image Encryption Using Chaotic Signal and Max-Heap Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
e-Forensics ![In: Forensics in Telecommunications, Information and Multimedia, Second International Conference, e-Forensics 2009, Adelaide, Australia, January 19-21, 2009, Revised Selected Papers, pp. 19-28, 2009, Springer, 978-3-642-02311-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASES ![In: Proceedings of the 2006 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES 2006, Seoul, Korea, October 22-25, 2006, pp. 212-222, 2006, ACM, 1-59593-543-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VEE ![In: Proceedings of the 1st International Conference on Virtual Execution Environments, VEE 2005, Chicago, IL, USA, June 11-12, 2005, pp. 68-78, 2005, ACM, 1-59593-047-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, New Orleans, Louisisana, USA, January 15-17, 2003, pp. 185-197, 2003, ACM, 1-58113-628-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), Cancun, Mexico, May 1-5, 2000, pp. 257-262, 2000, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE PACT ![In: Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques, Paris, France, October 12-18, 1998, pp. 96-, 1998, IEEE Computer Society, 0-8186-8591-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCPC ![In: Languages and Compilers for Parallel Computing, 21th International Workshop, LCPC 2008, Edmonton, Canada, July 31 - August 2, 2008, Revised Selected Papers, pp. 94-108, 2008, Springer, 978-3-540-89739-2. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1990, MFCS'90, Banská Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings, pp. 516-522, 1990, Springer, 3-540-52953-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
40 | Mooly Sagiv |
Thread-Modular Shape Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VMCAI ![In: Verification, Model Checking, and Abstract Interpretation, 10th International Conference, VMCAI 2009, Savannah, GA, USA, January 18-20, 2009. Proceedings, pp. 3, 2009, Springer, 978-3-540-93899-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
40 | Davide Frey, Rachid Guerraoui, Anne-Marie Kermarrec, Boris Koldehofe, Martin Mogensen, Maxime Monod, Vivien Quéma |
Heterogeneous Gossip. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Middleware ![In: Middleware 2009, ACM/IFIP/USENIX, 10th International Middleware Conference, Urbana, IL, USA, November 30 - December 4, 2009. Proceedings, pp. 42-61, 2009, Springer, 978-3-642-10444-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PASTE ![In: Proceedings of the 8th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, PASTE'08, Atlanta, Georgia, November 9-10, 2008, pp. 43-49, 2008, ACM, 978-1-60558-382-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
shared structures, parallelism, shape analysis |
40 | Shiro Kawai |
Efficient floating-point number handling for dynamically typed scripting languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DLS ![In: Proceedings of the 2008 Symposium on Dynamic Languages, DLS 2008, July 8, 2008, Paphos, Cyprus, pp. 6, 2008, ACM, 978-1-60558-270-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
40 | Christopher Dahn, Spiros Mancoridis |
Using Program Transformation to Secure C Programs Against Buffer Overflows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WCRE ![In: 10th Working Conference on Reverse Engineering, WCRE 2003, Victoria, Canada, November 13-16, 2003, pp. 323-333, 2003, IEEE Computer Society, 0-7695-2027-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
40 | Haim Kaplan, Nira Shafrir, Robert Endre Tarjan |
Meldable heaps and boolean union-find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 573-582, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
40 | Andrew D. Gordon 0001, Don Syme |
Typing a multi-language intermediate code. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of POPL 2001: The 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, London, UK, January 17-19, 2001, pp. 248-260, 2001, ACM, 1-58113-336-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
40 | Kenichi Asai |
Integrating Partial Evaluators into Interpreters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAIG ![In: Semantics, Applications, and Implementation of Program Generation, Second International Workshop, SAIG 2001, Florence, Italy, September 6, 2001, Proceedings, pp. 126-145, 2001, Springer, 3-540-42558-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
40 | Anthony J. H. Simons |
Borrow, Copy or Steal? Loans and Larceny in the Orthodox Canonical Form. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OOPSLA ![In: Proceedings of the 1998 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages & Applications, OOPSLA 1998, Vancouver, British Columbia, Canada, October 18-22, 1998., pp. 65-83, 1998, ACM, 1-58113-005-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LISP and Functional Programming ![In: Proceedings of the Conference on Lisp and Functional Programming, LFP 1992, San Francisco, California, USA, 22-24 June 1992., pp. 311-323, 1992, ACM, 0-89791-481-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
ML |
40 | Qin Huang, William E. Weihl |
An evaluation of concurrent priority queue algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPDP ![In: Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, SPDP 1991, 2-5 December 1991, Dallas, Texas, USA, pp. 518-525, 1991, IEEE Computer Society, 0-8186-2310-1. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
40 | Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert Endre Tarjan |
Faster Algorithms for the Shortest Path Problem ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 37(2), pp. 213-223, April 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
39 | Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa |
Parametric inference of memory requirements for garbage collected languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Proceedings of the 9th International Symposium on Memory Management, ISMM 2010, Toronto, Ontario, Canada, June 5-6, 2010, pp. 121-130, 2010, ACM, 978-1-4503-0054-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2006, Charleston, South Carolina, USA, January 11-13, 2006, pp. 115-126, 2006, ACM, 1-59593-027-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings, pp. 334-348, 2006, Springer, 3-540-35474-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASES ![In: Proceedings of the 2004 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES 2004, Washington DC, USA, September 22 - 25, 2004, pp. 280-291, 2004, ACM, 1-58113-890-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 2(4), pp. 423-429, 1991. The full citation details ...](Pics/full.jpeg) |
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 |
Displaying result #1 - #100 of 1573 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|