Sciweavers

4716 search results - page 727 / 944
» Iterative-free program analysis
Sort
View
TON
2010
119views more  TON 2010»
15 years 3 months ago
Thwarting zero-day polymorphic worms with network-level length-based signature generation
—It is crucial to detect zero-day polymorphic worms and to generate signatures at network gateways or honeynets so that we can prevent worms from propagating at their early phase...
Lanjia Wang, Zhichun Li, Yan Chen, Zhi Fu, Xing Li
TPLP
2010
102views more  TPLP 2010»
15 years 3 months ago
As time goes by: Constraint Handling Rules
Constraint Handling Rules (CHR) is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers,...
Jon Sneyers, Peter Van Weert, Tom Schrijvers, Lesl...
LPAR
2010
Springer
15 years 2 months ago
Interpolating Quantifier-Free Presburger Arithmetic
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...
Daniel Kroening, Jérôme Leroux, Phili...
SIGSOFT
2010
ACM
15 years 2 months ago
Separation of concerns for dependable software design
For `mixed-criticality' systems that have both critical and non-critical functions, the greatest leverage on dependability may be at the design level. By designing so that ea...
Daniel Jackson, Eunsuk Kang
TAP
2010
Springer
145views Hardware» more  TAP 2010»
15 years 2 months ago
QuickSpec: Guessing Formal Specifications Using Testing
We present QuickSpec, a tool that automatically generates algebraic specifications for sets of pure functions. The tool is based on testing, rather than static analysis or theorem ...
Koen Claessen, Nicholas Smallbone, John Hughes