Sciweavers

3676 search results - page 605 / 736
» Scalable component abstractions
Sort
View
108
Voted
CAV
2007
Springer
164views Hardware» more  CAV 2007»
15 years 4 months ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke
CIARP
2007
Springer
15 years 4 months ago
Bagging with Asymmetric Costs for Misclassified and Correctly Classified Examples
Abstract. Diversity is a key characteristic to obtain advantages of combining predictors. In this paper, we propose a modification of bagging to explicitly trade off diversity and ...
Ricardo Ñanculef, Carlos Valle, Héct...
116
Voted
EUROPAR
2007
Springer
15 years 4 months ago
Domain-Specific Optimization Strategy for Skeleton Programs
Skeletal parallel programming enables us to develop parallel programs easily by composing ready-made components called skeletons. However, a simplycomposed skeleton program often l...
Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Mas...
110
Voted
SAT
2010
Springer
158views Hardware» more  SAT 2010»
15 years 4 months ago
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
Dave A. D. Tompkins, Holger H. Hoos
FCT
2007
Springer
15 years 4 months ago
Local Testing of Message Sequence Charts Is Difficult
Abstract. Message sequence charts are an attractive formalism for specifying communicating systems. One way to test such a system is to substitute a component by a test process and...
Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. N...