Sciweavers

2206 search results - page 109 / 442
» On the power of coercion abstraction
Sort
View
PODC
1987
ACM
14 years 1 months ago
Hierarchical Correctness Proofs for Distributed Algorithms
Abstract: We introduce the input-output automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular...
Nancy A. Lynch, Mark R. Tuttle
APN
2008
Springer
14 years 2 days ago
A Monitoring Toolset for Paose
Abstract Paose (Petri net-based Agent-Oriented Software Engineering) combines the paradigm of AOSE (Agent-Oriented Software Engineering, see [10]) with the expressive power of Petr...
Lawrence Cabac, Till Dörges, Heiko Rölke
FLOPS
2008
Springer
13 years 11 months ago
EasyCheck - Test Data for Free
Abstract. We present a lightweight, automated tool for specificationbased testing of declarative programs written in the functional logic programming language Curry and emphasize t...
Jan Christiansen, Sebastian Fischer
FLOPS
2008
Springer
13 years 11 months ago
A Generalization of the Folding Rule for the Clark-Kunen Semantics
Abstract. In this paper, we propose more flexible applicability conditions for the folding rule that increase the power of existing unfold/fold systems for normal logic programs. O...
Javier Álvez, Paqui Lucio
BPSC
2007
202views Business» more  BPSC 2007»
13 years 11 months ago
Towards Autonomic Processes and Services
More than ever, computing devices are becoming more powerful and networked, organizational boundaries are dissolving, and underlying information systems become more complex, thus r...
Schahram Dustdar