TY - CONF A1 - Incerto, Emilio A1 - Tribastone, Mirco A1 - Trubiani, Catia N2 - Quality-of-Service attributes such as performance and reliability heavily depend on the run-time conditions under which software is executed (e.g., workload fluctuation and resources availability). Therefore, it is important to design systems able to adapt their setting and behavior due to these run-time variabilities. In this paper we propose a novel approach based on queuing networks as the quantitative model to represent system configurations. To find a model that fits with continuous changes in run-time conditions we rely on an innovative combination of symbolic analysis and satisfiability modulo theory (SMT). Through symbolic analysis we represent all possible system configurations as a set of nonlinear real constraints. By formulating an SMT problem we are able to devise feasible system configurations at a small computational cost. We study the effectiveness and scalability of our approach on a three-tier web system featuring different levels of redundancy. M2 - New York, USA T2 - Proceedings of the 11th International Symposium on Software Engineering for Adaptive and Self-Managing Systems SN - 978-1-4503-4187-5 T3 - SEAMS '16 Y1 - 2016/// PB - ACM ID - eprints3574 EP - 150 UR - http://doi.acm.org/10.1145/2897053.2897060 SP - 140 TI - Symbolic Performance Adaptation CY - New York, NY, USA AV - none N1 - SCOPUS ID: 2-s2.0-84974603563 KW - performance-based adaptation KW - queueing networks KW - satisfiability modulo theories KW - symbolic analysis ER -