Sciweavers

509 search results - page 41 / 102
» On the completeness of compositional reasoning methods
Sort
View
FM
2009
Springer
164views Formal Methods» more  FM 2009»
14 years 3 months ago
The Denotational Semantics of slotted-Circus
This paper describes a complete denotational semantics, in the UTP framework, of slotted-Circus, a generic framework for reasoning about discrete timed/synchronously clocked system...
Pawel Gancarski, Andrew Butterfield
ICLP
2005
Springer
14 years 2 months ago
Modeling Systems in CLP
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
ANSS
2007
IEEE
14 years 3 months ago
Failure Prediction in Computational Grids
Accurate failure prediction in Grids is critical for reasoning about QoS guarantees such as job completion time and availability. Statistical methods can be used but they suffer f...
Woochul Kang, Andrew S. Grimshaw
DLOG
2007
13 years 11 months ago
Contextualization of a DL Knowledge Base
Abstract. In the paper we propose a method of structuring a knowledge base into hierarchically related contexts and present how this arrangement influences the structure of TBox a...
Krzysztof Goczyla, Wojciech Waloszek, Aleksander W...
CADE
2009
Springer
14 years 9 months ago
Beyond Dependency Graphs
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
Martin Korp, Aart Middeldorp