9 search results - page 2 / 2 » SAT-Based Compositional Verification Using Lazy Learning |
ATVA
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically bas...
FASE
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. We present a novel algorithm for interface generation of software components. Given a component, our algorithm uses learning techniques to compute a permissive interface ...
CADE
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
ISAMI
2010
13 years 3 months ago
2010
Probabilistic models of languages are fundamental to understand and learn the profile of the subjacent code in order to estimate its entropy, enabling the verification and predicti...