---
_id: '486'
author:
- first_name: Oliver
  full_name: Otte, Oliver
  last_name: Otte
citation:
  ama: Otte O. <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität
    Paderborn; 2013.
  apa: Otte, O. (2013). <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>.
    Universität Paderborn.
  bibtex: '@book{Otte_2013, title={Seitenkanalresistenz paarungsbasierter Kryptographie},
    publisher={Universität Paderborn}, author={Otte, Oliver}, year={2013} }'
  chicago: Otte, Oliver. <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>.
    Universität Paderborn, 2013.
  ieee: O. Otte, <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität
    Paderborn, 2013.
  mla: Otte, Oliver. <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>.
    Universität Paderborn, 2013.
  short: O. Otte, Seitenkanalresistenz paarungsbasierter Kryptographie, Universität
    Paderborn, 2013.
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:27Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '43'
  name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Seitenkanalresistenz paarungsbasierter Kryptographie
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '487'
author:
- first_name: Jan
  full_name: Bobolz, Jan
  id: '27207'
  last_name: Bobolz
citation:
  ama: Bobolz J. <i>Security Proofs for Pairing-Based Cryptography in the Generic
    Group Model</i>. Universität Paderborn; 2013.
  apa: Bobolz, J. (2013). <i>Security Proofs for Pairing-Based Cryptography in the
    Generic Group Model</i>. Universität Paderborn.
  bibtex: '@book{Bobolz_2013, title={Security Proofs for Pairing-Based Cryptography
    in the Generic Group Model}, publisher={Universität Paderborn}, author={Bobolz,
    Jan}, year={2013} }'
  chicago: Bobolz, Jan. <i>Security Proofs for Pairing-Based Cryptography in the Generic
    Group Model</i>. Universität Paderborn, 2013.
  ieee: J. Bobolz, <i>Security Proofs for Pairing-Based Cryptography in the Generic
    Group Model</i>. Universität Paderborn, 2013.
  mla: Bobolz, Jan. <i>Security Proofs for Pairing-Based Cryptography in the Generic
    Group Model</i>. Universität Paderborn, 2013.
  short: J. Bobolz, Security Proofs for Pairing-Based Cryptography in the Generic
    Group Model, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:28Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: open_access
  content_type: application/pdf
  creator: jbobolz
  date_created: 2018-04-13T11:42:08Z
  date_updated: 2018-06-29T09:56:54Z
  file_id: '2346'
  file_name: thesis_jbobolz_final.pdf
  file_size: 874286
  relation: main_file
file_date_updated: 2018-06-29T09:56:54Z
has_accepted_license: '1'
oa: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
title: Security Proofs for Pairing-Based Cryptography in the Generic Group Model
type: bachelorsthesis
urn: '4875'
user_id: '27207'
year: '2013'
...
---
_id: '488'
abstract:
- lang: eng
  text: Unattended systems are key ingredients of various critical infrastruc-tures
    like networks of self service terminals or automated teller machines.For cost
    and efficiency reasons they should mostly run autonomously.Unattended systems
    are attractive and lucrative targets for various kindsof attacks, including attacks
    on the integrity of their components and thecommunication between components.
    In this paper, we propose a gen-eral cryptographic framework to protect unattended
    systems. We alsodemonstrate that instantiating the framework with techniques from
    iden-tity based cryptography is particularly well-suited to efficiently secureunattended
    systems.
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Peter
  full_name: Günther, Peter
  last_name: Günther
- first_name: Volker
  full_name: Krummel, Volker
  last_name: Krummel
citation:
  ama: 'Blömer J, Günther P, Krummel V. Securing Critical Unattended Systems with
    Identity Based Cryptography - A Case Study. In: <i>Proceedings of the 5th International
    Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>.
    ; 2013:98-105.'
  apa: Blömer, J., Günther, P., &#38; Krummel, V. (2013). Securing Critical Unattended
    Systems with Identity Based Cryptography - A Case Study. In <i>Proceedings of
    the 5th International Conference on Mathematical Aspects of Computer and Information
    Sciences (MACIS)</i> (pp. 98–105).
  bibtex: '@inproceedings{Blömer_Günther_Krummel_2013, title={Securing Critical Unattended
    Systems with Identity Based Cryptography - A Case Study}, booktitle={Proceedings
    of the 5th International Conference on Mathematical Aspects of Computer and Information
    Sciences (MACIS)}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker},
    year={2013}, pages={98–105} }'
  chicago: Blömer, Johannes, Peter Günther, and Volker Krummel. “Securing Critical
    Unattended Systems with Identity Based Cryptography - A Case Study.” In <i>Proceedings
    of the 5th International Conference on Mathematical Aspects of Computer and Information
    Sciences (MACIS)</i>, 98–105, 2013.
  ieee: J. Blömer, P. Günther, and V. Krummel, “Securing Critical Unattended Systems
    with Identity Based Cryptography - A Case Study,” in <i>Proceedings of the 5th
    International Conference on Mathematical Aspects of Computer and Information Sciences
    (MACIS)</i>, 2013, pp. 98–105.
  mla: Blömer, Johannes, et al. “Securing Critical Unattended Systems with Identity
    Based Cryptography - A Case Study.” <i>Proceedings of the 5th International Conference
    on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2013,
    pp. 98–105.
  short: 'J. Blömer, P. Günther, V. Krummel, in: Proceedings of the 5th International
    Conference on Mathematical Aspects of Computer and Information Sciences (MACIS),
    2013, pp. 98–105.'
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:28Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T13:46:52Z
  date_updated: 2018-03-15T13:46:52Z
  file_id: '1317'
  file_name: 488-MACIS13.pdf
  file_size: 301962
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T13:46:52Z
has_accepted_license: '1'
page: 98-105
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 5th International Conference on Mathematical Aspects
  of Computer and Information Sciences (MACIS)
status: public
title: Securing Critical Unattended Systems with Identity Based Cryptography - A Case
  Study
type: conference
user_id: '477'
year: '2013'
...
---
_id: '490'
author:
- first_name: Felix
  full_name: Wallaschek, Felix
  last_name: Wallaschek
citation:
  ama: Wallaschek F. <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität
    Paderborn; 2013.
  apa: Wallaschek, F. (2013). <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität
    Paderborn.
  bibtex: '@book{Wallaschek_2013, title={Routing in heterogenen OpenFlow Netzwerken},
    publisher={Universität Paderborn}, author={Wallaschek, Felix}, year={2013} }'
  chicago: Wallaschek, Felix. <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität
    Paderborn, 2013.
  ieee: F. Wallaschek, <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität
    Paderborn, 2013.
  mla: Wallaschek, Felix. <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität
    Paderborn, 2013.
  short: F. Wallaschek, Routing in heterogenen OpenFlow Netzwerken, Universität Paderborn,
    2013.
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:28Z
department:
- _id: '75'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Routing in heterogenen OpenFlow Netzwerken
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '492'
author:
- first_name: Christoph
  full_name: Robbert, Christoph
  last_name: Robbert
citation:
  ama: Robbert C. <i>Ressource-Optimized Deployment of Multi-Tier Applications - The
    Data Rate-Constrained Case</i>. Universität Paderborn; 2013.
  apa: Robbert, C. (2013). <i>Ressource-Optimized Deployment of Multi-Tier Applications
    - The Data Rate-Constrained Case</i>. Universität Paderborn.
  bibtex: '@book{Robbert_2013, title={Ressource-Optimized Deployment of Multi-Tier
    Applications - The Data Rate-Constrained Case}, publisher={Universität Paderborn},
    author={Robbert, Christoph}, year={2013} }'
  chicago: Robbert, Christoph. <i>Ressource-Optimized Deployment of Multi-Tier Applications
    - The Data Rate-Constrained Case</i>. Universität Paderborn, 2013.
  ieee: C. Robbert, <i>Ressource-Optimized Deployment of Multi-Tier Applications -
    The Data Rate-Constrained Case</i>. Universität Paderborn, 2013.
  mla: Robbert, Christoph. <i>Ressource-Optimized Deployment of Multi-Tier Applications
    - The Data Rate-Constrained Case</i>. Universität Paderborn, 2013.
  short: C. Robbert, Ressource-Optimized Deployment of Multi-Tier Applications - The
    Data Rate-Constrained Case, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:28Z
date_updated: 2022-01-06T07:01:29Z
department:
- _id: '75'
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained
  Case
type: bachelorsthesis
user_id: '15504'
year: '2013'
...
---
_id: '494'
abstract:
- lang: eng
  text: The maintenance of component-based software systems requires up-to-date models
    of their concrete architecture, i.e. the architecture that is realised in the
    source code. These models help in systematically planning, analysing and executing
    typical reengineering activities. Often no or only outdated architectural models
    of such systems exist. Therefore, various reverse engineering methods have been
    developed which try to recover a system's components, subsystems and connectors.
    However, these reverse engineering methods are severely impacted by design deciencies
    in the system's code base, especially violations of the component encapsulation.
    As long as design deciencies are not considered in the reverse engineering process,
    they reduce the quality of the recovered component structures. Despite this impact
    of design deciencies, no existing architecture reconstruction approach explicitly
    integrates a systematic deciency detection and removal into the recovery process.
    Therefore, I have developed Archimetrix. Archimetrix is a tool-supported architecture
    reconstruction process. It enhances a clustering-based architecture recovery approach
    with an extensible, pattern-based deciency detection. After the detection of deciencies,
    Archimetrix supports the software architect in removing the de ciencies and provides
    the means to preview the architectural consequences of such a removal. I also
    provide a process to identify and formalise additional deciencies. I validated
    the approach on three case studies which show that Archimetrix is able to identify
    relevant deciencies and that the removal of these deciencies leads to an increased
    quality of the recovered architectures, i.e. they are closer to the corresponding
    conceptual architectures.
author:
- first_name: Markus
  full_name: von Detten, Markus
  last_name: von Detten
citation:
  ama: von Detten M. <i>Reengineering of Component-Based Software Systems in the Presence
    of Design Deficiencies</i>. Universität Paderborn; 2013.
  apa: von Detten, M. (2013). <i>Reengineering of Component-Based Software Systems
    in the Presence of Design Deficiencies</i>. Universität Paderborn.
  bibtex: '@book{von Detten_2013, title={Reengineering of Component-Based Software
    Systems in the Presence of Design Deficiencies}, publisher={Universität Paderborn},
    author={von Detten, Markus}, year={2013} }'
  chicago: Detten, Markus von. <i>Reengineering of Component-Based Software Systems
    in the Presence of Design Deficiencies</i>. Universität Paderborn, 2013.
  ieee: M. von Detten, <i>Reengineering of Component-Based Software Systems in the
    Presence of Design Deficiencies</i>. Universität Paderborn, 2013.
  mla: von Detten, Markus. <i>Reengineering of Component-Based Software Systems in
    the Presence of Design Deficiencies</i>. Universität Paderborn, 2013.
  short: M. von Detten, Reengineering of Component-Based Software Systems in the Presence
    of Design Deficiencies, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:28Z
date_updated: 2022-01-06T07:01:30Z
ddc:
- '040'
department:
- _id: '76'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T13:43:42Z
  date_updated: 2018-03-15T13:43:42Z
  file_id: '1315'
  file_name: 494-Dissertation-vonDetten.pdf
  file_size: 11101635
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T13:43:42Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Wilhelm
  full_name: Schäfer, Wilhelm
  last_name: Schäfer
title: Reengineering of Component-Based Software Systems in the Presence of Design
  Deficiencies
type: dissertation
user_id: '477'
year: '2013'
...
---
_id: '495'
abstract:
- lang: eng
  text: Automated service composition has been studied as a subject of state based
    planning for a decade. A great deal of service composition tasks can only be solved
    if concrete output values of the services are considered in the composition process.
    However, the fact that those values are not known before runtime leads to nondeterministic
    planning problems, which have proven to be notoriously difficult in practical
    automated service composition applications. Even though this problem is frequently
    recognized, it has still received remarkably few attention and remains unsolved.This
    paper shows how nondeterminism in automated service composition can be reduced.
    We introduce context rules as a means to derive semantic knowledge from output
    values of services. These rules enable us to replace nondeterministic composition
    operations by less nondeterministic or even completely deterministic ones. We
    show the validity of our solutions not only theoretically but also have evaluated
    them practically through implementation.
author:
- first_name: Felix
  full_name: Mohr, Felix
  last_name: Mohr
- first_name: Theodor
  full_name: Lettmann, Theodor
  id: '315'
  last_name: Lettmann
  orcid: 0000-0001-5859-2457
- first_name: Hans
  full_name: Kleine Büning, Hans
  last_name: Kleine Büning
citation:
  ama: 'Mohr F, Lettmann T, Kleine Büning H. Reducing Nondeterminism in Automated
    Service Composition. In: <i>Proceedings of the 6th International Conference on
    Service Oriented Computing and Applications (SOCA)</i>. ; 2013:154-161. doi:<a
    href="https://doi.org/10.1109/SOCA.2013.25">10.1109/SOCA.2013.25</a>'
  apa: Mohr, F., Lettmann, T., &#38; Kleine Büning, H. (2013). Reducing Nondeterminism
    in Automated Service Composition. In <i>Proceedings of the 6th International Conference
    on Service Oriented Computing and Applications (SOCA)</i> (pp. 154–161). <a href="https://doi.org/10.1109/SOCA.2013.25">https://doi.org/10.1109/SOCA.2013.25</a>
  bibtex: '@inproceedings{Mohr_Lettmann_Kleine Büning_2013, title={Reducing Nondeterminism
    in Automated Service Composition}, DOI={<a href="https://doi.org/10.1109/SOCA.2013.25">10.1109/SOCA.2013.25</a>},
    booktitle={Proceedings of the 6th International Conference on Service Oriented
    Computing and Applications (SOCA)}, author={Mohr, Felix and Lettmann, Theodor
    and Kleine Büning, Hans}, year={2013}, pages={154–161} }'
  chicago: Mohr, Felix, Theodor Lettmann, and Hans Kleine Büning. “Reducing Nondeterminism
    in Automated Service Composition.” In <i>Proceedings of the 6th International
    Conference on Service Oriented Computing and Applications (SOCA)</i>, 154–61,
    2013. <a href="https://doi.org/10.1109/SOCA.2013.25">https://doi.org/10.1109/SOCA.2013.25</a>.
  ieee: F. Mohr, T. Lettmann, and H. Kleine Büning, “Reducing Nondeterminism in Automated
    Service Composition,” in <i>Proceedings of the 6th International Conference on
    Service Oriented Computing and Applications (SOCA)</i>, 2013, pp. 154–161.
  mla: Mohr, Felix, et al. “Reducing Nondeterminism in Automated Service Composition.”
    <i>Proceedings of the 6th International Conference on Service Oriented Computing
    and Applications (SOCA)</i>, 2013, pp. 154–61, doi:<a href="https://doi.org/10.1109/SOCA.2013.25">10.1109/SOCA.2013.25</a>.
  short: 'F. Mohr, T. Lettmann, H. Kleine Büning, in: Proceedings of the 6th International
    Conference on Service Oriented Computing and Applications (SOCA), 2013, pp. 154–161.'
date_created: 2017-10-17T12:42:28Z
date_updated: 2022-01-06T07:01:30Z
ddc:
- '040'
department:
- _id: '355'
doi: 10.1109/SOCA.2013.25
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T13:43:08Z
  date_updated: 2018-03-15T13:43:08Z
  file_id: '1314'
  file_name: 495-paper52_mohr.pdf
  file_size: 603822
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T13:43:08Z
has_accepted_license: '1'
language:
- iso: eng
page: 154-161
project:
- _id: '1'
  name: SFB 901
- _id: '10'
  name: SFB 901 - Subprojekt B2
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 6th International Conference on Service Oriented Computing
  and Applications (SOCA)
status: public
title: Reducing Nondeterminism in Automated Service Composition
type: conference
user_id: '477'
year: '2013'
...
---
_id: '496'
abstract:
- lang: eng
  text: Within reactive topology control, a node determines its adjacent edges of
    a network subgraph without prior knowledge of its neighborhood. The goal is to
    construct a local view on a topology which provides certain desired properties
    such as planarity. During algorithm execution, a node, in general, is not allowed
    to determine all its neighbors of the network graph. There are well-known reactive
    algorithms for computing planar subgraphs. However, the subgraphs obtained do
    not have constant Euclidean spanning ratio. This means that routing along these
    subgraphs may result in potentially long detours. So far, it has been unknown
    if planar spanners can be constructed reactively. In this work, we show that at
    least under the unit disk network model, this is indeed possible, by proposing
    an algorithm for reactive construction of the partial Delaunay triangulation,
    which recently turned out to be a spanner. Furthermore, we show that our algorithm
    is message-optimal as a node will only exchange messages with nodes that are also
    neighbors in the spanner. The algorithm’s presentation is complemented by a rigorous
    proof of correctness.
author:
- first_name: Markus
  full_name: Benter, Markus
  last_name: Benter
- first_name: Florentin
  full_name: Neumann, Florentin
  last_name: Neumann
- first_name: Hannes
  full_name: Frey, Hannes
  last_name: Frey
citation:
  ama: 'Benter M, Neumann F, Frey H. Reactive Planar Spanner Construction in Wireless
    Ad Hoc and Sensor Networks. In: <i>Proceedings of the 32nd IEEE International
    Conference on Computer Communications (INFOCOM)</i>. ; 2013:2193-2201. doi:<a
    href="https://doi.org/10.1109/INFCOM.2013.6567022">10.1109/INFCOM.2013.6567022</a>'
  apa: Benter, M., Neumann, F., &#38; Frey, H. (2013). Reactive Planar Spanner Construction
    in Wireless Ad Hoc and Sensor Networks. In <i>Proceedings of the 32nd IEEE International
    Conference on Computer Communications (INFOCOM)</i> (pp. 2193–2201). <a href="https://doi.org/10.1109/INFCOM.2013.6567022">https://doi.org/10.1109/INFCOM.2013.6567022</a>
  bibtex: '@inproceedings{Benter_Neumann_Frey_2013, title={Reactive Planar Spanner
    Construction in Wireless Ad Hoc and Sensor Networks}, DOI={<a href="https://doi.org/10.1109/INFCOM.2013.6567022">10.1109/INFCOM.2013.6567022</a>},
    booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications
    (INFOCOM)}, author={Benter, Markus and Neumann, Florentin and Frey, Hannes}, year={2013},
    pages={2193–2201} }'
  chicago: Benter, Markus, Florentin Neumann, and Hannes Frey. “Reactive Planar Spanner
    Construction in Wireless Ad Hoc and Sensor Networks.” In <i>Proceedings of the
    32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2193–2201,
    2013. <a href="https://doi.org/10.1109/INFCOM.2013.6567022">https://doi.org/10.1109/INFCOM.2013.6567022</a>.
  ieee: M. Benter, F. Neumann, and H. Frey, “Reactive Planar Spanner Construction
    in Wireless Ad Hoc and Sensor Networks,” in <i>Proceedings of the 32nd IEEE International
    Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 2193–2201.
  mla: Benter, Markus, et al. “Reactive Planar Spanner Construction in Wireless Ad
    Hoc and Sensor Networks.” <i>Proceedings of the 32nd IEEE International Conference
    on Computer Communications (INFOCOM)</i>, 2013, pp. 2193–201, doi:<a href="https://doi.org/10.1109/INFCOM.2013.6567022">10.1109/INFCOM.2013.6567022</a>.
  short: 'M. Benter, F. Neumann, H. Frey, in: Proceedings of the 32nd IEEE International
    Conference on Computer Communications (INFOCOM), 2013, pp. 2193–2201.'
date_created: 2017-10-17T12:42:29Z
date_updated: 2022-01-06T07:01:31Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/INFCOM.2013.6567022
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T13:41:34Z
  date_updated: 2018-03-15T13:41:34Z
  file_id: '1312'
  file_name: 496-reactivePDT-copyright.pdf
  file_size: 352571
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T13:41:34Z
has_accepted_license: '1'
page: 2193-2201
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 32nd IEEE International Conference on Computer Communications
  (INFOCOM)
status: public
title: Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '498'
abstract:
- lang: eng
  text: Proof-carrying code approaches aim at safe execution of untrusted code by
    having the code producer attach a safety proof to the code which the code consumer
    only has to validate. Depending on the type of safety property, proofs can however
    become quite large and their validation - though faster than their construction
    - still time consuming. In this paper we introduce a new concept for safe execution
    of untrusted code. It keeps the idea of putting the time consuming part of proving
    on the side of the code producer, however, attaches no proofs to code anymore
    but instead uses the proof to transform the program into an equivalent but more
    efficiently verifiable program. Code consumers thus still do proving themselves,
    however, on a computationally inexpensive level only. Experimental results show
    that the proof effort can be reduced by several orders of magnitude, both with
    respect to time and space.
author:
- first_name: Daniel
  full_name: Wonisch, Daniel
  last_name: Wonisch
- first_name: Alexander
  full_name: Schremmer, Alexander
  last_name: Schremmer
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs – A PCC Alternative.
    In: <i>Proceedings of the 25th International Conference on Computer Aided Verification
    (CAV)</i>. LNCS. ; 2013:912-927. doi:<a href="https://doi.org/10.1007/978-3-642-39799-8_65">10.1007/978-3-642-39799-8_65</a>'
  apa: Wonisch, D., Schremmer, A., &#38; Wehrheim, H. (2013). Programs from Proofs
    – A PCC Alternative. In <i>Proceedings of the 25th International Conference on
    Computer Aided Verification (CAV)</i> (pp. 912–927). <a href="https://doi.org/10.1007/978-3-642-39799-8_65">https://doi.org/10.1007/978-3-642-39799-8_65</a>
  bibtex: '@inproceedings{Wonisch_Schremmer_Wehrheim_2013, series={LNCS}, title={Programs
    from Proofs – A PCC Alternative}, DOI={<a href="https://doi.org/10.1007/978-3-642-39799-8_65">10.1007/978-3-642-39799-8_65</a>},
    booktitle={Proceedings of the 25th International Conference on Computer Aided
    Verification (CAV)}, author={Wonisch, Daniel and Schremmer, Alexander and Wehrheim,
    Heike}, year={2013}, pages={912–927}, collection={LNCS} }'
  chicago: Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Programs from
    Proofs – A PCC Alternative.” In <i>Proceedings of the 25th International Conference
    on Computer Aided Verification (CAV)</i>, 912–27. LNCS, 2013. <a href="https://doi.org/10.1007/978-3-642-39799-8_65">https://doi.org/10.1007/978-3-642-39799-8_65</a>.
  ieee: D. Wonisch, A. Schremmer, and H. Wehrheim, “Programs from Proofs – A PCC Alternative,”
    in <i>Proceedings of the 25th International Conference on Computer Aided Verification
    (CAV)</i>, 2013, pp. 912–927.
  mla: Wonisch, Daniel, et al. “Programs from Proofs – A PCC Alternative.” <i>Proceedings
    of the 25th International Conference on Computer Aided Verification (CAV)</i>,
    2013, pp. 912–27, doi:<a href="https://doi.org/10.1007/978-3-642-39799-8_65">10.1007/978-3-642-39799-8_65</a>.
  short: 'D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the 25th International
    Conference on Computer Aided Verification (CAV), 2013, pp. 912–927.'
date_created: 2017-10-17T12:42:29Z
date_updated: 2022-01-06T07:01:32Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-39799-8_65
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T13:42:30Z
  date_updated: 2018-03-15T13:42:30Z
  file_id: '1313'
  file_name: 498-WonischSchremmerWehrheim2013.pdf
  file_size: 487617
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T13:42:30Z
has_accepted_license: '1'
language:
- iso: eng
page: 912-927
project:
- _id: '1'
  name: SFB 901
- _id: '12'
  name: SFB 901 - Subprojekt B4
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 25th International Conference on Computer Aided Verification
  (CAV)
series_title: LNCS
status: public
title: Programs from Proofs – A PCC Alternative
type: conference
user_id: '477'
year: '2013'
...
---
_id: '499'
abstract:
- lang: eng
  text: We present a new online algorithm for profit-oriented scheduling on multiple
    speed-scalable processors.Moreover, we provide a tight analysis of the algorithm's
    competitiveness.Our results generalize and improve upon work by \citet{Chan:2010},
    which considers a single speed-scalable processor.Using significantly different
    techniques, we can not only extend their model to multiprocessors but also prove
    an enhanced and tight competitive ratio for our algorithm.In our scheduling problem,
    jobs arrive over time and are preemptable.They have different workloads, values,
    and deadlines.The scheduler may decide not to finish a job but instead to suffer
    a loss equaling the job's value.However, to process a job's workload until its
    deadline the scheduler must invest a certain amount of energy.The cost of a schedule
    is the sum of lost values and invested energy.In order to finish a job the scheduler
    has to determine which processors to use and set their speeds accordingly.A processor's
    energy consumption is power $\Power{s}$ integrated over time, where $\Power{s}=s^{\alpha}$
    is the power consumption when running at speed $s$.Since we consider the online
    variant of the problem, the scheduler has no knowledge about future jobs.This
    problem was introduced by~\citet{Chan:2010} for the case of a single processor.They
    presented an online algorithm which is $\alpha^{\alpha}+2e\alpha$-competitive.We
    provide an online algorithm for the case of multiple processors with an improved
    competitive ratio of $\alpha^{\alpha}$.
author:
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
- first_name: Peter
  full_name: Pietrzyk, Peter
  last_name: Pietrzyk
citation:
  ama: 'Kling P, Pietrzyk P. Profitable Scheduling on Multiple Speed-Scalable Processors.
    In: <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and
    Architectures (SPAA)</i>. ; 2013:251-260. doi:<a href="https://doi.org/10.1145/2486159.2486183">10.1145/2486159.2486183</a>'
  apa: Kling, P., &#38; Pietrzyk, P. (2013). Profitable Scheduling on Multiple Speed-Scalable
    Processors. In <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)</i> (pp. 251–260). <a href="https://doi.org/10.1145/2486159.2486183">https://doi.org/10.1145/2486159.2486183</a>
  bibtex: '@inproceedings{Kling_Pietrzyk_2013, title={Profitable Scheduling on Multiple
    Speed-Scalable Processors}, DOI={<a href="https://doi.org/10.1145/2486159.2486183">10.1145/2486159.2486183</a>},
    booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)}, author={Kling, Peter and Pietrzyk, Peter}, year={2013},
    pages={251–260} }'
  chicago: Kling, Peter, and Peter Pietrzyk. “Profitable Scheduling on Multiple Speed-Scalable
    Processors.” In <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)</i>, 251–60, 2013. <a href="https://doi.org/10.1145/2486159.2486183">https://doi.org/10.1145/2486159.2486183</a>.
  ieee: P. Kling and P. Pietrzyk, “Profitable Scheduling on Multiple Speed-Scalable
    Processors,” in <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)</i>, 2013, pp. 251–260.
  mla: Kling, Peter, and Peter Pietrzyk. “Profitable Scheduling on Multiple Speed-Scalable
    Processors.” <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)</i>, 2013, pp. 251–60, doi:<a href="https://doi.org/10.1145/2486159.2486183">10.1145/2486159.2486183</a>.
  short: 'P. Kling, P. Pietrzyk, in: Proceedings of the 25th ACM Symposium on Parallelism
    in Algorithms and Architectures (SPAA), 2013, pp. 251–260.'
date_created: 2017-10-17T12:42:29Z
date_updated: 2022-01-06T07:01:34Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2486159.2486183
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T13:40:02Z
  date_updated: 2018-03-15T13:40:02Z
  file_id: '1310'
  file_name: 499-P._Kling__P._Pietryzk_-_Profitable_Scheduling_on_Multiple_Speed-scalable_Processors__2013_.pdf
  file_size: 558661
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T13:40:02Z
has_accepted_license: '1'
language:
- iso: eng
page: '251-260 '
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '14'
  name: SFB 901 - Subproject C2
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and
  Architectures (SPAA)
status: public
title: Profitable Scheduling on Multiple Speed-Scalable Processors
type: conference
user_id: '477'
year: '2013'
...
---
_id: '7271'
author:
- first_name: Rogrio
  full_name: de Lemos, Rogrio
  last_name: de Lemos
- first_name: Holger
  full_name: Giese, Holger
  last_name: Giese
- first_name: Hausi
  full_name: A. Müller, Hausi
  last_name: A. Müller
- first_name: Mary
  full_name: Shaw, Mary
  last_name: Shaw
- first_name: Jesper
  full_name: Andersson, Jesper
  last_name: Andersson
- first_name: Marin
  full_name: Litoiu, Marin
  last_name: Litoiu
- first_name: Bradley
  full_name: Schmerl, Bradley
  last_name: Schmerl
- first_name: Gabriel
  full_name: Tamura, Gabriel
  last_name: Tamura
- first_name: Norha
  full_name: M. Villegas, Norha
  last_name: M. Villegas
- first_name: Thomas
  full_name: Vogel, Thomas
  last_name: Vogel
- first_name: Danny
  full_name: Weyns, Danny
  last_name: Weyns
- first_name: Luciano
  full_name: Baresi, Luciano
  last_name: Baresi
- first_name: Basil
  full_name: Becker, Basil
  last_name: Becker
- first_name: Nelly
  full_name: Bencomo, Nelly
  last_name: Bencomo
- first_name: Yuriy
  full_name: Brun, Yuriy
  last_name: Brun
- first_name: Bojan
  full_name: Cukic, Bojan
  last_name: Cukic
- first_name: Ron
  full_name: Desmarais, Ron
  last_name: Desmarais
- first_name: Schahram
  full_name: Dustdar, Schahram
  last_name: Dustdar
- first_name: Gregor
  full_name: Engels, Gregor
  last_name: Engels
- first_name: Kurt
  full_name: Geihs, Kurt
  last_name: Geihs
- first_name: Karl
  full_name: M. Göschka, Karl
  last_name: M. Göschka
- first_name: Alessandra
  full_name: Gorla, Alessandra
  last_name: Gorla
- first_name: Vincenzo
  full_name: Grassi, Vincenzo
  last_name: Grassi
- first_name: Paola
  full_name: Inverardi, Paola
  last_name: Inverardi
- first_name: Gabor
  full_name: Karsai, Gabor
  last_name: Karsai
- first_name: Jeff
  full_name: Kramer, Jeff
  last_name: Kramer
- first_name: Antonia
  full_name: Lopes, Antonia
  last_name: Lopes
- first_name: Jeff
  full_name: Magee, Jeff
  last_name: Magee
- first_name: Sam
  full_name: Malek, Sam
  last_name: Malek
- first_name: Serge
  full_name: Mankovskii, Serge
  last_name: Mankovskii
- first_name: Raffaela
  full_name: Mirandola, Raffaela
  last_name: Mirandola
- first_name: John
  full_name: Mylopoulos, John
  last_name: Mylopoulos
- first_name: Oscar
  full_name: Nierstrasz, Oscar
  last_name: Nierstrasz
- first_name: Mauro
  full_name: Pezzè, Mauro
  last_name: Pezzè
- first_name: Christian
  full_name: Prehofer, Christian
  last_name: Prehofer
- first_name: Wilhelm
  full_name: Schäfer, Wilhelm
  last_name: Schäfer
- first_name: Rick
  full_name: Schlichting, Rick
  last_name: Schlichting
- first_name: Dennis
  full_name: B. Smith, Dennis
  last_name: B. Smith
- first_name: Joao
  full_name: Pedro Sousa, Joao
  last_name: Pedro Sousa
- first_name: Ladan
  full_name: Tahvildari, Ladan
  last_name: Tahvildari
- first_name: Kenny
  full_name: Wong, Kenny
  last_name: Wong
- first_name: Jochen
  full_name: Wuttke, Jochen
  last_name: Wuttke
citation:
  ama: 'de Lemos R, Giese H, A. Müller H, et al. Software Engineering for Self-Adaptive
    Systems: A Second Research Roadmap. <i>Software Engineering for Self-Adaptive
    Systems II</i>. 2013:1-32. doi:<a href="https://doi.org/10.1007/978-3-642-35813-5_1">10.1007/978-3-642-35813-5_1</a>'
  apa: 'de Lemos, R., Giese, H., A. Müller, H., Shaw, M., Andersson, J., Litoiu, M.,
    … Wuttke, J. (2013). Software Engineering for Self-Adaptive Systems: A Second
    Research Roadmap. <i>Software Engineering for Self-Adaptive Systems II</i>, 1–32.
    <a href="https://doi.org/10.1007/978-3-642-35813-5_1">https://doi.org/10.1007/978-3-642-35813-5_1</a>'
  bibtex: '@article{de Lemos_Giese_A. Müller_Shaw_Andersson_Litoiu_Schmerl_Tamura_M.
    Villegas_Vogel_et al._2013, title={Software Engineering for Self-Adaptive Systems:
    A Second Research Roadmap}, DOI={<a href="https://doi.org/10.1007/978-3-642-35813-5_1">10.1007/978-3-642-35813-5_1</a>},
    journal={Software Engineering for Self-Adaptive Systems II}, author={de Lemos,
    Rogrio and Giese, Holger and A. Müller, Hausi and Shaw, Mary and Andersson, Jesper
    and Litoiu, Marin and Schmerl, Bradley and Tamura, Gabriel and M. Villegas, Norha
    and Vogel, Thomas and et al.}, year={2013}, pages={1–32} }'
  chicago: 'Lemos, Rogrio de, Holger Giese, Hausi A. Müller, Mary Shaw, Jesper Andersson,
    Marin Litoiu, Bradley Schmerl, et al. “Software Engineering for Self-Adaptive
    Systems: A Second Research Roadmap.” <i>Software Engineering for Self-Adaptive
    Systems II</i>, 2013, 1–32. <a href="https://doi.org/10.1007/978-3-642-35813-5_1">https://doi.org/10.1007/978-3-642-35813-5_1</a>.'
  ieee: 'R. de Lemos <i>et al.</i>, “Software Engineering for Self-Adaptive Systems:
    A Second Research Roadmap,” <i>Software Engineering for Self-Adaptive Systems
    II</i>, pp. 1–32, 2013.'
  mla: 'de Lemos, Rogrio, et al. “Software Engineering for Self-Adaptive Systems:
    A Second Research Roadmap.” <i>Software Engineering for Self-Adaptive Systems
    II</i>, 2013, pp. 1–32, doi:<a href="https://doi.org/10.1007/978-3-642-35813-5_1">10.1007/978-3-642-35813-5_1</a>.'
  short: R. de Lemos, H. Giese, H. A. Müller, M. Shaw, J. Andersson, M. Litoiu, B.
    Schmerl, G. Tamura, N. M. Villegas, T. Vogel, D. Weyns, L. Baresi, B. Becker,
    N. Bencomo, Y. Brun, B. Cukic, R. Desmarais, S. Dustdar, G. Engels, K. Geihs,
    K. M. Göschka, A. Gorla, V. Grassi, P. Inverardi, G. Karsai, J. Kramer, A. Lopes,
    J. Magee, S. Malek, S. Mankovskii, R. Mirandola, J. Mylopoulos, O. Nierstrasz,
    M. Pezzè, C. Prehofer, W. Schäfer, R. Schlichting, D. B. Smith, J. Pedro Sousa,
    L. Tahvildari, K. Wong, J. Wuttke, Software Engineering for Self-Adaptive Systems
    II (2013) 1–32.
date_created: 2019-01-30T13:41:40Z
date_updated: 2022-01-06T07:03:31Z
department:
- _id: '66'
doi: 10.1007/978-3-642-35813-5_1
language:
- iso: eng
page: 1-32
publication: Software Engineering for Self-Adaptive Systems II
status: public
title: 'Software Engineering for Self-Adaptive Systems: A Second Research Roadmap'
type: journal_article
user_id: '52534'
year: '2013'
...
---
_id: '7272'
author:
- first_name: Elke
  full_name: Bouillon, Elke
  last_name: Bouillon
- first_name: Baris
  full_name: Güldali, Baris
  last_name: Güldali
- first_name: Andrea
  full_name: Herrmann, Andrea
  last_name: Herrmann
- first_name: Thorsten
  full_name: Keuler, Thorsten
  last_name: Keuler
- first_name: Daniel
  full_name: Moldt, Daniel
  last_name: Moldt
- first_name: Matthias
  full_name: Riebisch, Matthias
  last_name: Riebisch
citation:
  ama: Bouillon E, Güldali B, Herrmann A, Keuler T, Moldt D, Riebisch M. Leichtgewichtige
    Traceability im agilen Entwicklungsprozess am Beispiel von Scrum. <i>Softwaretechnik-Trends</i>.
    2013;33(1):29-30.
  apa: Bouillon, E., Güldali, B., Herrmann, A., Keuler, T., Moldt, D., &#38; Riebisch,
    M. (2013). Leichtgewichtige Traceability im agilen Entwicklungsprozess am Beispiel
    von Scrum. <i>Softwaretechnik-Trends</i>, <i>33</i>(1), 29–30.
  bibtex: '@article{Bouillon_Güldali_Herrmann_Keuler_Moldt_Riebisch_2013, title={Leichtgewichtige
    Traceability im agilen Entwicklungsprozess am Beispiel von Scrum}, volume={33},
    number={1}, journal={Softwaretechnik-Trends}, author={Bouillon, Elke and Güldali,
    Baris and Herrmann, Andrea and Keuler, Thorsten and Moldt, Daniel and Riebisch,
    Matthias}, year={2013}, pages={29–30} }'
  chicago: 'Bouillon, Elke, Baris Güldali, Andrea Herrmann, Thorsten Keuler, Daniel
    Moldt, and Matthias Riebisch. “Leichtgewichtige Traceability Im Agilen Entwicklungsprozess
    Am Beispiel von Scrum.” <i>Softwaretechnik-Trends</i> 33, no. 1 (2013): 29–30.'
  ieee: E. Bouillon, B. Güldali, A. Herrmann, T. Keuler, D. Moldt, and M. Riebisch,
    “Leichtgewichtige Traceability im agilen Entwicklungsprozess am Beispiel von Scrum,”
    <i>Softwaretechnik-Trends</i>, vol. 33, no. 1, pp. 29–30, 2013.
  mla: Bouillon, Elke, et al. “Leichtgewichtige Traceability Im Agilen Entwicklungsprozess
    Am Beispiel von Scrum.” <i>Softwaretechnik-Trends</i>, vol. 33, no. 1, 2013, pp.
    29–30.
  short: E. Bouillon, B. Güldali, A. Herrmann, T. Keuler, D. Moldt, M. Riebisch, Softwaretechnik-Trends
    33 (2013) 29–30.
date_created: 2019-01-30T13:52:21Z
date_updated: 2022-01-06T07:03:31Z
department:
- _id: '66'
intvolume: '        33'
issue: '1'
language:
- iso: eng
page: 29-30
publication: Softwaretechnik-Trends
status: public
title: Leichtgewichtige Traceability im agilen Entwicklungsprozess am Beispiel von
  Scrum
type: journal_article
user_id: '52534'
volume: 33
year: '2013'
...
---
_id: '7273'
author:
- first_name: Marvin
  full_name: Grieger, Marvin
  last_name: Grieger
- first_name: Baris
  full_name: Güldali, Baris
  last_name: Güldali
- first_name: Stefan
  full_name: Sauer, Stefan
  id: '447'
  last_name: Sauer
- first_name: Michael
  full_name: Mlynarski, Michael
  last_name: Mlynarski
citation:
  ama: Grieger M, Güldali B, Sauer S, Mlynarski M. Testen bei Migrationsprojekten.
    <i>OBJEKTspektrum (Online Themenspecials)</i>. 2013:1-4.
  apa: Grieger, M., Güldali, B., Sauer, S., &#38; Mlynarski, M. (2013). Testen bei
    Migrationsprojekten. <i>OBJEKTspektrum (Online Themenspecials)</i>, 1–4.
  bibtex: '@article{Grieger_Güldali_Sauer_Mlynarski_2013, title={Testen bei Migrationsprojekten},
    journal={OBJEKTspektrum (Online Themenspecials)}, author={Grieger, Marvin and
    Güldali, Baris and Sauer, Stefan and Mlynarski, Michael}, year={2013}, pages={1–4}
    }'
  chicago: Grieger, Marvin, Baris Güldali, Stefan Sauer, and Michael Mlynarski. “Testen
    Bei Migrationsprojekten.” <i>OBJEKTspektrum (Online Themenspecials)</i>, 2013,
    1–4.
  ieee: M. Grieger, B. Güldali, S. Sauer, and M. Mlynarski, “Testen bei Migrationsprojekten,”
    <i>OBJEKTspektrum (Online Themenspecials)</i>, pp. 1–4, 2013.
  mla: Grieger, Marvin, et al. “Testen Bei Migrationsprojekten.” <i>OBJEKTspektrum
    (Online Themenspecials)</i>, 2013, pp. 1–4.
  short: M. Grieger, B. Güldali, S. Sauer, M. Mlynarski, OBJEKTspektrum (Online Themenspecials)
    (2013) 1–4.
date_created: 2019-01-30T13:52:57Z
date_updated: 2022-01-06T07:03:31Z
department:
- _id: '66'
language:
- iso: eng
page: 1-4
publication: OBJEKTspektrum (Online Themenspecials)
status: public
title: Testen bei Migrationsprojekten
type: journal_article
user_id: '52534'
year: '2013'
...
---
_id: '7274'
author:
- first_name: Masud
  full_name: Fazal-Baqaie, Masud
  last_name: Fazal-Baqaie
- first_name: Baris
  full_name: Güldali, Baris
  last_name: Güldali
- first_name: Markus
  full_name: Luckey, Markus
  last_name: Luckey
- first_name: Stefan
  full_name: Sauer, Stefan
  id: '447'
  last_name: Sauer
- first_name: Michael
  full_name: Spijkerman, Michael
  last_name: Spijkerman
citation:
  ama: Fazal-Baqaie M, Güldali B, Luckey M, Sauer S, Spijkerman M. Maßgeschneidert
    und werkzeugunterstützt Entwickeln angepasster Requirements Engineering-Methoden.
    <i>OBJEKTspektrum (Online Themenspecials)</i>. 2013;(RE/2013):1-5.
  apa: Fazal-Baqaie, M., Güldali, B., Luckey, M., Sauer, S., &#38; Spijkerman, M.
    (2013). Maßgeschneidert und werkzeugunterstützt Entwickeln angepasster Requirements
    Engineering-Methoden. <i>OBJEKTspektrum (Online Themenspecials)</i>, (RE/2013),
    1–5.
  bibtex: '@article{Fazal-Baqaie_Güldali_Luckey_Sauer_Spijkerman_2013, title={Maßgeschneidert
    und werkzeugunterstützt Entwickeln angepasster Requirements Engineering-Methoden},
    number={RE/2013}, journal={OBJEKTspektrum (Online Themenspecials)}, author={Fazal-Baqaie,
    Masud and Güldali, Baris and Luckey, Markus and Sauer, Stefan and Spijkerman,
    Michael}, year={2013}, pages={1–5} }'
  chicago: 'Fazal-Baqaie, Masud, Baris Güldali, Markus Luckey, Stefan Sauer, and Michael
    Spijkerman. “Maßgeschneidert Und Werkzeugunterstützt Entwickeln Angepasster Requirements
    Engineering-Methoden.” <i>OBJEKTspektrum (Online Themenspecials)</i>, no. RE/2013
    (2013): 1–5.'
  ieee: M. Fazal-Baqaie, B. Güldali, M. Luckey, S. Sauer, and M. Spijkerman, “Maßgeschneidert
    und werkzeugunterstützt Entwickeln angepasster Requirements Engineering-Methoden,”
    <i>OBJEKTspektrum (Online Themenspecials)</i>, no. RE/2013, pp. 1–5, 2013.
  mla: Fazal-Baqaie, Masud, et al. “Maßgeschneidert Und Werkzeugunterstützt Entwickeln
    Angepasster Requirements Engineering-Methoden.” <i>OBJEKTspektrum (Online Themenspecials)</i>,
    no. RE/2013, 2013, pp. 1–5.
  short: M. Fazal-Baqaie, B. Güldali, M. Luckey, S. Sauer, M. Spijkerman, OBJEKTspektrum
    (Online Themenspecials) (2013) 1–5.
date_created: 2019-01-30T13:53:56Z
date_updated: 2022-01-06T07:03:31Z
department:
- _id: '66'
issue: RE/2013
language:
- iso: eng
page: 1-5
publication: OBJEKTspektrum (Online Themenspecials)
status: public
title: Maßgeschneidert und werkzeugunterstützt Entwickeln angepasster Requirements
  Engineering-Methoden
type: journal_article
user_id: '52534'
year: '2013'
...
---
_id: '7275'
author:
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Markus
  full_name: Luckey, Markus
  last_name: Luckey
citation:
  ama: Engels G, Luckey M. Editorial. <i>Computer Science - Research and Development</i>.
    2013;28(1):1-2.
  apa: Engels, G., &#38; Luckey, M. (2013). Editorial. <i>Computer Science - Research
    and Development</i>, <i>28</i>(1), 1–2.
  bibtex: '@article{Engels_Luckey_2013, title={Editorial}, volume={28}, number={1},
    journal={Computer Science - Research and Development}, author={Engels, Gregor
    and Luckey, Markus}, year={2013}, pages={1–2} }'
  chicago: 'Engels, Gregor, and Markus Luckey. “Editorial.” <i>Computer Science -
    Research and Development</i> 28, no. 1 (2013): 1–2.'
  ieee: G. Engels and M. Luckey, “Editorial,” <i>Computer Science - Research and Development</i>,
    vol. 28, no. 1, pp. 1–2, 2013.
  mla: Engels, Gregor, and Markus Luckey. “Editorial.” <i>Computer Science - Research
    and Development</i>, vol. 28, no. 1, 2013, pp. 1–2.
  short: G. Engels, M. Luckey, Computer Science - Research and Development 28 (2013)
    1–2.
date_created: 2019-01-30T13:54:36Z
date_updated: 2022-01-06T07:03:31Z
department:
- _id: '66'
intvolume: '        28'
issue: '1'
language:
- iso: eng
page: 1-2
publication: Computer Science - Research and Development
status: public
title: Editorial
type: journal_article
user_id: '52534'
volume: 28
year: '2013'
...
---
_id: '7276'
author:
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Christian
  full_name: Gerth, Christian
  last_name: Gerth
- first_name: Bernd
  full_name: Kleinjohann, Bernd
  last_name: Kleinjohann
- first_name: Lisa
  full_name: Kleinjohann, Lisa
  id: '15588'
  last_name: Kleinjohann
- first_name: Wolfgang
  full_name: Müller, Wolfgang
  last_name: Müller
- first_name: Stefan
  full_name: Sauer, Stefan
  id: '447'
  last_name: Sauer
citation:
  ama: Engels G, Gerth C, Kleinjohann B, Kleinjohann L, Müller W, Sauer S. Informationstechnik
    spart Ressourcen. <i>Forschungsforum Paderborn</i>. 2013;16/2013:54-61.
  apa: Engels, G., Gerth, C., Kleinjohann, B., Kleinjohann, L., Müller, W., &#38;
    Sauer, S. (2013). Informationstechnik spart Ressourcen. <i>Forschungsforum Paderborn</i>,
    <i>16/2013</i>, 54–61.
  bibtex: '@article{Engels_Gerth_Kleinjohann_Kleinjohann_Müller_Sauer_2013, title={Informationstechnik
    spart Ressourcen}, volume={16/2013}, journal={Forschungsforum Paderborn}, author={Engels,
    Gregor and Gerth, Christian and Kleinjohann, Bernd and Kleinjohann, Lisa and Müller,
    Wolfgang and Sauer, Stefan}, year={2013}, pages={54–61} }'
  chicago: 'Engels, Gregor, Christian Gerth, Bernd Kleinjohann, Lisa Kleinjohann,
    Wolfgang Müller, and Stefan Sauer. “Informationstechnik Spart Ressourcen.” <i>Forschungsforum
    Paderborn</i> 16/2013 (2013): 54–61.'
  ieee: G. Engels, C. Gerth, B. Kleinjohann, L. Kleinjohann, W. Müller, and S. Sauer,
    “Informationstechnik spart Ressourcen,” <i>Forschungsforum Paderborn</i>, vol.
    16/2013, pp. 54–61, 2013.
  mla: Engels, Gregor, et al. “Informationstechnik Spart Ressourcen.” <i>Forschungsforum
    Paderborn</i>, vol. 16/2013, 2013, pp. 54–61.
  short: G. Engels, C. Gerth, B. Kleinjohann, L. Kleinjohann, W. Müller, S. Sauer,
    Forschungsforum Paderborn 16/2013 (2013) 54–61.
date_created: 2019-01-30T13:55:16Z
date_updated: 2022-01-06T07:03:31Z
department:
- _id: '66'
language:
- iso: eng
page: 54-61
publication: Forschungsforum Paderborn
status: public
title: Informationstechnik spart Ressourcen
type: journal_article
user_id: '52534'
volume: 16/2013
year: '2013'
...
---
_id: '7277'
author:
- first_name: Christian
  full_name: Gerth, Christian
  last_name: Gerth
- first_name: Jochen
  full_name: Küster, Jochen
  last_name: Küster
- first_name: Markus
  full_name: Luckey, Markus
  last_name: Luckey
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
citation:
  ama: Gerth C, Küster J, Luckey M, Engels G. Detection and Resolution of Conflicting
    Change Operations in Version Management of Process Models. <i>Software and Systems
    Modeling</i>. 2013;12(3):517-535.
  apa: Gerth, C., Küster, J., Luckey, M., &#38; Engels, G. (2013). Detection and Resolution
    of Conflicting Change Operations in Version Management of Process Models. <i>Software
    and Systems Modeling</i>, <i>12</i>(3), 517–535.
  bibtex: '@article{Gerth_Küster_Luckey_Engels_2013, title={Detection and Resolution
    of Conflicting Change Operations in Version Management of Process Models}, volume={12},
    number={3}, journal={Software and Systems Modeling}, author={Gerth, Christian
    and Küster, Jochen and Luckey, Markus and Engels, Gregor}, year={2013}, pages={517–535}
    }'
  chicago: 'Gerth, Christian, Jochen Küster, Markus Luckey, and Gregor Engels. “Detection
    and Resolution of Conflicting Change Operations in Version Management of Process
    Models.” <i>Software and Systems Modeling</i> 12, no. 3 (2013): 517–35.'
  ieee: C. Gerth, J. Küster, M. Luckey, and G. Engels, “Detection and Resolution of
    Conflicting Change Operations in Version Management of Process Models,” <i>Software
    and Systems Modeling</i>, vol. 12, no. 3, pp. 517–535, 2013.
  mla: Gerth, Christian, et al. “Detection and Resolution of Conflicting Change Operations
    in Version Management of Process Models.” <i>Software and Systems Modeling</i>,
    vol. 12, no. 3, 2013, pp. 517–35.
  short: C. Gerth, J. Küster, M. Luckey, G. Engels, Software and Systems Modeling
    12 (2013) 517–535.
date_created: 2019-01-30T13:56:05Z
date_updated: 2022-01-06T07:03:31Z
department:
- _id: '66'
intvolume: '        12'
issue: '3'
language:
- iso: eng
page: 517-535
publication: Software and Systems Modeling
status: public
title: Detection and Resolution of Conflicting Change Operations in Version Management
  of Process Models
type: journal_article
user_id: '52534'
volume: 12
year: '2013'
...
---
_id: '7278'
abstract:
- lang: eng
  text: Modellbasiertes Testen verspricht potenziell eine höhere Effizienz und Effektivität
    im Testprozess. Ob im eigenen Kontext der Einsatz wirtschaftlich ist, ist jedoch
    häufig unklar. Dieser Beitrag analysiert systematisch Kosten- und Nutzenfaktoren
    und stellt ein Verfahren zur Abschätzung der Wirtschaftlichkeit des modellbasierten
    Testens vor. Anhand eines Beispiels wird der Ablauf veranschaulicht.
author:
- first_name: David
  full_name: Faragó, David
  last_name: Faragó
- first_name: Arne-Michael
  full_name: Törsel, Arne-Michael
  last_name: Törsel
- first_name: Michael
  full_name: Mlynarski, Michael
  last_name: Mlynarski
- first_name: Stephan
  full_name: Weißleder, Stephan
  last_name: Weißleder
- first_name: Baris
  full_name: Güldali, Baris
  last_name: Güldali
- first_name: Christian
  full_name: Brandes, Christian
  last_name: Brandes
citation:
  ama: 'Faragó D, Törsel A-M, Mlynarski M, Weißleder S, Güldali B, Brandes C. Wirtschaftlichkeitsberechnung
    für MBT: Wann sich modellbasiertes Testen lohnt. <i>OBJEKTspektrum</i>. 2013;4:32-38.'
  apa: 'Faragó, D., Törsel, A.-M., Mlynarski, M., Weißleder, S., Güldali, B., &#38;
    Brandes, C. (2013). Wirtschaftlichkeitsberechnung für MBT: Wann sich modellbasiertes
    Testen lohnt. <i>OBJEKTspektrum</i>, <i>4</i>, 32–38.'
  bibtex: '@article{Faragó_Törsel_Mlynarski_Weißleder_Güldali_Brandes_2013, title={Wirtschaftlichkeitsberechnung
    für MBT: Wann sich modellbasiertes Testen lohnt}, volume={4}, journal={OBJEKTspektrum},
    author={Faragó, David and Törsel, Arne-Michael and Mlynarski, Michael and Weißleder,
    Stephan and Güldali, Baris and Brandes, Christian}, year={2013}, pages={32–38}
    }'
  chicago: 'Faragó, David, Arne-Michael Törsel, Michael Mlynarski, Stephan Weißleder,
    Baris Güldali, and Christian Brandes. “Wirtschaftlichkeitsberechnung Für MBT:
    Wann Sich Modellbasiertes Testen Lohnt.” <i>OBJEKTspektrum</i> 4 (2013): 32–38.'
  ieee: 'D. Faragó, A.-M. Törsel, M. Mlynarski, S. Weißleder, B. Güldali, and C. Brandes,
    “Wirtschaftlichkeitsberechnung für MBT: Wann sich modellbasiertes Testen lohnt,”
    <i>OBJEKTspektrum</i>, vol. 4, pp. 32–38, 2013.'
  mla: 'Faragó, David, et al. “Wirtschaftlichkeitsberechnung Für MBT: Wann Sich Modellbasiertes
    Testen Lohnt.” <i>OBJEKTspektrum</i>, vol. 4, 2013, pp. 32–38.'
  short: D. Faragó, A.-M. Törsel, M. Mlynarski, S. Weißleder, B. Güldali, C. Brandes,
    OBJEKTspektrum 4 (2013) 32–38.
date_created: 2019-01-30T13:56:52Z
date_updated: 2022-01-06T07:03:31Z
department:
- _id: '66'
intvolume: '         4'
language:
- iso: eng
page: 32-38
publication: OBJEKTspektrum
status: public
title: 'Wirtschaftlichkeitsberechnung für MBT: Wann sich modellbasiertes Testen lohnt'
type: journal_article
user_id: '52534'
volume: 4
year: '2013'
...
---
_id: '7523'
author:
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Stefan
  full_name: Sauer, Stefan
  id: '447'
  last_name: Sauer
citation:
  ama: 'Engels G, Sauer S. Object-oriented Modeling of Multimedia Applications. In:
    Chang SK, ed. <i>Handbook of Software Engineering and Knowledge Engineering</i>.
    Vol 2. Singapore: World Scientific Publishing Company; 2013:21--53. doi:<a href="https://doi.org/10.1142/4603">https://doi.org/10.1142/4603</a>'
  apa: 'Engels, G., &#38; Sauer, S. (2013). Object-oriented Modeling of Multimedia
    Applications. In S. K. Chang (Ed.), <i>Handbook of Software Engineering and Knowledge
    Engineering</i> (Vol. 2, pp. 21--53). Singapore: World Scientific Publishing Company.
    <a href="https://doi.org/10.1142/4603">https://doi.org/10.1142/4603</a>'
  bibtex: '@inbook{Engels_Sauer_2013, place={Singapore}, title={Object-oriented Modeling
    of Multimedia Applications}, volume={2}, DOI={<a href="https://doi.org/10.1142/4603">https://doi.org/10.1142/4603</a>},
    booktitle={Handbook of Software Engineering and Knowledge Engineering}, publisher={World
    Scientific Publishing Company}, author={Engels, Gregor and Sauer, Stefan}, editor={Chang,
    S KEditor}, year={2013}, pages={21--53} }'
  chicago: 'Engels, Gregor, and Stefan Sauer. “Object-Oriented Modeling of Multimedia
    Applications.” In <i>Handbook of Software Engineering and Knowledge Engineering</i>,
    edited by S K Chang, 2:21--53. Singapore: World Scientific Publishing Company,
    2013. <a href="https://doi.org/10.1142/4603">https://doi.org/10.1142/4603</a>.'
  ieee: 'G. Engels and S. Sauer, “Object-oriented Modeling of Multimedia Applications,”
    in <i>Handbook of Software Engineering and Knowledge Engineering</i>, vol. 2,
    S. K. Chang, Ed. Singapore: World Scientific Publishing Company, 2013, pp. 21--53.'
  mla: Engels, Gregor, and Stefan Sauer. “Object-Oriented Modeling of Multimedia Applications.”
    <i>Handbook of Software Engineering and Knowledge Engineering</i>, edited by S
    K Chang, vol. 2, World Scientific Publishing Company, 2013, pp. 21--53, doi:<a
    href="https://doi.org/10.1142/4603">https://doi.org/10.1142/4603</a>.
  short: 'G. Engels, S. Sauer, in: S.K. Chang (Ed.), Handbook of Software Engineering
    and Knowledge Engineering, World Scientific Publishing Company, Singapore, 2013,
    pp. 21--53.'
date_created: 2019-02-04T22:56:37Z
date_updated: 2022-01-06T07:03:39Z
department:
- _id: '66'
doi: https://doi.org/10.1142/4603
editor:
- first_name: S K
  full_name: Chang, S K
  last_name: Chang
intvolume: '         2'
language:
- iso: eng
page: 21--53
place: Singapore
publication: Handbook of Software Engineering and Knowledge Engineering
publication_identifier:
  isbn:
  - '9789810245146'
  - '9789810249731'
  - '9789812389718'
publication_status: published
publisher: World Scientific Publishing Company
status: public
title: Object-oriented Modeling of Multimedia Applications
type: book_chapter
user_id: '52534'
volume: 2
year: '2013'
...
---
_id: '7569'
abstract:
- lang: eng
  text: 'Dynamic Meta Modeling (DMM) is a semantics specification technique targeted
    at MOF-based modeling languages, where a language''s behavior is defined by means
    of graphical operational rules which change runtime models. The DMM approach has
    first been suggested by Engels et al. in 2000; Hausmann has then defined the DMM
    language on a conceptual level within his PhD thesis in 2006. Consequently, the
    next step was to bring the existing DMM concepts alive, and then to apply them
    to different modeling languages, making use of the lessons learned to improve
    the DMM concepts as well as the DMM tooling. The result of this process is the
    DMM++ method, which is presented within this thesis. Our contributions are three-fold:
    First, and according to our experiences with the DMM language, we have introduced
    new concepts such as refinement by means of rule overriding, and we have strengthened
    existing concepts such as the dealing with universally quantified structures or
    attributes. Second, we have developed a test-driven process for semantics specification:
    A set of test models is created, and their expected behavior is fixed. Then, the
    DMM rules are created incrementally, finally resulting in a DMM ruleset realizing
    at least the expected behavior of the test models. Additionally, we have defined
    a set of coverage criteria for DMM rulesets which allow to measure the quality
    of a set of test models. Third, we have shown how functional as well as non-functional
    requirements can be formulated against models and their DMM specifications. The
    former is achieved by providing a visual language for formulating temporal logic
    properties, which are then verified with model checking techniques, and by allowing
    for visual debugging of models failing a requirement. For the latter, the modeler
    can add performance information to models and analyze their performance properties,
    e.g. average throughput.'
author:
- first_name: Christian
  full_name: Soltenborn, Christian
  id: '1737'
  last_name: Soltenborn
  orcid: 0000-0002-0342-8227
citation:
  ama: Soltenborn C. <i>Quality Assurance with Dynamic Meta Modeling</i>. Universität
    Paderborn; 2013. doi:<a href="http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420">http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420</a>
  apa: Soltenborn, C. (2013). <i>Quality Assurance with Dynamic Meta Modeling</i>.
    Universität Paderborn. <a href="http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420">http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420</a>
  bibtex: '@book{Soltenborn_2013, title={Quality Assurance with Dynamic Meta Modeling},
    DOI={<a href="http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420">http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420</a>},
    publisher={Universität Paderborn}, author={Soltenborn, Christian}, year={2013}
    }'
  chicago: Soltenborn, Christian. <i>Quality Assurance with Dynamic Meta Modeling</i>.
    Universität Paderborn, 2013. <a href="http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420">http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420</a>.
  ieee: C. Soltenborn, <i>Quality Assurance with Dynamic Meta Modeling</i>. Universität
    Paderborn, 2013.
  mla: Soltenborn, Christian. <i>Quality Assurance with Dynamic Meta Modeling</i>.
    Universität Paderborn, 2013, doi:<a href="http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420">http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420</a>.
  short: C. Soltenborn, Quality Assurance with Dynamic Meta Modeling, Universität
    Paderborn, 2013.
date_created: 2019-02-06T14:15:58Z
date_updated: 2022-01-06T07:03:39Z
department:
- _id: '66'
doi: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '9'
  name: SFB 901 - Subproject B1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
title: Quality Assurance with Dynamic Meta Modeling
type: dissertation
user_id: '477'
year: '2013'
...