Sciweavers

1001 search results - page 192 / 201
» Testing Formal Dialectic
Sort
View
CAV
2006
Springer
165views Hardware» more  CAV 2006»
13 years 11 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...
DSN
2004
IEEE
13 years 11 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...
ACSAC
2001
IEEE
13 years 11 months ago
Practical Automated Filter Generation to Explicitly Enforce Implicit Input Assumptions
Vulnerabilities in distributed applications are being uncovered and exploited faster than software engineers can patch the security holes. All too often these weaknesses result fr...
Valentin Razmov, Daniel R. Simon
ISSTA
2010
ACM
13 years 11 months ago
Strict control dependence and its effect on dynamic information flow analyses
Program control dependence has substantial impact on applications such as dynamic information flow tracking and data lineage tracing (a technique tracking the set of inputs that ...
Tao Bao, Yunhui Zheng, Zhiqiang Lin, Xiangyu Zhang...
DAC
2010
ACM
13 years 11 months ago
Scalable specification mining for verification and diagnosis
Effective system verification requires good specifications. The lack of sufficient specifications can lead to misses of critical bugs, design re-spins, and time-to-market slips. I...
Wenchao Li, Alessandro Forin, Sanjit A. Seshia