Feedback control as MAPE-K loop in autonomic computing

E Rutten, N Marchand, D Simon - … 15-19, 2013, Revised Selected and …, 2018 - Springer
Computing systems are becoming more and more dynamically reconfigurable or adaptive,
to be flexible wrt their environment and to automate their administration. Autonomic …

Morph: A reference architecture for configuration and behaviour self-adaptation

V Braberman, N D'Ippolito, J Kramer, D Sykes… - Proceedings of the 1st …, 2015 - dl.acm.org
An architectural approach to self-adaptive systems involves runtime change of system
configuration (ie, the system's components, their bindings and operational parameters) and …

Control strategies for self-adaptive software systems

A Filieri, M Maggio, K Angelopoulos… - ACM Transactions on …, 2017 - dl.acm.org
The pervasiveness and growing complexity of software systems are challenging software
engineering to design systems that can adapt their behavior to withstand unpredictable …

GR (1) synthesis for LTL specification patterns

S Maoz, JO Ringert - Proceedings of the 2015 10th joint meeting on …, 2015 - dl.acm.org
Reactive synthesis is an automated procedure to obtain a correct-by-construction reactive
system from its temporal logic specification. Two of the main challenges in bringing reactive …

Spectra: a specification language for reactive systems

S Maoz, JO Ringert - Software and Systems Modeling, 2021 - Springer
We introduce Spectra, a new specification language for reactive systems, specifically
tailored for the context of reactive synthesis. The meaning of Spectra is defined by a …

Planning under LTL environment specifications

B Aminof, G De Giacomo, A Murano… - Proceedings of the …, 2019 - ojs.aaai.org
Planning domains represent what an agent assumes or believes about the environment it
acts in. In the presence of nondeterminism, additional temporal assumptions, such as …

LTLƒ Synthesis with Fairness and Stability Assumptions

S Zhu, G De Giacomo, G Pu, MY Vardi - … of the AAAI Conference on Artificial …, 2020 - aaai.org
In synthesis, assumptions are constraints on the environment that rule out certain
environment behaviors. A key observation here is that even if we consider systems with LTL …

Symbolic repairs for GR (1) specifications

S Maoz, JO Ringert, R Shalom - 2019 IEEE/ACM 41st …, 2019 - ieeexplore.ieee.org
Unrealizability is a major challenge for GR (1), an expressive assume-guarantee fragment of
LTL that enables efficient synthesis. Some works attempt to help engineers deal with …

How to handle assumptions in synthesis

R Bloem, R Ehlers, S Jacobs, R Könighofer - arxiv preprint arxiv …, 2014 - arxiv.org
The increased interest in reactive synthesis over the last decade has led to many improved
solutions but also to many new questions. In this paper, we discuss the question of how to …

Grail: Context-aware fixing of concurrency bugs

P Liu, O Tripp, C Zhang - Proceedings of the 22nd ACM SIGSOFT …, 2014 - dl.acm.org
Writing efficient synchronization for multithreaded programs is notoriously hard. The
resulting code often contains subtle concurrency bugs. Even worse, many bug fixes …