Sciweavers

592 search results - page 75 / 119
» Can Component Service-Based Systems Be Proved Correct
Sort
View
ECBS
2009
IEEE
130views Hardware» more  ECBS 2009»
14 years 2 months ago
Validating and Dynamically Adapting and Composing Features in Concurrent Product-Lines Applications
With the pressing in-time-market towards customized services, software product lines (SPL) are increasingly characterizing most of software landscape. SPL are mainly structured th...
Nasreddine Aoumeur, Kamel Barkaoui, Gunter Saake
ICDCS
2002
IEEE
14 years 19 days ago
From Total Order to Database Replication
This paper presents in detail an efficient and provably correct algorithm for database replication over partitionable networks. Our algorithm avoids the need for end-toend acknow...
Yair Amir, Ciprian Tutu
DLOG
1996
13 years 9 months ago
Using Description Logics for Consistency-based Diagnosis
Using quantitative models of simple mechanisms as an example domain, we show how the basic principles of consistency-based diagnosis can be implemented using description logics wi...
Gerd Kamp, Holger Wache
INTERSPEECH
2010
13 years 2 months ago
Chirp complex cepstrum-based decomposition for asynchronous glottal analysis
It was recently shown that complex cepstrum can be effectively used for glottal flow estimation by separating the causal and anticausal components of speech. In order to guarantee...
Thomas Drugman, Thierry Dutoit
FSTTCS
2003
Springer
14 years 27 days ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh