---
_id: '89'
abstract:
- lang: eng
text: The vision of OTF Computing is to have the software needs of end users in
the future covered by an automatic composition of existing software services.
Here we focus on natural language software requirements that end users formulate
and submit to OTF providers as requirement specifications. These requirements
serve as the sole foundation for the composition of software; but they can be
inaccurate and incomplete. Up to now, software developers have identified and
corrected these deficits by using a bidirectional consolidation process. However,
this type of quality assurance is no longer included in OTF Computing - the classic
consolidation process is dropped. This is where this work picks up, dealing with
the inaccuracies of freely formulated software design requirements. To do this,
we developed the CORDULA (Compensation of Requirements Descriptions Using Linguistic
Analysis) system that recognizes and compensates for language deficiencies (e.g.,
ambiguity, vagueness and incompleteness) in requirements written by inexperienced
end users. CORDULA supports the search for suitable software services that can
be combined in a composition by transferring requirement specifications into canonical
core functionalities. This dissertation provides the first-ever method for holistically
recording and improving language deficiencies in user-generated requirement specifications
by dealing with ambiguity, incompleteness and vagueness in parallel and in sequence.
author:
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
citation:
ama: Bäumer FS. Indikatorbasierte Erkennung und Kompensation von ungenauen und
unvollständig beschriebenen Softwareanforderungen. Universität Paderborn;
2017. doi:10.17619/UNIPB/1-157
apa: Bäumer, F. S. (2017). Indikatorbasierte Erkennung und Kompensation von ungenauen
und unvollständig beschriebenen Softwareanforderungen. Universität Paderborn.
https://doi.org/10.17619/UNIPB/1-157
bibtex: '@book{Bäumer_2017, title={Indikatorbasierte Erkennung und Kompensation
von ungenauen und unvollständig beschriebenen Softwareanforderungen}, DOI={10.17619/UNIPB/1-157}, publisher={Universität
Paderborn}, author={Bäumer, Frederik Simon}, year={2017} }'
chicago: Bäumer, Frederik Simon. Indikatorbasierte Erkennung und Kompensation
von ungenauen und unvollständig beschriebenen Softwareanforderungen. Universität
Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-157.
ieee: F. S. Bäumer, Indikatorbasierte Erkennung und Kompensation von ungenauen
und unvollständig beschriebenen Softwareanforderungen. Universität Paderborn,
2017.
mla: Bäumer, Frederik Simon. Indikatorbasierte Erkennung und Kompensation von
ungenauen und unvollständig beschriebenen Softwareanforderungen. Universität
Paderborn, 2017, doi:10.17619/UNIPB/1-157.
short: F.S. Bäumer, Indikatorbasierte Erkennung und Kompensation von ungenauen und
unvollständig beschriebenen Softwareanforderungen, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:08Z
date_updated: 2022-01-06T07:04:05Z
department:
- _id: '579'
- _id: '36'
- _id: '1'
doi: 10.17619/UNIPB/1-157
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
supervisor:
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
title: Indikatorbasierte Erkennung und Kompensation von ungenauen und unvollständig
beschriebenen Softwareanforderungen
type: dissertation
user_id: '14931'
year: '2017'
...
---
_id: '97'
abstract:
- lang: eng
text: Bridging the gap between informal, imprecise, and vague user requirements
descriptions and precise formalized specifications is the main task of requirements
engineering. Techniques such as interviews or story telling are used when requirements
engineers try to identify a user's needs. The requirements specification process
is typically done in a dialogue between users, domain experts, and requirements
engineers. In our research, we aim at automating the specification of requirements.
The idea is to distinguish between untrained users and trained users, and to exploit
domain knowledge learned from previous runs of our system. We let untrained users
provide unstructured natural language descriptions, while we allow trained users
to provide examples of behavioral descriptions. In both cases, our goal is to
synthesize formal requirements models similar to statecharts. From requirements
specification processes with trained users, behavioral ontologies are learned
which are later used to support the requirements specification process for untrained
users. Our research method is original in combining natural language processing
and search-based techniques for the synthesis of requirements specifications.
Our work is embedded in a larger project that aims at automating the whole software
development and deployment process in envisioned future software service markets.
author:
- first_name: Lorijn
full_name: van Rooijen, Lorijn
id: '58843'
last_name: van Rooijen
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'van Rooijen L, Bäumer FS, Platenius MC, Geierhos M, Hamann H, Engels G. From
User Demand to Software Service: Using Machine Learning to Automate the Requirements
Specification Process. In: 2017 IEEE 25th International Requirements Engineering
Conference Workshops (REW). Piscataway, NJ, USA: IEEE; 2017:379-385. doi:10.1109/REW.2017.26'
apa: 'van Rooijen, L., Bäumer, F. S., Platenius, M. C., Geierhos, M., Hamann, H.,
& Engels, G. (2017). From User Demand to Software Service: Using Machine Learning
to Automate the Requirements Specification Process. In 2017 IEEE 25th International
Requirements Engineering Conference Workshops (REW) (pp. 379–385). Piscataway,
NJ, USA: IEEE. https://doi.org/10.1109/REW.2017.26'
bibtex: '@inproceedings{van Rooijen_Bäumer_Platenius_Geierhos_Hamann_Engels_2017,
place={Piscataway, NJ, USA}, title={From User Demand to Software Service: Using
Machine Learning to Automate the Requirements Specification Process}, DOI={10.1109/REW.2017.26}, booktitle={2017
IEEE 25th International Requirements Engineering Conference Workshops (REW)},
publisher={IEEE}, author={van Rooijen, Lorijn and Bäumer, Frederik Simon and Platenius,
Marie Christin and Geierhos, Michaela and Hamann, Heiko and Engels, Gregor}, year={2017},
pages={379–385} }'
chicago: 'Rooijen, Lorijn van, Frederik Simon Bäumer, Marie Christin Platenius,
Michaela Geierhos, Heiko Hamann, and Gregor Engels. “From User Demand to Software
Service: Using Machine Learning to Automate the Requirements Specification Process.”
In 2017 IEEE 25th International Requirements Engineering Conference Workshops
(REW), 379–85. Piscataway, NJ, USA: IEEE, 2017. https://doi.org/10.1109/REW.2017.26.'
ieee: 'L. van Rooijen, F. S. Bäumer, M. C. Platenius, M. Geierhos, H. Hamann, and
G. Engels, “From User Demand to Software Service: Using Machine Learning to Automate
the Requirements Specification Process,” in 2017 IEEE 25th International Requirements
Engineering Conference Workshops (REW), Lisbon, Portugal, 2017, pp. 379–385.'
mla: 'van Rooijen, Lorijn, et al. “From User Demand to Software Service: Using Machine
Learning to Automate the Requirements Specification Process.” 2017 IEEE 25th
International Requirements Engineering Conference Workshops (REW), IEEE, 2017,
pp. 379–85, doi:10.1109/REW.2017.26.'
short: 'L. van Rooijen, F.S. Bäumer, M.C. Platenius, M. Geierhos, H. Hamann, G.
Engels, in: 2017 IEEE 25th International Requirements Engineering Conference Workshops
(REW), IEEE, Piscataway, NJ, USA, 2017, pp. 379–385.'
conference:
end_date: 2017-09-08
location: Lisbon, Portugal
name: 2017 IEEE 25th International Requirements Engineering Conference Workshops
(REW)
start_date: 2017-09-04
date_created: 2017-10-17T12:41:10Z
date_updated: 2022-01-06T07:04:18Z
ddc:
- '000'
department:
- _id: '36'
- _id: '1'
- _id: '579'
- _id: '34'
- _id: '7'
- _id: '66'
- _id: '238'
- _id: '63'
doi: 10.1109/REW.2017.26
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:50:35Z
date_updated: 2018-11-02T14:50:35Z
file_id: '5285'
file_name: 08054881.pdf
file_size: 433613
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:50:35Z
has_accepted_license: '1'
keyword:
- Software
- Unified modeling language
- Requirements engineering
- Ontologies
- Search problems
- Natural languages
language:
- iso: eng
page: 379-385
place: Piscataway, NJ, USA
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: 2017 IEEE 25th International Requirements Engineering Conference Workshops
(REW)
publication_identifier:
eisbn:
- '978-1-5386-3488-2 '
isbn:
- 978-1-5386-3489-9
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: 'From User Demand to Software Service: Using Machine Learning to Automate the
Requirements Specification Process'
type: conference
user_id: '57458'
year: '2017'
...
---
_id: '98'
abstract:
- lang: eng
text: Today, modern IT-systems are often an interplay of third-party web services.
Developers in their role as requesters integrate existing services of different
providers into new IT-systems. Providers use frameworks like Open API to create
syntactic service specifications from which requesters generate code to integrate
services. Proper service discovery is crucial to identify usable services in the
growing plethora of third-party services. Most advanced service discovery approaches
rely on semantic specifications, e.g., OWL-S. While semantic specification is
crucial for a precise discovery, syntactical specification is needed for service
invocation. To close the gap between semantic and syntactic specifications, service
grounding establishes links between the semantic and syntactic specifications.
However, for a large number of web services still no semantic specification or
grounding exists. In this paper, we present an approach that semi-automates the
semantic specification of web services for service providers and additionally
helps service requesters to leverage semantic web services. Our approach enables
a higher degree of automation than other approaches. This includes the creation
of semantic specifications and service groundings for service providers as well
as the integration of services for requesters by using our code generator. As
proof-of-concept, we provide a case study, where we derive a sophisticated semantic
OWL-S specification from a syntactic Open API specification.
author:
- first_name: Simon
full_name: Schwichtenberg, Simon
id: '13235'
last_name: Schwichtenberg
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Schwichtenberg S, Gerth C, Engels G. From Open API to Semantic Specifications
and Code Adapters. In: Proceedings of the 24th IEEE International Conference
on Web Services (ICWS). ; 2017:484--491.'
apa: Schwichtenberg, S., Gerth, C., & Engels, G. (2017). From Open API to Semantic
Specifications and Code Adapters. In Proceedings of the 24th IEEE International
Conference on Web Services (ICWS) (pp. 484--491).
bibtex: '@inproceedings{Schwichtenberg_Gerth_Engels_2017, title={From Open API to
Semantic Specifications and Code Adapters}, booktitle={Proceedings of the 24th
IEEE International Conference on Web Services (ICWS)}, author={Schwichtenberg,
Simon and Gerth, Christian and Engels, Gregor}, year={2017}, pages={484--491}
}'
chicago: Schwichtenberg, Simon, Christian Gerth, and Gregor Engels. “From Open API
to Semantic Specifications and Code Adapters.” In Proceedings of the 24th IEEE
International Conference on Web Services (ICWS), 484--491, 2017.
ieee: S. Schwichtenberg, C. Gerth, and G. Engels, “From Open API to Semantic Specifications
and Code Adapters,” in Proceedings of the 24th IEEE International Conference
on Web Services (ICWS), 2017, pp. 484--491.
mla: Schwichtenberg, Simon, et al. “From Open API to Semantic Specifications and
Code Adapters.” Proceedings of the 24th IEEE International Conference on Web
Services (ICWS), 2017, pp. 484--491.
short: 'S. Schwichtenberg, C. Gerth, G. Engels, in: Proceedings of the 24th IEEE
International Conference on Web Services (ICWS), 2017, pp. 484--491.'
date_created: 2017-10-17T12:41:10Z
date_updated: 2022-01-06T07:04:21Z
ddc:
- '000'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-01-11T10:40:48Z
date_updated: 2019-01-11T10:40:48Z
file_id: '6622'
file_name: 08029798.pdf
file_size: 1425640
relation: main_file
success: 1
file_date_updated: 2019-01-11T10:40:48Z
has_accepted_license: '1'
language:
- iso: eng
page: 484--491
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 24th IEEE International Conference on Web Services
(ICWS)
status: public
title: From Open API to Semantic Specifications and Code Adapters
type: conference
user_id: '477'
year: '2017'
...
---
_id: '99'
accept: '1'
author:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wehrheim H. Fault localization in service compositions. In: Proceedings
of the 14th International Conference on Formal Aspects of Component Software (FACS).
LNCS. ; 2017.'
apa: Wehrheim, H. (2017). Fault localization in service compositions. In Proceedings
of the 14th International Conference on Formal Aspects of Component Software (FACS).
bibtex: '@inproceedings{Wehrheim_2017, series={LNCS}, title={Fault localization
in service compositions}, booktitle={Proceedings of the 14th International Conference
on Formal Aspects of Component Software (FACS)}, author={Wehrheim, Heike}, year={2017},
collection={LNCS} }'
chicago: Wehrheim, Heike. “Fault Localization in Service Compositions.” In Proceedings
of the 14th International Conference on Formal Aspects of Component Software (FACS).
LNCS, 2017.
ieee: H. Wehrheim, “Fault localization in service compositions,” in Proceedings
of the 14th International Conference on Formal Aspects of Component Software (FACS),
2017.
mla: Wehrheim, Heike. “Fault Localization in Service Compositions.” Proceedings
of the 14th International Conference on Formal Aspects of Component Software (FACS),
2017.
short: 'H. Wehrheim, in: Proceedings of the 14th International Conference on Formal
Aspects of Component Software (FACS), 2017.'
date_created: 2017-10-17T12:41:10Z
date_updated: 2019-01-03T13:18:56Z
ddc:
- '000'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-11-21T10:51:33Z
date_updated: 2018-11-21T10:51:33Z
file_id: '5784'
file_name: Wehrheim2017_Chapter_FaultLocalizationInServiceComp.pdf
file_size: 536429
open_access: 1
relation: main_file
success: 1
file_date_updated: 2018-11-21T10:51:33Z
language:
- iso: eng
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 14th International Conference on Formal Aspects of
Component Software (FACS)
series_title: LNCS
status: public
title: Fault localization in service compositions
type: conference
user_id: '15504'
year: '2017'
...
---
_id: '5204'
author:
- first_name: Johannes
full_name: Späth, Johannes
last_name: Späth
- first_name: Karim
full_name: Ali, Karim
last_name: Ali
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: 'Späth J, Ali K, Bodden E. IDEal: Efficient and Precise Alias-aware Dataflow
Analysis. In: 2017 International Conference on Object-Oriented Programming,
Languages and Applications (OOPSLA/SPLASH). ACM Press; 2017.'
apa: 'Späth, J., Ali, K., & Bodden, E. (2017). IDEal: Efficient and Precise
Alias-aware Dataflow Analysis. In 2017 International Conference on Object-Oriented
Programming, Languages and Applications (OOPSLA/SPLASH). ACM Press.'
bibtex: '@inproceedings{Späth_Ali_Bodden_2017, title={IDEal: Efficient and Precise
Alias-aware Dataflow Analysis}, booktitle={2017 International Conference on Object-Oriented
Programming, Languages and Applications (OOPSLA/SPLASH)}, publisher={ACM Press},
author={Späth, Johannes and Ali, Karim and Bodden, Eric}, year={2017} }'
chicago: 'Späth, Johannes, Karim Ali, and Eric Bodden. “IDEal: Efficient and Precise
Alias-Aware Dataflow Analysis.” In 2017 International Conference on Object-Oriented
Programming, Languages and Applications (OOPSLA/SPLASH). ACM Press, 2017.'
ieee: 'J. Späth, K. Ali, and E. Bodden, “IDEal: Efficient and Precise Alias-aware
Dataflow Analysis,” in 2017 International Conference on Object-Oriented Programming,
Languages and Applications (OOPSLA/SPLASH), 2017.'
mla: 'Späth, Johannes, et al. “IDEal: Efficient and Precise Alias-Aware Dataflow
Analysis.” 2017 International Conference on Object-Oriented Programming, Languages
and Applications (OOPSLA/SPLASH), ACM Press, 2017.'
short: 'J. Späth, K. Ali, E. Bodden, in: 2017 International Conference on Object-Oriented
Programming, Languages and Applications (OOPSLA/SPLASH), ACM Press, 2017.'
date_created: 2018-10-31T12:46:50Z
date_updated: 2022-01-06T07:01:44Z
ddc:
- '000'
department:
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:28:13Z
date_updated: 2018-11-02T14:28:13Z
file_id: '5273'
file_name: sab17ideal.pdf
file_size: 1021251
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:28:13Z
has_accepted_license: '1'
keyword:
- ATTRACT
- ITSECWEBSITE
- CROSSING
language:
- iso: eng
main_file_link:
- url: ' http://bodden.de/pubs/sab17ideal.pdf'
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: 2017 International Conference on Object-Oriented Programming, Languages
and Applications (OOPSLA/SPLASH)
publisher: ACM Press
status: public
title: 'IDEal: Efficient and Precise Alias-aware Dataflow Analysis'
type: conference
user_id: '477'
year: '2017'
...
---
_id: '5209'
author:
- first_name: Andreas
full_name: Fischer, Andreas
last_name: Fischer
- first_name: Benny
full_name: Fuhry, Benny
last_name: Fuhry
- first_name: Florian
full_name: Kerschbaum, Florian
last_name: Kerschbaum
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: Fischer A, Fuhry B, Kerschbaum F, Bodden E. Computation on Encrypted Data using
Data Flow Authentication. CoRR. 2017;abs/1710.00390.
apa: Fischer, A., Fuhry, B., Kerschbaum, F., & Bodden, E. (2017). Computation
on Encrypted Data using Data Flow Authentication. CoRR, abs/1710.00390.
bibtex: '@article{Fischer_Fuhry_Kerschbaum_Bodden_2017, title={Computation on Encrypted
Data using Data Flow Authentication}, volume={abs/1710.00390}, journal={CoRR},
author={Fischer, Andreas and Fuhry, Benny and Kerschbaum, Florian and Bodden,
Eric}, year={2017} }'
chicago: Fischer, Andreas, Benny Fuhry, Florian Kerschbaum, and Eric Bodden. “Computation
on Encrypted Data Using Data Flow Authentication.” CoRR abs/1710.00390
(2017).
ieee: A. Fischer, B. Fuhry, F. Kerschbaum, and E. Bodden, “Computation on Encrypted
Data using Data Flow Authentication,” CoRR, vol. abs/1710.00390, 2017.
mla: Fischer, Andreas, et al. “Computation on Encrypted Data Using Data Flow Authentication.”
CoRR, vol. abs/1710.00390, 2017.
short: A. Fischer, B. Fuhry, F. Kerschbaum, E. Bodden, CoRR abs/1710.00390 (2017).
date_created: 2018-10-31T13:12:32Z
date_updated: 2022-01-06T07:01:46Z
ddc:
- '000'
department:
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T16:03:01Z
date_updated: 2018-11-02T16:03:01Z
file_id: '5321'
file_name: 1710.00390.pdf
file_size: 2339380
relation: main_file
success: 1
file_date_updated: 2018-11-02T16:03:01Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://arxiv.org/pdf/1710.00390.pdf
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: CoRR
status: public
title: Computation on Encrypted Data using Data Flow Authentication
type: journal_article
user_id: '477'
volume: abs/1710.00390
year: '2017'
...
---
_id: '68'
abstract:
- lang: eng
text: Proof-carrying hardware (PCH) is a principle for achieving safety for dynamically
reconfigurable hardware systems. The producer of a hardware module spends huge
effort when creating a proof for a safety policy. The proof is then transferred
as a certificate together with the configuration bitstream to the consumer of
the hardware module, who can quickly verify the given proof. Previous work utilized
SAT solvers and resolution traces to set up a PCH technology and corresponding
tool flows. In this article, we present a novel technology for PCH based on inductive
invariants. For sequential circuits, our approach is fundamentally stronger than
the previous SAT-based one since we avoid the limitations of bounded unrolling.
We contrast our technology to existing ones and show that it fits into previously
proposed tool flows. We conduct experiments with four categories of benchmark
circuits and report consumer and producer runtime and peak memory consumption,
as well as the size of the certificates and the distribution of the workload between
producer and consumer. Experiments clearly show that our new induction-based technology
is superior for sequential circuits, whereas the previous SAT-based technology
is the better choice for combinational circuits.
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
citation:
ama: Isenberg T, Platzner M, Wehrheim H, Wiersema T. Proof-Carrying Hardware via
Inductive Invariants. ACM Transactions on Design Automation of Electronic Systems.
2017;(4):61:1--61:23. doi:10.1145/3054743
apa: Isenberg, T., Platzner, M., Wehrheim, H., & Wiersema, T. (2017). Proof-Carrying
Hardware via Inductive Invariants. ACM Transactions on Design Automation of
Electronic Systems, (4), 61:1--61:23. https://doi.org/10.1145/3054743
bibtex: '@article{Isenberg_Platzner_Wehrheim_Wiersema_2017, title={Proof-Carrying
Hardware via Inductive Invariants}, DOI={10.1145/3054743},
number={4}, journal={ACM Transactions on Design Automation of Electronic Systems},
publisher={ACM}, author={Isenberg, Tobias and Platzner, Marco and Wehrheim, Heike
and Wiersema, Tobias}, year={2017}, pages={61:1--61:23} }'
chicago: 'Isenberg, Tobias, Marco Platzner, Heike Wehrheim, and Tobias Wiersema.
“Proof-Carrying Hardware via Inductive Invariants.” ACM Transactions on Design
Automation of Electronic Systems, no. 4 (2017): 61:1--61:23. https://doi.org/10.1145/3054743.'
ieee: T. Isenberg, M. Platzner, H. Wehrheim, and T. Wiersema, “Proof-Carrying Hardware
via Inductive Invariants,” ACM Transactions on Design Automation of Electronic
Systems, no. 4, pp. 61:1--61:23, 2017.
mla: Isenberg, Tobias, et al. “Proof-Carrying Hardware via Inductive Invariants.”
ACM Transactions on Design Automation of Electronic Systems, no. 4, ACM,
2017, pp. 61:1--61:23, doi:10.1145/3054743.
short: T. Isenberg, M. Platzner, H. Wehrheim, T. Wiersema, ACM Transactions on Design
Automation of Electronic Systems (2017) 61:1--61:23.
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:20Z
ddc:
- '000'
department:
- _id: '77'
- _id: '78'
doi: 10.1145/3054743
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T16:08:17Z
date_updated: 2018-11-02T16:08:17Z
file_id: '5324'
file_name: a61-isenberg.pdf
file_size: 806356
relation: main_file
success: 1
file_date_updated: 2018-11-02T16:08:17Z
has_accepted_license: '1'
issue: '4'
language:
- iso: eng
page: 61:1--61:23
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: ACM Transactions on Design Automation of Electronic Systems
publisher: ACM
status: public
title: Proof-Carrying Hardware via Inductive Invariants
type: journal_article
user_id: '3118'
year: '2017'
...
---
_id: '685'
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
citation:
ama: Jakobs M-C. On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-104
apa: Jakobs, M.-C. (2017). On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-104
bibtex: '@book{Jakobs_2017, title={On-The-Fly Safety Checking - Customizing Program
Certification and Program Restructuring}, DOI={10.17619/UNIPB/1-104},
publisher={Universität Paderborn}, author={Jakobs, Marie-Christine}, year={2017}
}'
chicago: Jakobs, Marie-Christine. On-The-Fly Safety Checking - Customizing Program
Certification and Program Restructuring. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-104.
ieee: M.-C. Jakobs, On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring. Universität Paderborn, 2017.
mla: Jakobs, Marie-Christine. On-The-Fly Safety Checking - Customizing Program
Certification and Program Restructuring. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-104.
short: M.-C. Jakobs, On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring, Universität Paderborn, 2017.
date_created: 2017-11-13T08:13:29Z
date_updated: 2022-01-06T07:03:22Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.17619/UNIPB/1-104
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T12:26:52Z
date_updated: 2018-03-14T12:26:52Z
file_id: '1211'
file_name: 685-Dissertation-Jakobs.pdf
file_size: 11828624
relation: main_file
success: 1
file_date_updated: 2018-03-14T12:26:52Z
has_accepted_license: '1'
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
id: '573'
last_name: Wehrheim
title: On-The-Fly Safety Checking - Customizing Program Certification and Program
Restructuring
type: dissertation
user_id: '477'
year: '2017'
...
---
_id: '69'
abstract:
- lang: eng
text: 'Today, software is traded worldwide on global markets, with apps being downloaded
to smartphones within minutes or seconds. This poses, more than ever, the challenge
of ensuring safety of software in the face of (1) unknown or untrusted software
providers together with (2) resource-limited software consumers. The concept of
Proof-Carrying Code (PCC), years ago suggested by Necula, provides one framework
for securing the execution of untrusted code. PCC techniques attach safety proofs,
constructed by software producers, to code. Based on the assumption that checking
proofs is usually much simpler than constructing proofs, software consumers should
thus be able to quickly check the safety of software. However, PCC techniques
often suffer from the size of certificates (i.e., the attached proofs), making
PCC techniques inefficient in practice.In this article, we introduce a new framework
for the safe execution of untrusted code called Programs from Proofs (PfP). The
basic assumption underlying the PfP technique is the fact that the structure of
programs significantly influences the complexity of checking a specific safety
property. Instead of attaching proofs to program code, the PfP technique transforms
the program into an efficiently checkable form, thus guaranteeing quick safety
checks for software consumers. For this transformation, the technique also uses
a producer-side automatic proof of safety. More specifically, safety proving for
the software producer proceeds via the construction of an abstract reachability
graph (ARG) unfolding the control-flow automaton (CFA) up to the degree necessary
for simple checking. To this end, we combine different sorts of software analysis:
expensive analyses incrementally determining the degree of unfolding, and cheap
analyses responsible for safety checking. Out of the abstract reachability graph
we generate the new program. In its CFA structure, it is isomorphic to the graph
and hence another, this time consumer-side, cheap analysis can quickly determine
its safety.Like PCC, Programs from Proofs is a general framework instantiable
with different sorts of (expensive and cheap) analysis. Here, we present the general
framework and exemplify it by some concrete examples. We have implemented different
instantiations on top of the configurable program analysis tool CPAchecker and
report on experiments, in particular on comparisons with PCC techniques.'
author:
- 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: 'Jakobs M-C, Wehrheim H. Programs from Proofs: A Framework for the Safe Execution
of Untrusted Software. ACM Transactions on Programming Languages and Systems.
2017;(2):7:1-7:56. doi:10.1145/3014427'
apa: 'Jakobs, M.-C., & Wehrheim, H. (2017). Programs from Proofs: A Framework
for the Safe Execution of Untrusted Software. ACM Transactions on Programming
Languages and Systems, (2), 7:1-7:56. https://doi.org/10.1145/3014427'
bibtex: '@article{Jakobs_Wehrheim_2017, title={Programs from Proofs: A Framework
for the Safe Execution of Untrusted Software}, DOI={10.1145/3014427},
number={2}, journal={ACM Transactions on Programming Languages and Systems}, publisher={ACM},
author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017}, pages={7:1-7:56}
}'
chicago: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs: A
Framework for the Safe Execution of Untrusted Software.” ACM Transactions on
Programming Languages and Systems, no. 2 (2017): 7:1-7:56. https://doi.org/10.1145/3014427.'
ieee: 'M.-C. Jakobs and H. Wehrheim, “Programs from Proofs: A Framework for the
Safe Execution of Untrusted Software,” ACM Transactions on Programming Languages
and Systems, no. 2, pp. 7:1-7:56, 2017.'
mla: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs: A Framework
for the Safe Execution of Untrusted Software.” ACM Transactions on Programming
Languages and Systems, no. 2, ACM, 2017, pp. 7:1-7:56, doi:10.1145/3014427.'
short: M.-C. Jakobs, H. Wehrheim, ACM Transactions on Programming Languages and
Systems (2017) 7:1-7:56.
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:23Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1145/3014427
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:15:09Z
date_updated: 2018-03-21T13:15:09Z
file_id: '1575'
file_name: 69-a7-jakobs.pdf
file_size: 1215139
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:15:09Z
has_accepted_license: '1'
issue: '2'
language:
- iso: eng
page: 7:1-7:56
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: ACM Transactions on Programming Languages and Systems
publisher: ACM
status: public
title: 'Programs from Proofs: A Framework for the Safe Execution of Untrusted Software'
type: journal_article
user_id: '477'
year: '2017'
...
---
_id: '106'
author:
- first_name: Isabel
full_name: Krammer, Isabel
last_name: Krammer
citation:
ama: 'Krammer I. Denn wir wissen, was gemeint ist: Erweiterung bestehender Lösungen
zur lexikalischen Disambiguierung durch einen kontextsensitiven Whitelist-Ansatz.
Universität München; 2017.'
apa: 'Krammer, I. (2017). Denn wir wissen, was gemeint ist: Erweiterung bestehender
Lösungen zur lexikalischen Disambiguierung durch einen kontextsensitiven Whitelist-Ansatz.
Universität München.'
bibtex: '@book{Krammer_2017, title={Denn wir wissen, was gemeint ist: Erweiterung
bestehender Lösungen zur lexikalischen Disambiguierung durch einen kontextsensitiven
Whitelist-Ansatz}, publisher={Universität München}, author={Krammer, Isabel},
year={2017} }'
chicago: 'Krammer, Isabel. Denn wir wissen, was gemeint ist: Erweiterung bestehender
Lösungen zur lexikalischen Disambiguierung durch einen kontextsensitiven Whitelist-Ansatz.
Universität München, 2017.'
ieee: 'I. Krammer, Denn wir wissen, was gemeint ist: Erweiterung bestehender
Lösungen zur lexikalischen Disambiguierung durch einen kontextsensitiven Whitelist-Ansatz.
Universität München, 2017.'
mla: 'Krammer, Isabel. Denn wir wissen, was gemeint ist: Erweiterung bestehender
Lösungen zur lexikalischen Disambiguierung durch einen kontextsensitiven Whitelist-Ansatz.
Universität München, 2017.'
short: 'I. Krammer, Denn wir wissen, was gemeint ist: Erweiterung bestehender Lösungen
zur lexikalischen Disambiguierung durch einen kontextsensitiven Whitelist-Ansatz,
Universität München, 2017.'
date_created: 2017-10-17T12:41:12Z
date_updated: 2022-01-06T06:50:46Z
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 München
status: public
title: 'Denn wir wissen, was gemeint ist: Erweiterung bestehender Lösungen zur lexikalischen
Disambiguierung durch einen kontextsensitiven Whitelist-Ansatz'
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '109'
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
citation:
ama: Pauck F. Cooperative Static Analysis of Android Applications. Universität
Paderborn; 2017.
apa: Pauck, F. (2017). Cooperative static analysis of Android applications.
Universität Paderborn.
bibtex: '@book{Pauck_2017, title={Cooperative static analysis of Android applications},
publisher={Universität Paderborn}, author={Pauck, Felix}, year={2017} }'
chicago: Pauck, Felix. Cooperative Static Analysis of Android Applications.
Universität Paderborn, 2017.
ieee: F. Pauck, Cooperative static analysis of Android applications. Universität
Paderborn, 2017.
mla: Pauck, Felix. Cooperative Static Analysis of Android Applications. Universität
Paderborn, 2017.
short: F. Pauck, Cooperative Static Analysis of Android Applications, Universität
Paderborn, 2017.
date_created: 2017-10-17T12:41:12Z
date_updated: 2022-01-06T06:50:52Z
ddc:
- '000'
department:
- _id: '77'
file:
- access_level: open_access
content_type: application/pdf
creator: fpauck
date_created: 2019-08-07T08:55:58Z
date_updated: 2019-08-07T09:03:48Z
file_id: '12905'
file_name: fpauck_2017.pdf
file_size: 5093611
relation: main_file
title: Master's Thesis
file_date_updated: 2019-08-07T09:03:48Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
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
id: '573'
last_name: Wehrheim
title: Cooperative static analysis of Android applications
type: mastersthesis
user_id: '22398'
year: '2017'
...
---
_id: '1098'
abstract:
- lang: eng
text: An end user generally writes down software requirements in ambiguous expressions
using natural language; hence, a software developer attuned to programming language
finds it difficult to understand th meaning of the requirements. To solve this
problem we define semantic categories for disambiguation and classify/annotate
the requirement into the categories by using machine-learning models. We extensively
use a language frame closely related to such categories for designing features
to overcome the problem of insufficient training data compare to the large number
of classes. Our proposed model obtained a micro-average F1-score of 0.75, outperforming
the previous model, REaCT.
article_type: original
author:
- first_name: Yeong-Su
full_name: Kim, Yeong-Su
last_name: Kim
- first_name: 'Seung-Woo '
full_name: 'Lee, Seung-Woo '
last_name: Lee
- 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: Kim Y-S, Lee S-W, Dollmann M, Geierhos M. Semantic Annotation of Software Requirements
with Language Frame. International Journal of Software Engineering for Smart
Device. 2017;4(2):1-6.
apa: Kim, Y.-S., Lee, S.-W., Dollmann, M., & Geierhos, M. (2017). Semantic Annotation
of Software Requirements with Language Frame. International Journal of Software
Engineering for Smart Device, 4(2), 1–6.
bibtex: '@article{Kim_Lee_Dollmann_Geierhos_2017, title={Semantic Annotation of
Software Requirements with Language Frame}, volume={4}, number={2}, journal={International
Journal of Software Engineering for Smart Device}, publisher={Global Vision School
Publication}, author={Kim, Yeong-Su and Lee, Seung-Woo and Dollmann, Markus and
Geierhos, Michaela}, year={2017}, pages={1–6} }'
chicago: 'Kim, Yeong-Su, Seung-Woo Lee, Markus Dollmann, and Michaela Geierhos.
“Semantic Annotation of Software Requirements with Language Frame.” International
Journal of Software Engineering for Smart Device 4, no. 2 (2017): 1–6.'
ieee: Y.-S. Kim, S.-W. Lee, M. Dollmann, and M. Geierhos, “Semantic Annotation of
Software Requirements with Language Frame,” International Journal of Software
Engineering for Smart Device, vol. 4, no. 2, pp. 1–6, 2017.
mla: Kim, Yeong-Su, et al. “Semantic Annotation of Software Requirements with Language
Frame.” International Journal of Software Engineering for Smart Device,
vol. 4, no. 2, Global Vision School Publication, 2017, pp. 1–6.
short: Y.-S. Kim, S.-W. Lee, M. Dollmann, M. Geierhos, International Journal of
Software Engineering for Smart Device 4 (2017) 1–6.
date_created: 2018-01-25T15:23:15Z
date_updated: 2022-01-06T06:50:55Z
ddc:
- '000'
department:
- _id: '36'
- _id: '1'
- _id: '579'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-12-12T15:30:59Z
date_updated: 2018-12-12T15:30:59Z
file_id: '6196'
file_name: Semantic_Annotation_of_Software_Requirements.pdf
file_size: 244655
relation: main_file
success: 1
file_date_updated: 2018-12-12T15:30:59Z
has_accepted_license: '1'
intvolume: ' 4'
issue: '2'
keyword:
- Natural Language Processing
- Semantic Annotation
- Machine Learning
language:
- iso: eng
page: 1-6
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: International Journal of Software Engineering for Smart Device
publication_identifier:
issn:
- 2205-8494
publication_status: published
publisher: Global Vision School Publication
quality_controlled: '1'
status: public
title: Semantic Annotation of Software Requirements with Language Frame
type: journal_article
user_id: '477'
volume: 4
year: '2017'
...
---
_id: '1180'
abstract:
- lang: eng
text: These days, there is a strong rise in the needs for machine learning applications,
requiring an automation of machine learning engineering which is referred to as
AutoML. In AutoML the selection, composition and parametrization of machine learning
algorithms is automated and tailored to a specific problem, resulting in a machine
learning pipeline. Current approaches reduce the AutoML problem to optimization
of hyperparameters. Based on recursive task networks, in this paper we present
one approach from the field of automated planning and one evolutionary optimization
approach. Instead of simply parametrizing a given pipeline, this allows for structure
optimization of machine learning pipelines, as well. We evaluate the two approaches
in an extensive evaluation, finding both approaches to have their strengths in
different areas. Moreover, the two approaches outperform the state-of-the-art
tool Auto-WEKA in many settings.
author:
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Wever MD, Mohr F, Hüllermeier E. Automatic Machine Learning: Hierachical Planning
Versus Evolutionary Optimization. In: 27th Workshop Computational Intelligence.
Dortmund; 2017.'
apa: 'Wever, M. D., Mohr, F., & Hüllermeier, E. (2017). Automatic Machine Learning:
Hierachical Planning Versus Evolutionary Optimization. In 27th Workshop Computational
Intelligence. Dortmund.'
bibtex: '@inproceedings{Wever_Mohr_Hüllermeier_2017, place={Dortmund}, title={Automatic
Machine Learning: Hierachical Planning Versus Evolutionary Optimization}, booktitle={27th
Workshop Computational Intelligence}, author={Wever, Marcel Dominik and Mohr,
Felix and Hüllermeier, Eyke}, year={2017} }'
chicago: 'Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Automatic Machine
Learning: Hierachical Planning Versus Evolutionary Optimization.” In 27th Workshop
Computational Intelligence. Dortmund, 2017.'
ieee: 'M. D. Wever, F. Mohr, and E. Hüllermeier, “Automatic Machine Learning: Hierachical
Planning Versus Evolutionary Optimization,” in 27th Workshop Computational
Intelligence, Dortmund, 2017.'
mla: 'Wever, Marcel Dominik, et al. “Automatic Machine Learning: Hierachical Planning
Versus Evolutionary Optimization.” 27th Workshop Computational Intelligence,
2017.'
short: 'M.D. Wever, F. Mohr, E. Hüllermeier, in: 27th Workshop Computational Intelligence,
Dortmund, 2017.'
conference:
end_date: 2017-11-24
location: Dortmund
name: 27th Workshop Computational Intelligence
start_date: 2017-11-23
date_created: 2018-02-22T07:19:18Z
date_updated: 2022-01-06T06:51:09Z
ddc:
- '000'
department:
- _id: '355'
file:
- access_level: closed
content_type: application/pdf
creator: wever
date_created: 2018-11-06T15:28:09Z
date_updated: 2018-11-06T15:28:09Z
file_id: '5387'
file_name: CI Workshop AutoML.pdf
file_size: 323589
relation: main_file
success: 1
file_date_updated: 2018-11-06T15:28:09Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://publikationen.bibliothek.kit.edu/1000074341/4643874
oa: '1'
place: Dortmund
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publication: 27th Workshop Computational Intelligence
publication_status: published
status: public
title: 'Automatic Machine Learning: Hierachical Planning Versus Evolutionary Optimization'
type: conference
user_id: '49109'
year: '2017'
...
---
_id: '119'
author:
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
citation:
ama: Wever MD. Active Learning of User Requirement Specifications in Dynamic
Software Service Markets. Universität Paderborn; 2017.
apa: Wever, M. D. (2017). Active Learning of User Requirement Specifications
in Dynamic Software Service Markets. Universität Paderborn.
bibtex: '@book{Wever_2017, title={Active Learning of User Requirement Specifications
in Dynamic Software Service Markets}, publisher={Universität Paderborn}, author={Wever,
Marcel Dominik}, year={2017} }'
chicago: Wever, Marcel Dominik. Active Learning of User Requirement Specifications
in Dynamic Software Service Markets. Universität Paderborn, 2017.
ieee: M. D. Wever, Active Learning of User Requirement Specifications in Dynamic
Software Service Markets. Universität Paderborn, 2017.
mla: Wever, Marcel Dominik. Active Learning of User Requirement Specifications
in Dynamic Software Service Markets. Universität Paderborn, 2017.
short: M.D. Wever, Active Learning of User Requirement Specifications in Dynamic
Software Service Markets, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:14Z
date_updated: 2022-01-06T06:51:12Z
ddc:
- '000'
file:
- access_level: open_access
content_type: application/pdf
creator: wever
date_created: 2018-11-06T15:31:48Z
date_updated: 2020-07-16T11:53:45Z
file_id: '5388'
file_name: MT-export-2017-03-17.pdf
file_size: 4012186
relation: main_file
file_date_updated: 2020-07-16T11:53:45Z
has_accepted_license: '1'
language:
- iso: eng
oa: '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
title: Active Learning of User Requirement Specifications in Dynamic Software Service
Markets
type: mastersthesis
user_id: '33176'
year: '2017'
...
---
_id: '120'
abstract:
- lang: eng
text: 'Within software engineering, requirements engineering starts from imprecise
and vague user requirements descriptions and infers precise, formalized specifications.
Techniques, such as interviewing by requirements engineers, are typically applied
to identify the user’s needs. We want to partially automate even this first step
of requirements elicitation by methods of evolutionary computation. The idea is
to enable users to specify their desired software by listing examples of behavioral
descriptions. Users initially specify two lists of operation sequences, one with
desired behaviors and one with forbidden behaviors. Then, we search for the appropriate
formal software specification in the form of a deterministic finite automaton.
We solve this problem known as grammatical inference with an active coevolutionary
approach following Bongard and Lipson [2]. The coevolutionary process alternates
between two phases: (A) additional training data is actively proposed by an evolutionary
process and the user is interactively asked to label it; (B) appropriate automata
are then evolved to solve this extended grammatical inference problem. Our approach
leverages multi-objective evolution in both phases and outperforms the state-of-the-art
technique [2] for input alphabet sizes of three and more, which are relevant to
our problem domain of requirements specification.'
author:
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Lorijn
full_name: van Rooijen, Lorijn
id: '58843'
last_name: van Rooijen
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: 'Wever MD, van Rooijen L, Hamann H. Active Coevolutionary Learning of Requirements
Specifications from Examples. In: Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO). ; 2017:1327--1334. doi:10.1145/3071178.3071258'
apa: Wever, M. D., van Rooijen, L., & Hamann, H. (2017). Active Coevolutionary
Learning of Requirements Specifications from Examples. In Proceedings of the
Genetic and Evolutionary Computation Conference (GECCO) (pp. 1327--1334).
https://doi.org/10.1145/3071178.3071258
bibtex: '@inproceedings{Wever_van Rooijen_Hamann_2017, title={Active Coevolutionary
Learning of Requirements Specifications from Examples}, DOI={10.1145/3071178.3071258},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference
(GECCO)}, author={Wever, Marcel Dominik and van Rooijen, Lorijn and Hamann, Heiko},
year={2017}, pages={1327--1334} }'
chicago: Wever, Marcel Dominik, Lorijn van Rooijen, and Heiko Hamann. “Active Coevolutionary
Learning of Requirements Specifications from Examples.” In Proceedings of the
Genetic and Evolutionary Computation Conference (GECCO), 1327--1334, 2017.
https://doi.org/10.1145/3071178.3071258.
ieee: M. D. Wever, L. van Rooijen, and H. Hamann, “Active Coevolutionary Learning
of Requirements Specifications from Examples,” in Proceedings of the Genetic
and Evolutionary Computation Conference (GECCO), 2017, pp. 1327--1334.
mla: Wever, Marcel Dominik, et al. “Active Coevolutionary Learning of Requirements
Specifications from Examples.” Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO), 2017, pp. 1327--1334, doi:10.1145/3071178.3071258.
short: 'M.D. Wever, L. van Rooijen, H. Hamann, in: Proceedings of the Genetic and
Evolutionary Computation Conference (GECCO), 2017, pp. 1327--1334.'
date_created: 2017-10-17T12:41:15Z
date_updated: 2022-01-06T06:51:15Z
ddc:
- '000'
department:
- _id: '66'
doi: 10.1145/3071178.3071258
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:00:35Z
date_updated: 2018-11-02T15:00:35Z
file_id: '5290'
file_name: p1327-wever.pdf
file_size: 1092021
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:00:35Z
has_accepted_license: '1'
language:
- iso: eng
page: 1327--1334
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subproject B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO)
status: public
title: Active Coevolutionary Learning of Requirements Specifications from Examples
type: conference
user_id: '477'
year: '2017'
...
---
_id: '100'
author:
- first_name: Albin
full_name: Sergio Djoum Temdjim, Albin
last_name: Sergio Djoum Temdjim
citation:
ama: Sergio Djoum Temdjim A. Evaluation of Software Reputation Matching Based
on App Reviews. Universität Paderborn; 2017.
apa: Sergio Djoum Temdjim, A. (2017). Evaluation of Software Reputation Matching
Based on App Reviews. Universität Paderborn.
bibtex: '@book{Sergio Djoum Temdjim_2017, title={Evaluation of Software Reputation
Matching Based on App Reviews}, publisher={Universität Paderborn}, author={Sergio
Djoum Temdjim, Albin}, year={2017} }'
chicago: Sergio Djoum Temdjim, Albin. Evaluation of Software Reputation Matching
Based on App Reviews. Universität Paderborn, 2017.
ieee: A. Sergio Djoum Temdjim, Evaluation of Software Reputation Matching Based
on App Reviews. Universität Paderborn, 2017.
mla: Sergio Djoum Temdjim, Albin. Evaluation of Software Reputation Matching
Based on App Reviews. Universität Paderborn, 2017.
short: A. Sergio Djoum Temdjim, Evaluation of Software Reputation Matching Based
on App Reviews, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:11Z
date_updated: 2022-01-06T06:50:21Z
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: Evaluation of Software Reputation Matching Based on App Reviews
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '101'
author:
- first_name: Lennart
full_name: Rehmer, Lennart
last_name: Rehmer
citation:
ama: Rehmer L. Erweiterung eines kontextsensitiven Autovervollständigungstools
zur natürlichsprachlichen Softwarespezifikation. Universität Paderborn; 2017.
apa: Rehmer, L. (2017). Erweiterung eines kontextsensitiven Autovervollständigungstools
zur natürlichsprachlichen Softwarespezifikation. Universität Paderborn.
bibtex: '@book{Rehmer_2017, title={Erweiterung eines kontextsensitiven Autovervollständigungstools
zur natürlichsprachlichen Softwarespezifikation}, publisher={Universität Paderborn},
author={Rehmer, Lennart}, year={2017} }'
chicago: Rehmer, Lennart. Erweiterung eines kontextsensitiven Autovervollständigungstools
zur natürlichsprachlichen Softwarespezifikation. Universität Paderborn, 2017.
ieee: L. Rehmer, Erweiterung eines kontextsensitiven Autovervollständigungstools
zur natürlichsprachlichen Softwarespezifikation. Universität Paderborn, 2017.
mla: Rehmer, Lennart. Erweiterung eines kontextsensitiven Autovervollständigungstools
zur natürlichsprachlichen Softwarespezifikation. Universität Paderborn, 2017.
short: L. Rehmer, Erweiterung eines kontextsensitiven Autovervollständigungstools
zur natürlichsprachlichen Softwarespezifikation, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:11Z
date_updated: 2022-01-06T06:50:29Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publisher: Universität Paderborn
status: public
title: Erweiterung eines kontextsensitiven Autovervollständigungstools zur natürlichsprachlichen
Softwarespezifikation
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '102'
author:
- first_name: Matthias
full_name: Becker, Matthias
last_name: Becker
citation:
ama: Becker M. Engineering Self-Adaptive Systems with Simulation-Based Performence
Prediction. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-133
apa: Becker, M. (2017). Engineering Self-Adaptive Systems with Simulation-Based
Performence Prediction. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-133
bibtex: '@book{Becker_2017, title={Engineering Self-Adaptive Systems with Simulation-Based
Performence Prediction}, DOI={10.17619/UNIPB/1-133},
publisher={Universität Paderborn}, author={Becker, Matthias}, year={2017} }'
chicago: Becker, Matthias. Engineering Self-Adaptive Systems with Simulation-Based
Performence Prediction. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-133.
ieee: M. Becker, Engineering Self-Adaptive Systems with Simulation-Based Performence
Prediction. Universität Paderborn, 2017.
mla: Becker, Matthias. Engineering Self-Adaptive Systems with Simulation-Based
Performence Prediction. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-133.
short: M. Becker, Engineering Self-Adaptive Systems with Simulation-Based Performence
Prediction, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:11Z
date_updated: 2022-01-06T06:50:31Z
department:
- _id: '76'
doi: 10.17619/UNIPB/1-133
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
title: Engineering Self-Adaptive Systems with Simulation-Based Performence Prediction
type: dissertation
user_id: '477'
year: '2017'
...
---
_id: '195'
author:
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
citation:
ama: Platenius MC. Fuzzy Matching of Comprehensive Service Specifications.
Universität Paderborn; 2016.
apa: Platenius, M. C. (2016). Fuzzy Matching of Comprehensive Service Specifications.
Universität Paderborn.
bibtex: '@book{Platenius_2016, title={Fuzzy Matching of Comprehensive Service Specifications},
publisher={Universität Paderborn}, author={Platenius, Marie Christin}, year={2016}
}'
chicago: Platenius, Marie Christin. Fuzzy Matching of Comprehensive Service Specifications.
Universität Paderborn, 2016.
ieee: M. C. Platenius, Fuzzy Matching of Comprehensive Service Specifications.
Universität Paderborn, 2016.
mla: Platenius, Marie Christin. Fuzzy Matching of Comprehensive Service Specifications.
Universität Paderborn, 2016.
short: M.C. Platenius, Fuzzy Matching of Comprehensive Service Specifications, Universität
Paderborn, 2016.
date_created: 2017-10-17T12:41:30Z
date_updated: 2022-01-06T06:54:06Z
ddc:
- '040'
department:
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:15:58Z
date_updated: 2018-03-21T12:15:58Z
file_id: '1527'
file_name: 195-Dissertation_-_Marie_Christin_Platenius.pdf
file_size: 18246710
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:15:58Z
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: Fuzzy Matching of Comprehensive Service Specifications
type: dissertation
user_id: '14052'
year: '2016'
...
---
_id: '197'
author:
- first_name: Markus
full_name: Dollmann, Markus
id: '27578'
last_name: Dollmann
citation:
ama: 'Dollmann M. Frag die Anwender: Extraktion und Klassifikation von funktionalen
Softwareanforderungen aus User-Generated-Content. Universität Paderborn; 2016.'
apa: 'Dollmann, M. (2016). Frag die Anwender: Extraktion und Klassifikation von
funktionalen Softwareanforderungen aus User-Generated-Content. Universität
Paderborn.'
bibtex: '@book{Dollmann_2016, title={Frag die Anwender: Extraktion und Klassifikation
von funktionalen Softwareanforderungen aus User-Generated-Content}, publisher={Universität
Paderborn}, author={Dollmann, Markus}, year={2016} }'
chicago: 'Dollmann, Markus. Frag die Anwender: Extraktion und Klassifikation
von funktionalen Softwareanforderungen aus User-Generated-Content. Universität
Paderborn, 2016.'
ieee: 'M. Dollmann, Frag die Anwender: Extraktion und Klassifikation von funktionalen
Softwareanforderungen aus User-Generated-Content. Universität Paderborn, 2016.'
mla: 'Dollmann, Markus. Frag die Anwender: Extraktion und Klassifikation von
funktionalen Softwareanforderungen aus User-Generated-Content. Universität
Paderborn, 2016.'
short: 'M. Dollmann, Frag die Anwender: Extraktion und Klassifikation von funktionalen
Softwareanforderungen aus User-Generated-Content, Universität Paderborn, 2016.'
date_created: 2017-10-17T12:41:30Z
date_updated: 2022-01-06T06:54: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: 'Frag die Anwender: Extraktion und Klassifikation von funktionalen Softwareanforderungen
aus User-Generated-Content'
type: mastersthesis
user_id: '477'
year: '2016'
...