30 search results - page 6 / 6 » Predicate Abstraction with Under-approximation Refinement |
TSE
2011
13 years 5 days ago
2011
—Conventional testing methods often fail to detect hidden flaws in complex embedded software such as device drivers or file systems. This deficiency incurs significant developmen...
IFM
1999
Springer
13 years 9 months ago
1999
Springer
: Some of the shortcomings of using refinement alone as the means of passing from high level simple models to actual detailed implementations are reviewed. Retrenchment is presente...
APLAS
2010
ACM
13 years 5 months ago
2010
ACM
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
EDBT
2002
ACM
14 years 5 months ago
2002
ACM
Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimi...