86 search results - page 12 / 18 » A toolset for automated failure analysis |
LOPSTR
1994
Springer
15 years 1 months ago
1994
Springer
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
181
click to vote
POPL
2008
ACM
15 years 10 months ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
BTW
2007
Springer
15 years 3 months ago
2007
Springer
Abstract: With information infrastructures getting more and more complex, it becomes necessary to give automated support for managing the evolution of the infrastructure. If change...
ACL
2001
14 years 11 months ago
2001
We present a machine learning approach to evaluating the wellformedness of output of a machine translation system, using classifiers that learn to distinguish human reference tran...
DSN
2002
IEEE
15 years 2 months ago
2002
IEEE
Traditional problem determination techniques rely on static dependency models that are difficult to generate accurately in today’s large, distributed, and dynamic application e...