Sciweavers

2214 search results - page 178 / 443
» Complexity of Reasoning
Sort
View
115
Voted
ENTCS
2007
129views more  ENTCS 2007»
15 years 3 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...
124
Voted
COORDINATION
2004
Springer
15 years 9 months ago
Optimistic Concurrency Semantics for Transactions in Coordination Languages
There has been significant recent interest in exploring the role of coordination languages as middleware for distributed systems. These languages provide operations that allow pro...
Suresh Jagannathan, Jan Vitek
130
Voted
MM
2006
ACM
293views Multimedia» more  MM 2006»
15 years 9 months ago
Automatic annotation and semantic retrieval of video sequences using multimedia ontologies
Effective usage of multimedia digital libraries has to deal with the problem of building efficient content annotation and retrieval tools. MOM (Multimedia Ontology Manager) is a ...
Marco Bertini, Alberto Del Bimbo, Carlo Torniai
141
Voted
FORMATS
2006
Springer
15 years 7 months ago
Symbolic Robustness Analysis of Timed Automata
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
Conrado Daws, Piotr Kordy
DAC
1994
ACM
15 years 7 months ago
New Techniques for Efficient Verification with Implicitly Conjoined BDDs
-- In previous work, Hu and Dill identified a common cause of BDD-size blowup in high-level design verification and proposed the method of implicitly conjoined invariants to addres...
Alan J. Hu, Gary York, David L. Dill