Sciweavers

4008 search results - page 746 / 802
» An expressive language of signatures
Sort
View
CAV
1999
Springer
119views Hardware» more  CAV 1999»
14 years 2 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
ECOOPW
1999
Springer
14 years 2 months ago
The Role of Trust Management in Distributed Systems Security
Existing authorization mechanisms fail to provide powerful and robust tools for handling security at the scale necessary for today's Internet. These mechanisms are coming unde...
Matt Blaze, Joan Feigenbaum, Angelos D. Keromytis
ANCS
2007
ACM
14 years 2 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos
ICDT
2010
ACM
180views Database» more  ICDT 2010»
14 years 2 months ago
Composing local-as-view mappings: closure and applications
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
Patricia C. Arocena, Ariel Fuxman, Renée J....
ECAI
1998
Springer
14 years 1 months ago
Description Logics with Concrete Domains and Aggregation
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
Franz Baader, Ulrike Sattler