Sciweavers

5196 search results - page 870 / 1040
» State of Application Assessment
Sort
View
137
Voted
ICSE
1999
IEEE-ACM
15 years 8 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...
118
Voted
EUROMICRO
1998
IEEE
15 years 8 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...
HPCA
1998
IEEE
15 years 8 months ago
Hardware for Speculative Run-Time Parallelization in Distributed Shared-Memory Multiprocessors
Run-time parallelization is often the only way to execute the code in parallel when data dependence information is incomplete at compile time. This situation is common in many imp...
Ye Zhang, Lawrence Rauchwerger, Josep Torrellas
ICRA
1998
IEEE
113views Robotics» more  ICRA 1998»
15 years 8 months ago
Analysis of Frictional Contact Models for Dynamic Simulation
Simulation of dynamic systems possessing unilateral frictional contacts is important to many industrial applications. While rigid body models are often employed, it is well establ...
Peter R. Kraus, Vijay Kumar, Pierre Dupont
SAS
1999
Springer
116views Formal Methods» more  SAS 1999»
15 years 8 months ago
Decomposing Non-redundant Sharing by Complementation
Complementation, the inverse of the reduced product operation, is a technique for systemfinding minimal decompositions of abstract domains. Fil´e and Ranzato advanced the state ...
Enea Zaffanella, Patricia M. Hill, Roberto Bagnara