Sciweavers

1541 search results - page 187 / 309
» Tools and Techniques for Model Checking Networked Programs
Sort
View
ASIACRYPT
2010
Springer
15 years 2 months ago
Random Oracles with(out) Programmability
This paper investigates the Random Oracle Model (ROM) feature known as programmability, which allows security reductions in the ROM to dynamically choose the range points of an ide...
Marc Fischlin, Anja Lehmann, Thomas Ristenpart, Th...
IDEAL
2005
Springer
15 years 10 months ago
Identification of Anomalous SNMP Situations Using a Cooperative Connectionist Exploratory Projection Pursuit Model
Abstract. The work presented in this paper shows the capability of a connectionist model, based on a statistical technique called Exploratory Projection Pursuit (EPP), to identify ...
Álvaro Herrero, Emilio Corchado, José...
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
15 years 11 months ago
Verifying Reference Counting Implementations
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Ma...
WWW
2004
ACM
16 years 5 months ago
Analysis of interacting BPEL web services
This paper presents a set of tools and techniques for analyzing interactions of composite web services which are specified in BPEL and communicate through asynchronous XML message...
Xiang Fu, Tevfik Bultan, Jianwen Su
TNN
2010
182views Management» more  TNN 2010»
14 years 11 months ago
A discrete-time neural network for optimization problems with hybrid constraints
Abstract--Recurrent neural networks have become a prominent tool for optimizations including linear or nonlinear variational inequalities and programming, due to its regular mathem...
Huajin Tang, Haizhou Li, Zhang Yi