From Live Sequence Charts to Distributed Implementation
| dc.contributor.author | DONG, Jin Song | en_US |
| dc.contributor.author | SUN, Jun | en_US |
| dc.date.accessioned | 2007-01-04T03:15:37Z | en_US |
| dc.date.accessioned | 2017-01-23T06:59:54Z | |
| dc.date.available | 2007-01-04T03:15:37Z | en_US |
| dc.date.available | 2017-01-23T06:59:54Z | |
| dc.date.issued | 2007-01-04T03:15:37Z | en_US |
| dc.description.abstract | Mechanized generation of prototypes from high-level specifications has long been an ultimate challenge for software engineering. One high-level specification of great interest is scenario-based sequence diagrams. Sequence diagrams serve as the manifestation of use cases and if synthesizable they could lead directly to implementation. In this work, we propose a method to generate prototypes all the way from a variant of sequence diagrams, namely Live Sequence Charts (LSC). The idea is of using mature theories and tool support of Communicating Sequential Process (CSP) to offer practical solutions to the distributed synthesis and verification problem of LSC. Our approach starts with defining a formal semantics for LSC, based on which a sound SP interpretation of LSC is developed. CSP algebraic laws are then applied to synthesize the distributed behaviors of each object without constructing the global state machine. Another implication is that tool support for CSP can be reused to verify LSC specifications. | en_US |
| dc.format.extent | 556627 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/2310 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TRA1/07 | en_US |
| dc.title | From Live Sequence Charts to Distributed Implementation | en_US |
| dc.type | Technical Report | en_US |