This research was supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the ARO MURI grant DAAH-04-96-1-0341, and by the SRC contract 97-DC-324.041.
Chapter PDF
References
R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, vol. 126, pages 183–235,1994.
R. Alur and TA. Henzingcr. Reactive modules.In Proc. 11th IEEE Symposium on Logic in Computer Science, pages 207–218, 1996.
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.
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.
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.
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.
G. Berry and G. Gonthier. The synchronous programming language ESTEREL: design, semantics, implementation. Technical Report 842, INRIA, 1988.
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.
R.E. Bryant. Graph-based algorithms for boolean-function manipulation. IEEE Trans. on Computers, C-35(8), 1986.
K.M. Chandy and J. Misra. Parallel program design: A foundation. Addison-Wesley, 1988
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.
ExpertInterfaccTechnologies.Tix Home Page.http://www.xpi.com/tix/index.html.
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.
N.A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symposium on Foundations of Computer Science, pages 46–77, 1977.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alur, R., Henzinger, T.A., Mang, F.Y.C., Qadeer, S., Rajamani, S.K., Tasiran, S. (1998). MOCHA: Modularity in model checking. In: Hu, A.J., Vardi, M.Y. (eds) Computer Aided Verification. CAV 1998. Lecture Notes in Computer Science, vol 1427. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028774
Download citation
DOI: https://doi.org/10.1007/BFb0028774
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64608-2
Online ISBN: 978-3-540-69339-0
eBook Packages: Springer Book Archive