---
_id: '201'
author:
- first_name: Henrik
  full_name: Bröcher, Henrik
  last_name: Bröcher
citation:
  ama: Bröcher H. <i>Evaluation von Graphpartitionierungsalgorithmen im Kontext von
    Konfigurierbarer Softwarezertifizierung</i>. Universität Paderborn; 2016.
  apa: Bröcher, H. (2016). <i>Evaluation von Graphpartitionierungsalgorithmen im Kontext
    von Konfigurierbarer Softwarezertifizierung</i>. Universität Paderborn.
  bibtex: '@book{Bröcher_2016, title={Evaluation von Graphpartitionierungsalgorithmen
    im Kontext von Konfigurierbarer Softwarezertifizierung}, publisher={Universität
    Paderborn}, author={Bröcher, Henrik}, year={2016} }'
  chicago: Bröcher, Henrik. <i>Evaluation von Graphpartitionierungsalgorithmen im
    Kontext von Konfigurierbarer Softwarezertifizierung</i>. Universität Paderborn,
    2016.
  ieee: H. Bröcher, <i>Evaluation von Graphpartitionierungsalgorithmen im Kontext
    von Konfigurierbarer Softwarezertifizierung</i>. Universität Paderborn, 2016.
  mla: Bröcher, Henrik. <i>Evaluation von Graphpartitionierungsalgorithmen im Kontext
    von Konfigurierbarer Softwarezertifizierung</i>. Universität Paderborn, 2016.
  short: H. Bröcher, Evaluation von Graphpartitionierungsalgorithmen im Kontext von
    Konfigurierbarer Softwarezertifizierung, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:31Z
date_updated: 2022-01-06T06:54:18Z
department:
- _id: '77'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '12'
  name: SFB 901 - Subprojekt B4
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
  full_name: Wehrheim, Heike
  last_name: Wehrheim
title: Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer
  Softwarezertifizierung
type: bachelorsthesis
user_id: '15504'
year: '2016'
...
---
_id: '3318'
author:
- first_name: Vitalik
  full_name: Melnikov, Vitalik
  last_name: Melnikov
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
- first_name: Daniel
  full_name: Kaimann, Daniel
  id: '18949'
  last_name: Kaimann
- first_name: 'Bernd '
  full_name: 'Frick, Bernd '
  last_name: Frick
- first_name: ' Pritha '
  full_name: 'Gupta,  Pritha '
  last_name: Gupta
citation:
  ama: 'Melnikov V, Hüllermeier E, Kaimann D, Frick B, Gupta  Pritha . Pairwise versus
    Pointwise Ranking: A Case Study. <i>Schedae Informaticae</i>. 2016;25. doi:<a
    href="https://doi.org/10.4467/20838476si.16.006.6187">10.4467/20838476si.16.006.6187</a>'
  apa: 'Melnikov, V., Hüllermeier, E., Kaimann, D., Frick, B., &#38; Gupta,  Pritha
    . (2016). Pairwise versus Pointwise Ranking: A Case Study. <i>Schedae Informaticae</i>,
    <i>25</i>. <a href="https://doi.org/10.4467/20838476si.16.006.6187">https://doi.org/10.4467/20838476si.16.006.6187</a>'
  bibtex: '@article{Melnikov_Hüllermeier_Kaimann_Frick_Gupta_2016, title={Pairwise
    versus Pointwise Ranking: A Case Study}, volume={25}, DOI={<a href="https://doi.org/10.4467/20838476si.16.006.6187">10.4467/20838476si.16.006.6187</a>},
    journal={Schedae Informaticae}, publisher={Uniwersytet Jagiellonski - Wydawnictwo
    Uniwersytetu Jagiellonskiego}, author={Melnikov, Vitalik and Hüllermeier, Eyke
    and Kaimann, Daniel and Frick, Bernd  and Gupta,  Pritha }, year={2016} }'
  chicago: 'Melnikov, Vitalik, Eyke Hüllermeier, Daniel Kaimann, Bernd  Frick, and  Pritha  Gupta.
    “Pairwise versus Pointwise Ranking: A Case Study.” <i>Schedae Informaticae</i>
    25 (2016). <a href="https://doi.org/10.4467/20838476si.16.006.6187">https://doi.org/10.4467/20838476si.16.006.6187</a>.'
  ieee: 'V. Melnikov, E. Hüllermeier, D. Kaimann, B. Frick, and  Pritha  Gupta, “Pairwise
    versus Pointwise Ranking: A Case Study,” <i>Schedae Informaticae</i>, vol. 25,
    2016.'
  mla: 'Melnikov, Vitalik, et al. “Pairwise versus Pointwise Ranking: A Case Study.”
    <i>Schedae Informaticae</i>, vol. 25, Uniwersytet Jagiellonski - Wydawnictwo Uniwersytetu
    Jagiellonskiego, 2016, doi:<a href="https://doi.org/10.4467/20838476si.16.006.6187">10.4467/20838476si.16.006.6187</a>.'
  short: V. Melnikov, E. Hüllermeier, D. Kaimann, B. Frick,  Pritha  Gupta, Schedae
    Informaticae 25 (2016).
date_created: 2018-06-22T14:49:40Z
date_updated: 2022-01-06T06:59:10Z
ddc:
- '000'
department:
- _id: '355'
- _id: '183'
doi: 10.4467/20838476si.16.006.6187
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:54:38Z
  date_updated: 2018-11-02T15:54:38Z
  file_id: '5317'
  file_name: roz-6-Melnikov.pdf
  file_size: 1002478
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T15:54:38Z
has_accepted_license: '1'
intvolume: '        25'
language:
- iso: eng
project:
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '11'
  name: SFB 901 - Subproject B3
- _id: '8'
  name: SFB 901 - Subproject A4
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
publication: Schedae Informaticae
publication_identifier:
  issn:
  - 2083-8476
publication_status: published
publisher: Uniwersytet Jagiellonski - Wydawnictwo Uniwersytetu Jagiellonskiego
status: public
title: 'Pairwise versus Pointwise Ranking: A Case Study'
type: journal_article
user_id: '15504'
volume: 25
year: '2016'
...
---
_id: '3157'
author:
- first_name: Steffen
  full_name: Beringer, Steffen
  last_name: Beringer
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Beringer S, Wehrheim H. Verification of AUTOSAR Software Architectures with
    Timed Automata. In: H. ter Beek M, Gnesi S, Knapp A, eds. <i>Critical Systems:
    Formal Methods and Automated Verification - Joint 21st International Workshop
    on Formal Methods for Industrial Critical Systems and 16th International Workshop
    on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy,
    September 26-28, 2016, Proceedings</i>. Lecture Notes in Computer Science. ; 2016:189--204.
    doi:<a href="https://doi.org/10.1007/978-3-319-45943-1_13">10.1007/978-3-319-45943-1_13</a>'
  apa: 'Beringer, S., &#38; Wehrheim, H. (2016). Verification of AUTOSAR Software
    Architectures with Timed Automata. In M. H. ter Beek, S. Gnesi, &#38; A. Knapp
    (Eds.), <i>Critical Systems: Formal Methods and Automated Verification - Joint
    21st International Workshop on Formal Methods for Industrial Critical Systems
    and 16th International Workshop on Automated Verification of Critical Systems,
    FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i> (pp. 189--204).
    <a href="https://doi.org/10.1007/978-3-319-45943-1_13">https://doi.org/10.1007/978-3-319-45943-1_13</a>'
  bibtex: '@inproceedings{Beringer_Wehrheim_2016, series={Lecture Notes in Computer
    Science}, title={Verification of AUTOSAR Software Architectures with Timed Automata},
    DOI={<a href="https://doi.org/10.1007/978-3-319-45943-1_13">10.1007/978-3-319-45943-1_13</a>},
    booktitle={Critical Systems: Formal Methods and Automated Verification - Joint
    21st International Workshop on Formal Methods for Industrial Critical Systems
    and 16th International Workshop on Automated Verification of Critical Systems,
    FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings}, author={Beringer,
    Steffen and Wehrheim, Heike}, editor={H. ter Beek, Maurice and Gnesi, Stefania
    and Knapp, AlexanderEditors}, year={2016}, pages={189--204}, collection={Lecture
    Notes in Computer Science} }'
  chicago: 'Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software
    Architectures with Timed Automata.” In <i>Critical Systems: Formal Methods and
    Automated Verification - Joint 21st International Workshop on Formal Methods for
    Industrial Critical Systems and 16th International Workshop on Automated Verification
    of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>,
    edited by Maurice H. ter Beek, Stefania Gnesi, and Alexander Knapp, 189--204.
    Lecture Notes in Computer Science, 2016. <a href="https://doi.org/10.1007/978-3-319-45943-1_13">https://doi.org/10.1007/978-3-319-45943-1_13</a>.'
  ieee: 'S. Beringer and H. Wehrheim, “Verification of AUTOSAR Software Architectures
    with Timed Automata,” in <i>Critical Systems: Formal Methods and Automated Verification
    - Joint 21st International Workshop on Formal Methods for Industrial Critical
    Systems and 16th International Workshop on Automated Verification of Critical
    Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>,
    2016, pp. 189--204.'
  mla: 'Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures
    with Timed Automata.” <i>Critical Systems: Formal Methods and Automated Verification
    - Joint 21st International Workshop on Formal Methods for Industrial Critical
    Systems and 16th International Workshop on Automated Verification of Critical
    Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>,
    edited by Maurice H. ter Beek et al., 2016, pp. 189--204, doi:<a href="https://doi.org/10.1007/978-3-319-45943-1_13">10.1007/978-3-319-45943-1_13</a>.'
  short: 'S. Beringer, H. Wehrheim, in: M. H. ter Beek, S. Gnesi, A. Knapp (Eds.),
    Critical Systems: Formal Methods and Automated Verification - Joint 21st International
    Workshop on Formal Methods for Industrial Critical Systems and 16th International
    Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa,
    Italy, September 26-28, 2016, Proceedings, 2016, pp. 189--204.'
date_created: 2018-06-13T07:39:35Z
date_updated: 2022-01-06T06:59:01Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1007/978-3-319-45943-1_13
editor:
- first_name: Maurice
  full_name: H. ter Beek, Maurice
  last_name: H. ter Beek
- first_name: Stefania
  full_name: Gnesi, Stefania
  last_name: Gnesi
- first_name: Alexander
  full_name: Knapp, Alexander
  last_name: Knapp
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:17:13Z
  date_updated: 2018-11-02T14:17:13Z
  file_id: '5267'
  file_name: VerificationOfAUTOSARSoftwareA.pdf
  file_size: 2640695
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:17:13Z
has_accepted_license: '1'
language:
- iso: eng
page: 189--204
project:
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subproject B3
publication: 'Critical Systems: Formal Methods and Automated Verification - Joint
  21st International Workshop on Formal Methods for Industrial Critical Systems and
  16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS
  2016, Pisa, Italy, September 26-28, 2016, Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: Verification of AUTOSAR Software Architectures with Timed Automata
type: conference
user_id: '477'
year: '2016'
...
---
_id: '173'
author:
- first_name: Eduard
  full_name: Heck, Eduard
  last_name: Heck
citation:
  ama: Heck E. <i>Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen am
    Beispiel des Google Marketplace</i>. Universität Paderborn; 2016.
  apa: Heck, E. (2016). <i>Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen
    am Beispiel des Google Marketplace</i>. Universität Paderborn.
  bibtex: '@book{Heck_2016, title={Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen
    am Beispiel des Google Marketplace}, publisher={Universität Paderborn}, author={Heck,
    Eduard}, year={2016} }'
  chicago: Heck, Eduard. <i>Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen
    am Beispiel des Google Marketplace</i>. Universität Paderborn, 2016.
  ieee: E. Heck, <i>Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen
    am Beispiel des Google Marketplace</i>. Universität Paderborn, 2016.
  mla: Heck, Eduard. <i>Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen
    am Beispiel des Google Marketplace</i>. Universität Paderborn, 2016.
  short: E. Heck, Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen am
    Beispiel des Google Marketplace, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:25Z
date_updated: 2022-01-06T06:53:07Z
language:
- iso: ger
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
title: Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen am Beispiel des
  Google Marketplace
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '174'
author:
- first_name: Christoph
  full_name: Schwentker, Christoph
  last_name: Schwentker
citation:
  ama: Schwentker C. <i>Ontologie-basierte Extraktion funktionaler Softwareanforderungen
    am Fallbeispiel mobiler Kommunikationsapplikationen</i>. Universität Paderborn;
    2016.
  apa: Schwentker, C. (2016). <i>Ontologie-basierte Extraktion funktionaler Softwareanforderungen
    am Fallbeispiel mobiler Kommunikationsapplikationen</i>. Universität Paderborn.
  bibtex: '@book{Schwentker_2016, title={Ontologie-basierte Extraktion funktionaler
    Softwareanforderungen am Fallbeispiel mobiler Kommunikationsapplikationen}, publisher={Universität
    Paderborn}, author={Schwentker, Christoph}, year={2016} }'
  chicago: Schwentker, Christoph. <i>Ontologie-basierte Extraktion funktionaler Softwareanforderungen
    am Fallbeispiel mobiler Kommunikationsapplikationen</i>. Universität Paderborn,
    2016.
  ieee: C. Schwentker, <i>Ontologie-basierte Extraktion funktionaler Softwareanforderungen
    am Fallbeispiel mobiler Kommunikationsapplikationen</i>. Universität Paderborn,
    2016.
  mla: Schwentker, Christoph. <i>Ontologie-basierte Extraktion funktionaler Softwareanforderungen
    am Fallbeispiel mobiler Kommunikationsapplikationen</i>. Universität Paderborn,
    2016.
  short: C. Schwentker, Ontologie-basierte Extraktion funktionaler Softwareanforderungen
    am Fallbeispiel mobiler Kommunikationsapplikationen, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:25Z
date_updated: 2022-01-06T06:53:10Z
language:
- iso: ger
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
title: Ontologie-basierte Extraktion funktionaler Softwareanforderungen am Fallbeispiel
  mobiler Kommunikationsapplikationen
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '175'
abstract:
- lang: eng
  text: Today, service compositions often need to be assembled or changed on-the-fly,
    which leaves only little time for quality assurance. Moreover, quality assurance
    is complicated by service providers only giving information on their services
    in terms of domain specific concepts with only limited semantic meaning.In this
    paper, we propose a method for constructing service compositions based on pre-verified
    templates. Templates, given as workflow descriptions, are typed over a (domain-independent)
    template ontology defining concepts and predicates. Their meaning is defined by
    an abstract semantics, leaving the specific meaning of ontology concepts open,
    however, only up to given ontology rules. Templates are proven correct using a
    Hoare-style proof calculus, extended by a specific rule for service calls. Construction
    of service compositions amounts to instantiation of templates with domain-specific
    services. Correctness of an instantiation can then simply be checked by verifying
    that the domain ontology (a) adheres to the rules of the template ontology, and
    (b) fulfills the constraints of the employed template.
author:
- first_name: Sven
  full_name: Walther, Sven
  last_name: Walther
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: Walther S, Wehrheim H. On-The-Fly Construction of Provably Correct Service
    Compositions - Templates and Proofs. <i>Science of Computer Programming</i>. 2016:2--23.
    doi:<a href="https://doi.org/10.1016/j.scico.2016.04.002">10.1016/j.scico.2016.04.002</a>
  apa: Walther, S., &#38; Wehrheim, H. (2016). On-The-Fly Construction of Provably
    Correct Service Compositions - Templates and Proofs. <i>Science of Computer Programming</i>,
    2--23. <a href="https://doi.org/10.1016/j.scico.2016.04.002">https://doi.org/10.1016/j.scico.2016.04.002</a>
  bibtex: '@article{Walther_Wehrheim_2016, title={On-The-Fly Construction of Provably
    Correct Service Compositions - Templates and Proofs}, DOI={<a href="https://doi.org/10.1016/j.scico.2016.04.002">10.1016/j.scico.2016.04.002</a>},
    journal={Science of Computer Programming}, publisher={Elsevier}, author={Walther,
    Sven and Wehrheim, Heike}, year={2016}, pages={2--23} }'
  chicago: Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably
    Correct Service Compositions - Templates and Proofs.” <i>Science of Computer Programming</i>,
    2016, 2--23. <a href="https://doi.org/10.1016/j.scico.2016.04.002">https://doi.org/10.1016/j.scico.2016.04.002</a>.
  ieee: S. Walther and H. Wehrheim, “On-The-Fly Construction of Provably Correct Service
    Compositions - Templates and Proofs,” <i>Science of Computer Programming</i>,
    pp. 2--23, 2016.
  mla: Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably Correct
    Service Compositions - Templates and Proofs.” <i>Science of Computer Programming</i>,
    Elsevier, 2016, pp. 2--23, doi:<a href="https://doi.org/10.1016/j.scico.2016.04.002">10.1016/j.scico.2016.04.002</a>.
  short: S. Walther, H. Wehrheim, Science of Computer Programming (2016) 2--23.
date_created: 2017-10-17T12:41:26Z
date_updated: 2022-01-06T06:53:13Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.scico.2016.04.002
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:38:40Z
  date_updated: 2018-03-21T12:38:40Z
  file_id: '1536'
  file_name: 175-1-s2.0-S0167642316300028-main.pdf
  file_size: 630739
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:38:40Z
has_accepted_license: '1'
language:
- iso: eng
page: 2--23
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publication: Science of Computer Programming
publisher: Elsevier
status: public
title: On-The-Fly Construction of Provably Correct Service Compositions - Templates
  and Proofs
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '176'
abstract:
- lang: eng
  text: Users prefer natural language software requirements because of their usability
    and accessibility. When they describe their wishes for software development, they
    often provide off-topic information. We therefore present an automated approach
    for identifying and semantically annotating the on-topic parts of the given descriptions.
    It is designed to support requirement engineers in the requirement elicitation
    process on detecting and analyzing requirements in user-generated content. Since
    no lexical resources with domain-specific information about requirements are available,
    we created a corpus of requirements written in controlled language by instructed
    users and uncontrolled language by uninstructed users. We annotated these requirements
    regarding predicate-argument structures, conditions, priorities, motivations and
    semantic roles and used this information to train classifiers for information
    extraction purposes. The approach achieves an accuracy of 92% for the on- and
    off-topic classification task and an F1-measure of 72% for the semantic annotation.
author:
- first_name: Markus
  full_name: Dollmann, Markus
  id: '27578'
  last_name: Dollmann
- first_name: Michaela
  full_name: Geierhos, Michaela
  id: '42496'
  last_name: Geierhos
  orcid: 0000-0002-8180-5606
citation:
  ama: 'Dollmann M, Geierhos M. On- and Off-Topic Classification and Semantic Annotation
    of User-Generated Software Requirements. In: <i>Proceedings of the 2016 Conference
    on Empirical Methods in Natural Language Processing (EMNLP)</i>. Austin, TX, USA:
    Association for Computational Linguistics (ACL); 2016:1807-1816.'
  apa: 'Dollmann, M., &#38; Geierhos, M. (2016). On- and Off-Topic Classification
    and Semantic Annotation of User-Generated Software Requirements. In <i>Proceedings
    of the 2016 Conference on Empirical Methods in Natural Language Processing (EMNLP)</i>
    (pp. 1807–1816). Austin, TX, USA: Association for Computational Linguistics (ACL).'
  bibtex: '@inproceedings{Dollmann_Geierhos_2016, place={Austin, TX, USA}, title={On-
    and Off-Topic Classification and Semantic Annotation of User-Generated Software
    Requirements}, booktitle={Proceedings of the 2016 Conference on Empirical Methods
    in Natural Language Processing (EMNLP)}, publisher={Association for Computational
    Linguistics (ACL)}, author={Dollmann, Markus and Geierhos, Michaela}, year={2016},
    pages={1807–1816} }'
  chicago: 'Dollmann, Markus, and Michaela Geierhos. “On- and Off-Topic Classification
    and Semantic Annotation of User-Generated Software Requirements.” In <i>Proceedings
    of the 2016 Conference on Empirical Methods in Natural Language Processing (EMNLP)</i>,
    1807–16. Austin, TX, USA: Association for Computational Linguistics (ACL), 2016.'
  ieee: M. Dollmann and M. Geierhos, “On- and Off-Topic Classification and Semantic
    Annotation of User-Generated Software Requirements,” in <i>Proceedings of the
    2016 Conference on Empirical Methods in Natural Language Processing (EMNLP)</i>,
    Austin, TX, USA, 2016, pp. 1807–1816.
  mla: Dollmann, Markus, and Michaela Geierhos. “On- and Off-Topic Classification
    and Semantic Annotation of User-Generated Software Requirements.” <i>Proceedings
    of the 2016 Conference on Empirical Methods in Natural Language Processing (EMNLP)</i>,
    Association for Computational Linguistics (ACL), 2016, pp. 1807–16.
  short: 'M. Dollmann, M. Geierhos, in: Proceedings of the 2016 Conference on Empirical
    Methods in Natural Language Processing (EMNLP), Association for Computational
    Linguistics (ACL), Austin, TX, USA, 2016, pp. 1807–1816.'
conference:
  end_date: 2016-11-05
  location: Austin, TX, USA
  name: Conference on Empirical Methods in Natural Language Processing (EMNLP 2016)
  start_date: 2016-11-01
date_created: 2017-10-17T12:41:26Z
date_updated: 2022-01-06T06:53:15Z
ddc:
- '040'
department:
- _id: '36'
- _id: '1'
- _id: '579'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:33:48Z
  date_updated: 2018-03-21T12:33:48Z
  file_id: '1535'
  file_name: 176-D16-1186.pdf
  file_size: 259495
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:33:48Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.aclweb.org/anthology/D16-1186
oa: '1'
page: 1807-1816
place: Austin, TX, USA
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '9'
  name: SFB 901 - Subproject B1
publication: Proceedings of the 2016 Conference on Empirical Methods in Natural Language
  Processing (EMNLP)
publication_status: published
publisher: Association for Computational Linguistics (ACL)
quality_controlled: '1'
status: public
title: On- and Off-Topic Classification and Semantic Annotation of User-Generated
  Software Requirements
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '190'
abstract:
- lang: eng
  text: Today, software components are provided by global markets in the form of services.
    In order to optimally satisfy service requesters and service providers, adequate
    techniques for automatic service matching are needed. However, a requester’s requirements
    may be vague and the information available about a provided service may be incomplete.
    As a consequence, fuzziness is induced into the matching procedure. The contribution
    of this paper is the development of a systematic matching procedure that leverages
    concepts and techniques from fuzzy logic and possibility theory based on our formal
    distinction between different sources and types of fuzziness in the context of
    service matching. In contrast to existing methods, our approach is able to deal
    with imprecision and incompleteness in service specifications and to inform users
    about the extent of induced fuzziness in order to improve the user’s decision-making.
    We demonstrate our approach on the example of specifications for service reputation
    based on ratings given by previous users. Our evaluation based on real service
    ratings shows the utility and applicability of our approach.
author:
- first_name: Marie Christin
  full_name: Platenius, Marie Christin
  last_name: Platenius
- first_name: Ammar
  full_name: Shaker, Ammar
  last_name: Shaker
- first_name: Matthias
  full_name: Becker, Matthias
  last_name: Becker
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
- first_name: Wilhelm
  full_name: Schäfer, Wilhelm
  last_name: Schäfer
citation:
  ama: Platenius MC, Shaker A, Becker M, Hüllermeier E, Schäfer W. Imprecise Matching
    of Requirements Specifications for Software Services using Fuzzy Logic. <i>IEEE
    Transactions on Software Engineering (TSE), presented at ICSE 2017</i>. 2016;(8):739-759.
    doi:<a href="https://doi.org/10.1109/TSE.2016.2632115">10.1109/TSE.2016.2632115</a>
  apa: Platenius, M. C., Shaker, A., Becker, M., Hüllermeier, E., &#38; Schäfer, W.
    (2016). Imprecise Matching of Requirements Specifications for Software Services
    using Fuzzy Logic. <i>IEEE Transactions on Software Engineering (TSE), Presented
    at ICSE 2017</i>, (8), 739–759. <a href="https://doi.org/10.1109/TSE.2016.2632115">https://doi.org/10.1109/TSE.2016.2632115</a>
  bibtex: '@article{Platenius_Shaker_Becker_Hüllermeier_Schäfer_2016, title={Imprecise
    Matching of Requirements Specifications for Software Services using Fuzzy Logic},
    DOI={<a href="https://doi.org/10.1109/TSE.2016.2632115">10.1109/TSE.2016.2632115</a>},
    number={8}, journal={IEEE Transactions on Software Engineering (TSE), presented
    at ICSE 2017}, publisher={IEEE}, author={Platenius, Marie Christin and Shaker,
    Ammar and Becker, Matthias and Hüllermeier, Eyke and Schäfer, Wilhelm}, year={2016},
    pages={739–759} }'
  chicago: 'Platenius, Marie Christin, Ammar Shaker, Matthias Becker, Eyke Hüllermeier,
    and Wilhelm Schäfer. “Imprecise Matching of Requirements Specifications for Software
    Services Using Fuzzy Logic.” <i>IEEE Transactions on Software Engineering (TSE),
    Presented at ICSE 2017</i>, no. 8 (2016): 739–59. <a href="https://doi.org/10.1109/TSE.2016.2632115">https://doi.org/10.1109/TSE.2016.2632115</a>.'
  ieee: M. C. Platenius, A. Shaker, M. Becker, E. Hüllermeier, and W. Schäfer, “Imprecise
    Matching of Requirements Specifications for Software Services using Fuzzy Logic,”
    <i>IEEE Transactions on Software Engineering (TSE), presented at ICSE 2017</i>,
    no. 8, pp. 739–759, 2016.
  mla: Platenius, Marie Christin, et al. “Imprecise Matching of Requirements Specifications
    for Software Services Using Fuzzy Logic.” <i>IEEE Transactions on Software Engineering
    (TSE), Presented at ICSE 2017</i>, no. 8, IEEE, 2016, pp. 739–59, doi:<a href="https://doi.org/10.1109/TSE.2016.2632115">10.1109/TSE.2016.2632115</a>.
  short: M.C. Platenius, A. Shaker, M. Becker, E. Hüllermeier, W. Schäfer, IEEE Transactions
    on Software Engineering (TSE), Presented at ICSE 2017 (2016) 739–759.
date_created: 2017-10-17T12:41:29Z
date_updated: 2022-01-06T06:53:57Z
ddc:
- '040'
department:
- _id: '355'
doi: 10.1109/TSE.2016.2632115
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:30:31Z
  date_updated: 2018-03-21T12:30:31Z
  file_id: '1529'
  file_name: 190-07755807.pdf
  file_size: 5225413
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:30:31Z
has_accepted_license: '1'
issue: '8'
language:
- iso: eng
page: 739-759
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '10'
  name: SFB 901 - Subprojekt B2
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publication: IEEE Transactions on Software Engineering (TSE), presented at ICSE 2017
publisher: IEEE
status: public
title: Imprecise Matching of Requirements Specifications for Software Services using
  Fuzzy Logic
type: journal_article
user_id: '15504'
year: '2016'
...
---
_id: '191'
abstract:
- lang: eng
  text: One purpose of requirement refinement is that higher-level requirements have
    to be translated to something usable by developers. Since customer requirements
    are often written in natural language by end users, they lack precision, completeness
    and consistency. Although user stories are often used in the requirement elicitation
    process in order to describe the possibilities how to interact with the software,
    there is always something unspoken. Here, we present techniques how to automatically
    refine vague software descriptions. Thus, we can bridge the gap by first revising
    natural language utterances from higher-level to more detailed customer requirements,
    before functionality matters. We therefore focus on the resolution of semantically
    incomplete user-generated sentences (i.e. non-instantiated arguments of predicates)
    and provide ontology-based gap-filling suggestions how to complete unverbalized
    information in the user’s demand.
author:
- first_name: Michaela
  full_name: Geierhos, Michaela
  id: '42496'
  last_name: Geierhos
  orcid: 0000-0002-8180-5606
- first_name: Frederik Simon
  full_name: Bäumer, Frederik Simon
  id: '38837'
  last_name: Bäumer
citation:
  ama: 'Geierhos M, Bäumer FS. How to Complete Customer Requirements: Using Concept
    Expansion for Requirement Refinement. In: Métais E, Meziane F, Saraee M, Sugumaran
    V, Vadera S, eds. <i>Proceedings of the 21st International Conference on Applications
    of Natural Language to Information Systems (NLDB)</i>. Vol 9612. Lecture Notes
    in Computer Science. Cham, Switzerland: Springer; 2016:37-47. doi:<a href="https://doi.org/10.1007/978-3-319-41754-7_4">10.1007/978-3-319-41754-7_4</a>'
  apa: 'Geierhos, M., &#38; Bäumer, F. S. (2016). How to Complete Customer Requirements:
    Using Concept Expansion for Requirement Refinement. In E. Métais, F. Meziane,
    M. Saraee, V. Sugumaran, &#38; S. Vadera (Eds.), <i>Proceedings of the 21st International
    Conference on Applications of Natural Language to Information Systems (NLDB)</i>
    (Vol. 9612, pp. 37–47). Cham, Switzerland: Springer. <a href="https://doi.org/10.1007/978-3-319-41754-7_4">https://doi.org/10.1007/978-3-319-41754-7_4</a>'
  bibtex: '@inproceedings{Geierhos_Bäumer_2016, place={Cham, Switzerland}, series={Lecture
    Notes in Computer Science}, title={How to Complete Customer Requirements: Using
    Concept Expansion for Requirement Refinement}, volume={9612}, DOI={<a href="https://doi.org/10.1007/978-3-319-41754-7_4">10.1007/978-3-319-41754-7_4</a>},
    booktitle={Proceedings of the 21st International Conference on Applications of
    Natural Language to Information Systems (NLDB)}, publisher={Springer}, author={Geierhos,
    Michaela and Bäumer, Frederik Simon}, editor={Métais, Elisabeth  and Meziane,
    Farid  and Saraee, Mohamad  and Sugumaran, Vijayan  and Vadera, Sunil Editors},
    year={2016}, pages={37–47}, collection={Lecture Notes in Computer Science} }'
  chicago: 'Geierhos, Michaela, and Frederik Simon Bäumer. “How to Complete Customer
    Requirements: Using Concept Expansion for Requirement Refinement.” In <i>Proceedings
    of the 21st International Conference on Applications of Natural Language to Information
    Systems (NLDB)</i>, edited by Elisabeth  Métais, Farid  Meziane, Mohamad  Saraee,
    Vijayan  Sugumaran, and Sunil  Vadera, 9612:37–47. Lecture Notes in Computer Science.
    Cham, Switzerland: Springer, 2016. <a href="https://doi.org/10.1007/978-3-319-41754-7_4">https://doi.org/10.1007/978-3-319-41754-7_4</a>.'
  ieee: 'M. Geierhos and F. S. Bäumer, “How to Complete Customer Requirements: Using
    Concept Expansion for Requirement Refinement,” in <i>Proceedings of the 21st International
    Conference on Applications of Natural Language to Information Systems (NLDB)</i>,
    Salford, UK, 2016, vol. 9612, pp. 37–47.'
  mla: 'Geierhos, Michaela, and Frederik Simon Bäumer. “How to Complete Customer Requirements:
    Using Concept Expansion for Requirement Refinement.” <i>Proceedings of the 21st
    International Conference on Applications of Natural Language to Information Systems
    (NLDB)</i>, edited by Elisabeth  Métais et al., vol. 9612, Springer, 2016, pp.
    37–47, doi:<a href="https://doi.org/10.1007/978-3-319-41754-7_4">10.1007/978-3-319-41754-7_4</a>.'
  short: 'M. Geierhos, F.S. Bäumer, in: E. Métais, F. Meziane, M. Saraee, V. Sugumaran,
    S. Vadera (Eds.), Proceedings of the 21st International Conference on Applications
    of Natural Language to Information Systems (NLDB), Springer, Cham, Switzerland,
    2016, pp. 37–47.'
conference:
  end_date: 2016-06-24
  location: Salford, UK
  name: 21st International Conference on Applications of Natural Language to Information
    Systems (NLDB 2016)
  start_date: 2016-06-22
date_created: 2017-10-17T12:41:29Z
date_updated: 2022-01-06T06:53:58Z
ddc:
- '040'
department:
- _id: '36'
- _id: '1'
- _id: '579'
doi: 10.1007/978-3-319-41754-7_4
editor:
- first_name: 'Elisabeth '
  full_name: 'Métais, Elisabeth '
  last_name: Métais
- first_name: 'Farid '
  full_name: 'Meziane, Farid '
  last_name: Meziane
- first_name: 'Mohamad '
  full_name: 'Saraee, Mohamad '
  last_name: Saraee
- first_name: 'Vijayan '
  full_name: 'Sugumaran, Vijayan '
  last_name: Sugumaran
- first_name: 'Sunil '
  full_name: 'Vadera, Sunil '
  last_name: Vadera
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:29:37Z
  date_updated: 2018-03-21T12:29:37Z
  file_id: '1528'
  file_name: 191-chp_3A10.1007_2F978-3-319-41754-7_4.pdf
  file_size: 1499075
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:29:37Z
has_accepted_license: '1'
intvolume: '      9612'
keyword:
- Requirement refinement
- Concept expansion
- Ontology-based instantiation of predicate-argument structure
language:
- iso: eng
page: 37-47
place: Cham, Switzerland
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '9'
  name: SFB 901 - Subproject B1
publication: Proceedings of the 21st International Conference on Applications of Natural
  Language to Information Systems (NLDB)
publication_identifier:
  eisbn:
  - 978-3-319-41754-7
  isbn:
  - 978-3-319-41753-0
publication_status: published
publisher: Springer
quality_controlled: '1'
series_title: Lecture Notes in Computer Science
status: public
title: 'How to Complete Customer Requirements: Using Concept Expansion for Requirement
  Refinement'
type: conference
user_id: '477'
volume: 9612
year: '2016'
...
---
_id: '192'
author:
- first_name: Lena
  full_name: Reckhorn, Lena
  last_name: Reckhorn
citation:
  ama: Reckhorn L. <i>Herausforderungen im Umgang mit unvollständigen Softwareanforderungen
    durch Semantic Role Labeling</i>. Universität Paderborn; 2016.
  apa: Reckhorn, L. (2016). <i>Herausforderungen im Umgang mit unvollständigen Softwareanforderungen
    durch Semantic Role Labeling</i>. Universität Paderborn.
  bibtex: '@book{Reckhorn_2016, title={Herausforderungen im Umgang mit unvollständigen
    Softwareanforderungen durch Semantic Role Labeling}, publisher={Universität Paderborn},
    author={Reckhorn, Lena}, year={2016} }'
  chicago: Reckhorn, Lena. <i>Herausforderungen im Umgang mit unvollständigen Softwareanforderungen
    durch Semantic Role Labeling</i>. Universität Paderborn, 2016.
  ieee: L. Reckhorn, <i>Herausforderungen im Umgang mit unvollständigen Softwareanforderungen
    durch Semantic Role Labeling</i>. Universität Paderborn, 2016.
  mla: Reckhorn, Lena. <i>Herausforderungen im Umgang mit unvollständigen Softwareanforderungen
    durch Semantic Role Labeling</i>. Universität Paderborn, 2016.
  short: L. Reckhorn, Herausforderungen im Umgang mit unvollständigen Softwareanforderungen
    durch Semantic Role Labeling, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:29Z
date_updated: 2022-01-06T06:54:00Z
language:
- iso: ger
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
title: Herausforderungen im Umgang mit unvollständigen Softwareanforderungen durch
  Semantic Role Labeling
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '181'
author:
- first_name: Stefan
  full_name: Stanco, Stefan
  last_name: Stanco
citation:
  ama: Stanco S. <i>Modellierung von domänenspezifischen Ontologien im Anwendungsfall
    funktionaler Softwareanforderungen</i>. Universität Paderborn; 2016.
  apa: Stanco, S. (2016). <i>Modellierung von domänenspezifischen Ontologien im Anwendungsfall
    funktionaler Softwareanforderungen</i>. Universität Paderborn.
  bibtex: '@book{Stanco_2016, title={Modellierung von domänenspezifischen Ontologien
    im Anwendungsfall funktionaler Softwareanforderungen}, publisher={Universität
    Paderborn}, author={Stanco, Stefan}, year={2016} }'
  chicago: Stanco, Stefan. <i>Modellierung von domänenspezifischen Ontologien im Anwendungsfall
    funktionaler Softwareanforderungen</i>. Universität Paderborn, 2016.
  ieee: S. Stanco, <i>Modellierung von domänenspezifischen Ontologien im Anwendungsfall
    funktionaler Softwareanforderungen</i>. Universität Paderborn, 2016.
  mla: Stanco, Stefan. <i>Modellierung von domänenspezifischen Ontologien im Anwendungsfall
    funktionaler Softwareanforderungen</i>. Universität Paderborn, 2016.
  short: S. Stanco, Modellierung von domänenspezifischen Ontologien im Anwendungsfall
    funktionaler Softwareanforderungen, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:27Z
date_updated: 2022-01-06T06:53:26Z
language:
- iso: ger
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
title: Modellierung von domänenspezifischen Ontologien im Anwendungsfall funktionaler
  Softwareanforderungen
type: mastersthesis
user_id: '477'
year: '2016'
...
---
_id: '184'
abstract:
- lang: eng
  text: In this paper, we propose a framework for a class of learning problems that
    we refer to as “learning to aggregate”. Roughly, learning-to-aggregate problems
    are supervised machine learning problems, in which instances are represented in
    the form of a composition of a (variable) number on constituents; such compositions
    are associated with an evaluation, score, or label, which is the target of the
    prediction task, and which can presumably be modeled in the form of a suitable
    aggregation of the properties of its constituents. Our learning-to-aggregate framework
    establishes a close connection between machine learning and a branch of mathematics
    devoted to the systematic study of aggregation functions. We specifically focus
    on a class of functions called uninorms, which combine conjunctive and disjunctive
    modes of aggregation. Experimental results for a corresponding model are presented
    for a review data set, for which the aggregation problem consists of combining
    different reviewer opinions about a paper into an overall decision of acceptance
    or rejection.
author:
- first_name: Vitaly
  full_name: Melnikov, Vitaly
  id: '58747'
  last_name: Melnikov
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
citation:
  ama: 'Melnikov V, Hüllermeier E. Learning to Aggregate Using Uninorms. In: <i>Proceedings
    of the Joint European Conference on Machine Learning and Knowledge Discovery in
    Databases (ECML/PKDD 2016)</i>. LNCS. ; 2016:756-771. doi:<a href="https://doi.org/10.1007/978-3-319-46227-1_47">10.1007/978-3-319-46227-1_47</a>'
  apa: Melnikov, V., &#38; Hüllermeier, E. (2016). Learning to Aggregate Using Uninorms.
    In <i>Proceedings of the Joint European Conference on Machine Learning and Knowledge
    Discovery in Databases (ECML/PKDD 2016)</i> (pp. 756–771). <a href="https://doi.org/10.1007/978-3-319-46227-1_47">https://doi.org/10.1007/978-3-319-46227-1_47</a>
  bibtex: '@inproceedings{Melnikov_Hüllermeier_2016, series={LNCS}, title={Learning
    to Aggregate Using Uninorms}, DOI={<a href="https://doi.org/10.1007/978-3-319-46227-1_47">10.1007/978-3-319-46227-1_47</a>},
    booktitle={Proceedings of the Joint European Conference on Machine Learning and
    Knowledge Discovery in Databases (ECML/PKDD 2016)}, author={Melnikov, Vitaly and
    Hüllermeier, Eyke}, year={2016}, pages={756–771}, collection={LNCS} }'
  chicago: Melnikov, Vitaly, and Eyke Hüllermeier. “Learning to Aggregate Using Uninorms.”
    In <i>Proceedings of the Joint European Conference on Machine Learning and Knowledge
    Discovery in Databases (ECML/PKDD 2016)</i>, 756–71. LNCS, 2016. <a href="https://doi.org/10.1007/978-3-319-46227-1_47">https://doi.org/10.1007/978-3-319-46227-1_47</a>.
  ieee: V. Melnikov and E. Hüllermeier, “Learning to Aggregate Using Uninorms,” in
    <i>Proceedings of the Joint European Conference on Machine Learning and Knowledge
    Discovery in Databases (ECML/PKDD 2016)</i>, 2016, pp. 756–771.
  mla: Melnikov, Vitaly, and Eyke Hüllermeier. “Learning to Aggregate Using Uninorms.”
    <i>Proceedings of the Joint European Conference on Machine Learning and Knowledge
    Discovery in Databases (ECML/PKDD 2016)</i>, 2016, pp. 756–71, doi:<a href="https://doi.org/10.1007/978-3-319-46227-1_47">10.1007/978-3-319-46227-1_47</a>.
  short: 'V. Melnikov, E. Hüllermeier, in: Proceedings of the Joint European Conference
    on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016), 2016,
    pp. 756–771.'
date_created: 2017-10-17T12:41:27Z
date_updated: 2022-01-06T06:53:32Z
ddc:
- '040'
department:
- _id: '355'
doi: 10.1007/978-3-319-46227-1_47
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:32:44Z
  date_updated: 2018-03-21T12:32:44Z
  file_id: '1533'
  file_name: 184-chp_3A10.1007_2F978-3-319-46227-1_47.pdf
  file_size: 472159
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:32:44Z
has_accepted_license: '1'
language:
- iso: eng
page: 756-771
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the Joint European Conference on Machine Learning and
  Knowledge Discovery in Databases (ECML/PKDD 2016)
series_title: LNCS
status: public
title: Learning to Aggregate Using Uninorms
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '186'
abstract:
- lang: eng
  text: Software verification is an established method to ensure software safety.
    Nevertheless, verification still often fails, either because it consumes too much
    resources, e.g., time or memory, or the technique is not mature enough to verify
    the property. Often then discarding the partial verification, the validation process
    proceeds with techniques like testing.To enable standard testing to profit from
    previous, partial verification, we use a summary of the verification effort to
    simplify the program for subsequent testing. Our techniques use this summary to
    construct a residual program which only contains program paths with unproven assertions.
    Afterwards, the residual program can be used with standard testing tools.Our first
    experiments show that testing profits from the partial verification.The test effort
    is reduced and combined verification and testing is faster than a complete verification.
author:
- first_name: Mike
  full_name: Czech, Mike
  last_name: Czech
- first_name: Marie-Christine
  full_name: Jakobs, Marie-Christine
  last_name: Jakobs
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Czech M, Jakobs M-C, Wehrheim H. Just test what you cannot verify! In: Jens
    Knoop UZ, ed. <i>Software Engineering 2016</i>. Lecture Notes in Informatics.
    ; 2016:17-18.'
  apa: Czech, M., Jakobs, M.-C., &#38; Wehrheim, H. (2016). Just test what you cannot
    verify! In U. Z. Jens Knoop (Ed.), <i>Software Engineering 2016</i> (pp. 17–18).
  bibtex: '@inproceedings{Czech_Jakobs_Wehrheim_2016, series={Lecture Notes in Informatics},
    title={Just test what you cannot verify!}, booktitle={Software Engineering 2016},
    author={Czech, Mike and Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Jens
    Knoop, Uwe ZdunEditor}, year={2016}, pages={17–18}, collection={Lecture Notes
    in Informatics} }'
  chicago: Czech, Mike, Marie-Christine Jakobs, and Heike Wehrheim. “Just Test What
    You Cannot Verify!” In <i>Software Engineering 2016</i>, edited by Uwe Zdun Jens
    Knoop, 17–18. Lecture Notes in Informatics, 2016.
  ieee: M. Czech, M.-C. Jakobs, and H. Wehrheim, “Just test what you cannot verify!,”
    in <i>Software Engineering 2016</i>, 2016, pp. 17–18.
  mla: Czech, Mike, et al. “Just Test What You Cannot Verify!” <i>Software Engineering
    2016</i>, edited by Uwe Zdun Jens Knoop, 2016, pp. 17–18.
  short: 'M. Czech, M.-C. Jakobs, H. Wehrheim, in: U.Z. Jens Knoop (Ed.), Software
    Engineering 2016, 2016, pp. 17–18.'
date_created: 2017-10-17T12:41:28Z
date_updated: 2022-01-06T06:53:43Z
ddc:
- '040'
department:
- _id: '77'
editor:
- first_name: Uwe Zdun
  full_name: Jens Knoop, Uwe Zdun
  last_name: Jens Knoop
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:32:11Z
  date_updated: 2018-03-21T12:32:11Z
  file_id: '1532'
  file_name: 186-SEsubmission8.pdf
  file_size: 55775
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:32:11Z
has_accepted_license: '1'
language:
- iso: eng
page: 17-18
project:
- _id: '1'
  name: SFB 901
- _id: '12'
  name: SFB 901 - Subprojekt B4
- _id: '3'
  name: SFB 901 - Project Area B
publication: Software Engineering 2016
series_title: Lecture Notes in Informatics
status: public
title: Just test what you cannot verify!
type: conference
user_id: '477'
year: '2016'
...
---
_id: '221'
author:
- first_name: Marie Christin
  full_name: Platenius, Marie Christin
  last_name: Platenius
- first_name: Klementina
  full_name: Josifovska, Klementina
  last_name: Josifovska
- first_name: Lorijn
  full_name: van Rooijen, Lorijn
  id: '58843'
  last_name: van Rooijen
- first_name: Svetlana
  full_name: Arifulina, Svetlana
  last_name: Arifulina
- first_name: Matthias
  full_name: Becker, Matthias
  last_name: Becker
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Wilhelm
  full_name: Schäfer, Wilhelm
  last_name: Schäfer
citation:
  ama: Platenius MC, Josifovska K, van Rooijen L, et al. <i>An Overview of Service
    Specification Language and Matching in On-The-Fly Computing (v0.3)</i>. Universität
    Paderborn; 2016.
  apa: Platenius, M. C., Josifovska, K., van Rooijen, L., Arifulina, S., Becker, M.,
    Engels, G., &#38; Schäfer, W. (2016). <i>An Overview of Service Specification
    Language and Matching in On-The-Fly Computing (v0.3)</i>. Universität Paderborn.
  bibtex: '@book{Platenius_Josifovska_van Rooijen_Arifulina_Becker_Engels_Schäfer_2016,
    title={An Overview of Service Specification Language and Matching in On-The-Fly
    Computing (v0.3)}, publisher={Universität Paderborn}, author={Platenius, Marie
    Christin and Josifovska, Klementina and van Rooijen, Lorijn and Arifulina, Svetlana
    and Becker, Matthias and Engels, Gregor and Schäfer, Wilhelm}, year={2016} }'
  chicago: Platenius, Marie Christin, Klementina Josifovska, Lorijn van Rooijen, Svetlana
    Arifulina, Matthias Becker, Gregor Engels, and Wilhelm Schäfer. <i>An Overview
    of Service Specification Language and Matching in On-The-Fly Computing (v0.3)</i>.
    Universität Paderborn, 2016.
  ieee: M. C. Platenius <i>et al.</i>, <i>An Overview of Service Specification Language
    and Matching in On-The-Fly Computing (v0.3)</i>. Universität Paderborn, 2016.
  mla: Platenius, Marie Christin, et al. <i>An Overview of Service Specification Language
    and Matching in On-The-Fly Computing (v0.3)</i>. Universität Paderborn, 2016.
  short: M.C. Platenius, K. Josifovska, L. van Rooijen, S. Arifulina, M. Becker, G.
    Engels, W. Schäfer, An Overview of Service Specification Language and Matching
    in On-The-Fly Computing (v0.3), Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:35Z
date_updated: 2022-01-06T06:55:25Z
ddc:
- '040'
department:
- _id: '66'
- _id: '76'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:36:37Z
  date_updated: 2018-03-21T10:36:37Z
  file_id: '1512'
  file_name: 221-SFB_SSL_Techreport.pdf
  file_size: 6498677
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:36:37Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '11'
  name: SFB 901 - Subproject B3
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: An Overview of Service Specification Language and Matching in On-The-Fly Computing
  (v0.3)
type: report
user_id: '477'
year: '2016'
...
---
_id: '222'
abstract:
- lang: eng
  text: Virtual field programmable gate arrays (FPGA) are overlay architectures realized
    on top of physical FPGAs. They are proposed to enhance or abstract away from the
    physical FPGA for experimenting with novel architectures and design tool flows.
    In this paper, we present an embedding of a ZUMA-based virtual FPGA fabric into
    a complete configurable system-on-chip. Such an embedding is required to fully
    harness the potential of virtual FPGAs, in particular to give the virtual circuits
    access to main memory and operating system services, and to enable a concurrent
    operation of virtualized and non-virtualized circuitry. We discuss our extension
    to ZUMA and its embedding into the ReconOS operating system for hardware/software
    systems. Furthermore, we present an open source tool flow to synthesize configurations
    for the virtual FPGA, along with an analysis of the area and delay overheads involved.
author:
- first_name: Tobias
  full_name: Wiersema, Tobias
  id: '3118'
  last_name: Wiersema
- first_name: Arne
  full_name: Bockhorn, Arne
  last_name: Bockhorn
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: Wiersema T, Bockhorn A, Platzner M. An Architecture and Design Tool Flow for
    Embedding a Virtual FPGA into a Reconfigurable System-on-Chip. <i>Computers &#38;
    Electrical Engineering</i>. 2016:112--122. doi:<a href="https://doi.org/10.1016/j.compeleceng.2016.04.005">10.1016/j.compeleceng.2016.04.005</a>
  apa: Wiersema, T., Bockhorn, A., &#38; Platzner, M. (2016). An Architecture and
    Design Tool Flow for Embedding a Virtual FPGA into a Reconfigurable System-on-Chip.
    <i>Computers &#38; Electrical Engineering</i>, 112--122. <a href="https://doi.org/10.1016/j.compeleceng.2016.04.005">https://doi.org/10.1016/j.compeleceng.2016.04.005</a>
  bibtex: '@article{Wiersema_Bockhorn_Platzner_2016, title={An Architecture and Design
    Tool Flow for Embedding a Virtual FPGA into a Reconfigurable System-on-Chip},
    DOI={<a href="https://doi.org/10.1016/j.compeleceng.2016.04.005">10.1016/j.compeleceng.2016.04.005</a>},
    journal={Computers &#38; Electrical Engineering}, publisher={Elsevier}, author={Wiersema,
    Tobias and Bockhorn, Arne and Platzner, Marco}, year={2016}, pages={112--122}
    }'
  chicago: Wiersema, Tobias, Arne Bockhorn, and Marco Platzner. “An Architecture and
    Design Tool Flow for Embedding a Virtual FPGA into a Reconfigurable System-on-Chip.”
    <i>Computers &#38; Electrical Engineering</i>, 2016, 112--122. <a href="https://doi.org/10.1016/j.compeleceng.2016.04.005">https://doi.org/10.1016/j.compeleceng.2016.04.005</a>.
  ieee: T. Wiersema, A. Bockhorn, and M. Platzner, “An Architecture and Design Tool
    Flow for Embedding a Virtual FPGA into a Reconfigurable System-on-Chip,” <i>Computers
    &#38; Electrical Engineering</i>, pp. 112--122, 2016.
  mla: Wiersema, Tobias, et al. “An Architecture and Design Tool Flow for Embedding
    a Virtual FPGA into a Reconfigurable System-on-Chip.” <i>Computers &#38; Electrical
    Engineering</i>, Elsevier, 2016, pp. 112--122, doi:<a href="https://doi.org/10.1016/j.compeleceng.2016.04.005">10.1016/j.compeleceng.2016.04.005</a>.
  short: T. Wiersema, A. Bockhorn, M. Platzner, Computers &#38; Electrical Engineering
    (2016) 112--122.
date_created: 2017-10-17T12:41:35Z
date_updated: 2022-01-06T06:55:29Z
ddc:
- '040'
department:
- _id: '78'
doi: 10.1016/j.compeleceng.2016.04.005
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:36:08Z
  date_updated: 2018-03-21T10:36:08Z
  file_id: '1511'
  file_name: 222-1-s2.0-S0045790616300684-main.pdf
  file_size: 931048
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:36:08Z
has_accepted_license: '1'
language:
- iso: eng
page: 112--122
project:
- _id: '1'
  name: SFB 901
- _id: '12'
  name: SFB 901 - Subprojekt B4
- _id: '3'
  name: SFB 901 - Project Area B
publication: Computers & Electrical Engineering
publisher: Elsevier
status: public
title: An Architecture and Design Tool Flow for Embedding a Virtual FPGA into a Reconfigurable
  System-on-Chip
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '224'
abstract:
- lang: eng
  text: In modern software development, paradigms like component-based software engineering
    (CBSE) and service-oriented architectures (SOA) emphasize the construction of
    large software systems out of existing components or services. Therein, a service
    is a self-contained piece of software, which adheres to a specified interface.
    In a model-based software design, this interface constitutes our sole knowledge
    of the service at design time, while service implementations are not available.
    Therefore, correctness checks or detection of potential errors in service compositions
    has to be carried out without the possibility of executing services. This challenges
    the usage of standard software error localization techniques for service compositions.
    In this paper, we review state-of-the-art approaches for error localization of
    software and discuss their applicability to service compositions.
author:
- first_name: Julia
  full_name: Krämer, Julia
  last_name: Krämer
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Krämer J, Wehrheim H. A short survey on using software error localization
    for service compositions. In: <i>Proceedings of the 5th European Conference on
    Service-Oriented and Cloud Computing (ESOCC 2016)</i>. LNCS. ; 2016:248--262.
    doi:<a href="https://doi.org/10.1007/978-3-319-44482-6_16">10.1007/978-3-319-44482-6_16</a>'
  apa: Krämer, J., &#38; Wehrheim, H. (2016). A short survey on using software error
    localization for service compositions. In <i>Proceedings of the 5th European Conference
    on Service-Oriented and Cloud Computing (ESOCC 2016)</i> (pp. 248--262). <a href="https://doi.org/10.1007/978-3-319-44482-6_16">https://doi.org/10.1007/978-3-319-44482-6_16</a>
  bibtex: '@inproceedings{Krämer_Wehrheim_2016, series={LNCS}, title={A short survey
    on using software error localization for service compositions}, DOI={<a href="https://doi.org/10.1007/978-3-319-44482-6_16">10.1007/978-3-319-44482-6_16</a>},
    booktitle={Proceedings of the 5th European Conference on Service-Oriented and
    Cloud Computing (ESOCC 2016)}, author={Krämer, Julia and Wehrheim, Heike}, year={2016},
    pages={248--262}, collection={LNCS} }'
  chicago: Krämer, Julia, and Heike Wehrheim. “A Short Survey on Using Software Error
    Localization for Service Compositions.” In <i>Proceedings of the 5th European
    Conference on Service-Oriented and Cloud Computing (ESOCC 2016)</i>, 248--262.
    LNCS, 2016. <a href="https://doi.org/10.1007/978-3-319-44482-6_16">https://doi.org/10.1007/978-3-319-44482-6_16</a>.
  ieee: J. Krämer and H. Wehrheim, “A short survey on using software error localization
    for service compositions,” in <i>Proceedings of the 5th European Conference on
    Service-Oriented and Cloud Computing (ESOCC 2016)</i>, 2016, pp. 248--262.
  mla: Krämer, Julia, and Heike Wehrheim. “A Short Survey on Using Software Error
    Localization for Service Compositions.” <i>Proceedings of the 5th European Conference
    on Service-Oriented and Cloud Computing (ESOCC 2016)</i>, 2016, pp. 248--262,
    doi:<a href="https://doi.org/10.1007/978-3-319-44482-6_16">10.1007/978-3-319-44482-6_16</a>.
  short: 'J. Krämer, H. Wehrheim, in: Proceedings of the 5th European Conference on
    Service-Oriented and Cloud Computing (ESOCC 2016), 2016, pp. 248--262.'
date_created: 2017-10-17T12:41:35Z
date_updated: 2022-01-06T06:55:32Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-44482-6_16
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:35:04Z
  date_updated: 2018-03-21T10:35:04Z
  file_id: '1509'
  file_name: 224-chp_3A10.1007_2F978-3-319-44482-6_16.pdf
  file_size: 389042
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:35:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 248--262
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 5th European Conference on Service-Oriented and Cloud
  Computing (ESOCC 2016)
series_title: LNCS
status: public
title: A short survey on using software error localization for service compositions
type: conference
user_id: '477'
year: '2016'
...
---
_id: '225'
abstract:
- lang: eng
  text: Image Processing is fundamental for any camera-based vision system. In order
    to automate the prototyping process of image processing solutions to some extend,
    we propose a holistic, adaptive approach that comprises concepts for specification,
    composition, recommendation, execution, and rating of image processing functionality.
    The fundamental idea is to realize image processing applications according to
    Service-oriented Computing design principles. That is, distinct image processing
    functionality is encapsulated in terms of stateless services. Services are then
    used as building blocks for more complex image processing functionality. To automatically
    compose complex image processing functionality, our proposed approach incorporates
    a flexible, Artificial Intelligence planning-based forward search algorithm. Decision-making
    between alternative composition steps is supported by a learning recommendation
    system, which keeps track of valid composition steps by automatically constructing
    a composition grammar. In addition, it adapts to solutions of high quality by
    means of feedback-based Reinforcement Learning techniques. A concrete use case
    serves as proof of concept and demonstrates the feasibility of our holistic, adaptive
    approach.
author:
- first_name: Alexander
  full_name: Jungmann, Alexander
  last_name: Jungmann
- first_name: Bernd
  full_name: Kleinjohann, Bernd
  last_name: Kleinjohann
citation:
  ama: 'Jungmann A, Kleinjohann B. A Holistic and Adaptive Approach for Automated
    Prototyping of Image Processing Functionality. In: <i>Proceedings of the 21st
    IEEE International Conference on Emerging Technologies and Factory Automation
    (ETFA)</i>. ; 2016:1--8. doi:<a href="https://doi.org/10.1109/ETFA.2016.7733522">10.1109/ETFA.2016.7733522</a>'
  apa: Jungmann, A., &#38; Kleinjohann, B. (2016). A Holistic and Adaptive Approach
    for Automated Prototyping of Image Processing Functionality. In <i>Proceedings
    of the 21st IEEE International Conference on Emerging Technologies and Factory
    Automation (ETFA)</i> (pp. 1--8). <a href="https://doi.org/10.1109/ETFA.2016.7733522">https://doi.org/10.1109/ETFA.2016.7733522</a>
  bibtex: '@inproceedings{Jungmann_Kleinjohann_2016, title={A Holistic and Adaptive
    Approach for Automated Prototyping of Image Processing Functionality}, DOI={<a
    href="https://doi.org/10.1109/ETFA.2016.7733522">10.1109/ETFA.2016.7733522</a>},
    booktitle={Proceedings of the 21st IEEE International Conference on Emerging Technologies
    and Factory Automation (ETFA)}, author={Jungmann, Alexander and Kleinjohann, Bernd},
    year={2016}, pages={1--8} }'
  chicago: Jungmann, Alexander, and Bernd Kleinjohann. “A Holistic and Adaptive Approach
    for Automated Prototyping of Image Processing Functionality.” In <i>Proceedings
    of the 21st IEEE International Conference on Emerging Technologies and Factory
    Automation (ETFA)</i>, 1--8, 2016. <a href="https://doi.org/10.1109/ETFA.2016.7733522">https://doi.org/10.1109/ETFA.2016.7733522</a>.
  ieee: A. Jungmann and B. Kleinjohann, “A Holistic and Adaptive Approach for Automated
    Prototyping of Image Processing Functionality,” in <i>Proceedings of the 21st
    IEEE International Conference on Emerging Technologies and Factory Automation
    (ETFA)</i>, 2016, pp. 1--8.
  mla: Jungmann, Alexander, and Bernd Kleinjohann. “A Holistic and Adaptive Approach
    for Automated Prototyping of Image Processing Functionality.” <i>Proceedings of
    the 21st IEEE International Conference on Emerging Technologies and Factory Automation
    (ETFA)</i>, 2016, pp. 1--8, doi:<a href="https://doi.org/10.1109/ETFA.2016.7733522">10.1109/ETFA.2016.7733522</a>.
  short: 'A. Jungmann, B. Kleinjohann, in: Proceedings of the 21st IEEE International
    Conference on Emerging Technologies and Factory Automation (ETFA), 2016, pp. 1--8.'
date_created: 2017-10-17T12:41:35Z
date_updated: 2022-01-06T06:55:34Z
ddc:
- '040'
doi: 10.1109/ETFA.2016.7733522
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:34:35Z
  date_updated: 2018-03-21T10:34:35Z
  file_id: '1508'
  file_name: 225-07733522.pdf
  file_size: 1323587
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:34:35Z
has_accepted_license: '1'
page: 1--8
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 21st IEEE International Conference on Emerging Technologies
  and Factory Automation (ETFA)
status: public
title: A Holistic and Adaptive Approach for Automated Prototyping of Image Processing
  Functionality
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '226'
abstract:
- lang: eng
  text: Error detection, localization and correction are time-intensive tasks in software
    development, but crucial to deliver functionally correct products. Thus, automated
    approaches to these tasks have been intensively studied for standard software
    systems. For model-based software systems, the situation is different. While error
    detection is still well-studied, error localization and correction is a less-studied
    domain. In this paper, we examine error localization and correction for models
    of service compositions. Based on formal definitions of error and correction in
    this context, we show that the classical approach of error localization and correction,
    i.e. first determining a set of suspicious statements and then proposing changes
    to these statements, is ineffective in our context. In fact, it lessens the chance
    to succeed in finding a correction at all.In this paper, we introduce correction
    proposal as a novel approach on error correction in service compositions integrating
    error localization and correction in one combined step. In addition, we provide
    an algorithm to compute such correction proposals automatically.
author:
- first_name: Julia
  full_name: Krämer, Julia
  last_name: Krämer
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Krämer J, Wehrheim H. A Formal Approach to Error Localization and Correction
    in Service Compositions. In: <i>Proceedings of the 1st International Workshop
    on Formal to Practical Software Verification and Composition (VeryComp 2016)</i>.
    LNCS. ; 2016:445--457. doi:<a href="https://doi.org/10.1007/978-3-319-50230-4_35">10.1007/978-3-319-50230-4_35</a>'
  apa: Krämer, J., &#38; Wehrheim, H. (2016). A Formal Approach to Error Localization
    and Correction in Service Compositions. In <i>Proceedings of the 1st International
    Workshop on Formal to Practical Software Verification and Composition (VeryComp
    2016)</i> (pp. 445--457). <a href="https://doi.org/10.1007/978-3-319-50230-4_35">https://doi.org/10.1007/978-3-319-50230-4_35</a>
  bibtex: '@inproceedings{Krämer_Wehrheim_2016, series={LNCS}, title={A Formal Approach
    to Error Localization and Correction in Service Compositions}, DOI={<a href="https://doi.org/10.1007/978-3-319-50230-4_35">10.1007/978-3-319-50230-4_35</a>},
    booktitle={Proceedings of the 1st International Workshop on Formal to Practical
    Software Verification and Composition (VeryComp 2016)}, author={Krämer, Julia
    and Wehrheim, Heike}, year={2016}, pages={445--457}, collection={LNCS} }'
  chicago: Krämer, Julia, and Heike Wehrheim. “A Formal Approach to Error Localization
    and Correction in Service Compositions.” In <i>Proceedings of the 1st International
    Workshop on Formal to Practical Software Verification and Composition (VeryComp
    2016)</i>, 445--457. LNCS, 2016. <a href="https://doi.org/10.1007/978-3-319-50230-4_35">https://doi.org/10.1007/978-3-319-50230-4_35</a>.
  ieee: J. Krämer and H. Wehrheim, “A Formal Approach to Error Localization and Correction
    in Service Compositions,” in <i>Proceedings of the 1st International Workshop
    on Formal to Practical Software Verification and Composition (VeryComp 2016)</i>,
    2016, pp. 445--457.
  mla: Krämer, Julia, and Heike Wehrheim. “A Formal Approach to Error Localization
    and Correction in Service Compositions.” <i>Proceedings of the 1st International
    Workshop on Formal to Practical Software Verification and Composition (VeryComp
    2016)</i>, 2016, pp. 445--457, doi:<a href="https://doi.org/10.1007/978-3-319-50230-4_35">10.1007/978-3-319-50230-4_35</a>.
  short: 'J. Krämer, H. Wehrheim, in: Proceedings of the 1st International Workshop
    on Formal to Practical Software Verification and Composition (VeryComp 2016),
    2016, pp. 445--457.'
date_created: 2017-10-17T12:41:36Z
date_updated: 2022-01-06T06:55:37Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-50230-4_35
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:34:08Z
  date_updated: 2018-03-21T10:34:08Z
  file_id: '1507'
  file_name: 226-chp_3A10.1007_2F978-3-319-50230-4_35.pdf
  file_size: 492018
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:34:08Z
has_accepted_license: '1'
language:
- iso: eng
page: 445--457
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 1st International Workshop on Formal to Practical
  Software Verification and Composition (VeryComp 2016)
series_title: LNCS
status: public
title: A Formal Approach to Error Localization and Correction in Service Compositions
type: conference
user_id: '477'
year: '2016'
...
---
_id: '227'
abstract:
- lang: eng
  text: Information flow analysis studies the flow of data between program entities
    (e.g. variables), where the allowed flow is specified via security policies. Typical
    information flow analyses compute a conservative (over-)approximation of the flows
    in a program. Such an analysis may thus signal non-existing violations of the
    security policy.In this paper, we propose a new technique for inspecting the reported
    violations (counterexamples) for spuriousity. Similar to counterexample-guided-abstraction-refinement
    (CEGAR) in software verification, we use the result of this inspection to improve
    the next round of the analysis. We prove soundness of this scheme.
author:
- first_name: Manuel
  full_name: Töws, Manuel
  id: '11315'
  last_name: Töws
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Töws M, Wehrheim H. A CEGAR Scheme for Information Flow Analysis. In: <i>Proceedings
    of the 18th International Conference on Formal Engineering Methods (ICFEM 2016)</i>.
    LNCS. ; 2016:466--483. doi:<a href="https://doi.org/10.1007/978-3-319-47846-3_29">10.1007/978-3-319-47846-3_29</a>'
  apa: Töws, M., &#38; Wehrheim, H. (2016). A CEGAR Scheme for Information Flow Analysis.
    In <i>Proceedings of the 18th International Conference on Formal Engineering Methods
    (ICFEM 2016)</i> (pp. 466--483). <a href="https://doi.org/10.1007/978-3-319-47846-3_29">https://doi.org/10.1007/978-3-319-47846-3_29</a>
  bibtex: '@inproceedings{Töws_Wehrheim_2016, series={LNCS}, title={A CEGAR Scheme
    for Information Flow Analysis}, DOI={<a href="https://doi.org/10.1007/978-3-319-47846-3_29">10.1007/978-3-319-47846-3_29</a>},
    booktitle={Proceedings of the 18th International Conference on Formal Engineering
    Methods (ICFEM 2016)}, author={Töws, Manuel and Wehrheim, Heike}, year={2016},
    pages={466--483}, collection={LNCS} }'
  chicago: Töws, Manuel, and Heike Wehrheim. “A CEGAR Scheme for Information Flow
    Analysis.” In <i>Proceedings of the 18th International Conference on Formal Engineering
    Methods (ICFEM 2016)</i>, 466--483. LNCS, 2016. <a href="https://doi.org/10.1007/978-3-319-47846-3_29">https://doi.org/10.1007/978-3-319-47846-3_29</a>.
  ieee: M. Töws and H. Wehrheim, “A CEGAR Scheme for Information Flow Analysis,” in
    <i>Proceedings of the 18th International Conference on Formal Engineering Methods
    (ICFEM 2016)</i>, 2016, pp. 466--483.
  mla: Töws, Manuel, and Heike Wehrheim. “A CEGAR Scheme for Information Flow Analysis.”
    <i>Proceedings of the 18th International Conference on Formal Engineering Methods
    (ICFEM 2016)</i>, 2016, pp. 466--483, doi:<a href="https://doi.org/10.1007/978-3-319-47846-3_29">10.1007/978-3-319-47846-3_29</a>.
  short: 'M. Töws, H. Wehrheim, in: Proceedings of the 18th International Conference
    on Formal Engineering Methods (ICFEM 2016), 2016, pp. 466--483.'
date_created: 2017-10-17T12:41:36Z
date_updated: 2022-01-06T06:55:39Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-47846-3_29
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:33:38Z
  date_updated: 2018-03-21T10:33:38Z
  file_id: '1506'
  file_name: 227-chp_3A10.1007_2F978-3-319-47846-3_29.pdf
  file_size: 682849
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:33:38Z
has_accepted_license: '1'
language:
- iso: eng
page: 466--483
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 18th International Conference on Formal Engineering
  Methods (ICFEM 2016)
series_title: LNCS
status: public
title: A CEGAR Scheme for Information Flow Analysis
type: conference
user_id: '477'
year: '2016'
...
---
_id: '217'
abstract:
- lang: eng
  text: Today, cloud vendors host third party black-box services, whose developers
    usually provide only textual descriptions or purely syntactical interface specifications.
    Cloud vendors that give substantial support to other third party developers to
    integrate hosted services into new software solutions would have a unique selling
    feature over their competitors. However, to reliably determine if a service is
    reusable, comprehensive service specifications are needed. Characteristic for
    comprehensive in contrast to syntactical specifications are the formalization
    of ontological and behavioral semantics, homogeneity according to a global ontology,
    and a service grounding that links the abstract service description and its technical
    realization. Homogeneous, semantical specifications enable to reliably identify
    reusable services, whereas the service grounding is needed for the technical service
    integration. In general, comprehensive specifications are not availableand have
    to be derived. Existing automatized approaches are restricted to certain characteristics
    of comprehensiveness. In my PhD, I consider an automatized approach to derive
    fully-fledged comprehensive specifications for black-box services. Ontological
    semantics are derived from syntactical interface specifications. Behavioral semantics
    are mined from call logs that cloud vendors create to monitor the hosted services.
    The specifications are harmonized over a global ontology. The service grounding
    is established using traceability information. The approach enables third party
    developers to compose services into complex systems and creates new sales channels
    for cloud and service providers.
author:
- first_name: Simon
  full_name: Schwichtenberg, Simon
  id: '13235'
  last_name: Schwichtenberg
citation:
  ama: 'Schwichtenberg S. Automatized Derivation of Comprehensive Specifications for
    Black-box Services. In: <i>Proceedings of the 38th International Conference on
    Software Engineering Companion (ICSE)</i>. ; 2016:815-818. doi:<a href="https://doi.org/10.1145/2889160.2889271">10.1145/2889160.2889271</a>'
  apa: Schwichtenberg, S. (2016). Automatized Derivation of Comprehensive Specifications
    for Black-box Services. In <i>Proceedings of the 38th International Conference
    on Software Engineering Companion (ICSE)</i> (pp. 815–818). <a href="https://doi.org/10.1145/2889160.2889271">https://doi.org/10.1145/2889160.2889271</a>
  bibtex: '@inproceedings{Schwichtenberg_2016, title={Automatized Derivation of Comprehensive
    Specifications for Black-box Services}, DOI={<a href="https://doi.org/10.1145/2889160.2889271">10.1145/2889160.2889271</a>},
    booktitle={Proceedings of the 38th International Conference on Software Engineering
    Companion (ICSE)}, author={Schwichtenberg, Simon}, year={2016}, pages={815–818}
    }'
  chicago: Schwichtenberg, Simon. “Automatized Derivation of Comprehensive Specifications
    for Black-Box Services.” In <i>Proceedings of the 38th International Conference
    on Software Engineering Companion (ICSE)</i>, 815–18, 2016. <a href="https://doi.org/10.1145/2889160.2889271">https://doi.org/10.1145/2889160.2889271</a>.
  ieee: S. Schwichtenberg, “Automatized Derivation of Comprehensive Specifications
    for Black-box Services,” in <i>Proceedings of the 38th International Conference
    on Software Engineering Companion (ICSE)</i>, 2016, pp. 815–818.
  mla: Schwichtenberg, Simon. “Automatized Derivation of Comprehensive Specifications
    for Black-Box Services.” <i>Proceedings of the 38th International Conference on
    Software Engineering Companion (ICSE)</i>, 2016, pp. 815–18, doi:<a href="https://doi.org/10.1145/2889160.2889271">10.1145/2889160.2889271</a>.
  short: 'S. Schwichtenberg, in: Proceedings of the 38th International Conference
    on Software Engineering Companion (ICSE), 2016, pp. 815–818.'
date_created: 2017-10-17T12:41:34Z
date_updated: 2022-01-06T06:55:11Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.1145/2889160.2889271
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:39:14Z
  date_updated: 2018-03-21T10:39:14Z
  file_id: '1516'
  file_name: 217-sig-alternate.pdf
  file_size: 691294
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:39:14Z
has_accepted_license: '1'
language:
- iso: eng
page: 815-818
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 38th International Conference on Software Engineering
  Companion (ICSE)
status: public
title: Automatized Derivation of Comprehensive Specifications for Black-box Services
type: conference
user_id: '477'
year: '2016'
...
