Shared variables interaction diagrams

Scenario-based specifications offer an intuitive and visual way of describing design requirements of distributed software systems. For the communication paradigm based on messages, message sequence charts (MSC) offer a standardized and formal notation amenable to formal analysis. In this paper we define shared variables interaction diagrams (SVID) as the counterpart of MSCs when processes communicate via shared variables. After formally defining SVIDs, we develop an intuitive as well as formal definition of refinement for SVIDs. This notion provides a basis for systematically adding details to SVID requirements.

[1]  Ivar Jacobson,et al.  The Unified Modeling Language User Guide , 1998, J. Database Manag..

[2]  Leslie Lamport,et al.  How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.

[3]  Gerard J. Holzmann,et al.  Design tools for requirements engineering , 1997, Bell Labs Technical Journal.

[4]  Doug Lea,et al.  Concurrent programming in Java - design principles and patterns , 1996, Java series.

[5]  Raghu Ramakrishnan,et al.  Database Management Systems , 1976 .

[6]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[7]  Doug Lea.  Concurrent Programming in Java. Second Edition: Design Principles and Patterns , 1999 .

[8]  Thomas A. Henzinger,et al.  jMocha: a model checking tool that exploits design structure , 2001, Proceedings of the 23rd International Conference on Software Engineering. ICSE 2001.

[9]  Rajeev Alur,et al.  An Analyser for Mesage Sequence Charts , 1996, TACAS.

[10]  Hanêne Ben-Abdallah,et al.  MESA: Support for Scenario-Based Design of Concurrent Systems , 1998, TACAS.

[11]  Ursula Goltz,et al.  Refinement of Actions in Causality Based Models , 1990, REX Workshop.

[12]  Rajeev Alur,et al.  Inference of message sequence charts , 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium.

[13]  Anca Muscholl,et al.  Deciding Properties of Message Sequence Charts , 2003, Scenarios: Models, Transformations and Tools.

[14]  Ingolf Krüger,et al.  Hybrid Sequence Charts , 2000, Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607).

[15]  Rajeev Alur,et al.  An Analyzer for Message Sequence Charts , 1996, Softw. Concepts Tools.

[16]  Anca Muscholl,et al.  Deciding Properties for Message Sequence Charts , 1998, FoSSaCS.

[17]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[18]  Hanêne Ben-Abdallah,et al.  Syntactic Detection of Process Divergence and Non-local Choice inMessage Sequence Charts , 1997, TACAS.

[19]  Manfred Broy,et al.  From MSCs to Statecharts , 1998, DIPES.

[20]  Phillip B. Gibbons,et al.  Testing Shared Memories , 1997, SIAM J. Comput..

[21]  Rajeev Alur,et al.  Model Checking of Message Sequence Charts , 1999, CONCUR.

[22]  Ekkart Rudolph,et al.  Tutorial on Message Sequence Charts , 1996, Comput. Networks ISDN Syst..

[23]  John H. Reppy,et al.  Concurrent programming in ML , 1999 .