Optimized L*-Based Assume-Guarantee Reasoning

@inproceedings{Chaki2007OptimizedLA,
  title={Optimized L*-Based Assume-Guarantee Reasoning},
  author={Sagar Chaki and Ofer Strichman},
  booktitle={TACAS},
  year={2007}
}
In this paper, we suggest three optimizations to the L*-based automated Assume-Guarantee reasoning algorithm for the compositional verification of concurrent systems. First, we use each counterexample from the model checker to supply multiple strings to L*, saving candidate queries. Second, we observe that in existing instances of this paradigm, the learning algorithm is coupled weakly with the teacher. Thus, the learner ignores completely the details about the internal structure of the system… CONTINUE READING
Highly Cited
This paper has 48 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 31 extracted citations

Similar Papers

Loading similar papers…