Sciweavers

551 search results - page 58 / 111
» Formalizing the Logic-Automaton Connection
Sort
View
SAS
1999
Springer
116views Formal Methods» more  SAS 1999»
15 years 2 months ago
Decomposing Non-redundant Sharing by Complementation
Complementation, the inverse of the reduced product operation, is a technique for systemfinding minimal decompositions of abstract domains. Fil´e and Ranzato advanced the state ...
Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
RTSS
1997
IEEE
15 years 2 months ago
Static priority scheduling for ATM networks
Static-priority scheduling is popular for traffic scheduling in ATM switches because it is less costly than dynamic priority scheduling while being sensitive to the delay constra...
Chengzhi Li, Riccardo Bettati, Wei Zhao
IMPERIAL
1993
15 years 1 months ago
Deriving Category Theory from Type Theory
This work expounds the notion that (structured) categories are syntax free presentations of type theories, and shows some of the ideas involved in deriving categorical semantics f...
Roy L. Crole
KR
1994
Springer
15 years 1 months ago
An Ontology of Meta-Level Categories
We focus in this paper on some meta-level ontological distinctions among unary predicates, like those between concepts and assertional properties. Three are the main contributions...
Nicola Guarino, Massimiliano Carrara, Pierdaniele ...
EUC
2006
Springer
15 years 1 months ago
Scalable Message Routing for Mobile Software Assistants
In this paper we define an algorithm for location-independent communication of mobile software Personal Assistants (PAs). The algorithm extends the Query Server with Caching algor...
Pawel T. Wojciechowski