ENTCS
2008
13 years 3 months ago
2008
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...
ENTCS
2008
13 years 3 months ago
2008
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 ...
ENTCS
2008
13 years 3 months ago
2008
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. ...
ENTCS
2010
13 years 3 months ago
2010
ENTCS
2008
13 years 4 months ago
2008
: 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...
ENTCS
2008
13 years 4 months ago
2008
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...
ENTCS
2008
13 years 4 months ago
2008
ENTCS
2008
13 years 4 months ago
2008
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...
ENTCS
2008
13 years 4 months ago
2008
ENTCS
2008
13 years 4 months ago
2008
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...