Sciweavers

13 search results - page 1 / 3
» Automatic symbolic compositional verification by learning as...
Sort
View
FMSD
2008
110views more  FMSD 2008»
13 years 4 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
ATVA
2006
Springer
153views Hardware» more  ATVA 2006»
13 years 8 months ago
Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically bas...
Wonhong Nam, Rajeev Alur
CAV
2007
Springer
164views Hardware» more  CAV 2007»
13 years 8 months ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke
FASE
2011
Springer
12 years 8 months ago
Automated Learning of Probabilistic Assumptions for Compositional Reasoning
Probabilistic verification techniques have been applied to the formal modelling and analysis of a wide range of systems, from communication protocols such as Bluetooth, to nanosca...
Lu Feng, Marta Z. Kwiatkowska, David Parker
CADE
2006
Springer
14 years 5 months ago
Inferring Network Invariants Automatically
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...
Olga Grinchtein, Martin Leucker, Nir Piterman