Sciweavers

388 search results - page 63 / 78
» Guiding random test generation with program analysis
Sort
View
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
14 years 2 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert
EUROSYS
2007
ACM
14 years 22 days ago
Discrete control for safe execution of IT automation workflows
As information technology (IT) administration becomes increasingly complex, workflow technologies are gaining popularity for IT automation. Writing correct workflow programs is no...
Yin Wang, Terence Kelly, Stéphane Lafortune
FAC
2008
100views more  FAC 2008»
13 years 9 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
RV
2010
Springer
122views Hardware» more  RV 2010»
13 years 7 months ago
Clara: A Framework for Partially Evaluating Finite-State Runtime Monitors Ahead of Time
Researchers have developed a number of runtime verification tools that generate runtime monitors in the form of AspectJ aspects. In this work, we present Clara, a novel framework ...
Eric Bodden, Patrick Lam, Laurie J. Hendren
BMCBI
2006
156views more  BMCBI 2006»
13 years 9 months ago
Score-based prediction of genomic islands in prokaryotic genomes using hidden Markov models
Background: Horizontal gene transfer (HGT) is considered a strong evolutionary force shaping the content of microbial genomes in a substantial manner. It is the difference in spee...
Stephan Waack, Oliver Keller, Roman Asper, Thomas ...