Sciweavers

592 search results - page 42 / 119
» Can Component Service-Based Systems Be Proved Correct
Sort
View
ESSOS
2009
Springer
13 years 11 months ago
Pattern-Based Confidentiality-Preserving Refinement
Abstract. We present an approach to security requirements engineering, which makes use of special kinds of problem frames that serve to structure, characterize, analyze, and solve ...
Holger Schmidt
ICCS
2007
Springer
13 years 11 months ago
Formal Verification of Analog and Mixed Signal Designs in Mathematica
In this paper, we show how symbolic algebra in Mathematica can be used to formally verify analog and mixed signal designs. The verification methodology is based on combining induct...
Mohamed H. Zaki, Ghiath Al Sammane, Sofiène...
TCAD
2008
181views more  TCAD 2008»
13 years 7 months ago
A Survey of Automated Techniques for Formal Software Verification
The quality and the correctness of software is often the greatest concern in electronic systems. Formal verification tools can provide a guarantee that a design is free of specific...
Vijay D'Silva, Daniel Kroening, Georg Weissenbache...
ICDE
2006
IEEE
193views Database» more  ICDE 2006»
14 years 9 months ago
Probabilistic Message Passing in Peer Data Management Systems
Until recently, most data integration techniques involved central components, e.g., global schemas, to enable transparent access to heterogeneous databases. Today, however, with t...
Philippe Cudré-Mauroux, Karl Aberer, Andras...
P2P
2006
IEEE
130views Communications» more  P2P 2006»
14 years 1 months ago
The Effect of Replica Placement on Routing Robustness in Distributed Hash Tables
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...
Cyrus Harvesf, Douglas M. Blough