article

Automated assumption generation for compositional verification

Authors:

K. L. Mcmillan,

Zhaohui FuAuthors Info & Claims

Formal Methods in System Design, Volume 32, Issue 3

Pages 285 - 301

https://doi.org/10.1007/s10703-008-0050-0

Published: 01 June 2008 Publication History

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.

References

[1]

Alur R, Madhusudan P, Nam W (2005) Symbolic compositional verification by learning assumptions. In: Proceedings of the international conference on computer aided verification (CAV), pp 548-562.

[2]

Angluin D (1987) Learning regular sets from queries and counterexamples. Inf Comput 75:87-106.

Digital Library

[3]

Biere A, Cimatti A, Clarke E, Zhu Y (1999) Symbolic model checking without BDDs. In: Tools and algorithms for the construction and analysis of systems (TACAS'99), LNCS.

[4]

Cobleigh J, Giannakopoulou D, Pasareanu C (2003) Learning assumptions for compositional verification. In: Proceedings of the 9th international conference on tools and algorithms for the construction and analysis of systems (TACAS).

[5]

Chaki S, Strichman O (2007) Optimized 1*-based assume-guarantee reasoning. In: TACAS, pp 276-291.

[6]

Gold EM (1978) Complexity of automaton identification from given data. Inf Comput 37:302-320.

[7]

Kam T, Villa T, Brayton R, Sangiovanni-Vincentelli AL (1997) Synthesis of FSMs: functional optimization. Kluwer Academic, Dordrecht.

[8]

McMillan KL Cadence SMV. Cadence Berkeley Labs, CA.

[9]

McMillan KL (1993) Symbolic model checking. Kluwer Academic, Boston.

[10]

Mitchell TM (1997) Machine learning. WCB/McGraw-Hill, New York.

[11]

Oliveira AL, Marques Silva JP (1998) Efficient search techniques for the inference of minimum size finite automata. In: Proceedings of the symposium on string processing and information retrieval (SPIRE), pp 81-89.

[12]

Pena JM, Oliveira AL (1999) A new algorithm for exact reduction of incompletely specified finite state machines. IEEE Trans CAD Integr Circuits Syst 18(11): 1619-1632.

Digital Library

[13]

Pfleeger CF (1973) State reduction in incompletely specified finite state machines. IEEE Trans Comput C-22:1099-1102.

[14]

Quinlan JR (1986) Induction of decision trees. Mach Learn.

[15]

Rivest RL, Schapire RE (1989) Inference of finite automata using homing sequences. In: Proceedings of the ACM symposium on theory of computing (STOC). ACM Press, New York, pp 411-420.

[16]

Sinha N, Clarke EM (2007) Sat-based compositional verification using lazy learning. In: CAV, pp 39-54.

Cited By

Frenkel HGrumberg OPăsăreanu CSheinvald S(2022)Assume, guarantee or repair: a regular framework for non regular propertiesInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-022-00669-924:5(667-689)Online publication date: 1-Oct-2022
https://dl.acm.org/doi/10.1007/s10009-022-00669-9
v. Gleissenthall KKıcı RStefan DJhala RKim YKim JVigna GShi E(2021)Solver-Aided Constant-Time Hardware VerificationProceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security10.1145/3460120.3484810(429-444)Online publication date: 12-Nov-2021
https://dl.acm.org/doi/10.1145/3460120.3484810
K. KRebeiro CHazra A(2018)An Algorithmic Approach to Formally Verify an ECC LibraryACM Transactions on Design Automation of Electronic Systems10.1145/322420523:5(1-26)Online publication date: 25-Aug-2018
https://dl.acm.org/doi/10.1145/3224205
Show More Cited By

Index Terms

Automated assumption generation for compositional verification
1. Hardware
  1. Hardware validation
    1. Functional verification
2. Theory of computation
  1. Formal languages and automata theory
  2. Logic

Recommendations

Compositional reachability analysis for efficient modular verification of asynchronous designs

Compositional verification is essential to address state explosion in model checking. Traditionally, an over-approximate context is needed for each individual component in a system for sound verification. This may cause state explosion for the ...
Automated interface refinement for compositional verification

Compositional verification is essential for verifying large systems. However, approximate environments are needed when verifying the constituent modules in a system. Effective compositional verification requires finding a simple but accurate ...
Modeling and Verification of Reactive Systems using Rebeca

Actor-based modeling has been successfully applied to the representation of concurrent and distributed systems. Besides having an appropriate and efficient way for modeling these systems, one needs a formal verification approach for ensuring their ...

Comments

Information & Contributors

Information

Published In

cover image Formal Methods in System Design

Formal Methods in System Design Volume 32, Issue 3

June 2008

128 pages

ISSN:0925-9856

Issue’s Table of Contents

Copyright © Copyright © 2008 Springer Science+Business Media, LLC.

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 June 2008

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Frenkel HGrumberg OPăsăreanu CSheinvald S(2022)Assume, guarantee or repair: a regular framework for non regular propertiesInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-022-00669-924:5(667-689)Online publication date: 1-Oct-2022
https://dl.acm.org/doi/10.1007/s10009-022-00669-9
v. Gleissenthall KKıcı RStefan DJhala RKim YKim JVigna GShi E(2021)Solver-Aided Constant-Time Hardware VerificationProceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security10.1145/3460120.3484810(429-444)Online publication date: 12-Nov-2021
https://dl.acm.org/doi/10.1145/3460120.3484810
K. KRebeiro CHazra A(2018)An Algorithmic Approach to Formally Verify an ECC LibraryACM Transactions on Design Automation of Electronic Systems10.1145/322420523:5(1-26)Online publication date: 25-Aug-2018
https://dl.acm.org/doi/10.1145/3224205
Abd Elkader KGrumberg OPăsăreanu CShoham S(2018)Automated circular assume-guarantee reasoningFormal Aspects of Computing10.1007/s00165-017-0436-030:5(571-595)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.1007/s00165-017-0436-0
Choi YByun T(2017)Constraint-based test generation for automotive operating systemsSoftware and Systems Modeling (SoSyM)10.1007/s10270-014-0449-616:1(7-24)Online publication date: 1-Feb-2017
https://dl.acm.org/doi/10.1007/s10270-014-0449-6
Dillig IDillig TLi BMcmillan KSagiv M(2017)Synthesis of circular compositional program proofs via abductionInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-015-0397-719:5(535-547)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.1007/s10009-015-0397-7
Meller YGrumberg OShoham S(2016)A framework for compositional verification of multi-valued systems via abstraction-refinementInformation and Computation10.1016/j.ic.2016.01.001247:C(169-202)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1016/j.ic.2016.01.001
Byun TChoi YWainwright RCorchado JBechini AHong J(2015)Automated system-level safety testing using constraint patterns for automotive operating systemsProceedings of the 30th Annual ACM Symposium on Applied Computing10.1145/2695664.2695935(1815-1822)Online publication date: 13-Apr-2015
https://dl.acm.org/doi/10.1145/2695664.2695935
Choi YPark MByun TKim D(2015)Efficient safety checking for automotive operating systems using property-based slicing and constraint-based environment generationScience of Computer Programming10.1016/j.scico.2014.10.006103:C(51-70)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.1016/j.scico.2014.10.006
Meller YGrumberg OYorav K(2015)Learning-Based Compositional Model Checking of Behavioral UML SystemsRevised Selected Papers of the 12th International Conference on Formal Aspects of Component Software - Volume 953910.1007/978-3-319-28934-2_15(275-293)Online publication date: 14-Oct-2015
https://dl.acm.org/doi/10.1007/978-3-319-28934-2_15
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents