Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Operational semantics for MSC'96
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on advanced topics on SDL and MSC
Inference of message sequence charts
Proceedings of the 22nd international conference on Software engineering
Generating statechart designs from scenarios
Proceedings of the 22nd international conference on Software engineering
LSCs: Breathing Life into Message Sequence Charts
Formal Methods in System Design
An Algebraic Semantics for Message Sequence Chart Documents
FORTE XI / PSTV XVIII '98 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII)
Syntactic Detection of Process Divergence and Non-local Choice inMessage Sequence Charts
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Safe Realizability of High-Level Message Sequence Charts
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Synthesis of Open Reactive Systems from Scenario-Based Specifications
ACSD '03 Proceedings of the Third International Conference on Application of Concurrency to System Design
Synthesizing Software Architecture Descriptions from Message Sequence Chart Specifications
ASE '98 Proceedings of the 13th IEEE international conference on Automated software engineering
Testing of Concurrent Programs Based on Message Sequence Charts
PDSE '99 Proceedings of the International Symposium on Software Engineering for Parallel and Distributed Systems
Incremental elaboration of scenario-based specifications and behavior models using implied scenarios
ACM Transactions on Software Engineering and Methodology (TOSEM)
Resolving Race Conditions in Asynchronous Partial Order Scenarios
IEEE Transactions on Software Engineering
Realizing Live Sequence Charts in SystemVerilog
TASE '07 Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering
Automatic generation of conformance tests from message sequence charts
SAM'02 Proceedings of the 3rd international conference on Telecommunications and beyond: the broader applicability of SDL and MSC
Inherent causal orderings of partial order scenarios
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Synthesis of distributed processes from scenario-based specifications
FM'05 Proceedings of the 2005 international conference on Formal Methods
From scenarios to test implementations via Promela
ICTSS'10 Proceedings of the 22nd IFIP WG 6.1 international conference on Testing software and systems
Hi-index | 0.00 |
There exists a unique minimal generalisation of a UML sequence diagram (SD) that is race free, known as the inherent causal scenario. However, practitioners sometimes regard this solution as invalid since it is a purely mathematical construct that apparently does not describe a concrete software engineering solution for resolving race conditions.Practitioners often implement SDs with random access input buffers. Messages are then consumed correctly regardless of the order or time at which they arrive, which appears to avoid race conditions altogether. However, this approach changes the observable system behaviour from that specified. We refer to this approach as the lazy buffer realization of a SD.We introduce an operational semantics for the lazy buffer realization. We prove the inherent causal scenario global behaviour is bisimulation equivalent to the global behaviour of lazy buffer semantics. Hence, in this sense, the practitioners solution is theoretically the best possible. Also this proves that the inherent causal scenario does represent a `real-world' software solution.