Automated assumption generation for compositional verification

Authors:
Anubhav Gupta;K. L. Mcmillan;Zhaohui Fu
Affiliations:
Cadence Design Systems, Inc., Berkeley, USA 94704;Cadence Design Systems, Inc., Berkeley, USA 94704;Cadence Design Systems, Inc., Berkeley, USA 94704
Venue:
Formal Methods in System Design
Year:
2008

Citing 12
Cited 8

Learning regular sets from queries and counterexamples

Information and Computation
Inference of finite automata using homing sequences

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Synthesis of Finite State Machines: Functional Optimization

Synthesis of Finite State Machines: Functional Optimization
Symbolic Model Checking

Symbolic Model Checking
Machine Learning

Machine Learning
Induction of Decision Trees

Machine Learning
State Reduction in Incompletely Specified Finite-State Machines

IEEE Transactions on Computers
Optimized L*-based assume-guarantee reasoning

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Learning assumptions for compositional verification

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
SAT-based compositional verification using lazy learning

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Symbolic compositional verification by learning assumptions

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
A new algorithm for exact reduction of incompletely specified finite state machines

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Inference and analysis of formal models of botnet command and control protocols

Proceedings of the 17th ACM conference on Computer and communications security
Comparing learning algorithms in automated assume-guarantee reasoning

ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Automated learning of probabilistic assumptions for compositional reasoning

FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
Controlled composition and abstraction for bottom-up integration and verification of abstract components

Information and Software Technology
Automated assume-guarantee reasoning through implicit learning

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Learning Probabilistic Systems from Tree Samples

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Synthesis of circular compositional program proofs via abduction

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Exploring the internal state of user interfaces by combining computer vision techniques with grammatical inference

Proceedings of the 2013 International Conference on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a method for computing a minimum-state automaton to act as an intermediate assertion in assume-guarantee reasoning, using a sampling approach and a Boolean satisfiability solver. For a set of synthetic benchmarks intended to mimic common situations in hardware verification, this is shown to be significantly more effective than earlier approximate methods based on Angluin's L* algorithm. For many of these benchmarks, this method also outperforms BDD-based model checking and interpolation-based model checking. We also demonstrate how domain knowledge can be incorporated into our algorithm to improve its performance.