2015/03/25 by Conner Hansen, Eugene Syriani, Hansen, Conner +4
Computer Science · #Advanced Software Engineering Methodologies #FOS: Computer and information sciences #Formal Methods in Verification #Model-Driven Software Engineering Techniques #Software Engineering (cs.SE) #cs.SE
paper · pdf · doi:10.48550/arxiv.1503.07266
In Poster Proceedings of 6th Conference on Software Language Engineering (SLE) 2013 (http://www.sleconf.org/2013/)
arxiv created 2015/03/25 · openalex publication_date 2015/03/25 · arxiv updated 2015/03/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In incremental development strategies, modelers frequently refine Statecharts models to satisfy requirements and changes. Although several solutions exist to the problem of Statecharts refinement, they provide such levels of freedom that a statechart cannot make assumptions or guarantees about its future structure. In this paper, we propose a set of bounding rules to limit the allowable Statecharts refinement operations such that certain assumptions will hold.