Refinement is fundamental to software development. An earlier work proposed a refinement relation between sequence diagrams based on their required behaviors. In this paper, we first generalize the refinement relation by taking into account system variable assignment and event hiding, renaming and substitution. We then give an algorithm as a system of inference rules that does not just verify refinement relationship between two sequence diagrams but also derives sufficient conditions under which such a relationship holds. The algorithm makes use of a semantics preserving transformation on sequence diagrams. The usefulness of refinement inference is demonstrated with a case study. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Lu, L., & Kim, D. K. (2013). Refinement inference for sequence diagrams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7741 LNCS, pp. 432–444). https://doi.org/10.1007/978-3-642-35843-2_37
Mendeley helps you to discover research relevant for your work.