Smart play-out of behavioral requirements

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

Volumn 2517, Issue , 2002, Pages 378-398

  Harel, David ^a   Kugler, Hillel ^a   Marelly, Rami ^a   Pnueli, Amir ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN;

COMPONENT MODEL; REACTIVE SYSTEM; SCENARIO-BASED; VERIFICATION TECHNIQUES;

FORMAL METHODS;

EID: 84948138249     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36126-x_23     Document Type: Conference Paper

References (34)

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. R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proc. 22nd Int. Conf. On Software Engineering (ICSE’00), Limerick, Ireland, June 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 Proc. 10th Int. Conf. On Concurrency Theory (CONCUR’99), Eindhoven, Netherlands, August 1999.
5. R. Bharadwaj and C. Heitmeyer. Model Checking Complete Requirements Specifications Using Abstraction. Automated Software Engineering, 6(1):37–68, January 1999.
6. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2):142–170, 1992.
7. W. Damm and D. Harel. LSCs: Breathing Life into Message Sequence Charts. Formal Methods in System Design, 19(1), 2001. (Preliminary version in Proc. 3rd IFIP Int. Conf. On Formal Methods for Open Object-Based Distributed Systems (FMOODS’99), (P. Ciancarini, A. Fantechi and R. Gorrieri, eds.), Kluwer Academic Publishers, 1999, pp. 293–312.).
8. W. Damm and J. Klose. Verification of a Radio-based Signalling System using the STATEMATE Verification Environment. Formal Methods in System Design, 19(2):121–141, 2001.
9. E.A. Emerson and E.M. Clarke. Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2:241–266, 1982.
10. M. Franzle and K. Lüth. Visual Temporal Logic as a Rapid Prototyping Tool. Computer Languages, 27:93–113, 2001.
11. Elsa L. Gunter, Anca Muscholl, and Doron Peled. Compositional message sequence charts. In Tools and Algorithms for Construction and Analysis of Systems, pages 496–511, 2001.
12. D. Harel. From Play-In ScenariosTo Code:AnAchievable Dream. IEEE Computer, 34(1):53–60, January 2001. (Also in FundamentalApproaches to Software Engineering (FASE), Lecture Notes in Computer Science, Vol. 1783 (Tom Maibaum, ed.), Springer-Verlag, March 2000, pp. 22–34.).
13. D. Harel and H. Kugler. Synthesizing State-Based Object Systems from LSC Specifications. Int. J. Of Foundations of Computer Science (IJFCS)., 13(1):5–51, Febuary 2002. (Also,Proc. Fifth Int. Conf. On Implementation and Application of Automata (CIAA 2000), July 2000, Lecture Notes in Computer Science, Springer-Verlag, 2000.).
14. D. Harel and R. Marelly. Specifying and Executing Behavioral Requirements: The Play-In/ Play-Out Approach. Tech. Report MCS01-15, TheWeizmann Institute of Science, 2001.
15. D. Harel and R. Marelly. Playing with Time: On the Specification and Execution of Time- Enriched LSCs. In Proc. 10th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS’02), Fort Worth, Texas, 2002. To appear.
16. D. Harel and M. Politi. Modeling Reactive Systems with Statecharts: The STATEMATE Approach. McGraw-Hill, 1998.
17. C. Heitmeyer, J. Kirby, B. Labaw, and R. Bharadwaj. SCR*: A Toolset for Specifying and Analyzing Software Requirements. In A.J. Hu and M.Y. Vardi, editors, Proc. 10th Intl. Conference on Computer Aided Verification (CAV’98), volume 1427 of Lect. Notes in Comp. Sci., Springer-Verlag, pages 5–51, 1998.
18. J.G. Henriksen, M. Mukund, K. NarayanKumar, and P.S. Thiagarajan. On Message Sequence Graphs and finitely generated regular MSC languages. In Proceedings of the 27th International Colloquium on Automata Languages and Programming (ICALP’2000), number 1853 in Lecture Notes in Computer Science, Geneva, Switzerland, 2000. Springer.
19. J.G. Henriksen, M. Mukund, K. Narayan Kumar, and P.S. Thiagarajan. Regular collections of Message Sequence Charts. In Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS’2000), number 1893 In Lecture Notes in Computer Science, Bratislava, Slovakia, 2000. Springer-Verlag.
20. I-logix,inc., Products web page. http://www.ilogix.com/fs prod.htm.
21. ITU. ITU-T recommendation Z.120: Message sequence chart (MSC).
22. J. Klose and H. Wittke. An automata based interpretation of live sequence chart. In Proc. 7th Intl. Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’01), 2001.
23. K. Koskimies, T. Systa, J. Tuomi, and T. Mannisto. Automated support for modeling OO software. IEEE Software, 15(1):87–94, 1988.
24. I. Kruger, R. Grosu, P. Scholz, and M. Broy. From MSCs to statecharts. In Proc. DIPES’98. Kluwer, 1999.
25. O. Kupferman and M.Y. Vardi. Synthesis with incomplete information. In 2nd International Conference on Temporal Logic, pages 91–106, Manchester, July 1997.
26. M. Lettrari and J. Klose. Scenario-based monitoring and testing of real-time uml models. In Proc. 4th Int. Conf. On the Unified Modeling Language, 2001.
27. R. Marelly, D. Harel, and H.Kugler. Multiple Instances and SymbolicVariables in Executable Sequence Charts. In Proc. 17th Ann. ACM Conf. On Object-Oriented Programming, Systems, Languages and Applications (OOPSLA’02), Seattle, WA, 2002. To appear. Also available as Tech. Report MCS02-05,Weizmann Institute of Science, 2002.
28. Anca Muscholl, Doron Peled, and Zhendong Su. Deciding properties for message sequence charts. In Foundations of Software Science and Computation Structure, pages 226–242, 1998.
29. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th ACM Symp. Princ. Of Prog. Lang., pages 179–190, 1989.
30. A. Pnueli and E. Shahar. A platform for combining deductive with algorithmic verification. In In R. Alur andT. Henzinger, editors, Proc. 8th Intl. Conference on ComputerAidedVerification (CAV’96), volume 1102 of Lect. Notes in Comp. Sci., Springer-Verlag, pages 184–195, 1996.
31. Rational,inc., Web page. http://www.rational.com.
32. B. Selic, G. Gullekson, and P. Ward. Real-Time Object-Oriented Modeling. John Wiley and Sons, NewYork, 1994.
33. UML. Documentation of the unified modeling language (UML). Available from the Object Management Group (OMG), http://www.omg.org.
34. J. Whittle and J. Schumann. Generating statechart designs from scenarios. In Proc. 22nd Int. Conf. On Software Engineering (ICSE’00), Limerick, Ireland, June 2000.