Sciweavers

357 search results - page 59 / 72
» Specifying and Verifying Fault-Tolerant Systems
Sort
View
INTERNET
2006
144views more  INTERNET 2006»
13 years 7 months ago
Analyzing Conversations of Web Services
A conversation is the global sequence of messages exchanged among the components of a distributed system. Conversations provide a promising model for specifying and analyzing the ...
Tevfik Bultan, Jianwen Su, Xiang Fu
JUCS
2006
104views more  JUCS 2006»
13 years 7 months ago
Introducing the ITP Tool: a Tutorial
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
Manuel Clavel, Miguel Palomino, Adrián Ries...
KI
2006
Springer
13 years 7 months ago
Agent Logics as Program Logics: Grounding KARO
Abstract. Several options are available to relate agent logics to computational agent systems. Among others, one can try to find useful executable fragments of an agent logic or us...
Koen V. Hindriks, John-Jules Ch. Meyer
FUIN
2007
110views more  FUIN 2007»
13 years 7 months ago
Controllable Delay-Insensitive Processes
Abstract. Josephs and Udding’s DI-Algebra offers a convenient way of specifying and verifying designs that must rely upon delay-insensitive signalling between modules (asynchrono...
Mark B. Josephs, Hemangee K. Kapoor
TOG
2002
123views more  TOG 2002»
13 years 7 months ago
A user interface for interactive cinematic shadow design
Placing shadows is difficult task since shadows depend on the relative positions of lights and objects in an unintuitive manner. To simplify the task of the modeler, we present a ...
Fabio Pellacini, Parag Tole, Donald P. Greenberg