1302 search results - page 55 / 261 » Fair Equivalence Relations |
JLP
2010
13 years 7 months ago
2010
Abstract. ComputationalsystemsareoftenrepresentedbymeansofKripkestructures, and related using simulations. We propose rewriting logic as a flexible and executable framework in whi...
ALGORITHMICA
2002
13 years 9 months ago
2002
In this paper we introduce a generalization of Paging to the case where there are many threads of requests. This models situations in which the requests come from more than one ind...
TC
2008
13 years 9 months ago
2008
Synchronous systems offer clean semantics and an easy verification path at the expense of often inefficient implementations. Capturing design specifications as synchronous models a...
CSL
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. We study a weakening of the notion of logical relations, called prelogical relations, that has many of the features that make logical relations so useful but having furth...
DBPL
2007
Springer
14 years 3 months ago
2007
Springer
Annotated relational databases can be queried either by simply making the annotations explicitly available along the ordinary data, or by adapting the standard query operators so ...