Communicating sequential processes
Communicating sequential processes
Introduction to algebraic specifications based on the language ACT ONE
Computer Networks and ISDN Systems - Formal description technique (FDT) languages for protocols
International Journal on Software Tools for Technology Transfer (STTT) - Special section on high-level test of complex systems
Protocol Conformance Testing a SIP Registrar: an Industrial Application of Formal Methods
SEFM '07 Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods
UML Statecharts Compositional Semantics in LOTOS
ISPDC '08 Proceedings of the 2008 International Symposium on Parallel and Distributed Computing
From UML Statecharts to LOTOS: A Semantics Preserving Model Transformation
QSIC '09 Proceedings of the 2009 Ninth International Conference on Quality Software
CADP 2006: a toolbox for the construction and analysis of distributed processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
QSIC '10 Proceedings of the 2010 10th International Conference on Quality Software
Refinement-Based development of timed systems
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Hi-index | 0.00 |
As testing of software systems becomes more and more important and expensive, there is a trend to automate as much as possible of this task. This article is intended as an attempt to breach the gap between academic model-based testing tools and their usage in industry. This is done by allowing the specification of a system in a widely accepted industry notation (UML state charts) and via a behind the scene transformation providing a formal representation of the system using the formal language LOTOS. As a byproduct of the transformation a formal semantics of UML state charts is given. An interesting class of software systems well suited for the application are distributed timed control oriented systems. As LOTOS contains no timing constructs, the timing information in the system is automatically abstracted by preserving the execution order of the timeout transitions.