Sciweavers

977 search results - page 191 / 196
» Logic programming with infinite sets
Sort
View
WWW
2008
ACM
14 years 8 months ago
Extending the compatibility notion for abstract WS-BPEL processes
WS-BPEL Processes Dieter K?nig IBM B?blingen Laboratory Sch?naicher Stra?e 220, 71032 B?blingen, Germany dieterkoenig@de.ibm.com Niels Lohmann Universit?t Rostock, Institut f?r Inf...
Dieter König, Niels Lohmann, Simon Moser, Chr...
ICLP
2004
Springer
14 years 22 days ago
Applying CLP to Predict Extra-Functional Properties of Component-Based Models
A component is the basic re-usable unit of composition to build composite systems by connecting to others through their provided and required ports. Checking the functional complia...
Olivier Defour, Jean-Marc Jézéquel, ...
CF
2010
ACM
14 years 13 days ago
Interval-based models for run-time DVFS orchestration in superscalar processors
We develop two simple interval-based models for dynamic superscalar processors. These models allow us to: i) predict with great accuracy performance and power consumption under va...
Georgios Keramidas, Vasileios Spiliopoulos, Stefan...
SCP
2010
155views more  SCP 2010»
13 years 5 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
WWW
2008
ACM
14 years 8 months ago
Computing minimum cost diagnoses to repair populated DL-based ontologies
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
Jianfeng Du, Yi-Dong Shen