Three optimizations for Assume–Guarantee reasoning with L^{*}
 Sagar Chaki,
 Ofer Strichman
 … show all 2 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
The learningbased automated Assume–Guarantee reasoning paradigm has been applied in the last few years for the compositional verification of concurrent systems. Specifically, L^{*} has been used for learning the assumption, based on strings derived from counterexamples, which are given to it by a modelchecker that attempts to verify the Assume–Guarantee rules. We suggest three optimizations to this paradigm. First, we derive from each counterexample multiple strings to L^{*}, rather than a single one as in previous approaches. This small improvement saves candidate queries and hence modelchecking runs. Second, we observe that in existing instances of this paradigm, the learning algorithm is coupled weakly with the teacher. Thus, the learner completely ignores the details of the internal structure of the system and specification being verified, which are available already to the teacher. We suggest an optimization that uses this information in order to avoid many unnecessary membership queries (it reduces the number of such queries by more than an order of magnitude). Finally, we develop a method for minimizing the alphabet used by the assumption, which reduces the size of the assumption and the number of queries required to construct it. We present these three optimizations in the context of verifying trace containment for concurrent systems composed of finite state machines. We have implemented our approach in the ComFoRT tool, and experimented with reallife examples. Our results exhibit an average speedup of between 4 to 11 times, depending on the Assume–Guarantee rule used and the set of activated optimizations.
 Aloul F, Ramani A, Markov I, Sakallah K (2002) PBS: A backtrack search pseudoboolean solver and optimizer. In: Proceedings of the 5th international symposium on the theory and applications of satisfiability testing (SAT ’02), Cincinnati, OH, May 6–9, 2002. University of Cincinnati, Cincinnati, pp 346–353. http://gauss.ececs.uc.edu/Conferences/SAT2002/sat2002list.html
 Alur R, Cerny P, Gupta G, Madhusudan P, Nam W, Srivastava A (2005) Synthesis of interface specifications for Java classes. In: Palsberg J, Abadi M (eds) Popl05, Long Beach, CA, January 12–14, 2005. Association for Computing Machinery, New York, pp 98–109
 Alur R, Madhusudan P, Nam W (2005) Symbolic compositional verification by learning assumptions. In: Etessami K, Rajamani SK (eds) Proceedings of the 17th international conference on computer aided verification (CAV ’05), Edinburgh, Scotland, July 6–10, 2005. Lecture notes in computer science, vol 3576. Springer, New York, pp 548–562
 Angluin D (1987) Learning regular sets from queries and counterexamples. Inf Comput 75(2):87–106 CrossRef
 Ball T, Rajamani SK (2002) Generating abstract explanations of spurious counterexamples in C programs. Technical report MSRTR200209, Microsoft Research, Redmond, Washington, USA, January 2002
 Barringer H, Giannakopoulou D, Păsăreanu CS (2003) Proof rules for automated compositional verification. In: Proceedings of the 2nd workshop on specification and verification of component based systems (SAVCBS ’03), Helsinki, Finland, September 1–2, 2003. Iowa State University, Ames, pp 14–21
 Chaki S, Clarke EM, Sinha N, Thati P (2005) Automated Assume–Guarantee reasoning for simulation conformance. In: Etessami K, Rajamani SK (eds) Proceedings of the 17th international conference on computer aided verification (CAV ’05), Edinburgh, Scotland, July 2005. Lecture notes in computer science, vol 3576. Springer, Berlin, pp 534–547
 Chaki S, Ivers J, Sharygina N, Wallnau K (2005) The ComFoRT reasoning framework. In: Etessami K, Rajamani SK (eds) Proceedings of the 17th international conference on computer aided verification (CAV ’05), Edinburgh, Scotland, July 6–10, 2005. Lecture notes in computer science, vol 3576. Springer, New York, pp 164–169
 Chaki S, Sinha N (2006) Assume–Guarantee reasoning for deadlock. In: Proc. of FMCAD, 2006
 Chaki S, Strichman O (2006) Optimized L^{*} for Assume–Guarantee reasoning. In: Grumberg O, Huth M (eds) Proceedings of the 13th international conference on tools and algorithms for the construction and analysis of systems (TACAS ’07), Braga, Portugal, March 24–April 1, 2007. Lecture notes in computer science, vol 4424. Springer, New York, pp 276–291 CrossRef
 Clarke EM, Grumberg O, Jha S, Lu Y, Veith H (2003) Counterexampleguided abstraction refinement for symbolic model checking. J Assoc Comput Mach 50(5):752–794
 Cobleigh JM, Giannakopoulou D, Păsăreanu CS (2003) Learning assumptions for compositional verification. In: Garavel H, Hatcliff J (eds) Proceedings of the 9th international conference on tools and algorithms for the construction and analysis of systems (TACAS ’03), Warsaw, Poland, April 7–11, 2003. Lecture notes in computer science, vol 2619. Springer, New York, pp 331–346
 Ernst MD, Cockrell J, Griswold WG, Notkin D (1999) Dynamically discovering likely program invariants to support program evolution. In: Proceedings of the 21st international conference on software engineering (ICSE ’99), Los Angeles, CA, May 1999. IEEE Computer Society, Los Alamitos, pp 213–224
 Gheorghiu M, Giannakopoulou D, Păsăreanu CS (2007) Refining interface alphabets for compositional verification. In: Grumberg O, Huth M (eds) Proceedings of the 13th international conference on tools and algorithms for the construction and analysis of systems (TACAS ’07), Braga, Portugal, March 24–April 1, 2007. Lecture notes in computer science, vol 4424. Springer, New York, pp 292–307 CrossRef
 Giannakopoulou D, Păsăreanu CS, Barringer H (2002) Assumption generation for software component verification. In: Proceedings of the 17th international conference on automated software engineering (ASE ’02), Edinburgh, Scotland, September 23–27, 2002. IEEE Computer Society, Los Alamitos, pp 3–12 CrossRef
 Groce A, Peled D, Yannakakis M (2002) Adaptive model checking. In: Katoen JP, Stevens P (eds) Proceedings of the eighth international conference on tools and algorithms for the construction and analysis of systems (TACAS ’02), Grenoble, France, April 8–12, 2002. Lecture notes in computer science, vol 2280. Springer, New York, pp 357–370 CrossRef
 Habermehl P, Vojnar T (2005) Regular model checking using inference of regular languages. In: Proceedings of the 6th international workshop on verification of infinitestate systems (INFINITY ’04). Electronic notes in theoretical computer science, vol 138(3), pp 21–36
 Johnson D (1974) Approximation algorithms for combinatorial problems. J Comput Syst Sci 9(3):256–278 CrossRef
 Jones CB (1983) Specification and design of (parallel) programs. In: Mason REA (ed) Proceedings of the 9th IFIP world congress. Information Processing, vol 83, Paris, France, September 1983, pp 321–332
 Kurshan RP (1994) Computeraided verification of coordinating processes: the automatatheoretic approach. Princeton University Press, Princeton
 Misra J, Chandy KM (1981) Proofs of networks of processes. IEEE Trans Soft Eng 7(4):417–426 CrossRef
 Peled D, Vardi MY, Yannakakis M (1999) Black box checking. In: Wu J, Chanson ST, Gao Q (eds) Proceedings of the joint international conference on formal description techniques for distributed systems and communication protocols (FORTE ’99), Beijing, China, October 1999. IFIP conference proceedings, vol 156. Kluwer Academic, Dordrecht, pp 225–240
 Pnueli A (1985) In transition from global to modular temporal reasoning about programs. Logics Models Concurr Syst 13:123–144
 Rivest RL, Schapire RE (1993) Inference of finite automata using homing sequences. Inf Comput 103(2):299–347 CrossRef
 Title
 Three optimizations for Assume–Guarantee reasoning with L^{*}
 Journal

Formal Methods in System Design
Volume 32, Issue 3 , pp 267284
 Cover Date
 20080601
 DOI
 10.1007/s1070300700425
 Print ISSN
 09259856
 Online ISSN
 15728102
 Publisher
 Springer US
 Additional Links
 Topics
 Keywords

 Software verification
 Compositionality
 Assume–Guarantee
 Learning
 Industry Sectors
 Authors

 Sagar Chaki ^{(1)}
 Ofer Strichman ^{(2)}
 Author Affiliations

 1. Software Engineering Institute, Pittsburgh, USA
 2. Information Systems Engineering, IE Technion, Haifa, Israel