Sciweavers

2273 search results - page 323 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
84
Voted
ICDT
2001
ACM
131views Database» more  ICDT 2001»
15 years 2 months ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
MMMACNS
2001
Springer
15 years 2 months ago
Typed MSR: Syntax and Examples
Abstract. Many design flaws and incorrect analyses of cryptographic protoAppeared in the Proceedings of the First International Workshop on Mathematical Methods, Models and Archit...
Iliano Cervesato
POLICY
2001
Springer
15 years 2 months ago
Policy Based SLA Management in Enterprise Networks
The Differentiated Services Architecture defines the mechanisms that are needed to offer multiple classes of services in an IP network. While this model offers significant scaling ...
Dinesh C. Verma, Mandis Beigi, Raymond B. Jennings...
SIGADA
2001
Springer
15 years 2 months ago
Targeting Ada95/DSA for distributed simulation of multiprotocol communication networks
The last years have seen an increasing, albeit restricted simulation of large-scale networks on shared memory parallel platforms. As the complexity of communication protocols and ...
Dhavy Gantsou
TACAS
2001
Springer
135views Algorithms» more  TACAS 2001»
15 years 2 months ago
Implementing a Multi-valued Symbolic Model Checker
Multi-valued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dyn...
Marsha Chechik, Benet Devereux, Steve M. Easterbro...