Sciweavers

592 search results - page 65 / 119
» Can Component Service-Based Systems Be Proved Correct
Sort
View
EUROPAR
2007
Springer
14 years 1 months ago
Asynchronous Distributed Power Iteration with Gossip-Based Normalization
The dominant eigenvector of matrices defined by weighted links in overlay networks plays an important role in many peer-to-peer applications. Examples include trust management, im...
Márk Jelasity, Geoffrey Canright, Kenth Eng...
ESOP
2005
Springer
14 years 1 months ago
A New Foundation for Control-Dependence and Slicing for Modern Program Structures
The notion of control dependence underlies many program analysis and transformation techniques used in numerous applications. Despite wide application, existing definitions and ap...
Venkatesh Prasad Ranganath, Torben Amtoft, Anindya...
HPDC
1998
IEEE
13 years 12 months ago
A Fault Detection Service for Wide Area Distributed Computations
The potential for faults in distributed computing systems is a significant complicating factor for application developers. While a variety of techniques exist for detecting and co...
Paul Stelling, Ian T. Foster, Carl Kesselman, Crai...
POPL
2011
ACM
12 years 10 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
ICTAI
2000
IEEE
14 years 1 days ago
Debugging knowledge-based applications with a generic toolkit
Knowledge refinement tools assist in the debugging and maintenance of knowledge based systems (KBSs) by attempting to identify and correct faults in the knowledge that account fo...
Susan Craw, Robin Boswell