Sciweavers

793 search results - page 138 / 159
» Protocol Modeling with Model Program Composition
Sort
View
FMSP
2000
ACM
152views Formal Methods» more  FMSP 2000»
15 years 6 months ago
Fault origin adjudication
When a program P fails to satisfy a requirement R supposedly ensured by a detailed speci cation S that was used to implement P, there is a question about whether the problem arise...
Karthikeyan Bhargavan, Carl A. Gunter, Davor Obrad...
106
Voted
WWW
2005
ACM
16 years 2 months ago
Design for verification for asynchronously communicating Web services
We present a design for verification approach to developing reliable web services. We focus on composite web services which consist of asynchronously communicating peers. Our goal...
Aysu Betin-Can, Tevfik Bultan, Xiang Fu
BMCBI
2005
126views more  BMCBI 2005»
15 years 2 months ago
GANN: Genetic algorithm neural networks for the detection of conserved combinations of features in DNA
Background: The multitude of motif detection algorithms developed to date have largely focused on the detection of patterns in primary sequence. Since sequence-dependent DNA struc...
Robert G. Beiko, Robert L. Charlebois
ICPP
2008
IEEE
15 years 8 months ago
Scalable Dynamic Load Balancing Using UPC
An asynchronous work-stealing implementation of dynamic load balance is implemented using Unified Parallel C (UPC) and evaluated using the Unbalanced Tree Search (UTS) benchmark ...
Stephen Olivier, Jan Prins
129
Voted
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
15 years 7 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi