Sciweavers

3909 search results - page 562 / 782
» Extreme Model Checking
Sort
View
AMC
2008
106views more  AMC 2008»
15 years 6 months ago
A non-binary constraint ordering heuristic for constraint satisfaction problems
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
Miguel A. Salido
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 6 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...
CORR
2010
Springer
71views Education» more  CORR 2010»
15 years 6 months ago
Sampled Semantics of Timed Automata
Sampled semantics of timed automata is a nite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems ed granularity of ti...
Parosh Aziz Abdulla, Pavel Krcál, Wang Yi
172
Voted
ENTCS
2010
165views more  ENTCS 2010»
15 years 6 months ago
Correct Execution of Reconfiguration for Stateful Components
In component-based software engineering, reconfiguration describes structural changes to the architecture of a component system. For stateful components, not only structural but a...
Moritz Hammer, Alexander Knapp
157
Voted
ECEASST
2008
60views more  ECEASST 2008»
15 years 6 months ago
Sufficient Criteria for Applicability and Non-Applicability of Rule Sequences
Abstract: In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence...
Leen Lambers, Hartmut Ehrig, Gabriele Taentzer