 |
|
@inproceedings {INPROC-2019-43,
author = {Lukas Reinfurt and Michael Falkenthal and Frank Leymann},
title = {{A Pattern-Based Method for Designing IoT Systems}},
booktitle = {Proceedings of the 13th Symposium and Summer School On Service-Oriented Computing (SummerSoc19)},
publisher = {IBM Research Division},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {1--27},
type = {Konferenz-Beitrag},
month = {September},
year = {2019},
keywords = {Pattern Languages; Design Patterns; Pattern-Based Method; Internet of Things; System Design},
language = {Englisch},
cr-category = {C.2.4 Distributed Systems,
D.2.11 Software Engineering Software Architectures},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {The Internet of Things pattern language can be a valuable tool for
practitioners that want to design an IoT system. It offers them abstract proven
solutions based on existing real world uses and, thus, makes working with the
large amount of different devices, platforms, technologies, and standards in
the field of IoT more manageable. Practitioners can use the pattern language to
design an IoT system by starting with any pattern they deem suitable and then
by continuing to follow the links to related patterns defined by the pattern
language. However, when designing an IoT system, applying patterns in a certain
order can be beneficial. It allows practitioners to think through important
aspects of the system in the right order to minimize context switching and to
avoid having to change previous decisions. Thus, we introduce a pattern-based
method for designing IoT systems. It guides practitioners through the steps of
designing an IoT system in a sensible order. Based on answers to specific
questions asked in each step, it points practitioners to suitable patterns and
other helpful tools. The result is a pattern-annotated architecture diagram
that can be used as basis for further architecture refinement, as a guide for
finding existing solutions, and as input for communication with other involved
stakeholders.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-43&engl=0}
}
@inproceedings {INPROC-2019-42,
author = {Andrea Lamparelli and Ghareeb Falazi and Uwe Breitenb{\"u}cher and Florian Daniel and Frank Leymann},
title = {{Smart Contract Locator (SCL) and Smart Contract Description Language (SCDL)}},
booktitle = {Service-Oriented Computing - ICSOC 2019 Workshops},
publisher = {Springer},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
series = {Lecture Notes in Computer Science (LNCS)},
volume = {12019},
pages = {195--210},
type = {Workshop-Beitrag},
month = {Oktober},
year = {2019},
doi = {10.1007/978-3-030-45989-5_16},
language = {Englisch},
cr-category = {C.2.4 Distributed Systems,
D.2.11 Software Engineering Software Architectures,
D.2.12 Software Engineering Interoperability},
contact = {Ghareeb Falazi ghareeb.falazi@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Today{\^a}€™s blockchain technologies focus mostly on isolated, proprietary
technologies, yet there are application scenarios that ask for
interoperability, e.g., among blockchains themselves or with external
applications. This paper proposes the Smart Contract Locator (SCL) for the
unambiguous identification of smart contracts over the Internet and across
blockchains, and the Smart Contract Description Language (SCDL) for the
abstract description of the external interface of smart contracts. The paper
derives a unified metamodel for blockchain smart contract description and
equips it with a concrete, JSON-based description language for smart contract
search and discovery. The goal of the proposal is to foster smart contract
reuse both inside blockchains and through the integration of smart contracts
inside enterprise applications. The idea is inspired by the Service-Oriented
Architecture (SOA) and aims to provide a high-level, cross-blockchain
interoperability layer.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-42&engl=0}
}
@inproceedings {INPROC-2019-41,
author = {Michael Wurster and Uwe Breitenb{\"u}cher and Antonio Brogi and Ghareeb Falazi and Lukas Harzenetter and Frank Leymann and Jacopo Soldani and Vladimir Yussupov},
title = {{The EDMM Modeling and Transformation System}},
booktitle = {Service-Oriented Computing - ICSOC 2019 Workshops},
publisher = {Springer},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {294--298},
type = {Demonstration},
month = {Oktober},
year = {2019},
doi = {10.1007/978-3-030-45989-5_26},
language = {Englisch},
cr-category = {C.0 Computer Systems Organization, General,
D.2 Software Engineering},
contact = {Michael Wurster wurster@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Since deployment automation technologies are heterogeneous regarding their
supported features and modeling languages, selecting a concrete technology is
difficult and can result in a lock-in. Therefore, we presented the Essential
Deployment Metamodel (EDMM) in previous work that abstracts from concrete
technologies and provides a normalized metamodel for creating
technology-independent deployment models. In this demonstration, we present
tool support for EDMM in the form of the EDMM Modeling and Transformation
System, which enables (i) creating EDMM models graphically and (ii)
automatically transforming them into models supported by concrete deployment
automation technologies.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-41&engl=0}
}
@inproceedings {INPROC-2019-40,
author = {Karoline Saatkamp and Christoph Krieger and Frank Leymann and Julian Sudendorf and Michael Wurster},
title = {{Application Threat Modeling and Automated VNF Selection for Mitigation using TOSCA}},
booktitle = {2019 International Conference on Networked Systems (NetSys)},
publisher = {IEEE},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {1--6},
type = {Workshop-Beitrag},
month = {Oktober},
year = {2019},
isbn = {10.1109/NetSys.2019.8854524},
keywords = {Threat Modeling; VNF; STRIDE; TOSCA},
language = {Englisch},
cr-category = {D.2.2 Software Engineering Design Tools and Techniques},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {In the era of Internet of Things (IoT) the interconnectedness of devices, and
thus the need to protect them against threats increased. The widely used threat
modeling method STRIDE can be used to identify the system's vulnerabilities and
to determine appropriate mitigation solutions. In connected environments,
especially the network layer plays a critical role in achieving security. Based
on the Network Functions Virtualization (NFV) concept, network functions can be
virtualized and provisioned on standard IT hardware. Virtualized Network
Functions (VNFs) increase the flexibility of the provisioning, and thus
security network functions, such as firewalls, can be easily deployed. However,
in a complex distributed system it is time-consuming, error-prone, and for
application architects even not possible to identify and provision the required
security functions. For the orchestration and management of applications the
TOSCA modeling language can be used to describe the application's components
and their relations in a deployment model. The standard was mainly developed
for cloud applications but was extended to the network layer. In this paper, we
present a TOSCA-based approach for threat modeling based on STRIDE that
facilitates the automated VNF selection and injection into TOSCA deployment
models. The feasibility of our approach is validated by an extension of the
TOSCA modeling tool Winery.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-40&engl=0}
}
@inproceedings {INPROC-2019-38,
author = {Vladimir Yussupov and Uwe Breitenb{\"u}cher and Frank Leymann and Christian M{\"u}ller},
title = {{Facing the Unplanned Migration of Serverless Applications: A Study on Portability Problems, Solutions, and Dead Ends}},
booktitle = {Proceedings of the 12th IEEE/ACM International Conference on Utility and Cloud Computing (UCC 2019)},
editor = {ACM},
publisher = {ACM},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {273--283},
type = {Konferenz-Beitrag},
month = {Dezember},
year = {2019},
doi = {10.1145/3344341.3368813},
keywords = {Serverless; Function-as-a-Service; FaaS; Portability; Migration},
language = {Englisch},
cr-category = {D.2.0 Software Engineering General,
D.2.11 Software Engineering Software Architectures,
D.2.12 Software Engineering Interoperability},
ee = {https://www.ucc-conference.org},
contact = {Vladimir Yussupov yussupov@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Serverless computing focuses on developing cloud applications that comprise
components fully managed by providers. Function-as-a-Service (FaaS) service
model is often associated with the term serverless as it allows developing
entire applications by composing provider-managed, event-driven code snippets.
However, such reduced control over the infrastructure and tight-coupling with
provider's services amplify the various lock-in problems. In this work, we
explore the challenges of migrating serverless, FaaS-based applications across
cloud providers. To achieve this, we conduct an experiment in which we
implement four prevalent yet intentionally simple serverless use cases and
manually migrate them across three popular commercial cloud providers. The
results show that even when migrating simple use cases, developers encounter
multiple aspects of a lock-in problem. Moreover, we present a categorization of
the problems and discuss the feasibility of possible solutions.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-38&engl=0}
}
@inproceedings {INPROC-2019-37,
author = {Vladimir Yussupov and Uwe Breitenb{\"u}cher and Frank Leymann and Michael Wurster},
title = {{A Systematic Mapping Study on Engineering Function-as-a-Service Platforms and Tools}},
booktitle = {Proceedings of the 12th IEEE/ACM International Conference on Utility and Cloud Computing (UCC 2019)},
editor = {ACM},
publisher = {ACM},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {229--240},
type = {Konferenz-Beitrag},
month = {Dezember},
year = {2019},
doi = {10.1145/3344341.3368803},
keywords = {Serverless; FaaS; Function-as-a-Service; Systematic Mapping Study},
language = {Englisch},
cr-category = {C.0 Computer Systems Organization, General,
C.2.4 Distributed Systems,
D.2 Software Engineering},
ee = {https://www.ucc-conference.org},
contact = {Vladimir Yussupov yussupov@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Function-as-a-Service (FaaS) is a novel cloud service model allowing to develop
fine-grained, provider-managed cloud applications. In this work, we investigate
which challenges motivate researchers to introduce or enhance FaaS platforms
and tools. We use a systematic mapping study method to collect and analyze the
relevant scientific literature, which helps us answering the three
clearly-defined research questions. We design our study using well-established
guidelines and systematically apply it to 62 selected publications. The
collected and synthesized data provides useful insights into the main
challenges that motivate researchers to work on this topic and can be helpful
in identifying research gaps for future research.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-37&engl=0}
}
@inproceedings {INPROC-2019-36,
author = {Vladimir Yussupov and Uwe Breitenb{\"u}cher and Michael Hahn and Frank Leymann},
title = {{Serverless Parachutes: Preparing Chosen Functionalities for Exceptional Workloads}},
booktitle = {Proceedings of the 2019 IEEE 23rd International Enterprise Distributed Object Computing Conference (EDOC 2019)},
publisher = {IEEE Computer Society},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {226--235},
type = {Konferenz-Beitrag},
month = {Oktober},
year = {2019},
doi = {10.1109/EDOC.2019.00035},
keywords = {Serverless; FaaS; Function-as-a-Service; Scalability; Failover; Annotation},
language = {Englisch},
cr-category = {D.2.2 Software Engineering Design Tools and Techniques,
D.2.11 Software Engineering Software Architectures,
D.3.4 Programming Languages Processors},
ee = {https://edoc2019.sciencesconf.org/},
contact = {Vladimir Yussupov yussupov@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Function-as-a-Service (FaaS) is an emerging cloud service model that enables
composing applications using arbitrary, small, and event-driven code snippets
managed by cloud providers and that can be scaled to zero. The scalability
properties of FaaS look attractive for handling rare or unexpected high loads
that affect only particular functionalities of the application. However,
deciding on the component granularity upfront or reengineering the architecture
of an entire application for rare workloads is often a very difficult challenge
or even infeasible. In this work, we introduce a method that prepares annotated
functionalities for handling rare workloads by automatically extracting them
from the source code of the application and additionally deploying them as FaaS
functions, while keeping the original application's functionalities and
architecture unchanged. In this way, the benefits of FaaS can be leveraged
without the need to reengineer the application only for rare cases. We validate
our method by means of a prototype, evaluate its feasibility in a set of
experiments, and discuss limitations and future work.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-36&engl=0}
}
@inproceedings {INPROC-2019-35,
author = {Ghareeb Falazi and Michael Hahn and Uwe Breitenb{\"u}cher and Frank Leymann and Vladimir Yussupov},
title = {{Process-Based Composition of Permissioned and Permissionless Blockchain Smart Contracts}},
booktitle = {Proceedings of the 2019 IEEE 23rd International Enterprise Distributed Object Computing Conference (EDOC 2019)},
publisher = {IEEE Computer Society},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {77--87},
type = {Konferenz-Beitrag},
month = {Oktober},
year = {2019},
doi = {10.1109/EDOC.2019.00019},
language = {Englisch},
cr-category = {C.2.4 Distributed Systems,
D.2.2 Software Engineering Design Tools and Techniques,
D.2.11 Software Engineering Software Architectures},
ee = {https://edoc2019.sciencesconf.org/},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Blockchains are distributed systems that facilitate the interaction of
autonomous entities with limited mutual trust. Many of them support
transactional applications known as smart contracts, which access and modify
the shared world state. Permissionless blockchains are completely decentralized
and do not require mutual trust between interacting peers, but at the expense
of having low performance and limited data confidentiality capabilities. On the
other hand, permissioned blockchains solve these issues, but sacrifice complete
decentralization and involve more trust assumptions. Therefore, there is no
single blockchain system suitable for all use-cases. However, this becomes a
serious integration challenge for enterprises that need to interact with
multiple permissioned and permissionless blockchains in the same context. To
facilitate this, we propose an approach that enables composing smart contract
functions of various permissioned and permissionless blockchain systems by
providing the ability to invoke them directly from business process models
using a new task type. To keep this task blockchain-agnostic, we designed a
generic technique to identify smart contract functions, as well as a generic
metric to describe the degree-of-confidence in the finality of blockchain
transactions. Thereby, the proposed approach extends our previous work,
BlockME, which provides business modeling extensions only suitable for
interacting with permissionless blockchains. To validate the practical
feasibility of our approach, we provide a detailed system architecture and a
prototypical implementation supporting multiple blockchains.
Keywords: blockchains, business process management, permissioned blockchains,
smart contract composition, blockchain access layer, BlockME2},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-35&engl=0}
}
@inproceedings {INPROC-2019-34,
author = {K{\'a}lm{\'a}n K{\'e}pes and Uwe Breitenb{\"u}cher and Frank Leymann and Karoline Saatkamp and Benjamin Weder},
title = {{Deployment of Distributed Applications Across Public and Private Networks}},
booktitle = {Proceedings of the 23rd IEEE International Enterprise Distributed Object Computing Conference (EDOC)},
address = {Paris},
publisher = {IEEE},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {236--242},
type = {Konferenz-Beitrag},
month = {Oktober},
year = {2019},
issn = {2325-6354},
doi = {10.1109/EDOC.2019.00036},
language = {Englisch},
cr-category = {D.4.4 Operating Systems Communications Management,
D.2.11 Software Engineering Software Architectures,
D.2.9 Software Engineering Management},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {The growing usage of software and hardware in our everyday lives has lead to
paradigms such as Cloud Computing, Edge Computing, and the Internet of Things.
The combination of these paradigms results in distributed and heterogeneous
target environments: components of an application often need to be deployed in
different environments such as clouds, private data centers, and small devices.
This makes the deployment of distributed applications a complex and error-prone
challenge as deployment systems have to (i) support cloud deployments, (ii)
determine the location of physical resources, (iii) cope with security
mechanisms preventing inbound communication, and (iv) use hardware-constrained
devices. In this paper, we present an approach for the automated deployment of
distributed applications on heterogeneous target environments consisting of
public and private clouds, and devices. We especially tackle the issue of
deploying components in environments having restricted inbound communication
capabilities. We prototypically implemented and compared our approach based on
a smart home scenario using TOSCA and the OpenTOSCA Ecosystem.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-34&engl=0}
}
@inproceedings {INPROC-2019-33,
author = {Lukas Harzenetter and Uwe Breitenb{\"u}cher and Frank Leymann and Karoline Saatkamp and Benjamin Weder and Michael Wurster},
title = {{Automated Generation of Management Workflows for Applications Based on Deployment Models}},
booktitle = {2019 IEEE 23rd International Enterprise Distributed Object Computing Conference (EDOC)},
publisher = {IEEE},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {216--225},
type = {Konferenz-Beitrag},
month = {Dezember},
year = {2019},
doi = {10.1109/EDOC.2019.00034},
language = {Englisch},
cr-category = {D.0 Software General},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {To automate the deployment of applications several deployment technologies have
been developed. However, the management of deployed applications is only
partially covered by existing approaches: While management functionalities such
as scaling components or changing their configurations are covered directly by
cloud providers or configuration management technologies such as Chef, holistic
management processes that affect multiple components probably deployed in
different environments cannot be automated using these approaches. For example,
testing all deployed components and their communication or backing up the
entire application state that is scattered across different components requires
custom management logic that needs to be implemented manually, $\backslash$eg using
scripts. However, a manual implementation of such management processes is
error-prone, time-consuming, and requires immense technical expertise.
Therefore, we propose an approach that enables automatically generating
executable management workflows based on the declarative deployment model of an
application. This significantly reduces the effort for automating holistic
management processes as no manual implementation is required. We validate the
practical feasibility of the approach by a prototypical implementation based on
the TOSCA standard and the OpenTOSCA ecosystem.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-33&engl=0}
}
@inproceedings {INPROC-2019-30,
author = {Amirali Amiri and Christoph Krieger and Uwe Zdun and Frank Leymann},
title = {{Dynamic Data Routing Decisions for Compliant Data Handling in Service- and Cloud-Based Architectures: A Performance Analysis}},
booktitle = {Proceedings of the 2019 IEEE International Conference on Services Computing (SCC)},
publisher = {IEEE},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {215--219},
type = {Konferenz-Beitrag},
month = {Juli},
year = {2019},
doi = {10.1109/SCC.2019.00044},
language = {Englisch},
cr-category = {C.2.4 Distributed Systems,
D.2.11 Software Engineering Software Architectures},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {In many service-based applications, decisions about data routing need to be
made at runtime, for instance to ensure compliant data handling. Different
service-and cloud-based architectures to make dynamic data routing decisions
exist including central entities, multiple dedicated dynamic router services,
or using a sidecar for each involved service. These archi-tectures differ in
various quality attributes including complexity, understandability, and
changeability of the decision logic. Choosing the wrong architecture for
decision-making at runtime may severely impact the performance of the software
system. In this paper, we have evaluated the performance of three
representative approaches for processing compliance rules concerned with data
routing in service-and cloud-based architectures. The results show that
distributed approaches for dynamic data routing have a better performance
compared to centralized solutions. On the other hand, centralized solutions are
easier to understand and change, but this strongly depends on the domain
problem.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-30&engl=0}
}
@inproceedings {INPROC-2019-29,
author = {Claes Neuefeind and Philip Schildkamp and Brigitte Mathiak and Aleksander Marcic and Frank Hentschel and Lukas Harzenetter and Johanna Barzen and Uwe Breitenb{\"u}cher and Frank Leymann},
title = {{Sustaining the Musical Competitions Database: A TOSCA-based Approach to Application Preservation in the Digital Humanities}},
booktitle = {DH 2019},
publisher = {DH 2019},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {1--1},
type = {Konferenz-Beitrag},
month = {M{\"a}rz},
year = {2019},
language = {Englisch},
cr-category = {A.0 General Literature, General},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {kein abstract},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-29&engl=0}
}
@inproceedings {INPROC-2019-28,
author = {Claes Neuefeind and Philip Schildkamp and Brigitte Mathiak and Lukas Harzenetter and Johanna Barzen and Uwe Breitenb{\"u}cher and Frank Leymann},
title = {{Technologienutzung im Kontext Digitaler Editionen. Eine Landschaftsvermessung}},
booktitle = {DHd 2019 Digital Humanities: multimedial \& multimodal. Konferenzabstracts},
publisher = {Zenodo},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {1--1},
type = {Konferenz-Beitrag},
month = {M{\"a}rz},
year = {2019},
language = {Deutsch},
cr-category = {A.0 General Literature, General},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {kein abstract},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-28&engl=0}
}
@inproceedings {INPROC-2019-24,
author = {Frank Leymann and Johanna Barzen and Michael Falkenthal},
title = {{Towards a Platform for Sharing Quantum Software}},
booktitle = {Proceedings of the 13th Advanced Summer School on Service Oriented Computing (2019)},
publisher = {IBM Research Division},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
series = {IBM Technical Report (RC25685)},
pages = {70--74},
type = {Konferenz-Beitrag},
month = {September},
year = {2019},
keywords = {Quantum computing; software engineering; middleware; platforms; cloud computing},
language = {Englisch},
cr-category = {D.2.0 Software Engineering General,
C.5.0 Computer System Implementation, General},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Quantum computers solving real-world problems are expected to become general
available within the next few years. But software for quantum computers require
very different skills compared to creating software for traditional computers
or networks. Thus, a community-driven approach to creating software for quantum
computers will foster a wide-spread use of this innovative technology. Also, a
platform for quantum software may provide a business model for several user
groups.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-24&engl=0}
}
@inproceedings {INPROC-2019-13,
author = {K{\'a}lm{\'a}n K{\'e}pes and Uwe Breitenb{\"u}cher and Frank Leymann},
title = {{Situation-Aware Management of Cyber-Physical Systems}},
booktitle = {Proceedings of the 9th International Conference on Cloud Computing and Services Science},
editor = {SciTePress},
publisher = {SciTePress},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {551--560},
type = {Konferenz-Beitrag},
month = {Mai},
year = {2019},
isbn = {978-989-758-365-0},
isbn = {10.5220/0007799505510560},
language = {Englisch},
cr-category = {D.2.9 Software Engineering Management},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {The current trend of connecting the physical world with the so-called cyber
world resulted in paradigms such as the Internet of Things or the more general
paradigm of Cyber-Physical Systems. The wide range of domains applicable
results in a heterogeneous landscape of software and hardware solutions. To
benefit of the paradigm, developers must be able to integrate different
solutions from a range of different domains. However, these systems must
therefore be able to change components, configurations and environments, hence,
be adaptable at runtime. We present an approach that is based on the
combination of Situation-Aware Adaptation concepts and Deployment Models. The
general idea is to start processes that can change application structure and
configuration when a certain situation in the context of applications occur. We
validated the technical feasibility of our approach by a prototypical
implementation based on a Smart Home scenario.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-13&engl=0}
}
@inproceedings {INPROC-2019-11,
author = {Karoline Saatkamp and Uwe Breitenb{\"u}cher and Michael Falkenthal and Lukas Harzenetter and Frank Leymann},
title = {{An Approach to Determine \& Apply Solutions to Solve Detected Problems in Restructured Deployment Models Using First-Order Logic}},
booktitle = {Proceedings of the 9th International Conference on Cloud Computing and Services Science (CLOSER 2019)},
publisher = {SciTePress},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {495--506},
type = {Konferenz-Beitrag},
month = {Mai},
year = {2019},
isbn = {978-989-758-365-0},
doi = {10.5220/0007763204950506},
keywords = {deployment model; pattern; logic programming; pattern-based solution; model adaptation; TOSCA},
language = {Englisch},
cr-category = {C.2.4 Distributed Systems,
D.2.2 Software Engineering Design Tools and Techniques,
D.2.12 Software Engineering Interoperability,
K.6 Management of Computing and Information Systems},
ee = {http://closer.scitevents.org/},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {New paradigms such as edge computing opened up new opportunities for
distributing applications to meet use-case-specific requirements. For
automating the deployment of applications, deployment models can be created
that describe the application structure with its components and their
relations. However, the distribution is often not known in advance and, thus,
deployment models have to be restructured. This can result in problems that
have not existed before, e.g., components previously deployed in the same
network were distributed, but security mechanisms are missing. Architecture
patterns can be used to detect such problems, however, patterns describe only
generic technology-independent solutions, which cannot automatically be applied
to applications. Several concrete technologies exist that implements the
pattern. Which solutions are applicable to a particular application is
determined by, e.g., its hosting environment or used communication protocol.
However, the manual effort to determine and implement appropriate solutions is
immense. In this work, we present an approach to automate (i) the determination
of solutions for an application using first-order logic and (ii) the adaptation
of its deployment model accordingly. To validate the practical feasibility, we
present a prototype using the cloud standard TOSCA and the logic programming
language PROLOG.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-11&engl=0}
}
@inproceedings {INPROC-2019-05,
author = {Frank Leymann},
title = {{Towards a Pattern Language for Quantum Algorithms}},
booktitle = {First International Workshop, QTOP 2019, Munich, Germany, March 18, 2019, Proceedings},
publisher = {Springer},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
type = {Konferenz-Beitrag},
month = {April},
year = {2019},
isbn = {978-3-030-14081-6},
language = {Deutsch},
cr-category = {D.2.11 Software Engineering Software Architectures},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Creating quantum algorithms is a difficult task, especially for computer
scientist not used to quantum computing. But quantum algorithms often use
similar elements. Thus, these elements provide proven solutions to recurring
problems, i.e. a pattern language. Sketching such a language is a step towards
establishing a software engineering discipline of quantum algorithms.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-05&engl=0}
}
@article {ART-2019-23,
author = {Lukas Reinfurt and Michael Falkenthal and Frank Leymann},
title = {{Where to Begin - On Pattern Language Entry Points}},
journal = {SICS Software-Intensive Cyber-Physical Systems},
publisher = {Springer},
pages = {1--12},
type = {Artikel in Zeitschrift},
month = {August},
year = {2019},
doi = {https://doi.org/10.1007/s00450-019-00417-6},
keywords = {Internet of Things; Pattern Languages; Entry Points},
language = {Englisch},
cr-category = {C.2.4 Distributed Systems,
D.2.11 Software Engineering Software Architectures,
F.2.2 Nonnumerical Algorithms and Problems,
G.2.2 Discrete Mathematics Graph Theory},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Pattern languages as tools for solving problems based on interconnected,
abstract, and proven solutions can offer valuable help to practitioners. But
there is always the question of where to begin when a pattern language should
be applied. Their authors often provide entry points, but these are usually
only useful if one starts completely from scratch or from a very specific
situation. When confronted with problems at hand, practitioners are often left
to find a suitable entry point themselves by reading through the whole pattern
language to find applicable patterns. To help with this problem, we present a
general approach and its formalization that provides entry points for any kind
of situation. Our general three step approach guides practitioners through
Situation Assessment, Treatment Selection, and Treatment Application in order
to find and apply a suitable pattern language for their specific problems. We
formalize all the parts involved and show that the facts collected during
Situation Assessment can be used to find a suitable entry point for a specific
situation. We also present an algorithm for finding these entry points.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2019-23&engl=0}
}
@article {ART-2019-19,
author = {Vladimir Yussupov and Ghareeb Falazi and Michael Falkenthal and Frank Leymann},
title = {{Protecting Deployment Models in Collaborative Cloud Application Development}},
journal = {International Journal On Advances in Security},
publisher = {IARIA},
volume = {12},
number = {1\&2},
pages = {79--94},
type = {Artikel in Zeitschrift},
month = {Juni},
year = {2019},
issn = {1942-2636},
keywords = {Collaboration; Security Policy; Confidentiality; Integrity; Deployment Model; Deployment Automation; TOSCA},
language = {Englisch},
cr-category = {D.2.11 Software Engineering Software Architectures,
D.4.6 Operating Systems Security and Protection},
contact = {Vladimir Yussupov yussupov@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Profitability of industrial processes today depends on well-timed utilization
of new technologies. Development of cloud applications combining cross-domain
knowledge from multiple collaborating parties is one common way to enhance
manufacturing. Often, such collaborations are not centralized due to
outsourcing or rearrangements in organizational structures. Moreover, manual
deployment inefficiency and intellectual property issues further tangle the
development process of such applications. While the development of deployment
models obviates the necessity to manually deploy applications, a way to protect
sensitive data in exchanged deployment models is still needed. In this work, we
describe the specifics of modeling and enforcement of security requirements for
deployment models in the context of decentralized collaborative cloud
application development. We provide a stepwise demonstration of how security
requirements can be specified and enforced in a collaborative development
scenario based on the TOSCA cloud standard. Furthermore, we conceptualize the
system architecture, provide details about the implementation of certain
approach-specific operations, and discuss the limitations of the approach.
Finally, we show the feasibility of the presented concepts via an open-source
prototype.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2019-19&engl=0}
}
@article {ART-2019-18,
author = {Johanna Barzen and Frank Leymann},
title = {{Quantum humanities: a vision for quantum computing in digital humanities}},
journal = {SICS Software-Intensive Cyber-Physical Systems},
address = {Heidelberg},
publisher = {Springer Berlin Heidelberg},
pages = {1--6},
type = {Artikel in Zeitschrift},
month = {August},
year = {2019},
doi = {https://doi.org/10.1007/s00450-019-00419-4},
language = {Englisch},
cr-category = {H.3.3 Information Search and Retrieval,
H.3.1 Content Analysis and Indexing,
J.5 Arts and Humanities},
contact = {johanna.barzen@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {The establishment of digital humanities as a research field has shown that the
use of computers as tools, but also the use of methods and techniques from
computer science, can contribute enormously to research done in the humanities.
Since quantum computers are expected to become generally available in the next
few years, it is promising to use the advantages of this new technology for
addressing existing as well as completely new questions in the humanities. The
use of quantum computers offers a great deal of potential: (i) they are much
faster than classical computers in solving certain complex problems, (ii)
solutions may be much more precise, (iii) they allow the solution of problem
classes that can hardly been solved on classical computers, and (iv) their
usage promises to be much cheaper than that of supercomputers. Parts of this
potential are already used in different domains but are also particular
promising for digital humanities research. This paper outlines the vision of
such quantum humanities.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2019-18&engl=0}
}
@article {ART-2019-17,
author = {Michael Wurster and Uwe Breitenb{\"u}cher and Michael Falkenthal and Christoph Krieger and Frank Leymann and Karoline Saatkamp and Jacopo Soldani},
title = {{The Essential Deployment Metamodel: A Systematic Review of Deployment Automation Technologies}},
journal = {SICS Software-Intensive Cyber-Physical Systems},
publisher = {Springer},
type = {Artikel in Zeitschrift},
month = {August},
year = {2019},
doi = {10.1007/s00450-019-00412-x},
language = {Englisch},
cr-category = {C.0 Computer Systems Organization, General,
C.2.4 Distributed Systems,
D.1 Programming Techniques,
D.2 Software Engineering},
contact = {Michael Wurster wurster@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {In recent years, a plethora of deployment technologies evolved, many following
a declarative approach to automate the delivery of software components. Even if
such technologies share the same purpose, they differ in features and supported
mechanisms. Thus, it is difficult to compare and select deployment automation
technologies as well as to migrate from one technology to another. Hence, we
present a systematic review of declarative deployment technologies and
introduce the essential deployment metamodel (EDMM) by extracting the essential
parts that are supported by all these technologies. Thereby, the EDMM enables a
common understanding of declarative deployment models by facilitating the
comparison, selection, and migration of technologies. Moreover, it provides a
technology-independent baseline for further deployment automation research.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2019-17&engl=0}
}
@article {ART-2019-16,
author = {Giuliano Casale and Matej Arta\&\#269; and Willem-Jan van den Heuvel and Andr{\'e} van Hoorn and Pelle Jakovits and Frank Leymann and Michael Long and Vasileios Papanikolaou and Domenico Presenza and Alessandra Russo and Satish N. Srirama and Damian A. Tamburri and Michael Wurster and Lulai Zhu},
title = {{RADON: Rational Decomposition and Orchestration for Serverless Computing}},
journal = {SICS Software-Intensive Cyber-Physical Systems},
publisher = {Springer},
type = {Artikel in Zeitschrift},
month = {August},
year = {2019},
doi = {10.1007/s00450-019-00413-w},
language = {Englisch},
cr-category = {C.0 Computer Systems Organization, General,
C.2.4 Distributed Systems,
D.1 Programming Techniques,
D.2 Software Engineering},
contact = {Michael Wurster wurster@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen;
Universit{\"a}t Stuttgart, Institut f{\"u}r Softwaretechnologie, Sichere und Zuverl{\"a}ssige Softwaresysteme;
Universit{\"a}t Stuttgart, Institut f{\"u}r Softwaretechnologie, Software Engineering},
abstract = {Emerging serverless computing technologies, such as function as a service
(FaaS), enable developers to virtualize the internal logic of an application,
simplifying the management of cloud-native services and allowing cost savings
through billing and scaling at the level of individual functions. Serverless
computing is therefore rapidly shifting the attention of software vendors to
the challenge of developing cloud applications deployable on FaaS platforms. In
this vision paper, we present the research agenda of the RADON project
(http://radon-h2020.eu), which aims to develop a model-driven DevOps framework
for creating and managing applications based on serverless computing. RADON
applications will consist of fine-grained and independent microservices that
can efficiently and optimally exploit FaaS and container technologies. Our
methodology strives to tackle complexity in designing such applications,
including the solution of optimal decomposition, the reuse of serverless
functions as well as the abstraction and actuation of event processing chains,
while avoiding cloud vendor lock-in through models.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2019-16&engl=0}
}
@article {ART-2019-15,
author = {Jasmin Guth and Frank Leymann},
title = {{Pattern-based rewrite and refinement of architectures using graph theory}},
journal = {Software-Intensive Cyber-Physical Systems (SICS)},
publisher = {Springer Berlin Heidelberg},
pages = {1--12},
type = {Artikel in Zeitschrift},
month = {August},
year = {2019},
isbn = {10.1007/s00450-019-00416-7},
keywords = {Application architecture; Patterns; Refinement; Rewrite; Graph transformation},
language = {Englisch},
cr-category = {C.0 Computer Systems Organization, General,
C.2.4 Distributed Systems,
D.2.1 Software Engineering Requirements/Specifications,
K.6 Management of Computing and Information Systems},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {With the continuous growth of IT application systems, the complexity of
architecture modeling and development increases. Patterns document proven
solutions for recurring problems in an abstract and human readable manner.
Within the domain of IT architectures, they should support the architecture
modeling and development process. Due to the documentation of patterns as text
documents, they cannot be applied to an architecture automatically: patterns
have to be read, understood, adapted to the corresponding use case, and
realized manually over and over again. Consequently, architecture modeling
considering the variety of documented patterns becomes even more complex and
time-consuming. To tackle these issues, we introduce an approach and for an
automated application and realization of patterns in architectural graphs using
graph transformation techniques. This eases the architecture modeling process
in which proven solutions for recurring problems can be selected as required
and applied automatically. We present the concept, formalization, and validate
our approach based on an application example.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2019-15&engl=0}
}
@article {ART-2019-14,
author = {Ghareeb Falazi and Vikas Khinchi and Uwe Breitenb{\"u}cher and Frank Leymann},
title = {{Transactional properties of permissioned blockchains}},
journal = {SICS Software-Intensive Cyber-Physical Systems},
address = {Heidelberg},
publisher = {Springer Berlin Heidelberg},
pages = {1--13},
type = {Artikel in Zeitschrift},
month = {August},
year = {2019},
doi = {10.1007/s00450-019-00411-y},
keywords = {Blockchains; Permissioned Blockchains; Transaction Processing; Replicated Databases; Distributed Databases},
language = {Englisch},
cr-category = {C.2.4 Distributed Systems,
H.2.4 Database Management Systems},
contact = {Ghareeb Falazi ghareeb.falazi@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Traditional distributed transaction processing (TP) systems, such as replicated
databases, faced difficulties in getting wide adoption for scenarios of
enterprise integration due to the level of mutual trust required. Ironically,
public blockchains, which promised to solve the problem of mutual trust in
collaborative processes, suffer from issues like scalability, probabilistic
transaction finality, and lack of data confidentiality. To tackle these issues,
permissioned blockchains were introduced as an alternative approach combining
the positives of the two worlds and avoiding their drawbacks. However, no
sufficient analysis has been done to emphasize their actual capabilities
regarding TP. In this paper, we identify a suitable collection of TP criteria
to analyze permissioned blockchains and apply them to a prominent set of these
systems. Finally, we compare the derived properties and provide general
conclusions.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2019-14&engl=0}
}
@article {ART-2019-13,
author = {Lukas Harzenetter and Uwe Breiteb{\"u}cher and K{\'a}lm{\'a}n K{\'e}pes and Frank Leymann},
title = {{Freezing and Defrosting Cloud Applications: Automated Saving and Restoring of Running Applications}},
journal = {Software-Intensive Cyber-Physical Systems (SICS)},
publisher = {Springer Berlin Heidelberg},
pages = {1--14},
type = {Artikel in Zeitschrift},
month = {August},
year = {2019},
doi = {10.1007/s00450-019-00415-8},
keywords = {Deployment modeling; Stateful components; Freeze; Defrost; TOSCA},
language = {Englisch},
cr-category = {C.0 Computer Systems Organization, General},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {In recent years, several technologies were developed enabling the automated
provisioning and decom-missioning of cloud applications. To reduce costs, these
applications can be terminated and restarted on demand. However, as an
application is terminated, its current application state, i.e., all application
specific data is deleted along with the running application instance. This
application state may be holding all business-critical information, and, hence,
must be saved before the application is terminated. One possibility to save
application states is to create VM snapshots although this is not always
possible or sufficient. Therefore, we introduce two approaches: (i) a concept
to generically terminate applications and save their internal state, and (ii)
an approach to reinstate the application in the same state again. To evaluate
their practical feasibility, we implemented a proof of concept in the OpenTOSCA
ecosystem.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2019-13&engl=0}
}
@article {ART-2019-09,
author = {Karoline Saatkamp and Uwe Breitenb{\"u}cher and Oliver Kopp and Frank Leymann},
title = {{Method, formalization, and algorithms to split topology models for distributed cloud application deployments}},
journal = {Computing},
publisher = {Springer Wien},
pages = {1--21},
type = {Artikel in Zeitschrift},
month = {April},
year = {2019},
isbn = {10.1007/s00607-019-00721-8},
keywords = {Application deployment; Distribution; Splitting; Multi-cloud; TOSCA},
language = {Englisch},
cr-category = {D.2.2 Software Engineering Design Tools and Techniques},
ee = {https://link.springer.com/article/10.1007/s00607-019-00721-8},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Anwendersoftware;
Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {For automating the deployment of applications in cloud environments, a variety
of technologies have been developed in recent years. These technologies enable
to specify the desired deployment in the form of deployment models that can be
automatically processed by a provisioning engine. However, the deployment
across several clouds increases the complexity of the provisioning. Using one
deployment model with a single provisioning engine, which orchestrates the
deployment across the clouds, forces the providers to expose low-level APIs to
ensure the accessibility from outside. In this paper, we present an extended
version of the split and match method to facilitate the division of deployment
models to multiple models which can be deployed by each provider separately.
The goal of this approach is to reduce the information and APIs which have to
be exposed to the outside. We present a formalization and algorithms to
automate the method. Moreover, we validate the practical feasibility by a
prototype based on the TOSCA standard and the OpenTOSCA ecosystem.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2019-09&engl=0}
}
@article {ART-2019-08,
author = {Lukas Reinfurt and Uwe Breitenb{\"u}cher and Michael Falkenthal and Frank Leymann and Andreas Riegg},
title = {{Internet of Things Patterns for Communication and Management}},
journal = {Transactions on Pattern Languages of Programming IV},
publisher = {Springer-Verlag},
pages = {139--182},
type = {Artikel in Zeitschrift},
month = {Februar},
year = {2019},
doi = {10.1007/978-3-030-14291-9_5},
keywords = {Internet of Things; Patterns; Embedded and cyber-physical systems; Device management},
language = {Englisch},
cr-category = {C.2.4 Distributed Systems,
D.2.11 Software Engineering Software Architectures},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {The Internet of Things is gaining a foothold in many different areas and
industries. Though offerings vary in their scope and implementation, they often
have to deal with similar problems: Constrained devices and networks, a vast
amount of different vendors and technologies, security and privacy issues, etc.
Over time, similar solutions for these problems appear, but the amount of
available information makes it hard to identify the underlying principles. We
investigated a large number of Internet of Things solutions and extracted the
core principles into patterns. The eight patterns presented in this paper are:
DEVICE GATEWAY enables devices that do not support a networks technology to
connect to this network. DEVICE SHADOW allows other components to interact with
offline devices. RULES ENGINE enables non-programmers to create rules that
trigger actions. DEVICE WAKEUP TRIGGER informs sleeping devices that they
should wake up. REMOTE LOCK AND WIPE allows lost or stolen devices to be
secured. DELTA UPDATE only sends data that has changed since the last
communication. REMOTE DEVICE MANAGEMENT enables remote device management with a
client-server architecture. VISIBLE LIGHT COMMUNICATION uses existing lights to
send messages to other devices.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2019-08&engl=0}
}
@article {ART-2019-04,
author = {Michael Falkenthal and Uwe Breitenb{\"u}cher and Johanna Barzen and Frank Leymann},
title = {{On the algebraic properties of concrete solution aggregation}},
journal = {SICS Software-Intensive Cyber-Physical Systems},
publisher = {Springer Berlin Heidelberg},
pages = {1--12},
type = {Artikel in Zeitschrift},
month = {Februar},
year = {2019},
keywords = {Pattern Language; Solution Aggregation; Solution Algebra; Aggregation Operator; Pattern Application},
language = {Englisch},
cr-category = {C.0 Computer Systems Organization, General,
C.2.4 Distributed Systems,
D.2.2 Software Engineering Design Tools and Techniques,
D.2.3 Software Engineering Coding Tools and Techniques,
D.2.7 Software Engineering Distribution, Maintenance, and Enhancement,
G.0 Mathematics of Computing General,
F.4.3 Formal Languages},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Pattern languages are a pervasive means in many domains to capture proven
solutions for recurring problems in an abstract manner. To improve reusability,
they abstract from implementation details such as specific technologies or
environments. However, while this abstraction provides a significant benefit as
patterns can be applied to solve different manifestations of the general
problem, this also leads to time-consuming efforts when patterns have to be
applied as concrete solutions have to be elaborated and implemented over and
over again. Moreover, as patterns are intended to be applied in combination
with other patterns, the individual concrete solutions have to be aggregated
into an overall solution, too. However, this immensely increases necessary
expertise, required effort, and complexity. Therefore, we present a systematic
approach that allows to (i) reuse and (ii) combine already developed concrete
solutions on the basis of selected sequences of patterns. We establish the
theory of solution algebras, which perceive concrete solutions and aggregation
operators as mathematical objects. Thereby, domain-specific operators allow to
combine and aggregate concrete solutions of patterns, which we validate in
several different domains.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2019-04&engl=0}
}
@article {ART-2019-03,
author = {Karoline Saatkamp and Uwe Breitenb{\"u}cher and Oliver Kopp and Frank Leymann},
title = {{An approach to automatically detect problems in restructured deployment models based on formalizing architecture and design patterns}},
journal = {SICS Software-Intensive Cyber-Physical Systems},
publisher = {Springer Berlin Heidelberg},
pages = {1--13},
type = {Artikel in Zeitschrift},
month = {Februar},
year = {2019},
doi = {10.1007/s00450-019-00397-7},
keywords = {Topology-based deployment model; Patterns; Problem detection; TOSCA; Logic programming, Prolog},
language = {Englisch},
cr-category = {C.2.4 Distributed Systems,
D.2.2 Software Engineering Design Tools and Techniques,
D.2.12 Software Engineering Interoperability,
K.6 Management of Computing and Information Systems},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Anwendersoftware;
Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {For the automated deployment of applications, technologies exist which can
process topology-based deployment models that describes the application's
structure with its components and their relations. The topology-based
deployment model of an application can be adapted for the deployment in
different environments. However, the structural changes can lead to problems,
which had not existed before and prevent a functional deployment. This includes
security issues, communication restrictions, or incompatibilities. For example,
a formerly over the internal network established insecure connection leads to
security problems when using the public network after the adaptation. In order
to solve problems in adapted deployment models, first the problems have to be
detected. Unfortunately, detecting such problems is a highly non-trivial
challenge that requires deep expertise about the involved technologies and the
environment. In this paper, we present (i) an approach for detecting problems
in deployment models using architecture and design patterns and (ii) the
automation of the detection process by formalizing the problem a pattern solves
in a certain context. We validate the practical feasibility of our approach by
a prototypical implementation for the automated problem detection in TOSCA
topologies.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2019-03&engl=0}
}
@article {ART-2019-02,
author = {Ghareeb Falazi and Michael Hahn and Uwe Breitenb{\"u}cher and Frank Leymann},
title = {{Modeling and execution of blockchain-aware business processes}},
journal = {SICS Software-Intensive Cyber-Physical Systems},
address = {Heidelberg},
publisher = {Springer Berlin Heidelberg},
pages = {1--12},
type = {Artikel in Zeitschrift},
month = {Februar},
year = {2019},
doi = {10.1007/s00450-019-00399-5},
keywords = {Blockchains; Business Process Management Systems; BPMN; Modeling; BlockME; Blockchain Access Layer; BAL; BPMN Extension},
language = {Englisch},
cr-category = {C.2.4 Distributed Systems,
D.2.2 Software Engineering Design Tools and Techniques,
D.2.11 Software Engineering Software Architectures,
D.2.12 Software Engineering Interoperability},
contact = {Ghareeb Falazi ghareeb.falazi@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {The blockchain is an emerging technology that allows multiple parties to agree
on a common state without the need for trusted intermediaries. Moreover,
business process technology streamlines the automation of inter- and
intra-organizational processes while cutting-down on costs. With the new
business opportunities provided by blockchains, it becomes vital to combine
both technologies to allow the modeling and execution of blockchain-based
interactions within business processes. However, the existing business process
modeling languages lack support to intuitively model the various interactions
with blockchains. In this paper we address this issue by proposing a business
process modeling extension that captures the particularities of blockchains. We
also show how to transform the proposed constructs into standard-compliant
models, and we present an integration architecture that allows external
applications, to communicate with the blockchains. Finally, we validate our
approach by providing a prototypical implementation that proves its practical
feasibility.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2019-02&engl=0}
}
|
|
"Webmaster"
)
| © Universität Stuttgart |
Impressum