MOCHA: Modularity in model checking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1427 LNCS, Issue , 1998, Pages 521-525

  Alur, R ^a,b   Hcnzinger, T A ^c   Mang, F Y C ^c   Qadeer, S ^c   Rajamani, S K ^c   Tasiran, S ^c  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646178489     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0028774     Document Type: Conference Paper

References (16)

1. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, vol. 126, pages 183-235, 1994.
2. R. Alur and T.A. Hcnzingcr. Reactive modules. In Proc. 11th IEEE Symposium on Logic in Computer Science, pages 207-218, 1996.
3. R. Alur and T.A. Hcnzingcr. Modularity for timed and hybrid systems. In Proc. 8th International Conference on Concurrency Theory, LNCS 1243, pages 74-88. Springer-Verlag, 1997. (Pubitemid 127089311)
4. R. Alur, T.A. Henzinger, and O. Kupfcrman. Alternating-time temporal logic. In Proc. 38th IEEE Symposium on Foundations of Computer Science, pages, 100-109, 1997.
5. R. Alur, T.A. Henzinger, 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. (Pubitemid 128055553)
6. 20 states and beyond. Information and Computation, Vol 98, No 2, pages 142-170, 1992.
7. G. Berry and G. Gonlhier. The synchronous programming language ESTEREL: design, semantics, implementation. Technical Report 842, INRIA, 1988.
8. R. Brayton, G. Hachtel, 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. (Pubitemid 126101307)
9. R.E. Bryant. Graph-based algorithms for boolean-function manipulation. IEEE Trans, on Computers, C-35(8), 1986.
10. K.M. Chandy and J. Misra. Parallel program design: A foundation. Addison-Wesley, 1988
11. 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.
12. Expert Interface Technologies. Tix Home Page, http://www.xpi.com/tix/ index.html.
13. T.A. Hcnzingcr, S. Qadeer, and S.K. Rajamani. You assume, we guarantee: Methodology and case studies. In Proc. 10th International Conference on Computer Aided Verification. Springer-Verlag, 1998.
14. N.A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
15. A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symposium on Foundations of Computer Science, pages 46-77, 1977.
16. R.K. Ranjan, A. Aziz, B. Plessier, C. Pixley, and R.K. Brayton. Efficient formal design verification: data structures + algorithms. In Proc. International Workshop on Logic Synthesis, 1995.