Sciweavers

1182 search results - page 103 / 237
» Reducing the Overhead of Dynamic Analysis
Sort
View
135
Voted
ATVA
2007
Springer
115views Hardware» more  ATVA 2007»
15 years 9 months ago
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...
129
Voted
IPPS
2005
IEEE
15 years 9 months ago
Characterizing Secure Dynamic Web Applications Scalability
Security in the access to web contents and the interaction with web sites is becoming one of the most important issues in Internet. Servers need to provide certain levels of secur...
Jordi Guitart, Vicenç Beltran, David Carrer...
161
Voted
ESCIENCE
2006
IEEE
15 years 9 months ago
An Adaptive Algorithm for Information Dissemination in Self-Organizing Grids
Effective scheduling in large-scale computational grids is challenging because it requires tracking the dynamic state of the large number of distributed resources that comprise th...
Deger Cenk Erdil, Michael J. Lewis, Nael B. Abu-Gh...
115
Voted
CGO
2010
IEEE
15 years 7 months ago
Umbra: efficient and scalable memory shadowing
Shadow value tools use metadata to track properties of application data at the granularity of individual machine instructions. These tools provide effective means of monitoring an...
Qin Zhao, Derek Bruening, Saman P. Amarasinghe
126
Voted
IC
2000
15 years 4 months ago
Tree Delta Transcoding for Efficient Dynamic Resource Delivery on Asymmetric Internet
The paper presents a scheme for serving dynamic resources over the Internet. The method uses a combination of structured fragmentation of dynamic resources in a tree hierarchy and...
Javed I. Khan