Synchronous and bidirectional component interfaces

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

Volumn 2404, Issue , 2002, Pages 414-427

  Chakrabarti, Arindam ^a   De Alfaro, Luca ^b   Henzinger, Thomas A ^a   Mang, Freddy Y C ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of California Santa Cruz   (United States)

^c SYNOPSYS INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SPECIFICATIONS;

BI-DIRECTIONAL CONNECTIONS; COMPONENT BASED DESIGN; COMPONENT INTERFACES; DESIGN SPECIFICATION; IN COMPOSITIONS; INPUT AND OUTPUTS; REFINEMENT CHECKING; SYNCHRONOUS INTERACTIONS;

COMPUTER AIDED ANALYSIS;

EID: 40149111547     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45657-0_34     Document Type: Conference Paper

References (18)

1. M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable concurrent program specifications. In Proc. 16th Int. Colloq. Aut. Lang. Prog., volume 372 of Lect. Notes in Comp. Sci., pages 1-17. Springer-Verlag, 1989.
2. S. Abramsky. Games in the semantics of programming languages. In Proc. of the 11th Amsterdam Colloquium, pages 1-6. ILLC, Dept. of Philosophy, University of Amsterdam, 1997.
3. S. Abramsky, S. Gay, and R. Nagarajan. A type-theoretic approach to deadlockfreedom of asynchronous systems. In TACS’97: Theoretical Aspects of Computer Software. Third International Symposium, 1997.
4. R. Alur and T. A. Henzinger. Reactive modules. Formal Methods in System Design, pages 7-48, 1999.
5. R. Alur, T. A. Henzinger, O. Kupferman, and M. Y. Vardi. Alternating refinement relations. In CONCUR 97: Concurrency Theory, volume 1466 of Lect. Notes in Comp. Sci., pages 163-178. Springer-Verlag, 1998.
6. R. Alur, T. A. Henzinger, F. Y. C. Mang, S. Qadeer, S. K. Rajamani, and S. Tasiran. Mocha: modularity in model checking. In CAV 98: Proc. of 10th Conf. on Computer Aided Verification, volume 1427 of Lect. Notes in Comp. Sci., pages 521-525. Springer-Verlag, 1998.
7. E. Clarke, K. McMillan, S. Campos, and V. Hartonas-Garmhausen. Symbolic model checking. In CAV 96: Proc. of 8th Conf. on Computer Aided Verification, volume 1102 of Lect. Notes in Comp. Sci., pages 419-422. Springer-Verlag, 1996.
8. L. de Alfaro, R. Alur, R. Grosu, T. Henzinger, M. Kang, R. Majumdar, F. Mang, C. Meyer-Kirsch, and B. Y. Wang. Mocha: A model checking tool that exploits design structure. In ICSE 01: Proceedings of the 23rd International Conference on Software Engineering, 2001.
9. L. de Alfaro and T. A. Henzinger. Interface automata. In Proc. of 8th European Software Engineering Conference and 9th ACM SIGSOFT Symposium on Foundations of Software Engineering (ESEC/FSE), pages 109-120. ACM Press, 2001.
10. L. de Alfaro and T. A. Henzinger. Interface theories for component-based design. In EMSOFT 01: Proc. of First Int. Workshop on Embedded Software, volume 2211 of Lect. Notes in Comp. Sci., pages 148-165. Springer-Verlag, 2001.
11. D. L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. MIT Press, 1988.
12. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
13. N. A. Lynch. Distributed Algorithms. Morgan-Kaufmann, 1996.
14. N. A. Lynch and M. Tuttle. Hierarcical correctness proofs for distributed algorithms. In Proc. of 6th ACM Symp. Princ. of Dist. Comp., pages 137-151, 1987.
15. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1991.
16. R. Milner. An algebraic definition of simulation between programs. In Proc. of Second Int. Joint Conf. on Artificial Intelligence, pages 481-489. The British Computer Society, 1971.
17. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
18. J. C. Mitchell. Foundations for Programming Languages. MIT Press, 1996.