Sciweavers

310 search results - page 31 / 62
» Sound and complete models of contracts
Sort
View
SARA
2007
Springer
14 years 3 months ago
Approximate Model-Based Diagnosis Using Greedy Stochastic Search
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
JUCS
2008
158views more  JUCS 2008»
13 years 9 months ago
Algebraic Laws for Feature Models
: Software Product Lines (SPL) may be adopted by either bootstrapping existing software products into a SPL, or extending an existing SPL to encompass an additional software produc...
Rohit Gheyi, Tiago Massoni, Paulo Borba
DATE
2006
IEEE
83views Hardware» more  DATE 2006»
14 years 3 months ago
What lies between design intent coverage and model checking?
Practitioners of formal property verification often work around the capacity limitations of formal verification tools by breaking down properties into smaller properties that ca...
Sayantan Das, Prasenjit Basu, Pallab Dasgupta, P. ...
PODS
2003
ACM
114views Database» more  PODS 2003»
14 years 9 months ago
Soft stratification for magic set based query evaluation in deductive databases
In this paper we propose a new bottom-up query evaluation method for stratified deductive databases based on the Magic Set approach. As the Magic Sets rewriting may lead to unstra...
Andreas Behrend
APN
2009
Springer
14 years 3 months ago
Compositional Service Trees
In the world of Service Oriented Architectures, one deals with networks of cooperating components. A component offers services; to deliver a service it possibly needs services of ...
Wil M. P. van der Aalst, Kees M. van Hee, Peter Ma...