Article

SAT-based compositional verification using lazy learning

Authors:

Edmund ClarkeAuthors Info & Claims

CAV'07: Proceedings of the 19th international conference on Computer aided verification

Pages 39 - 54

Published: 03 July 2007 Publication History

Abstract

A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L* algorithm for learning regular languages.While this approach has been investigated extensively for message passing systems, it still remains a challenge to scale the technique to large shared memory systems, mainly because the assumptions have an exponential communication alphabet size. In this paper, we propose a SAT-based methodology that employs both induction and interpolation to implement automated AGR for shared memory systems. The method is based on a new lazy approach to assumption learning, which avoids an explicit enumeration of the exponential alphabet set during learning by using symbolic alphabet clustering and iterative counterexample-driven localized partitioning. Preliminary experimental results on benchmarks in Verilog and SMV are encouraging and show that the approach scales well in practice.

References

[1]

Foci: An interpolating prover, http://www.kenmcmil.com/foci.html

[2]

http://vlsi.coloradu.edu/~vis/

[3]

Yices: An smt solver, http://yices.csl.sri.com/

[4]

Alur, R., Madhusudan, P., Nam, W.: Symbolic compositional verification by learning assumptions. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, Springer, Heidelberg (2005).

Digital Library

[5]

Amla, N.: An analysis of sat-based model checking techniques in an industrial environment. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol. 3725, pp. 254-268. Springer, Heidelberg (2005).

Digital Library

[6]

Angluin, D.: Learning regular sets from queries and counterexamples. In: Information and Computation, vol. 75(2), pp. 87-106 (1987).

Digital Library

[7]

Barringer, H., Giannakopoulou, D., Pasareanu, C.S.: Proof rules for automated compositional verification. In: SAVCBS (2003).

[8]

Berg, T., Jonsson, B., Raffelt, H.: Regular inference for state machines with parameters. In: Baresi, L., Heckel, R. (eds.) FASE 2006 and ETAPS 2006. LNCS, vol. 3922, pp. 107-121. Springer, Heidelberg (2006).

Digital Library

[9]

Biere, A., Cimatti, A., Clarke, E.M., Strichman, O., Zue, Y.: Bounded Model Checking. In: Zelkowitz, M. (ed.) Advances in computers, vol. 58 (2003).

[10]

Sagar Chaki and Ofer Strichman. Optimized L* for assume-guarantee reasoning. In: TACAS, To Appear.

[11]

Cobleigh, J., Avrunin, G., Clarke, L.: Breaking up is hard to do: an investigation of decomposition for assume-guarantee reasoning. In: ISSTA, pp. 97-108 (2006).

Digital Library

[12]

Cobleigh, J.M., Giannakopoulou, D., Pasareanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) ETAPS 2003 and TACAS 2003. LNCS, vol. 2619, Springer, Heidelberg (2003).

Digital Library

[13]

Dutertre, B., de Moura, L.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81-94. Springer, Heidelberg (2006).

Digital Library

[14]

Eén, N., Sörensson, N.: Temporal induction by incremental sat solving. Electr. Notes Theor. Comput. Sci. 89(4) (2003).

[15]

Armoni, R. et al.: Sat-based induction for temporal safety properties. Electr. Notes Theor. Comput. Sci. 119(2), 3-16 (2005).

Digital Library

[16]

Gheorghiu, M., Giannakopoulou, D., Pasareanu, C.S.: Refining interface alphabets for compositional verification. In: TACAS (To Appear).

Digital Library

[17]

Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Massachusetts (1979).

Digital Library

[18]

Jones, C.B.: Tentative steps toward a development method for interfering programs. ACM Trans. Program. Lang. Syst. 5(4), 596-619 (1983).

Digital Library

[19]

Maier, P.: A set-theoretic framework for assume-guarantee reasoning. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 821-834. Springer, Heidelberg (2001).

Digital Library

[20]

McMillan, K.L.: Interpolation and sat-based model checking. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 1-13. Springer, Heidelberg (2003).

[21]

Misra, J., Chandy, K.M.: Proofs of networks of processes. IEEE Trans. Software Eng. 7(4), 417-426 (1981).

Digital Library

[22]

Nam, W., Alur, R.: Learning-based symbolic assume-guarantee reasoning with automatic decomposition. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol. 4218, pp. 170-185. Springer, Heidelberg (2006).

Digital Library

[23]

Namjoshi, K.S., Trefler, R.J.: On the completeness of compositional reasoning. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 139-153. Springer, Heidelberg (2000).

Digital Library

[24]

Pnueli, A.: In transition from global to modular temporal reasoning about programs. In: Logics and models of concurrent systems, Springer, Heidelberg (1985).

Digital Library

[25]

Prasad, M.R., Biere, A., Gupta, A.: A survey of recent advances in sat-based formal verification. STTT 7(2), 156-173 (2005).

[26]

Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. In: Inf. Comp. vol. 103(2), pp. 299-347 (1993).

Digital Library

[27]

Sheeran, M., Singh, S., Stalmarck, G.: Checking safety properties using induction and a sat-solver. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol. 1954, pp. 108-125. Springer, Heidelberg (2000).

Digital Library

[28]

Sinha, N., Clarke, E.: SAT-based compositional verification using lazy learning. In: Technical report CMU-CS-07-109, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA (February 2007).

[29]

Tinelli, C., Ranise, S.: SMT-LIB: The Satisfiability Modulo Theories Library (2005), http://goedel.cs.uiowa.edu/smtlib/

Cited By

Lin SSun JNguyen TLiu YDong JCohen MGrunske LWhalen M(2015)Interpolation guided compositional verificationProceedings of the 30th IEEE/ACM International Conference on Automated Software Engineering10.1109/ASE.2015.33(65-74)Online publication date: 9-Nov-2015
https://dl.acm.org/doi/10.1109/ASE.2015.33
He FWang BYin LZhu LJalote PBriand LHoek A(2014)Symbolic assume-guarantee reasoning through BDD learningProceedings of the 36th International Conference on Software Engineering10.1145/2568225.2568253(1071-1082)Online publication date: 31-May-2014
https://dl.acm.org/doi/10.1145/2568225.2568253
Chen YClarke EFarzan AHe FTsai MTsay YWang BZhu L(2010)Comparing learning algorithms in automated assume-guarantee reasoningProceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I10.5555/1939281.1939341(643-657)Online publication date: 18-Oct-2010
https://dl.acm.org/doi/10.5555/1939281.1939341
Show More Cited By

Recommendations

Bounded Semantics of CTL and SAT-Based Verification
ICFEM '09: Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering

Bounded model checking has been proposed as a complementary approach to BDD based symbolic model checking for combating the state explosion problem, esp. for efficient error detection. This has led to a lot of successful work with respect to error ...
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 ...
Interpolation guided compositional verification
ASE '15: Proceedings of the 30th IEEE/ACM International Conference on Automated Software Engineering

Model checking suffers from the state space explosion problem. Compositional verification techniques such as assume-guarantee reasoning (AGR) have been proposed to alleviate the problem. However, there are at least three challenges in applying AGR. ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

CAV'07: Proceedings of the 19th international conference on Computer aided verification

July 2007

562 pages

ISBN:9783540733676

Editors:
Werner Damm
Carl von Ossietzky University Oldenburg, Department of Computer Science, Oldenburg, Germany
,
Holger Hermanns
Saarland University, Department of Computer Science, Saarbrücken, Germany

Sponsors

German Science Foundation
Artist2 Network of Excellence
Cadence Design Systems
Informatik Saarland
IBM: IBM

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 03 July 2007

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
2
Total Downloads

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

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Lin SSun JNguyen TLiu YDong JCohen MGrunske LWhalen M(2015)Interpolation guided compositional verificationProceedings of the 30th IEEE/ACM International Conference on Automated Software Engineering10.1109/ASE.2015.33(65-74)Online publication date: 9-Nov-2015
https://dl.acm.org/doi/10.1109/ASE.2015.33
He FWang BYin LZhu LJalote PBriand LHoek A(2014)Symbolic assume-guarantee reasoning through BDD learningProceedings of the 36th International Conference on Software Engineering10.1145/2568225.2568253(1071-1082)Online publication date: 31-May-2014
https://dl.acm.org/doi/10.1145/2568225.2568253
Chen YClarke EFarzan AHe FTsai MTsay YWang BZhu L(2010)Comparing learning algorithms in automated assume-guarantee reasoningProceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I10.5555/1939281.1939341(643-657)Online publication date: 18-Oct-2010
https://dl.acm.org/doi/10.5555/1939281.1939341
Chen YClarke EFarzan ATsai MTsay YWang B(2010)Automated assume-guarantee reasoning through implicit learningProceedings of the 22nd international conference on Computer Aided Verification10.1007/978-3-642-14295-6_44(511-526)Online publication date: 15-Jul-2010
https://dl.acm.org/doi/10.1007/978-3-642-14295-6_44
Gheorghiu Bobaru MPăsăreanu CGiannakopoulou D(2008)Automated Assume-Guarantee Reasoning by Abstraction RefinementProceedings of the 20th international conference on Computer Aided Verification10.1007/978-3-540-70545-1_14(135-148)Online publication date: 7-Jul-2008
https://dl.acm.org/doi/10.1007/978-3-540-70545-1_14

View Options

View options

Media

Figures

Other

Tables

View Table of Contents