Sciweavers

2719 search results - page 396 / 544
» Exposing Application Alternatives
Sort
View
ESEC
1999
Springer
15 years 10 months ago
Data-Flow Analysis of Program Fragments
Traditional interprocedural data-flow analysis is performed on whole programs; however, such whole-program analysis is not feasible for large or incomplete programs. We propose fr...
Atanas Rountev, Barbara G. Ryder, William Landi
ICSE
1999
IEEE-ACM
15 years 10 months ago
Dynamically Discovering Likely Program Invariants to Support Program Evolution
ÐExplicitly stated program invariants can help programmers by identifying program properties that must be preserved when modifying code. In practice, however, these invariants are...
Michael D. Ernst, Jake Cockrell, William G. Griswo...
EUROMICRO
1998
IEEE
15 years 10 months ago
SMP PCs: A Case Study on Cluster Computing
As commodity microprocessors and networks reach performance levels comparable to those used in massively parallel processors, clusters of symmetric multiprocessors are starting to...
Antônio Augusto Fröhlich, Wolfgang Schr...
ISHPC
1999
Springer
15 years 10 months ago
Dynamically Adaptive Parallel Programs
Abstract. Dynamic program optimization is the only recourse for optimizing compilers when machine and program parameters necessary for applying an optimization technique are unknow...
Michael Voss, Rudolf Eigenmann
LPNMR
1999
Springer
15 years 10 months ago
On the Role of Negation in Choice Logic Programs
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
Marina De Vos, Dirk Vermeir