Sciweavers

4469 search results - page 710 / 894
» Dynamic Program Slicing
Sort
View
113
Voted
ICST
2009
IEEE
15 years 5 months ago
Transforming and Selecting Functional Test Cases for Security Policy Testing
In this paper, we consider typical applications in which the business logic is separated from the access control logic, implemented in an independent component, called the Policy ...
Tejeddine Mouelhi, Yves Le Traon, Benoit Baudry
96
Voted
IEEECIT
2009
IEEE
15 years 5 months ago
SLA-Aware Virtual Resource Management for Cloud Infrastructures
Cloud platforms host several independent applications on a shared resource pool with the ability to allocate computing power to applications on a per-demand basis. The use of serv...
Hien Nguyen Van, Frédéric Dang Tran,...
80
Voted
IPPS
2009
IEEE
15 years 5 months ago
High-level estimation and trade-off analysis for adaptive real-time systems
We propose a novel design estimation method for adaptive streaming applications to be implemented on a partially reconfigurable FPGA. Based on experimental results we enable accu...
Ingo Sander, Jun Zhu, Axel Jantsch, Andreas Herrho...
60
Voted
IWPC
2009
IEEE
15 years 5 months ago
BugFix: A learning-based tool to assist developers in fixing bugs
We present a tool called BugFix that can assist developers in fixing program bugs. Our tool automatically analyzes the debugging situation at a statement and reports a prioritize...
Dennis Jeffrey, Min Feng, Neelam Gupta, Rajiv Gupt...
103
Voted
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 5 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith