Automatic symbolic compositional verification by learning assumptions

Authors:
Wonhong Nam;P. Madhusudan;Rajeev Alur
Affiliations:
Pennsylvania State University, University Park, USA;University of Illinois, Urbana-Champaign, USA;University of Pennsylvania, Philadelphia, USA
Venue:
Formal Methods in System Design
Year:
2008

Citing 36
Cited 9

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Learning regular sets from queries and counterexamples

Information and Computation
In transition from global to modular temporal reasoning about programs

Logics and models of concurrent systems
Learning regular languages from counterexamples

Journal of Computer and System Sciences
Model checking and modular verification

ACM Transactions on Programming Languages and Systems (TOPLAS)
Inference of finite automata using homing sequences

Information and Computation
Computer-aided verification of coordinating processes: the automata-theoretic approach

Computer-aided verification of coordinating processes: the automata-theoretic approach
An introduction to computational learning theory

An introduction to computational learning theory
Conjoining specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Multilevel hypergraph partitioning: applications in VLSI domain

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Multilevel k-way hypergraph partitioning

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Reactive Modules

Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Learning Deterministic Finite Automata from Smallest Counterexamples

SIAM Journal on Discrete Mathematics
A Proof Technique for Rely/Guarantee Properties

Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
A Compositional Rule for Hardware Design Refinement

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
MOCHA: Modularity in Model Checking

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
You Assume, We Guarantee: Methodology and Case Studies

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Counterexample-Guided Abstraction Refinement

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
On the Competeness of Compositional Reasoning

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Applying SAT Methods in Unbounded Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Black box checking

Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
Assumption Generation for Software Component Verification

Proceedings of the 17th IEEE international conference on Automated software engineering
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference
Synthesis of interface specifications for Java classes

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Breaking up is hard to do: an investigation of decomposition for assume-guarantee reasoning

Proceedings of the 2006 international symposium on Software testing and analysis
Proofs of Networks of Processes

IEEE Transactions on Software Engineering
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
Automated assumption generation for compositional verification

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Dynamic component substitutability analysis

FM'05 Proceedings of the 2005 international conference on Formal Methods
LEVER: a tool for learning based verification

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Symbolic compositional verification by learning assumptions

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Learning-based assume-guarantee verification (tool paper)

SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Actively learning to verify safety for FIFO automata

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Learning-based symbolic assume-guarantee reasoning with automatic decomposition

ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis

Compositional Control Synthesis for Partially Observable Systems

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Compositional deadlock detection for rendezvous communication

EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Active learning of plans for safety and reachability goals with partial observability

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
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
Assume-guarantee reasoning with local specifications

ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
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
A model checking framework for hierarchical systems

ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically based on assume-guarantee reasoning principles, and requires user guidance to identify appropriate assumptions for components. In this paper, we propose a fully automated approach to compositional reasoning that consists of automated decomposition using a hypergraph partitioning algorithm for balanced clustering of variables, and discovering assumptions using the L * algorithm for active learning of regular languages. We present a symbolic implementation of the learning algorithm, and incorporate it in the model checker NuSmv. In some cases, our experiments demonstrate significant savings in the computational requirements of symbolic model checking.