Sciweavers

809 search results - page 105 / 162
» Requirements by Contracts allow Automated System Testing
Sort
View
DSN
2004
IEEE
15 years 3 months ago
Verifying Web Applications Using Bounded Model Checking
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
COCO
2010
Springer
186views Algorithms» more  COCO 2010»
15 years 3 months ago
Derandomized Parallel Repetition of Structured PCPs
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
Irit Dinur, Or Meir
DAC
2008
ACM
16 years 25 days ago
Study of the effects of MBUs on the reliability of a 150 nm SRAM device
1 Soft errors induced by radiation are an increasing problem in the microelectronic field. Although traditional models estimate the reliability of memories suffering Single Event U...
Juan Antonio Maestro, Pedro Reviriego
ECOWS
2007
Springer
15 years 6 months ago
Composing Services with JOLIE
Service composition and service statefulness are key concepts in Web Service system programming. In this paper we present JOLIE, which is the full implementation of our formal cal...
Fabrizio Montesi, Claudio Guidi, Gianluigi Zavatta...
GECCO
2004
Springer
116views Optimization» more  GECCO 2004»
15 years 5 months ago
A Comment on Opt-AiNET: An Immune Network Algorithm for Optimisation
Verifying the published results of algorithms is part of the usual research process. This helps to both validate the existing literature, but also quite often allows for new insigh...
Jon Timmis, Camilla Edmonds