Sciweavers

Share
ENTCS
2008
97views more  ENTCS 2008»
8 years 8 months ago
Coordination Models Orc and Reo Compared
Orc and Reo are two complementary approaches to the problem of coordinating components or services. On one hand, Orc is highly asynchronous, naturally dynamic, and based on epheme...
José Proença, Dave Clarke
ENTCS
2008
97views more  ENTCS 2008»
8 years 8 months ago
Performance of Reactive Interfaces in Stimulus Rich Environments, Applying Formal Methods and Cognitive Frameworks
Previous research has developed a formal methods-based (cognitive-level) model of the Interacting Cognitive Subsystems central engine, with which we have simulated attentional cap...
Li Su, Howard Bowman, Philip Barnard
ENTCS
2008
94views more  ENTCS 2008»
8 years 8 months ago
On the Convergence of Reduction-based and Model-based Methods in Proof Theory
In the recent past, the reduction-based and the model-based methods to prove cut elimination have converged, so that they now appear just as two sides of the same coin. This paper...
Gilles Dowek
ENTCS
2008
390views more  ENTCS 2008»
8 years 8 months ago
Cryptographic Versus Trust-based Methods for MANET Routing Security
Mobile Ad-hoc Networks (MANETs) allow wireless nodes to form a network without requiring a fixed infrastructure. Early routing protocols for MANETs failed to take security issues ...
Jared Cordasco, Susanne Wetzel
ENTCS
2008
118views more  ENTCS 2008»
8 years 8 months ago
Shared Hash Tables in Parallel Model Checking
In light of recent shift towards shared-memory systems in parallel explicit model checking, we explore relative advantages and disadvantages of shared versus private hash tables. ...
Jiri Barnat, Petr Rockai
ENTCS
2008
98views more  ENTCS 2008»
8 years 9 months ago
On Finite-time Computability Preserving Conversions
: A finite-time computable function is a partial function from to whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computabili...
Hideki Tsuiki, Shuji Yamada
ENTCS
2008
124views more  ENTCS 2008»
8 years 9 months ago
Stability for Effective Algebras
We give a general method for showing that all numberings of certain effective algebras are recursively equivalent. The method is based on computable approximation-limit pairs. The...
Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tuc...
ENTCS
2008
120views more  ENTCS 2008»
8 years 9 months ago
Characterizing Computable Analysis with Differential Equations
Manuel Lameiras Campagnolo, Kerry Ojakian
ENTCS
2008
144views more  ENTCS 2008»
8 years 9 months ago
Platform Independent Timing of Java Virtual Machine Bytecode Instructions
The accurate measurement of the execution time of Java bytecode is one factor that is important in order to estimate the total execution time of a Java application running on a Ja...
Jonathan M. Lambert, James F. Power
books