Statecharts: A visual formalism for complex systems
Science of Computer Programming
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
On Semantics and Refinement of UML Statecharts: A Coalgebraic View
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Experimenting Formal Proofs of Petri Nets Refinements
Electronic Notes in Theoretical Computer Science (ENTCS)
Systematic translation rules from ASTD to event-B
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Comparison of model checking tools for information systems
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
A proof-based approach to verifying reachability properties
Proceedings of the 2011 ACM Symposium on Applied Computing
Combining UML, ASTD and B for the formal specification of an access control filter
Innovations in Systems and Software Engineering
Refinement patterns for hierarchical UML state machines
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
| Hi-index | 0.00 |
astd is a formal and graphical language specifically defined for information system specification. Up to now, a specifier had to build an astd specification from scratch and there were no refinement techniques for stepwise construction. This paper aims at introducing refinement patterns for astd, which are inspired from real case studies. For each pattern, proof obligations have been identified to define the refinement semantics we want to provide. The three refinement patterns presented in the paper are illustrated by an example of a basic complaint management system.