Sciweavers

522 search results - page 84 / 105
» Real-time Logics: Complexity and Expressiveness
Sort
View
CHARME
2005
Springer
122views Hardware» more  CHARME 2005»
14 years 2 months ago
Regular Vacuity
The application of model-checking tools to complex systems involves a nontrivial step of modelling the system by a finite-state model and a translation of the desired properties i...
Doron Bustan, Alon Flaisher, Orna Grumberg, Orna K...
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 8 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
GPCE
2009
Springer
13 years 11 months ago
Mapping problem-space to solution-space features: a feature interaction approach
Mapping problem-space features into solution-space features is a fundamental configuration problem in software product line engineering. A configuration problem is defined as g...
Frans Sanen, Eddy Truyen, Wouter Joosen
KR
2010
Springer
14 years 1 months ago
Worst-Case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
Magdalena Ortiz, Sebastian Rudolph, Mantas Simkus
DSN
2002
IEEE
14 years 1 months ago
Model Checking Performability Properties
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a...
Boudewijn R. Haverkort, Lucia Cloth, Holger Herman...