Sciweavers

503 search results - page 56 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
SIGSOFT
2004
ACM
15 years 10 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
ICSOC
2009
Springer
14 years 7 months ago
An Initial Proposal for Data-Aware Resource Analysis of Orchestrations with Applications to Predictive Monitoring
Several activities in service oriented computing can benefit from knowing ahead of time future properties of a given service composition. In this paper we focus on how statically i...
Dragan Ivanovic, Manuel Carro, Manuel V. Hermenegi...
TACAS
1998
Springer
81views Algorithms» more  TACAS 1998»
15 years 2 months ago
Formal Design and Analysis of a Gear Controller
In this paper, we report on an application of the validation and veri cation tool kit Uppaal in the design and analysis of a prototype gear controller, carried out in a joint proje...
Magnus Lindahl, Paul Pettersson, Wang Yi
JMLR
2002
74views more  JMLR 2002»
14 years 9 months ago
The Representational Power of Discrete Bayesian Networks
One of the most important fundamental properties of Bayesian networks is the representational power, reflecting what kind of functions they can or cannot represent. In this paper,...
Charles X. Ling, Huajie Zhang
LATIN
2004
Springer
15 years 3 months ago
Bidimensional Parameters and Local Treewidth
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...