343 results found
IEEE Discrete event controllers are at the heart of many software systems that require continuous operation. Changing these controllers at runtime to cope with changes in its execution environment or system requirements change is a challenging open problem. In this paper we address the problem of dynamic update of controllers in reactive systems. We present a general approach to specifying correctness criteria for dynamic update and a technique for automatically computing a controller that handles the transition from the old to the new specification, assuring that the system will reach a state in which such a transition can correctly occur and in which the underlying system architecture can reconfigure. Our solution uses discrete event controller synthesis to automatically build a controller that guarantees both progress towards update and safe update.
Duarte LM, Kramer J, Uchitel S, 2017, Using contexts to extract models from code, SOFTWARE AND SYSTEMS MODELING, Vol: 16, Pages: 523-557, ISSN: 1619-1366
Braberman V, D’Ippolito N, Kramer J, et al., 2017, An extended description of MORPH: A reference architecture for configuration and behaviour self-adaptation, Pages: 377-408, ISSN: 0302-9743
© Springer International Publishing AG 2017. An architectural approach to self-adaptive systems involves runtime change of system configuration (i.e., the system’s components, their bindings and operational parameters) and behaviour update (i.e., component orchestration). The architecture should allow for both configuration and behaviour changes selected from pre-computed change strategies and for synthesised change strategies at run-time to satisfy changes in the environment, changes in the specified goals of the system or in response to failures or degradation in quality attributes, such as performance, of the system itself. Although controlling configuration and behaviour at runtime has been discussed and applied to architectural adaptation, architectures for self-adaptive systems often compound these two aspects reducing the potential for adaptability. In this work we provide an extended description of our proposal for a reference architecture that allows for coordinated yet transparent and independent adaptation of system configuration and behaviour.
Hazzan O, Kramer J, 2016, Assessing Abstraction Skills, COMMUNICATIONS OF THE ACM, Vol: 59, Pages: 43-45, ISSN: 0001-0782
Alrajeh D, Russo A, Uchitel S, et al., 2016, Logic-based Learning in Software Engineering, 38th IEEE/ACM International Conference on Software Engineering Companion (ICSE), Publisher: IEEE, Pages: 892-893
Nahabedian L, Braberman V, D'Ippolito N, et al., 2016, Assured and Correct Dynamic Update of Controllers, 11th IEEE/ACM International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS), Publisher: IEEE, Pages: 96-107
Alrajeh D, van Lamsweerde A, Kramer J, et al., 2016, Risk-Driven Revision of Requirements Models, 38th IEEE/ACM International Conference on Software Engineering (ICSE), Publisher: IEEE, Pages: 855-865, ISSN: 0270-5257
Braberman V, D'Ippolito N, Kramer J, et al., 2015, MORPH: A reference architecture for configuration and behaviour self-adaptation, Pages: 9-16
© 2015 ACM. An architectural approach to self-adaptive systems involves runtime change of system configuration (i.e., the system's components, their bindings and operational parameters) and behaviour update (i.e., component orchestration). Thus, dynamic reconfiguration and discrete event control theory are at the heart of architectural adaptation. Although controlling configuration and behaviour at runtime has been discussed and applied to architectural adaptation, architectures for self-adaptive systems often compound these two aspects reducing the potential for adaptability. In this paper we propose a reference architecture that allows for coordinated yet transparent and independent adaptation of system configuration and behaviour.
Kramer J, 2015, Adventures in Adaptation: A Software Engineering Playground! (Keynote), IEEE/ACM 10th International Symposium on Software Engineering for Adaptive and Self-Managing Systems, Publisher: IEEE, Pages: 1-1
Rodrigues P, Kramer J, Lupu E, 2015, On Re-Assembling Self-Managed Components, IFIP/IEEE International Symposium on Integrated Network Management (IM), Publisher: IEEE, Pages: 727-733
Rodrigues P, Lupu E, Kramer J, 2015, Compositional Reliability Analysis for Probabilistic Component Automata, 2015 IEEE ACM 7th International Workshop on Modeling in Software Engineering, Publisher: IEEE, Pages: 19-24
D'Ippolito N, Braberman V, Kramer J, et al., 2014, Hope for the Best, Prepare for the Worst: Multi-tier Control for Adaptive Systems, 36th International Conference on Software Engineering (ICSE), Publisher: ASSOC COMPUTING MACHINERY, Pages: 688-699
Rodrigues P, Lupu E, Kramer J, 2014, LTSA-PCA: Tool Support for Compositional Reliability Analysis, 36th International Conference on Software Engineering ((ICSE Companion), Publisher: ASSOC COMPUTING MACHINERY, Pages: 548-551
Uchitel S, Alrajeh D, Ben-David S, et al., 2013, Supporting incremental behaviour model elaboration, Computer Science - Research and Development, Vol: 28, Pages: 279-293, ISSN: 1865-2034
Behaviour model construction remains a difficult and labour intensive task which hinders the adoption of model-based methods by practitioners. We believe one reason for this is the mismatch between traditional approaches and current software development process best practices which include iterative development, adoption of use-case and scenario-based techniques and viewpoint- or stakeholder-based analysis; practices which require modelling and analysis in the presence of partial information about system behaviour. Our objective is to address the limitations of behaviour modelling and analysis by shifting the focus from traditional behaviour models and verification techniques that require full behaviour information to partial behaviour models and analysis techniques, that drive model elaboration rather than asserting adequacy. We aim to develop sound theory, techniques and tools that facilitate the construction of partial behaviour models through model synthesis, enable partial behaviour model analysis and provide feedback that prompts incremental elaboration of partial models. In this paper we present how the different research threads that we have and currently are developing help pursue this vision as part of the "Partial Behaviour Modelling - Foundations for Iterative Model Based Software Engineering" Starting Grant funded by the ERC. We cover partial behaviour modelling theory and construction, controller synthesis, automated diagnosis and refinement, and behaviour validation. © 2012 Springer-Verlag Berlin Heidelberg.
Sibay GE, Braberman V, Uchitel S, et al., 2013, Synthesizing Modal Transition Systems from Triggered Scenarios, IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, Vol: 39, Pages: 975-1001, ISSN: 0098-5589
Alrajeh D, Kramer J, Russo A, et al., 2013, Elaborating Requirements Using Model Checking and Inductive Learning, IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, Vol: 39, Pages: 361-383, ISSN: 0098-5589
Sykes D, Corapi D, Magee J, et al., 2013, Learning Revised Models for Planning in Adaptive Systems, 35th International Conference on Software Engineering (ICSE), Publisher: IEEE, Pages: 63-71
In order to capture all permissible implementations, partial models of component based systems are given as at the system level. However, iterative refinement by engineers is often more convenient at the component level. In this paper, we address the problem of decomposing partial behaviour models from a single monolithic model to a component-wise model. Specifically, given a Modal Transition System (MTS) M and component interfaces (the set of actions each component can control/monitor), can MTSs M 1 ..., M n matching the component interfaces be produced such that independent refinement of each M i will lead to a component Labelled Transition Systems (LTS) I i such that composing the I i s result in a system LTS that is a refinement of M? We show that a sound and complete distribution can be built when the MTS to be distributed is deterministic, transition modalities are consistent and the LTS determined by its possible transitions is distributable. © 2012 Springer-Verlag.
Alrajeh D, Russo A, Uchitel S, et al., 2012, Integrating model checking and inductive logic programming, Pages: 45-60, ISSN: 0302-9743
Inductive Logic Programming can be used to provide automated support to help correct the errors identified by model checking, which in turn provides the relevant context for learning hypotheses that are meaningful within the domain of interest. Model checking and Inductive Logic Programming can thus be seen as two complementary approaches with much to gain from their integration. In this paper we present a general framework for such an integration, discuss its main characteristics and present an overview of its application. © 2012 Springer-Verlag Berlin Heidelberg.
Alrajeh D, Kramer J, Russo A, et al., 2012, Learning from Vacuously Satisfiable Scenario-Based Specifications, 15th International Conference on Fundamental Approaches to Software Engineering (FASE), Publisher: SPRINGER-VERLAG BERLIN, Pages: 377-393, ISSN: 0302-9743
Alrajeh D, Kramer J, van Lamsweerde A, et al., 2012, Generating Obstacle Conditions for Requirements Completeness, 34th International Conference on Software Engineering (ICSE), Publisher: IEEE, Pages: 705-715, ISSN: 0270-5257
Kramer J, 2012, Whither Software Architecture? (Keynote), 34th International Conference on Software Engineering (ICSE), Publisher: IEEE, Pages: 963-963, ISSN: 0270-5257
Alrajeh D, Kramer J, Russo A, et al., 2011, An Inductive approach for modal transition system refinement, Pages: 106-116, ISSN: 1868-8969
Modal Transition Systems (MTSs) provide an appropriate framework for modelling software behaviour when only a partial specification is available. A key characteristic of an MTS is that it explicitly models events that a system is required to provide and is proscribed from exhibiting, and those for which no specification is available, called maybe events. Incremental elaboration of maybe events into either required or proscribed events can be seen as a process of MTS refinement, resulting from extending a given partial specification with more information about the system behaviour. This paper focuses on providing automated support for computing strong refinements of an MTS with respect to event traces that describe required and proscribed behaviours using a non-monotonic inductive logic programming technique. A real case study is used to illustrate the practical application of the approach.
Sykes D, Magee J, Kramer J, 2011, FlashMob: Distributed adaptive self-assembly, Pages: 100-109, ISSN: 0270-5257
Autonomous systems need to support dynamic software adaptation in order to handle the complexity and unpredictability of the execution environment, and the changing needs of the end user. Although a number of approaches have been proposed, few address a key issue: that of distribution. In this paper we seek to overcome the limitations of centralised approaches. We build on our previous work on adaptive self-assembly within the three-layer model for autonomous systems to provide a decentralised technique for self-assembly. To achieve this in a fault-tolerant and scalable manner, we use a gossip protocol as a basis. While no central or leader node is aware of the full space of solutions, gossip ensures that agreement on a particular solution - in this case a component configuration - is reached in a logarithmic number of steps with respect to the size of the network. © 2011 ACM.
McVeigh A, Kramer J, Magee J, 2011, Evolve: Tool Support for Architecture Evolution, 33rd International Conference on Software Engineering (ICSE), Publisher: IEEE, Pages: 1040-1042
Lang F, Salauen G, Herilier R, et al., 2010, Translating FSP into LOTOS and networks of automata, FORMAL ASPECTS OF COMPUTING, Vol: 22, Pages: 681-711, ISSN: 0934-5043
Kramer J, Bishop J, Devanbu P, et al., 2010, ICSE 2010 Foreword, ISSN: 0270-5257
Kramer J, Bishop J, Devanbu P, et al., 2010, ICSE 2010 foreword, ISSN: 0270-5257
Sykes D, Heaven W, Magee J, et al., 2010, Exploiting non-functional preferences in architectural adaptation for self-managed systems, Pages: 431-438
Among the many challenges of engineering dependable, self-managed, component-based systems is their need to make informed decisions about adaptive reconfigurations in response to changing requirements or a changing environment. Such decisions may be made on the basis of non-functional or QoS aspects of reconfiguration in addition to the purely functional properties needed to meet a goal. We present a practical approach for using non-functional information to guide a procedure for assembling, and subsequently modifying, configurations of software components, and compare the performance of two variants of the approach. In addition, we outline a scheme for monitoring non-functional properties in the running system such that more accurate information can be utilised in the next adaptation. © 2010 ACM.
This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.