Sciweavers

1940 search results - page 53 / 388
» Dependable Software: An Oxymoron
Sort
View
TSD
2000
Springer
15 years 9 months ago
Automatic Functor Assignment in the Prague Dependency Treebank
The aim of this paper is to describe and evaluate a system that automates a part of the transition from analytical to tectogrammatical tree structures within the Prague Dependency...
Zdenek Zabokrtský
IWPC
2002
IEEE
15 years 11 months ago
Dependence-Cache Slicing: A Program Slicing Method Using Lightweight Dynamic Information
When we try to debug or to comprehend a large program, it is important to separate suspicious program portions from the overall source program. Program slicing is a promising tech...
Tomonori Takada, Fumiaki Ohata, Katsuro Inoue
CSCW
2000
ACM
15 years 10 months ago
Distance, dependencies, and delay in a global collaboration
Collaborations over distance must contend with the loss of the rich, subtle interactions that co-located teams use to coordinate their work. Previous research has suggested that o...
James D. Herbsleb, Audris Mockus, Thomas A. Finhol...
COMPSAC
2004
IEEE
15 years 10 months ago
Services-Oriented Dynamic Reconfiguration Framework for Dependable Distributed Computing
Web services (WS) received significant attention recently because services can be searched, bound, and executed at runtime over the Internet. This paper proposes a dynamic reconfi...
Wei-Tek Tsai, Weiwei Song, Raymond A. Paul, Zhibin...
CGO
2006
IEEE
15 years 9 months ago
2D-Profiling: Detecting Input-Dependent Branches with a Single Input Data Set
Static compilers use profiling to predict run-time program behavior. Generally, this requires multiple input sets to capture wide variations in run-time behavior. This is expensiv...
Hyesoon Kim, M. Aater Suleman, Onur Mutlu, Yale N....