Automated Assume-Guarantee Reasoning for Simulation Conformance

  • Sagar Chaki
  • Edmund Clarke
  • Nishant Sinha
  • Prasanna Thati
Conference paper

DOI: 10.1007/11513988_51

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3576)
Cite this paper as:
Chaki S., Clarke E., Sinha N., Thati P. (2005) Automated Assume-Guarantee Reasoning for Simulation Conformance. In: Etessami K., Rajamani S.K. (eds) Computer Aided Verification. CAV 2005. Lecture Notes in Computer Science, vol 3576. Springer, Berlin, Heidelberg

Abstract

We address the issue of efficiently automating assume-guarantee reasoning for simulation conformance between finite state systems and specifications. We focus on a non-circular assume-guarantee proof rule, and show that there is a weakest assumption that can be represented canonically by a deterministic tree automata (DTA). We then present an algorithm LT that learns this DTA automatically in an incremental fashion, in time that is polynomial in the number of states in the equivalent minimal DTA. The algorithm assumes a teacher that can answer membership and candidate queries pertaining to the language of the unknown DTA. We show how the teacher can be implemented using a model checker. We have implemented this framework in the COMFORT toolkit and we report encouraging results (over an order of magnitude improvement in memory consumption) on non-trivial benchmarks.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Sagar Chaki
  • Edmund Clarke
  • Nishant Sinha
  • Prasanna Thati

There are no affiliations available

Personalised recommendations