Shared variables interaction diagrams

Proceedings - 16th Annual International Conference on Automated Software Engineering, ASE 2001

Volumn , Issue , 2001, Pages 281-288

  Alur, Rajeev ^a   Grosu, Radu ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION PARADIGM; DISTRIBUTED SOFTWARE SYSTEM; FORMAL ANALYSIS; FORMAL DEFINITION; FORMAL NOTATIONS; INTERACTION DIAGRAM; MESSAGE SEQUENCE CHARTS; SCENARIO-BASED SPECIFICATIONS; SHARED VARIABLES; VARIABLE INTERACTION;

FLOWCHARTING;

EID: 85111136945     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASE.2001.989814     Document Type: Conference Paper

References (20)

1. R. Alur, L. de Alfaro, R. Grosu, T.A. Henzinger, M. Kang, R. Majumdar, F. Mang, C.M. Kirsch, and B.Y. Wang. MOCHA: A model checking tool that exploits design structure. In Proceedings of 23rd International Conference on Software Engineering, 2001.
2. R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proceedings of 22nd International Conference on Software Engineering, pages 304-313,2000.
3. R. Alur, G.J. Holzmann, and D. Peled. An analyzer for message sequence charts. Software Concepts and Tools, 17(2):70-77,1996.
4. R. Alur and M. Yannakakis. Model checking of message sequence charts. In CONCUR'99: ConcurrencyTheory, Tenth International Conference, LNCS 1664, pages 114-129. Springer-Verlag, 1999.
5. H. Ben-Abdallah and S. Leue. MESA: Support for scenario-based design of concurrent systems. In Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1384, pages 118-135, 1998.
6. G. Booch, I. Jacobson, and J. Rumbaugh. Unified Modeling Language User Guide. Addison Wesley, 1997.
7. H. Ben-Abdallah and S. Leue. Syntactic detection of process divergence and non-local choice in message sequence charts. In Proceedings of the Second International Workshop on Tools and Algorithms for the Construction and Analysis of Systems, 1997.
8. P. Gibbons and E. Korach. Testing shared memories. SIAM Journal on Computing, 26(4):1208-1244,1997.
9. R. Grosu, I. Krueger, and T. Stauner. Hybrid sequence charts. In ISORC'2K, the 3rd IEEE International Symposium on Object-oriented Real-time distributed Computing, pages 104-111,2000.
10. G.J. Holzmann. The model checker SPIN. IEEE Trans. on Software Engineering, 23(5):279-295,1997.
11. G.J. Holzmann, D.A. Peled, and M.H. Redberg. Design tools for for requirements engineering. Lucent Bell Labs Technical Journal, 2(1):86-95,1997.
12. I. Krueger, R. Grosu, P. Scholz, M. Broy, From MSCs to Statecharts. In Distributed and Parallel Embedded Systems, Kluwer Academic Publishers, 1999.
13. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, 28(9):690-691,1979.
14. D. Lea. Concurrent Programming in Java; Design Principles and Patterns. Addison Wesley, 2000.
15. N. Lynch. Distributed algorithms. Morgan Kaufmann, 1996.
16. A. Muscholl, D. Peled, and Z. Su. Deciding properties of message sequence charts. In Foundations of Software Science and Computation Structures, 1998.
17. J. Reppy. Concurrent Programming in ML. Cambridge University Press, 1999.
18. R. Ramakrishnan and J. Gehrke. Database management systems. McGraw-Hill, 1999.
19. E. Rudolph, P. Graubmann, and J. Gabowski. Tutorial on message sequence charts. In Computer Networks and ISDN Systems - SDL and MSC, volume 28. 1996.
20. R.J. van Glabbeek and U. Goltz. Refinement of Actions in Causality Based Models. In Comparitive Concurrency Semantics and Refinement of Actions, pages 161-203,1989.