@inproceedings{4604,
  author       = {Alur, Rajeev and Henzinger, Thomas A and Mang, Freddy and Qadeer, Shaz and Rajamani, Sriram and Tasiran, Serdar},
  booktitle    = {Proceedings of the 10th International Conference on Computer Aided Verification},
  isbn         = {9783540646082},
  location     = {Vancouver, Canada},
  pages        = {521 -- 525},
  publisher    = {Springer},
  title        = {{Mocha: Modularity in model checking}},
  doi          = {10.1007/BFb0028774},
  volume       = {1427},
  year         = {1998},
}

@inproceedings{4488,
  abstract     = {Assume-guarantee reasoning has long been advertised as an important method for decomposing proof obligations in system verification. Refinement mappings (homomorphisms) have long been advertised as an important method for solving the language-inclusion problem in practice. When confronted with large verification problems, we therefore attempted to make use of both techniques. We soon found that rather than offering instant solutions, the success of assume-guarantee reasoning depends critically on the construction of suitable abstraction modules, and the success of refinement checking depends critically on the construction of suitable witness modules. Moreover, as abstractions need to be witnessed, and witnesses abstracted, the process must be iterated. We present here the main lessons we learned from our experiments, in limn of a systematic and structured discipline for the compositional verification of reactive modules. An infrastructure to support this discipline, and automate parts of the verification, has been implemented in the tool Mocha.},
  author       = {Henzinger, Thomas A and Qadeer, Shaz and Rajamani, Sriram},
  booktitle    = {Proceedings of the 10th International Conference on Computer Aided Verification},
  isbn         = {9783540646082},
  location     = {Vancouver, Canada},
  pages        = {440 -- 451},
  publisher    = {Springer},
  title        = {{You assume, we guarantee: Methodology and case studies}},
  doi          = {10.1007/BFb0028765},
  volume       = {1427},
  year         = {1998},
}

@inproceedings{4489,
  abstract     = {Symbolic model checking, which enables the automatic verification of large systems, proceeds by calculating with expressions that represent state sets. Traditionally, symbolic model-checking tools arc based on backward state traversal; their basic operation is the function pre, which given a set of states, returns the set of all predecessor states. This is because specifiers usally employ formalisms with future-time modalities. which are naturally evaluated by iterating applications of pre. It has been recently shown experimentally that symbolic model checking can perform significantly better if it is based, instead, on forward state traversal; in this case, the basic operation is the function post, which given a set of states, returns the set of all successor states. This is because forward state traversal can ensure that only those parts of the state space are explored which are reachable from an initial state and relevant for satisfaction or violation of the specification; that is, errors can be detected as soon as possible.
In this paper, we investigate which specifications can be checked by symbolic forward state traversal. We formulate the problems of symbolic backward and forward model checking by means of two -calculi. The pre- calculus is based on the pre operation; the post- calculus, on the post operation. These two -calculi induce query logics, which augment fixpoint expressions with a boolean emptiness query. Using query logics, we are able to relate and compare the symbolic backward and forward approaches. In particular, we prove that all -regular (linear-time) specifications can be expressed as post- queries, and therefore checked using symbolic forward state traversal. On the other hand, we show that there are simple branching-time specifications that cannot be checked in this way.},
  author       = {Henzinger, Thomas A and Kupferman, Orna and Qadeer, Shaz},
  booktitle    = {Proceedings of the 10th International Conference on Computer Aided Verification},
  isbn         = {9783540646082},
  location     = {Vancouver, Canada},
  pages        = {195 -- 206},
  publisher    = {Springer},
  title        = {{From pre-historic to post-modern symbolic model checking}},
  doi          = {10.1007/BFb0028745},
  volume       = {1427},
  year         = {1998},
}