Sciweavers

1452 search results - page 164 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
PLDI
2005
ACM
15 years 6 months ago
Automatic pool allocation: improving performance by controlling data structure layout in the heap
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
Chris Lattner, Vikram S. Adve
115
Voted
IPPS
1999
IEEE
15 years 5 months ago
Experimental Evaluation of QSM, a Simple Shared-Memory Model
Parallel programming models should attempt to satisfy two conflicting goals. On one hand, they should hide architectural details so that algorithm designers can write simple, port...
Brian Grayson, Michael Dahlin, Vijaya Ramachandran
69
Voted
GPCE
2007
Springer
15 years 4 months ago
Context-aware scanning for parsing extensible languages
This paper introduces new parsing and context-aware scanning algorithms in which the scanner uses contextual information to disambiguate lexical syntax. The parser uses a slightly...
Eric Van Wyk, August Schwerdfeger
115
Voted
TOOLS
2000
IEEE
15 years 5 months ago
Testing-for-Trust: The Genetic Selection Model Applied to Component Qualification
This paper presents a method and a tool for building trustable OO components. The methodology is based on an integrated design and test approach for OO software components. It is ...
Benoit Baudry, Vu Le Hanh, Yves Le Traon
ICSM
2002
IEEE
15 years 5 months ago
Constructing Precise Object Relation Diagrams
The Object Relation Diagram (ORD) of a program is a class interdependence diagram which has applications in a wide variety of software engineering problems (e.g., integration test...
Ana Milanova, Atanas Rountev, Barbara G. Ryder