Sciweavers

1156 search results - page 4 / 232
» Compositional Methods for Information-Hiding
Sort
View
KBSE
1997
IEEE
13 years 11 months ago
Applying Concept Formation Methods to Object Identification in Procedural Code
Legacy software systems present a high level of entropy combined with imprecise documentation. This makes their maintenance more difficult, more time consuming, and costlier. In o...
Houari A. Sahraoui, Walcélio L. Melo, Hakim...
IEEESP
2011
12 years 11 months ago
On Adversary Models and Compositional Security
We present a representative development in the science of security that includes a generic model of computer systems, their security properties and adversaries who actively interf...
Anupam Datta, Jason Franklin, Deepak Garg, Limin J...
ICIW
2007
IEEE
14 years 1 months ago
Web Service Composition Approaches: From Industrial Standards to Formal Methods
Abstract— Composition of web services is much studied to support business-to-business and enterprise application integration in e-Commerce. Current web service composition approa...
Maurice H. ter Beek, Antonio Bucchiarone, Stefania...
HIS
2009
13 years 5 months ago
An Efficient VQ-Based Data Hiding Scheme Using Voronoi Clustering
In this paper, we propose a vector quantization (VQ) -based information hiding scheme that cluster the VQ codeowrds according the codewords' relation on Voronoi Diagram (VD). ...
Ming-Ni Wu, Puu-An Juang, Yu-Chiang Li
ENTCS
2008
79views more  ENTCS 2008»
13 years 7 months ago
The Compositional Method and Regular Reachability
The compositional method, introduced by Feferman and Vaught in 1959, allows to reduce the model-checking problem for a product structure to the model-checking problem for its fact...
Ingo Felscher