Sciweavers

1748 search results - page 217 / 350
» Generating Data Analysis Programs from Statistical Models
Sort
View
SAC
2006
ACM
15 years 4 months ago
A probability analysis for candidate-based frequent itemset algorithms
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
Nele Dexters, Paul W. Purdom, Dirk Van Gucht
CADE
2002
Springer
15 years 10 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
QOSA
2010
Springer
15 years 1 months ago
Evaluating Maintainability with Code Metrics for Model-to-Model Transformations
Using model-to-model transformations to generate analysis models or code from architecture models is sought to promote compliance and reuse of components. The maintainability of tr...
Lucia Kapová, Thomas Goldschmidt, Steffen B...
IFIP
2004
Springer
15 years 3 months ago
Formal Analysis of a Fair Payment Protocol
We formally specify a payment protocol described in [Vogt et al., 2001]. This protocol is intended for fair exchange of time-sensitive data. Here the µCRL language is used to form...
Jan Cederquist, Muhammad Torabi Dashti
JSS
2002
101views more  JSS 2002»
14 years 9 months ago
Software requirements validation via task analysis
As a baseline for software development, a correct and complete requirements definition is one foundation of software quality. Previously, a novel approach to static testing of sof...
Hong Zhu, Lingzi Jin, Dan Diaper, Ganghong Bai