Sciweavers

877 search results - page 54 / 176
» Full Abstraction for HOPLA
Sort
View
CAV
2010
Springer
172views Hardware» more  CAV 2010»
13 years 11 months ago
Symbolic Bounded Synthesis
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...
Rüdiger Ehlers
FC
2007
Springer
105views Cryptology» more  FC 2007»
13 years 11 months ago
Space-Efficient Private Search with Applications to Rateless Codes
Abstract. Private keyword search is a technique that allows for searching and retrieving documents matching certain keywords without revealing the search criteria. We improve the s...
George Danezis, Claudia Díaz
ICC
2007
IEEE
150views Communications» more  ICC 2007»
13 years 11 months ago
Fast Proactive Recovery from Concurrent Failures
Abstract-- Recovery of traffic in connectionless pure IP networks has traditionally been handled by a full re-convergence of the network state. This process operates in a time scal...
Audun Fosselie Hansen, Olav Lysne, Tarik Cicic, St...
ADBIS
2006
Springer
135views Database» more  ADBIS 2006»
13 years 11 months ago
Interactive Discovery and Composition of Complex Web Services
Among the most important expected benefits of a global service oriented architecture leveraging web service standards is an increased level of automation in the discovery, composit...
Sergey A. Stupnikov, Leonid A. Kalinichenko, St&ea...
CSMR
2004
IEEE
13 years 11 months ago
Tool Support for Traceable Product Evolution
In software product families, the full benefit of reuse can only be achieved if traceability of requirements to architecture, components and further down to source code is support...
Patricia Lago, Eila Niemelä, Hans van Vliet