MOCHA: Modularity in model checking

  • R. Alur
  • T. A. Henzinger
  • F. Y. C. Mang
  • S. Qadeer
  • S. K. Rajamani
  • S. Tasiran
Tool Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1427)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AD94]
    R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, vol. 126, pages 183–235,1994.CrossRefGoogle Scholar
  2. [AH96]
    R. Alur and TA. Henzingcr. Reactive modules.In Proc. 11th IEEE Symposium on Logic in Computer Science, pages 207–218, 1996.Google Scholar
  3. [AH97]
    R. Alur and T.A. Henzingcr. Modularity for timed and hybrid systems. In Proc. 8th International Conference on Concurrency Theory, LNCS 1243, pages 74–88. Springer-Verlag, 1997.Google Scholar
  4. [AHK97]
    R. Alur, TA. Henzingcr, and O. Kupferman. Alternating-time temporal logic. In Proc. 38th IEEE Symposium on Foundations of Computer Science, pages 100–109, 1997.Google Scholar
  5. [AHR98]
    R. Alur, TA. Henzingcr, and S.K. Rajamani. Symbolic exploration of transition hierarchies. In TACAS 98: Tools and Algorithms for Construction and Analysis of Systems, LNCS 1384, pages 330–344, 1998.Google Scholar
  6. [BCM92]
    J.R. Burch and E.M. Clarke and K.L. McMillan and D.L. Dill and L.J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, Vol 98, No 2, pages 142–170, 1992.CrossRefGoogle Scholar
  7. [BG88]
    G. Berry and G. Gonthier. The synchronous programming language ESTEREL: design, semantics, implementation. Technical Report 842, INRIA, 1988.Google Scholar
  8. [BHS+96]
    R. Brayton, G. Hachtcl, A. Sangiovanni-Vincentelli, F. Somenzi, A. Aziz, S. Cheng, S. Edwards, S. Khatri, Y. Kukimoto, A. Pardo, S. Qadeer, R. Ranjan, S. Sarwary, T Shiple, G. Swamy, and T. Villa. VIS: A system for verification and synthesis. In Proc. 8th International Conference on Computer Aided Verification, LNCS 1102, pages 428–432. Springer-Verlag, 1996.Google Scholar
  9. [Bry86]
    R.E. Bryant. Graph-based algorithms for boolean-function manipulation. IEEE Trans. on Computers, C-35(8), 1986.Google Scholar
  10. [CM88]
    K.M. Chandy and J. Misra. Parallel program design: A foundation. Addison-Wesley, 1988Google Scholar
  11. [CE81]
    E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Workshop on Logic of Programs, LNCS 131, pages 52–71. Springer-Verlag, 1981.Google Scholar
  12. [Exp97]
    ExpertInterfaccTechnologies.Tix Home Page. Scholar
  13. [HQR98]
    TA. Henzingcr, S. Qadeer, and S.K. Rajamani. You assume, we guarantee: Methodology and case studies. In Proc. 10th International Conference ore CornputerAided Verification. Springer-Verlag, 1998.Google Scholar
  14. [Lyn96]
    N.A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.Google Scholar
  15. [Pnu77]
    A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symposium on Foundations of Computer Science, pages 46–77, 1977.Google Scholar
  16. [RAP+95]
    R.K. Ranjan, A. Aziz, B. Messier, C. Pixley, and R.K. Brayton. Efficient formal design verification: data structures + algorithms. In Proc. International Workshop on Logic Synthesis, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • R. Alur
    • 1
    • 2
  • T. A. Henzinger
    • 3
  • F. Y. C. Mang
    • 3
  • S. Qadeer
    • 3
  • S. K. Rajamani
    • 3
  • S. Tasiran
    • 3
  1. 1.Computer & Information Science DepartmentUniversity of PennsylvaniaPhiladelphia
  2. 2.Computing Science Research CenterBell LaboratoriesMurray fill
  3. 3.Elecctrical Engineering & Computer Sciences DepartmentUniversity of CaliforniaBerkeley

Personalised recommendations