Synthesis and quantitative verification of tradeoff spaces for families of software systems

11Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Designing software subject to uncertainty in a way that provides guarantees about its run-time behavior while achieving an acceptable balance between multiple extra-functional properties is still an open problem. Tools and techniques to inform engineers about poorly-understood design spaces in the presence of uncertainty are needed. To tackle this problem, we propose an approach that combines synthesis of spaces of system design alternatives from formal specifications of architectural styles with probabilistic formal verification. The main contribution of this paper is a formal framework for specification-driven synthesis and analysis of design spaces that provides formal guarantees about the correctness of system behaviors and satisfies quantitative properties (e.g., defined over system qualities) subject to uncertainty, which is factored as a first-class entity.

Cite

CITATION STYLE

APA

Cámara, J., Garlan, D., & Schmerl, B. (2017). Synthesis and quantitative verification of tradeoff spaces for families of software systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10475 LNCS, pp. 3–21). Springer Verlag. https://doi.org/10.1007/978-3-319-65831-5_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free