%0 Conference Proceedings
%T Incremental Refinement of Goal Models with Contracts
%+ Göteborgs Universitet = University of Gothenburg (GU)
%+ Chalmers University of Technology [Göteborg]
%+ University of Southern California (USC)
%+ Gran Sasso Science Institute (GSSI)
%A Mallozzi, Piergiuseppe
%A Nuzzo, Pierluigi
%A Pelliccione, Patrizio
%Z Part 1: Coordination
%< avec comité de lecture
%@ 978-3-030-89246-3
%( Lecture Notes in Computer Science
%B 9th International Conference on Fundamentals of Software Engineering (FSEN)
%C Virtual, Iran
%Y Hossein Hojjat
%Y Mieke Massink
%I Springer International Publishing
%3 Fundamentals of Software Engineering
%V LNCS-12818
%P 35-50
%8 2021-05-19
%D 2021
%R 10.1007/978-3-030-89247-0_3
%Z Computer Science [cs]Conference papers
%X Goal models and contracts offer complementary approaches to requirement analysis. Goal modeling has been effectively used to capture designer’s intents and their hierarchical structure. Contracts emphasize modularity and formal representations of the interactions between system components. In this paper, we present CoGoMo (Contract-based Goal Modeling), a framework for systematic requirement analysis, which leverages a new formal model, termed contract-based goal tree, to represent goal models in terms of hierarchies of contracts. Based on this model, we propose algorithms that use contract operations and relations to check goal consistency and completeness, and support incremental and hierarchical refinement of goals from a library of goals. Model and algorithms are implemented in a tool which enables incremental formalization and refinement of goals from a web interface. We show the effectiveness of our approach on an illustrative example motivated by vehicle platooning.
%G English
%Z TC 2
%Z WG 2.2
%2 https://inria.hal.science/hal-04074529/document
%2 https://inria.hal.science/hal-04074529/file/506725_1_En_3_Chapter.pdf
%L hal-04074529
%U https://inria.hal.science/hal-04074529
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC2
%~ IFIP-WG2-2
%~ IFIP-FSEN
%~ IFIP-LNCS-12818