852 search results - page 44 / 171 » entcs 2010 |
ENTCS
2002
14 years 10 months ago
2002
Abstract Stephen L. Bloom Department of Computer Science Stevens Institute of Technology Hoboken, NJ 07030 and Zolt
ENTCS
2002
14 years 10 months ago
2002
Approaches to runtime checking have to track the execution of a software system and therefore have to deal with generating and processing execution events. Often these techniques ...
ENTCS
1998
14 years 10 months ago
1998
We present two ways to de ne covarieties and complete covarieties, i.e. covarieties that are closed under total bisimulation: by closure operators and by subcoalgebras of coalgebr...
ENTCS
2007
14 years 10 months ago
2007
We show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair.
ENTCS
2008
14 years 9 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...