Sciweavers

963 search results - page 5 / 193
» Escape Analysis on Lists
Sort
View
SIGSOFT
2008
ACM
15 years 10 months ago
A scalable technique for characterizing the usage of temporaries in framework-intensive Java applications
Framework-intensive applications (e.g., Web applications) heavily use temporary data structures, often resulting in performance bottlenecks. This paper presents an optimized blend...
Bruno Dufour, Barbara G. Ryder, Gary Sevitsky
CORR
2011
Springer
193views Education» more  CORR 2011»
14 years 4 months ago
A new ANEW: Evaluation of a word list for sentiment analysis in microblogs
Abstract. Sentiment analysis of microblogs such as Twitter has recently gained a fair amount of attention. One of the simplest sentiment analysis approaches compares the words of a...
Finn Årup Nielsen
AADEBUG
1997
Springer
15 years 1 months ago
Assertions for Dynamic Shape Analysis of List Data Structures
We introduce an assertion language for run-time checking of linked list data structure shapes. The assertion language is expressive enough to define characteristic predicates for ...
Mikhail Auguston, Miu Har Hon
VMCAI
2007
Springer
15 years 3 months ago
Maintaining Doubly-Linked List Invariants in Shape Analysis with Local Reasoning
Abstract. This paper presents a novel shape analysis algorithm with local reasoning that is designed to analyze heap structures with structural invariants, such y-linked lists. The...
Sigmund Cherem, Radu Rugina
MFCS
1994
Springer
15 years 1 months ago
A Competitive Analysis of the List Update Problem with Lookahead
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present re...
Susanne Albers