---
_id: '7628'
author:
- first_name: Nils
full_name: Selbach, Nils
last_name: Selbach
citation:
ama: Selbach N. Modeling Crypto API Usages in OpenSSL’s EVP Library. Universität
Paderborn; 2019.
apa: Selbach, N. (2019). Modeling Crypto API usages in OpenSSL’s EVP library.
Universität Paderborn.
bibtex: '@book{Selbach_2019, title={Modeling Crypto API usages in OpenSSL’s EVP
library}, publisher={Universität Paderborn}, author={Selbach, Nils}, year={2019}
}'
chicago: Selbach, Nils. Modeling Crypto API Usages in OpenSSL’s EVP Library.
Universität Paderborn, 2019.
ieee: N. Selbach, Modeling Crypto API usages in OpenSSL’s EVP library. Universität
Paderborn, 2019.
mla: Selbach, Nils. Modeling Crypto API Usages in OpenSSL’s EVP Library.
Universität Paderborn, 2019.
short: N. Selbach, Modeling Crypto API Usages in OpenSSL’s EVP Library, Universität
Paderborn, 2019.
date_created: 2019-02-12T07:28:12Z
date_updated: 2022-01-06T07:03:41Z
department:
- _id: '76'
language:
- iso: eng
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Philipp
full_name: Schubert, Philipp
id: '60543'
last_name: Schubert
orcid: 0000-0002-8674-1859
title: Modeling Crypto API usages in OpenSSL's EVP library
type: bachelorsthesis
user_id: '477'
year: '2019'
...
---
_id: '7635'
author:
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Sharma A, Wehrheim H. Testing Machine Learning Algorithms for Balanced Data
Usage. In: IEEE International Conference on Software Testing, Verification
and Validation (ICST). Xi’an, China: IEEE; 2019:125--135.'
apa: 'Sharma, A., & Wehrheim, H. (2019). Testing Machine Learning Algorithms
for Balanced Data Usage. In IEEE International Conference on Software Testing,
Verification and Validation (ICST) (pp. 125--135). Xi’an, China: IEEE.'
bibtex: '@inproceedings{Sharma_Wehrheim_2019, place={Xi’an, China}, title={Testing
Machine Learning Algorithms for Balanced Data Usage}, booktitle={IEEE International
Conference on Software Testing, Verification and Validation (ICST)}, publisher={IEEE},
author={Sharma, Arnab and Wehrheim, Heike}, year={2019}, pages={125--135} }'
chicago: 'Sharma, Arnab, and Heike Wehrheim. “Testing Machine Learning Algorithms
for Balanced Data Usage.” In IEEE International Conference on Software Testing,
Verification and Validation (ICST), 125--135. Xi’an, China: IEEE, 2019.'
ieee: A. Sharma and H. Wehrheim, “Testing Machine Learning Algorithms for Balanced
Data Usage,” in IEEE International Conference on Software Testing, Verification
and Validation (ICST), Xi’an, China, April, 2019, 2019, pp. 125--135.
mla: Sharma, Arnab, and Heike Wehrheim. “Testing Machine Learning Algorithms for
Balanced Data Usage.” IEEE International Conference on Software Testing, Verification
and Validation (ICST), IEEE, 2019, pp. 125--135.
short: 'A. Sharma, H. Wehrheim, in: IEEE International Conference on Software Testing,
Verification and Validation (ICST), IEEE, Xi’an, China, 2019, pp. 125--135.'
conference:
end_date: 2019-04-27
location: Xi'an, China, April, 2019
name: IEEE International Conference on Software Testing, Verification and Validation
(ICST)
start_date: 2019-04-22
date_created: 2019-02-12T12:31:57Z
date_updated: 2022-01-06T07:03:42Z
ddc:
- '004'
department:
- _id: '34'
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T10:56:34Z
date_updated: 2019-08-26T10:56:34Z
file_id: '12960'
file_name: 08730187.pdf
file_size: 266375
relation: main_file
success: 1
file_date_updated: 2019-08-26T10:56:34Z
has_accepted_license: '1'
language:
- iso: eng
page: 125--135
place: Xi'an, China
project:
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '1'
name: SFB 901
publication: IEEE International Conference on Software Testing, Verification and Validation
(ICST)
publication_status: published
publisher: IEEE
status: public
title: Testing Machine Learning Algorithms for Balanced Data Usage
type: conference
user_id: '29719'
year: '2019'
...
---
_id: '8424'
abstract:
- lang: eng
text: 'The vision of On-the-Fly (OTF) Computing is to compose and provide software
services ad hoc, based on requirement descriptions in natural language. Since
non-technical users write their software requirements themselves and in unrestricted
natural language, deficits occur such as inaccuracy and incompleteness. These
deficits are usually met by natural language processing methods, which have to
face special challenges in OTF Computing because maximum automation is the goal.
In this paper, we present current automatic approaches for solving inaccuracies
and incompletenesses in natural language requirement descriptions and elaborate
open challenges. In particular, we will discuss the necessity of domain-specific
resources and show why, despite far-reaching automation, an intelligent and guided
integration of end users into the compensation process is required. In this context,
we present our idea of a chat bot that integrates users into the compensation
process depending on the given circumstances. '
article_number: '22'
article_type: original
author:
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
- first_name: Joschka
full_name: Kersting, Joschka
id: '58701'
last_name: Kersting
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
citation:
ama: 'Bäumer FS, Kersting J, Geierhos M. Natural Language Processing in OTF Computing:
Challenges and the Need for Interactive Approaches. Computers. 2019;8(1).
doi:10.3390/computers8010022'
apa: 'Bäumer, F. S., Kersting, J., & Geierhos, M. (2019). Natural Language Processing
in OTF Computing: Challenges and the Need for Interactive Approaches. Computers,
8(1). https://doi.org/10.3390/computers8010022'
bibtex: '@article{Bäumer_Kersting_Geierhos_2019, title={Natural Language Processing
in OTF Computing: Challenges and the Need for Interactive Approaches}, volume={8},
DOI={10.3390/computers8010022},
number={122}, journal={Computers}, publisher={MDPI AG, Basel, Switzerland}, author={Bäumer,
Frederik Simon and Kersting, Joschka and Geierhos, Michaela}, year={2019} }'
chicago: 'Bäumer, Frederik Simon, Joschka Kersting, and Michaela Geierhos. “Natural
Language Processing in OTF Computing: Challenges and the Need for Interactive
Approaches.” Computers 8, no. 1 (2019). https://doi.org/10.3390/computers8010022.'
ieee: 'F. S. Bäumer, J. Kersting, and M. Geierhos, “Natural Language Processing
in OTF Computing: Challenges and the Need for Interactive Approaches,” Computers,
vol. 8, no. 1, 2019.'
mla: 'Bäumer, Frederik Simon, et al. “Natural Language Processing in OTF Computing:
Challenges and the Need for Interactive Approaches.” Computers, vol. 8,
no. 1, 22, MDPI AG, Basel, Switzerland, 2019, doi:10.3390/computers8010022.'
short: F.S. Bäumer, J. Kersting, M. Geierhos, Computers 8 (2019).
conference:
end_date: 2018-10-06
location: Vilnius, Lithuania
name: 24th International Conference on Information and Software Technologies (ICIST
2018)
start_date: 2018-10-04
date_created: 2019-03-06T14:27:28Z
date_updated: 2022-01-06T07:03:55Z
ddc:
- '000'
department:
- _id: '36'
- _id: '1'
- _id: '579'
doi: 10.3390/computers8010022
file:
- access_level: closed
content_type: application/pdf
creator: jkers
date_created: 2020-09-18T09:23:34Z
date_updated: 2020-09-18T09:23:34Z
file_id: '19572'
file_name: Bäumer et al. (2019), Baeumer2019.pdf
file_size: 3164523
relation: main_file
success: 1
file_date_updated: 2020-09-18T09:23:34Z
has_accepted_license: '1'
intvolume: ' 8'
issue: '1'
keyword:
- Inaccuracy Detection
- Natural Language Software Requirements
- Chat Bot
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.mdpi.com/2073-431X/8/1/22/pdf
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: Computers
publication_identifier:
issn:
- 2073-431X
publication_status: published
publisher: MDPI AG, Basel, Switzerland
quality_controlled: '1'
status: public
title: 'Natural Language Processing in OTF Computing: Challenges and the Need for
Interactive Approaches'
type: journal_article
user_id: '58701'
volume: 8
year: '2019'
...
---
_id: '8868'
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
- first_name: Alexander
full_name: Hetzer, Alexander
id: '38209'
last_name: Hetzer
citation:
ama: 'Wever MD, Mohr F, Hüllermeier E, Hetzer A. Towards Automated Machine Learning
for Multi-Label Classification. In: ; 2019.'
apa: Wever, M. D., Mohr, F., Hüllermeier, E., & Hetzer, A. (2019). Towards Automated
Machine Learning for Multi-Label Classification. Presented at the European Conference
on Data Analytics (ECDA), Bayreuth, Germany.
bibtex: '@inproceedings{Wever_Mohr_Hüllermeier_Hetzer_2019, title={Towards Automated
Machine Learning for Multi-Label Classification}, author={Wever, Marcel Dominik
and Mohr, Felix and Hüllermeier, Eyke and Hetzer, Alexander}, year={2019} }'
chicago: Wever, Marcel Dominik, Felix Mohr, Eyke Hüllermeier, and Alexander Hetzer.
“Towards Automated Machine Learning for Multi-Label Classification,” 2019.
ieee: M. D. Wever, F. Mohr, E. Hüllermeier, and A. Hetzer, “Towards Automated Machine
Learning for Multi-Label Classification,” presented at the European Conference
on Data Analytics (ECDA), Bayreuth, Germany, 2019.
mla: Wever, Marcel Dominik, et al. Towards Automated Machine Learning for Multi-Label
Classification. 2019.
short: 'M.D. Wever, F. Mohr, E. Hüllermeier, A. Hetzer, in: 2019.'
conference:
end_date: 2019-03-20
location: Bayreuth, Germany
name: European Conference on Data Analytics (ECDA)
start_date: 2019-03-18
date_created: 2019-04-10T07:17:55Z
date_updated: 2022-01-06T07:04:04Z
ddc:
- '000'
department:
- _id: '355'
file:
- access_level: closed
content_type: application/pdf
creator: wever
date_created: 2019-04-10T07:17:17Z
date_updated: 2019-04-10T07:17:17Z
file_id: '8870'
file_name: Towards_Automated_Machine_Learning_for_Multi_Label_Classification.pdf
file_size: '74484'
relation: main_file
success: 1
file_date_updated: 2019-04-10T07:17:17Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
status: public
title: Towards Automated Machine Learning for Multi-Label Classification
type: conference_abstract
user_id: '49109'
year: '2019'
...
---
_id: '15838'
abstract:
- lang: eng
text: In the field of software analysis a trade-off between scalability and accuracy
always exists. In this respect, Android app analysis is no exception, in particular,
analyzing large or many apps can be challenging. Dealing with many small apps
is a typical challenge when facing micro-benchmarks such as DROIDBENCH or ICC-BENCH.
These particular benchmarks are not only used for the evaluation of novel tools
but also in continuous integration pipelines of existing mature tools to maintain
and guarantee a certain quality-level. Considering this latter usage it becomes
very important to be able to achieve benchmark results as fast as possible. Hence,
benchmarks have to be optimized for this purpose. One approach to do so is app
merging. We implemented the Android Merge Tool (AMT) following this approach and
show that its novel aspects can be used to produce scaled up and accurate benchmarks.
For such benchmarks Android app analysis tools do not suffer from the scalability-accuracy
trade-off anymore. We show this throughout detailed experiments on DROIDBENCH
employing three different analysis tools (AMANDROID, ICCTA, FLOWDROID). Benchmark
execution times are largely reduced without losing benchmark accuracy. Moreover,
we argue why AMT is an advantageous successor of the state-of-the-art app merging
tool (APKCOMBINER) in analysis lift-up scenarios.
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Shikun
full_name: Zhang, Shikun
last_name: Zhang
citation:
ama: 'Pauck F, Zhang S. Android App Merging for Benchmark Speed-Up and Analysis
Lift-Up. In: 2019 34th IEEE/ACM International Conference on Automated Software
Engineering Workshop (ASEW). ; 2019. doi:10.1109/asew.2019.00019'
apa: Pauck, F., & Zhang, S. (2019). Android App Merging for Benchmark Speed-Up
and Analysis Lift-Up. In 2019 34th IEEE/ACM International Conference on Automated
Software Engineering Workshop (ASEW). https://doi.org/10.1109/asew.2019.00019
bibtex: '@inproceedings{Pauck_Zhang_2019, title={Android App Merging for Benchmark
Speed-Up and Analysis Lift-Up}, DOI={10.1109/asew.2019.00019},
booktitle={2019 34th IEEE/ACM International Conference on Automated Software Engineering
Workshop (ASEW)}, author={Pauck, Felix and Zhang, Shikun}, year={2019} }'
chicago: Pauck, Felix, and Shikun Zhang. “Android App Merging for Benchmark Speed-Up
and Analysis Lift-Up.” In 2019 34th IEEE/ACM International Conference on Automated
Software Engineering Workshop (ASEW), 2019. https://doi.org/10.1109/asew.2019.00019.
ieee: F. Pauck and S. Zhang, “Android App Merging for Benchmark Speed-Up and Analysis
Lift-Up,” in 2019 34th IEEE/ACM International Conference on Automated Software
Engineering Workshop (ASEW), 2019.
mla: Pauck, Felix, and Shikun Zhang. “Android App Merging for Benchmark Speed-Up
and Analysis Lift-Up.” 2019 34th IEEE/ACM International Conference on Automated
Software Engineering Workshop (ASEW), 2019, doi:10.1109/asew.2019.00019.
short: 'F. Pauck, S. Zhang, in: 2019 34th IEEE/ACM International Conference on Automated
Software Engineering Workshop (ASEW), 2019.'
date_created: 2020-02-06T17:06:51Z
date_updated: 2022-01-06T06:52:38Z
ddc:
- '004'
department:
- _id: '77'
doi: 10.1109/asew.2019.00019
file:
- access_level: closed
content_type: application/pdf
creator: fpauck
date_created: 2020-02-06T17:09:45Z
date_updated: 2020-02-06T17:09:45Z
file_id: '15839'
file_name: AMT_final.pdf
file_size: 644517
relation: main_file
file_date_updated: 2020-02-06T17:09:45Z
has_accepted_license: '1'
keyword:
- Program Analysis
- Android App Analysis
- Taint Analysis
- App Merging
- Benchmark
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: 2019 34th IEEE/ACM International Conference on Automated Software Engineering
Workshop (ASEW)
publication_identifier:
isbn:
- '9781728141367'
publication_status: published
status: public
title: Android App Merging for Benchmark Speed-Up and Analysis Lift-Up
type: conference
user_id: '477'
year: '2019'
...
---
_id: '15920'
abstract:
- lang: eng
text: "Secure hardware design is the most important aspect to be considered in addition
to functional correctness. Achieving hardware security in today’s globalized Integrated
Cir- cuit(IC) supply chain is a challenging task. One solution that is widely
considered to help achieve secure hardware designs is Information Flow Tracking(IFT).
It provides an ap- proach to verify that the systems adhere to security properties
either by static verification during design phase or dynamic checking during runtime.\r\nProof-Carrying
Hardware(PCH) is an approach to verify a functional design prior to using it in
hardware. It is a two-party verification approach, where the target party, the
consumer requests new functionalities with pre-defined properties to the producer.
In response, the producer designs the IP (Intellectual Property) cores with the
requested functionalities that adhere to the consumer-defined properties. The
producer provides the IP cores and a proof certificate combined into a proof-carrying
bitstream to the consumer to verify it. If the verification is successful, the
consumer can use the IP cores in his hardware. In essence, the consumer can only
run verified IP cores. Correctly applied, PCH techniques can help consumers to
defend against many unintentional modifications and malicious alterations of the
modules they receive. There are numerous published examples of how to use PCH
to detect any change in the functionality of a circuit, i.e., pairing a PCH approach
with functional equivalence checking for combinational or sequential circuits.
For non-functional properties, since opening new covert channels to leak secret
information from secure circuits is a viable attack vector for hardware trojans,
i.e., intentionally added malicious circuitry, IFT technique is employed to make
sure that secret/untrusted information never reaches any unclassified/trusted
outputs.\r\nThis master thesis aims to explore the possibility of adapting Information
Flow Tracking into a Proof-Carrying Hardware scenario. It aims to create a method
that combines Infor- mation Flow Tracking(IFT) with a PCH approach at bitstream
level enabling consumers to validate the trustworthiness of a module’s information
flow without the computational costs of a complete flow analysis."
author:
- first_name: Monica
full_name: Keerthipati, Monica
last_name: Keerthipati
citation:
ama: Keerthipati M. A Bitstream-Level Proof-Carrying Hardware Technique for Information
Flow Tracking. Universität Paderborn; 2019.
apa: Keerthipati, M. (2019). A Bitstream-Level Proof-Carrying Hardware Technique
for Information Flow Tracking. Universität Paderborn.
bibtex: '@book{Keerthipati_2019, title={A Bitstream-Level Proof-Carrying Hardware
Technique for Information Flow Tracking}, publisher={Universität Paderborn}, author={Keerthipati,
Monica}, year={2019} }'
chicago: Keerthipati, Monica. A Bitstream-Level Proof-Carrying Hardware Technique
for Information Flow Tracking. Universität Paderborn, 2019.
ieee: M. Keerthipati, A Bitstream-Level Proof-Carrying Hardware Technique for
Information Flow Tracking. Universität Paderborn, 2019.
mla: Keerthipati, Monica. A Bitstream-Level Proof-Carrying Hardware Technique
for Information Flow Tracking. Universität Paderborn, 2019.
short: M. Keerthipati, A Bitstream-Level Proof-Carrying Hardware Technique for Information
Flow Tracking, Universität Paderborn, 2019.
date_created: 2020-02-17T12:03:40Z
date_updated: 2022-01-06T06:52:41Z
department:
- _id: '78'
language:
- iso: eng
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Sybille
full_name: Hellebrand, Sybille
id: '209'
last_name: Hellebrand
orcid: 0000-0002-3717-3939
title: A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '14896'
author:
- first_name: Andreas
full_name: Dann, Andreas
last_name: Dann
- first_name: Ben
full_name: Hermann, Ben
id: '66173'
last_name: Hermann
orcid: 0000-0001-9848-2017
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: 'Dann A, Hermann B, Bodden E. ModGuard: Identifying Integrity &Confidentiality
Violations in Java Modules. IEEE Transactions on Software Engineering.
Published online 2019:1-1. doi:10.1109/tse.2019.2931331'
apa: 'Dann, A., Hermann, B., & Bodden, E. (2019). ModGuard: Identifying Integrity
&Confidentiality Violations in Java Modules. IEEE Transactions on Software
Engineering, 1–1. https://doi.org/10.1109/tse.2019.2931331'
bibtex: '@article{Dann_Hermann_Bodden_2019, title={ModGuard: Identifying Integrity
&Confidentiality Violations in Java Modules}, DOI={10.1109/tse.2019.2931331},
journal={IEEE Transactions on Software Engineering}, author={Dann, Andreas and
Hermann, Ben and Bodden, Eric}, year={2019}, pages={1–1} }'
chicago: 'Dann, Andreas, Ben Hermann, and Eric Bodden. “ModGuard: Identifying Integrity
&Confidentiality Violations in Java Modules.” IEEE Transactions on Software
Engineering, 2019, 1–1. https://doi.org/10.1109/tse.2019.2931331.'
ieee: 'A. Dann, B. Hermann, and E. Bodden, “ModGuard: Identifying Integrity &Confidentiality
Violations in Java Modules,” IEEE Transactions on Software Engineering,
pp. 1–1, 2019, doi: 10.1109/tse.2019.2931331.'
mla: 'Dann, Andreas, et al. “ModGuard: Identifying Integrity &Confidentiality
Violations in Java Modules.” IEEE Transactions on Software Engineering,
2019, pp. 1–1, doi:10.1109/tse.2019.2931331.'
short: A. Dann, B. Hermann, E. Bodden, IEEE Transactions on Software Engineering
(2019) 1–1.
date_created: 2019-11-12T12:20:56Z
date_updated: 2022-01-06T06:52:10Z
department:
- _id: '76'
- _id: '34'
- _id: '26'
doi: 10.1109/tse.2019.2931331
language:
- iso: eng
page: 1-1
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: IEEE Transactions on Software Engineering
publication_identifier:
issn:
- 0098-5589
- 1939-3520
- 2326-3881
publication_status: published
status: public
title: 'ModGuard: Identifying Integrity &Confidentiality Violations in Java Modules'
type: journal_article
user_id: '5786'
year: '2019'
...
---
_id: '15007'
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: Tackling the Aggregation/Disaggregation
Problem for OWA. In: Proceedings ACML, Asian Conference on Machine Learning
(Proceedings of Machine Learning Research, 101). ; 2019. doi:10.1016/j.jmva.2019.02.017'
apa: 'Melnikov, V., & Hüllermeier, E. (2019). Learning to Aggregate: Tackling
the Aggregation/Disaggregation Problem for OWA. In Proceedings ACML, Asian
Conference on Machine Learning (Proceedings of Machine Learning Research, 101).
https://doi.org/10.1016/j.jmva.2019.02.017'
bibtex: '@inproceedings{Melnikov_Hüllermeier_2019, title={Learning to Aggregate:
Tackling the Aggregation/Disaggregation Problem for OWA}, DOI={10.1016/j.jmva.2019.02.017},
booktitle={Proceedings ACML, Asian Conference on Machine Learning (Proceedings
of Machine Learning Research, 101)}, author={Melnikov, Vitaly and Hüllermeier,
Eyke}, year={2019} }'
chicago: 'Melnikov, Vitaly, and Eyke Hüllermeier. “Learning to Aggregate: Tackling
the Aggregation/Disaggregation Problem for OWA.” In Proceedings ACML, Asian
Conference on Machine Learning (Proceedings of Machine Learning Research, 101),
2019. https://doi.org/10.1016/j.jmva.2019.02.017.'
ieee: 'V. Melnikov and E. Hüllermeier, “Learning to Aggregate: Tackling the Aggregation/Disaggregation
Problem for OWA,” in Proceedings ACML, Asian Conference on Machine Learning
(Proceedings of Machine Learning Research, 101), 2019.'
mla: 'Melnikov, Vitaly, and Eyke Hüllermeier. “Learning to Aggregate: Tackling the
Aggregation/Disaggregation Problem for OWA.” Proceedings ACML, Asian Conference
on Machine Learning (Proceedings of Machine Learning Research, 101), 2019,
doi:10.1016/j.jmva.2019.02.017.'
short: 'V. Melnikov, E. Hüllermeier, in: Proceedings ACML, Asian Conference on Machine
Learning (Proceedings of Machine Learning Research, 101), 2019.'
date_created: 2019-11-15T10:43:26Z
date_updated: 2022-01-06T06:52:14Z
ddc:
- '000'
department:
- _id: '34'
- _id: '355'
- _id: '7'
doi: 10.1016/j.jmva.2019.02.017
file:
- access_level: open_access
content_type: application/pdf
creator: lettmann
date_created: 2020-02-28T12:47:07Z
date_updated: 2020-02-28T12:47:07Z
file_id: '16156'
file_name: learning-to-aggregate-owa.pdf
file_size: 2331320
relation: main_file
file_date_updated: 2020-02-28T12:47:07Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publication: Proceedings ACML, Asian Conference on Machine Learning (Proceedings of
Machine Learning Research, 101)
publication_status: published
status: public
title: 'Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for
OWA'
type: conference
user_id: '477'
year: '2019'
...
---
_id: '15011'
author:
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Tornede A, Wever MD, Hüllermeier E. Algorithm Selection as Recommendation:
From Collaborative Filtering to Dyad Ranking. In: Hoffmann F, Hüllermeier E, Mikut
R, eds. Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28.
- 29. November 2019. KIT Scientific Publishing, Karlsruhe; 2019:135-146.'
apa: 'Tornede, A., Wever, M. D., & Hüllermeier, E. (2019). Algorithm Selection
as Recommendation: From Collaborative Filtering to Dyad Ranking. In F. Hoffmann,
E. Hüllermeier, & R. Mikut (Eds.), Proceedings - 29. Workshop Computational
Intelligence, Dortmund, 28. - 29. November 2019 (pp. 135–146). Dortmund: KIT
Scientific Publishing, Karlsruhe.'
bibtex: '@inproceedings{Tornede_Wever_Hüllermeier_2019, title={Algorithm Selection
as Recommendation: From Collaborative Filtering to Dyad Ranking}, booktitle={Proceedings
- 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019},
publisher={KIT Scientific Publishing, Karlsruhe}, author={Tornede, Alexander and
Wever, Marcel Dominik and Hüllermeier, Eyke}, editor={Hoffmann, Frank and Hüllermeier,
Eyke and Mikut, RalfEditors}, year={2019}, pages={135–146} }'
chicago: 'Tornede, Alexander, Marcel Dominik Wever, and Eyke Hüllermeier. “Algorithm
Selection as Recommendation: From Collaborative Filtering to Dyad Ranking.” In
Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29.
November 2019, edited by Frank Hoffmann, Eyke Hüllermeier, and Ralf Mikut,
135–46. KIT Scientific Publishing, Karlsruhe, 2019.'
ieee: 'A. Tornede, M. D. Wever, and E. Hüllermeier, “Algorithm Selection as Recommendation:
From Collaborative Filtering to Dyad Ranking,” in Proceedings - 29. Workshop
Computational Intelligence, Dortmund, 28. - 29. November 2019, Dortmund, 2019,
pp. 135–146.'
mla: 'Tornede, Alexander, et al. “Algorithm Selection as Recommendation: From Collaborative
Filtering to Dyad Ranking.” Proceedings - 29. Workshop Computational Intelligence,
Dortmund, 28. - 29. November 2019, edited by Frank Hoffmann et al., KIT Scientific
Publishing, Karlsruhe, 2019, pp. 135–46.'
short: 'A. Tornede, M.D. Wever, E. Hüllermeier, in: F. Hoffmann, E. Hüllermeier,
R. Mikut (Eds.), Proceedings - 29. Workshop Computational Intelligence, Dortmund,
28. - 29. November 2019, KIT Scientific Publishing, Karlsruhe, 2019, pp. 135–146.'
conference:
end_date: 2019-11-29
location: Dortmund
name: 29. Workshop Computational Intelligence
start_date: 2019-11-28
date_created: 2019-11-15T13:29:25Z
date_updated: 2022-01-06T06:52:14Z
ddc:
- '006'
department:
- _id: '355'
editor:
- first_name: Frank
full_name: Hoffmann, Frank
last_name: Hoffmann
- first_name: Eyke
full_name: Hüllermeier, Eyke
last_name: Hüllermeier
- first_name: Ralf
full_name: Mikut, Ralf
last_name: Mikut
file:
- access_level: open_access
content_type: application/pdf
creator: ahetzer
date_created: 2020-05-25T08:01:31Z
date_updated: 2020-05-25T08:01:31Z
file_id: '17060'
file_name: ci_workshop_tornede.pdf
file_size: 468825
relation: main_file
file_date_updated: 2020-05-25T08:01:31Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 135-146
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28.
- 29. November 2019
publication_identifier:
isbn:
- 978-3-7315-0979-0
publication_status: published
publisher: KIT Scientific Publishing, Karlsruhe
status: public
title: 'Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad
Ranking'
type: conference
user_id: '38209'
year: '2019'
...
---
_id: '13126'
author:
- first_name: Lial
full_name: Khaluf, Lial
last_name: Khaluf
citation:
ama: Khaluf L. Organic Programming of Dynamic Real-Time Applications. Universität
Paderborn; 2019.
apa: Khaluf, L. (2019). Organic Programming of Dynamic Real-Time Applications.
Universität Paderborn.
bibtex: '@book{Khaluf_2019, title={Organic Programming of Dynamic Real-Time Applications},
publisher={Universität Paderborn}, author={Khaluf, Lial}, year={2019} }'
chicago: Khaluf, Lial. Organic Programming of Dynamic Real-Time Applications.
Universität Paderborn, 2019.
ieee: L. Khaluf, Organic Programming of Dynamic Real-Time Applications. Universität
Paderborn, 2019.
mla: Khaluf, Lial. Organic Programming of Dynamic Real-Time Applications.
Universität Paderborn, 2019.
short: L. Khaluf, Organic Programming of Dynamic Real-Time Applications, Universität
Paderborn, 2019.
date_created: 2019-09-03T12:23:44Z
date_updated: 2022-01-06T06:51:28Z
department:
- _id: '7'
- _id: '70'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Franz
full_name: Rammig, Franz
last_name: Rammig
title: Organic Programming of Dynamic Real-Time Applications
type: dissertation
user_id: '477'
year: '2019'
...
---
_id: '13132'
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Mohr F, Wever MD, Tornede A, Hüllermeier E. From Automated to On-The-Fly Machine
Learning. In: INFORMATIK 2019: 50 Jahre Gesellschaft Für Informatik – Informatik
Für Gesellschaft. INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft
für Informatik. Bonn: Gesellschaft für Informatik e.V.; 2019:273-274.'
apa: 'Mohr, F., Wever, M. D., Tornede, A., & Hüllermeier, E. (2019). From Automated
to On-The-Fly Machine Learning. In INFORMATIK 2019: 50 Jahre Gesellschaft für
Informatik – Informatik für Gesellschaft (pp. 273–274). Bonn: Gesellschaft
für Informatik e.V.'
bibtex: '@inproceedings{Mohr_Wever_Tornede_Hüllermeier_2019, place={Bonn}, series={INFORMATIK
2019, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik}, title={From
Automated to On-The-Fly Machine Learning}, booktitle={INFORMATIK 2019: 50 Jahre
Gesellschaft für Informatik – Informatik für Gesellschaft}, publisher={Gesellschaft
für Informatik e.V.}, author={Mohr, Felix and Wever, Marcel Dominik and Tornede,
Alexander and Hüllermeier, Eyke}, year={2019}, pages={273–274}, collection={INFORMATIK
2019, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik} }'
chicago: 'Mohr, Felix, Marcel Dominik Wever, Alexander Tornede, and Eyke Hüllermeier.
“From Automated to On-The-Fly Machine Learning.” In INFORMATIK 2019: 50 Jahre
Gesellschaft Für Informatik – Informatik Für Gesellschaft, 273–74. INFORMATIK
2019, Lecture Notes in Informatics (LNI), Gesellschaft Für Informatik. Bonn: Gesellschaft
für Informatik e.V., 2019.'
ieee: 'F. Mohr, M. D. Wever, A. Tornede, and E. Hüllermeier, “From Automated to
On-The-Fly Machine Learning,” in INFORMATIK 2019: 50 Jahre Gesellschaft für
Informatik – Informatik für Gesellschaft, Kassel, 2019, pp. 273–274.'
mla: 'Mohr, Felix, et al. “From Automated to On-The-Fly Machine Learning.” INFORMATIK
2019: 50 Jahre Gesellschaft Für Informatik – Informatik Für Gesellschaft,
Gesellschaft für Informatik e.V., 2019, pp. 273–74.'
short: 'F. Mohr, M.D. Wever, A. Tornede, E. Hüllermeier, in: INFORMATIK 2019: 50
Jahre Gesellschaft Für Informatik – Informatik Für Gesellschaft, Gesellschaft
für Informatik e.V., Bonn, 2019, pp. 273–274.'
conference:
end_date: 2019-09-26
location: Kassel
name: Informatik 2019
start_date: 2019-09-23
date_created: 2019-09-04T08:44:46Z
date_updated: 2022-01-06T06:51:28Z
department:
- _id: '355'
language:
- iso: eng
page: ' 273-274 '
place: Bonn
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publication: 'INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für
Gesellschaft'
publisher: Gesellschaft für Informatik e.V.
series_title: INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft für
Informatik
status: public
title: From Automated to On-The-Fly Machine Learning
type: conference_abstract
user_id: '38209'
year: '2019'
...
---
_id: '13435'
author:
- first_name: Edwin
full_name: Friesen, Edwin
last_name: Friesen
citation:
ama: 'Friesen E. Requirements Engineering im OTF-Computing: Informationsextraktion
und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis.
Universität Paderborn; 2019.'
apa: 'Friesen, E. (2019). Requirements Engineering im OTF-Computing: Informationsextraktion
und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis.
Universität Paderborn.'
bibtex: '@book{Friesen_2019, title={Requirements Engineering im OTF-Computing: Informationsextraktion
und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis},
publisher={Universität Paderborn}, author={Friesen, Edwin}, year={2019} }'
chicago: 'Friesen, Edwin. Requirements Engineering im OTF-Computing: Informationsextraktion
und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis.
Universität Paderborn, 2019.'
ieee: 'E. Friesen, Requirements Engineering im OTF-Computing: Informationsextraktion
und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis.
Universität Paderborn, 2019.'
mla: 'Friesen, Edwin. Requirements Engineering im OTF-Computing: Informationsextraktion
und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis.
Universität Paderborn, 2019.'
short: 'E. Friesen, Requirements Engineering im OTF-Computing: Informationsextraktion
und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis, Universität
Paderborn, 2019.'
date_created: 2019-09-20T14:58:49Z
date_updated: 2022-01-06T06:51:36Z
department:
- _id: '36'
- _id: '1'
- _id: '579'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
title: 'Requirements Engineering im OTF-Computing: Informationsextraktion und Unvollständigkeitskompensation
mittels domänenspezifischer Wissensbasis'
type: bachelorsthesis
user_id: '477'
year: '2019'
...
---
_id: '10093'
author:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Thomas
full_name: Lemberger, Thomas
last_name: Lemberger
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Beyer D, Jakobs M-C, Lemberger T, Wehrheim H. Combining Verifiers in Conditional
Model Checking via Reducers. In: Becker S, Bogicevic I, Herzwurm G, Wagner S,
eds. Software Engineering and Software Management (SE/SWM 2019), Stuttgart,
Germany, February 18-22, 2019. Vol P-292. LNI. GI; 2019:151--152. doi:10.18420/se2019-46'
apa: Beyer, D., Jakobs, M.-C., Lemberger, T., & Wehrheim, H. (2019). Combining
Verifiers in Conditional Model Checking via Reducers. In S. Becker, I. Bogicevic,
G. Herzwurm, & S. Wagner (Eds.), Software Engineering and Software Management
(SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019 (Vol. P-292, pp. 151--152).
GI. https://doi.org/10.18420/se2019-46
bibtex: '@inproceedings{Beyer_Jakobs_Lemberger_Wehrheim_2019, series={LNI}, title={Combining
Verifiers in Conditional Model Checking via Reducers}, volume={P-292}, DOI={10.18420/se2019-46}, booktitle={Software
Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February
18-22, 2019}, publisher={GI}, author={Beyer, Dirk and Jakobs, Marie-Christine
and Lemberger, Thomas and Wehrheim, Heike}, editor={Becker, Steffen and Bogicevic,
Ivan and Herzwurm, Georg and Wagner, StefanEditors}, year={2019}, pages={151--152},
collection={LNI} }'
chicago: Beyer, Dirk, Marie-Christine Jakobs, Thomas Lemberger, and Heike Wehrheim.
“Combining Verifiers in Conditional Model Checking via Reducers.” In Software
Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February
18-22, 2019, edited by Steffen Becker, Ivan Bogicevic, Georg Herzwurm, and
Stefan Wagner, P-292:151--152. LNI. GI, 2019. https://doi.org/10.18420/se2019-46.
ieee: D. Beyer, M.-C. Jakobs, T. Lemberger, and H. Wehrheim, “Combining Verifiers
in Conditional Model Checking via Reducers,” in Software Engineering and Software
Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019, 2019,
vol. P-292, pp. 151--152.
mla: Beyer, Dirk, et al. “Combining Verifiers in Conditional Model Checking via
Reducers.” Software Engineering and Software Management (SE/SWM 2019), Stuttgart,
Germany, February 18-22, 2019, edited by Steffen Becker et al., vol. P-292,
GI, 2019, pp. 151--152, doi:10.18420/se2019-46.
short: 'D. Beyer, M.-C. Jakobs, T. Lemberger, H. Wehrheim, in: S. Becker, I. Bogicevic,
G. Herzwurm, S. Wagner (Eds.), Software Engineering and Software Management (SE/SWM
2019), Stuttgart, Germany, February 18-22, 2019, GI, 2019, pp. 151--152.'
date_created: 2019-06-03T08:08:39Z
date_updated: 2022-01-06T06:50:28Z
ddc:
- '004'
department:
- _id: '77'
doi: 10.18420/se2019-46
editor:
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
- first_name: Ivan
full_name: Bogicevic, Ivan
last_name: Bogicevic
- first_name: Georg
full_name: Herzwurm, Georg
last_name: Herzwurm
- first_name: Stefan
full_name: Wagner, Stefan
last_name: Wagner
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T09:31:55Z
date_updated: 2019-08-26T09:31:55Z
file_id: '12956'
file_name: 46.pdf
file_size: 472426
relation: main_file
success: 1
file_date_updated: 2019-08-26T09:31:55Z
has_accepted_license: '1'
language:
- iso: eng
page: 151--152
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
publication: Software Engineering and Software Management (SE/SWM 2019), Stuttgart,
Germany, February 18-22, 2019
publisher: GI
series_title: LNI
status: public
title: Combining Verifiers in Conditional Model Checking via Reducers
type: conference
user_id: '477'
volume: P-292
year: '2019'
...
---
_id: '10095'
author:
- first_name: Cedric
full_name: Richter, Cedric
id: '50003'
last_name: Richter
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Richter C, Wehrheim H. PeSCo: Predicting Sequential Combinations of Verifiers
- (Competition Contribution). In: Beyer D, Huisman M, Kordon F, Steffen B, eds.
Tools and Algorithms for the Construction and Analysis of Systems - 25 Years
of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic,
April 6-11, 2019, Proceedings, Part {III}. Vol 11429. Lecture Notes in Computer
Science. Springer; 2019:229-233. doi:10.1007/978-3-030-17502-3_19'
apa: 'Richter, C., & Wehrheim, H. (2019). PeSCo: Predicting Sequential Combinations
of Verifiers - (Competition Contribution). In D. Beyer, M. Huisman, F. Kordon,
& B. Steffen (Eds.), Tools and Algorithms for the Construction and Analysis
of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague,
Czech Republic, April 6-11, 2019, Proceedings, Part {III} (Vol. 11429, pp.
229–233). Springer. https://doi.org/10.1007/978-3-030-17502-3_19'
bibtex: '@inproceedings{Richter_Wehrheim_2019, series={Lecture Notes in Computer
Science}, title={PeSCo: Predicting Sequential Combinations of Verifiers - (Competition
Contribution)}, volume={11429}, DOI={10.1007/978-3-030-17502-3_19},
booktitle={Tools and Algorithms for the Construction and Analysis of Systems -
25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic,
April 6-11, 2019, Proceedings, Part {III}}, publisher={Springer}, author={Richter,
Cedric and Wehrheim, Heike}, editor={Beyer, Dirk and Huisman, Marieke and Kordon,
Fabrice and Steffen, BernhardEditors}, year={2019}, pages={229–233}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations
of Verifiers - (Competition Contribution).” In Tools and Algorithms for the
Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as
Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part
{III}, edited by Dirk Beyer, Marieke Huisman, Fabrice Kordon, and Bernhard
Steffen, 11429:229–33. Lecture Notes in Computer Science. Springer, 2019. https://doi.org/10.1007/978-3-030-17502-3_19.'
ieee: 'C. Richter and H. Wehrheim, “PeSCo: Predicting Sequential Combinations of
Verifiers - (Competition Contribution),” in Tools and Algorithms for the Construction
and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS}
2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}, 2019,
vol. 11429, pp. 229–233.'
mla: 'Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations
of Verifiers - (Competition Contribution).” Tools and Algorithms for the Construction
and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS}
2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}, edited
by Dirk Beyer et al., vol. 11429, Springer, 2019, pp. 229–33, doi:10.1007/978-3-030-17502-3_19.'
short: 'C. Richter, H. Wehrheim, in: D. Beyer, M. Huisman, F. Kordon, B. Steffen
(Eds.), Tools and Algorithms for the Construction and Analysis of Systems - 25
Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic,
April 6-11, 2019, Proceedings, Part {III}, Springer, 2019, pp. 229–233.'
date_created: 2019-06-03T08:12:55Z
date_updated: 2022-01-06T06:50:29Z
ddc:
- '004'
department:
- _id: '77'
doi: 10.1007/978-3-030-17502-3_19
editor:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Marieke
full_name: Huisman, Marieke
last_name: Huisman
- first_name: Fabrice
full_name: Kordon, Fabrice
last_name: Kordon
- first_name: Bernhard
full_name: Steffen, Bernhard
last_name: Steffen
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T11:01:00Z
date_updated: 2019-08-26T11:01:00Z
file_id: '12961'
file_name: PeSCo.pdf
file_size: 254772
relation: main_file
success: 1
file_date_updated: 2019-08-26T11:01:00Z
has_accepted_license: '1'
intvolume: ' 11429'
language:
- iso: eng
page: 229-233
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
publication: Tools and Algorithms for the Construction and Analysis of Systems - 25
Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic,
April 6-11, 2019, Proceedings, Part {III}
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)'
type: conference
user_id: '29719'
volume: 11429
year: '2019'
...
---
_id: '10105'
author:
- first_name: Jan
full_name: Haltermann, Jan
last_name: Haltermann
citation:
ama: Haltermann J. Analyzing Data Usage in Array Programs. Universität Paderborn;
2019.
apa: Haltermann, J. (2019). Analyzing Data Usage in Array Programs. Universität
Paderborn.
bibtex: '@book{Haltermann_2019, title={Analyzing Data Usage in Array Programs},
publisher={Universität Paderborn}, author={Haltermann, Jan}, year={2019} }'
chicago: Haltermann, Jan. Analyzing Data Usage in Array Programs. Universität
Paderborn, 2019.
ieee: J. Haltermann, Analyzing Data Usage in Array Programs. Universität
Paderborn, 2019.
mla: Haltermann, Jan. Analyzing Data Usage in Array Programs. Universität
Paderborn, 2019.
short: J. Haltermann, Analyzing Data Usage in Array Programs, Universität Paderborn,
2019.
date_created: 2019-06-04T10:54:08Z
date_updated: 2022-01-06T06:50:29Z
department:
- _id: '7'
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Analyzing Data Usage in Array Programs
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '10232'
abstract:
- lang: eng
text: Existing tools for automated machine learning, such as Auto-WEKA, TPOT, auto-sklearn,
and more recently ML-Plan, have shown impressive results for the tasks of single-label
classification and regression. Yet, there is only little work on other types of
machine learning problems so far. In particular, there is almost no work on automating
the engineering of machine learning solutions for multi-label classification (MLC).
We show how the scope of ML-Plan, an AutoML-tool for multi-class classification,
can be extended towards MLC using MEKA, which is a multi-label extension of the
well-known Java library WEKA. The resulting approach recursively refines MEKA's
multi-label classifiers, nesting other multi-label classifiers for meta algorithms
and single-label classifiers provided by WEKA as base learners. In our evaluation,
we find that the proposed approach yields strong results and performs significantly
better than a set of baselines we compare with.
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: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Wever MD, Mohr F, Tornede A, Hüllermeier E. Automating Multi-Label Classification
Extending ML-Plan. In: ; 2019.'
apa: Wever, M. D., Mohr, F., Tornede, A., & Hüllermeier, E. (2019). Automating
Multi-Label Classification Extending ML-Plan. Presented at the 6th ICML Workshop
on Automated Machine Learning (AutoML 2019), Long Beach, CA, USA.
bibtex: '@inproceedings{Wever_Mohr_Tornede_Hüllermeier_2019, title={Automating Multi-Label
Classification Extending ML-Plan}, author={Wever, Marcel Dominik and Mohr, Felix
and Tornede, Alexander and Hüllermeier, Eyke}, year={2019} }'
chicago: Wever, Marcel Dominik, Felix Mohr, Alexander Tornede, and Eyke Hüllermeier.
“Automating Multi-Label Classification Extending ML-Plan,” 2019.
ieee: M. D. Wever, F. Mohr, A. Tornede, and E. Hüllermeier, “Automating Multi-Label
Classification Extending ML-Plan,” presented at the 6th ICML Workshop on Automated
Machine Learning (AutoML 2019), Long Beach, CA, USA, 2019.
mla: Wever, Marcel Dominik, et al. Automating Multi-Label Classification Extending
ML-Plan. 2019.
short: 'M.D. Wever, F. Mohr, A. Tornede, E. Hüllermeier, in: 2019.'
conference:
end_date: 2019-06-15
location: Long Beach, CA, USA
name: 6th ICML Workshop on Automated Machine Learning (AutoML 2019)
start_date: 2019-06-09
date_created: 2019-06-11T21:33:06Z
date_updated: 2022-01-06T06:50:33Z
ddc:
- '006'
department:
- _id: '355'
file:
- access_level: open_access
content_type: application/pdf
creator: wever
date_created: 2019-09-10T08:19:01Z
date_updated: 2019-09-10T08:20:44Z
file_id: '13177'
file_name: Automating_MultiLabel_Classification_Extending_ML-Plan.pdf
file_size: 388191
relation: main_file
file_date_updated: 2019-09-10T08:20:44Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
status: public
title: Automating Multi-Label Classification Extending ML-Plan
type: conference
user_id: '33176'
year: '2019'
...
---
_id: '7626'
author:
- first_name: Philipp
full_name: Schubert, Philipp
id: '60543'
last_name: Schubert
orcid: 0000-0002-8674-1859
- first_name: Ben
full_name: Hermann, Ben
id: '66173'
last_name: Hermann
orcid: 0000-0001-9848-2017
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: 'Schubert P, Hermann B, Bodden E. PhASAR: An Inter-Procedural Static Analysis
Framework for C/C++. In: Proceedings of the 25th International Conference on
Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019),
Held as Part of the European Joint Conferences on Theory and Practice of Software
(ETAPS 2019). Vol II. ; 2019:393-410. doi:10.1007/978-3-030-17465-1_22'
apa: 'Schubert, P., Hermann, B., & Bodden, E. (2019). PhASAR: An Inter-Procedural
Static Analysis Framework for C/C++. Proceedings of the 25th International
Conference on Tools and Algorithms for the Construction and Analysis of Systems
(TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice
of Software (ETAPS 2019), II, 393–410. https://doi.org/10.1007/978-3-030-17465-1_22'
bibtex: '@inproceedings{Schubert_Hermann_Bodden_2019, title={PhASAR: An Inter-Procedural
Static Analysis Framework for C/C++}, volume={II}, DOI={10.1007/978-3-030-17465-1_22},
booktitle={Proceedings of the 25th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the
European Joint Conferences on Theory and Practice of Software (ETAPS 2019)}, author={Schubert,
Philipp and Hermann, Ben and Bodden, Eric}, year={2019}, pages={393–410} }'
chicago: 'Schubert, Philipp, Ben Hermann, and Eric Bodden. “PhASAR: An Inter-Procedural
Static Analysis Framework for C/C++.” In Proceedings of the 25th International
Conference on Tools and Algorithms for the Construction and Analysis of Systems
(TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice
of Software (ETAPS 2019), II:393–410, 2019. https://doi.org/10.1007/978-3-030-17465-1_22.'
ieee: 'P. Schubert, B. Hermann, and E. Bodden, “PhASAR: An Inter-Procedural Static
Analysis Framework for C/C++,” in Proceedings of the 25th International Conference
on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019),
Held as Part of the European Joint Conferences on Theory and Practice of Software
(ETAPS 2019), Prague, Czech Republic, 2019, vol. II, pp. 393–410, doi: 10.1007/978-3-030-17465-1_22.'
mla: 'Schubert, Philipp, et al. “PhASAR: An Inter-Procedural Static Analysis Framework
for C/C++.” Proceedings of the 25th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the
European Joint Conferences on Theory and Practice of Software (ETAPS 2019),
vol. II, 2019, pp. 393–410, doi:10.1007/978-3-030-17465-1_22.'
short: 'P. Schubert, B. Hermann, E. Bodden, in: Proceedings of the 25th International
Conference on Tools and Algorithms for the Construction and Analysis of Systems
(TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice
of Software (ETAPS 2019), 2019, pp. 393–410.'
conference:
end_date: 2019-04-11
location: Prague, Czech Republic
name: 25th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems (TACAS)
start_date: 2019-04-08
date_created: 2019-02-12T07:20:07Z
date_updated: 2022-03-25T07:48:36Z
ddc:
- '000'
department:
- _id: '76'
doi: 10.1007/978-3-030-17465-1_22
file:
- access_level: closed
content_type: application/pdf
creator: pdschbrt
date_created: 2019-02-12T07:18:17Z
date_updated: 2019-02-12T07:18:17Z
file_id: '7627'
file_name: main.pdf
file_size: 504897
relation: main_file
success: 1
file_date_updated: 2019-02-12T07:18:17Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/chapter/10.1007/978-3-030-17465-1_22
oa: '1'
page: 393-410
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 25th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the European
Joint Conferences on Theory and Practice of Software (ETAPS 2019)
publication_status: published
status: public
title: 'PhASAR: An Inter-Procedural Static Analysis Framework for C/C++'
type: conference
user_id: '60543'
volume: II
year: '2019'
...
---
_id: '13259'
author:
- first_name: Wei-Fan
full_name: Chen, Wei-Fan
id: '82920'
last_name: Chen
- first_name: Khalid
full_name: Al-Khatib, Khalid
last_name: Al-Khatib
- first_name: Matthias
full_name: Hagen, Matthias
last_name: Hagen
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Chen W-F, Al-Khatib K, Hagen M, Wachsmuth H, Stein B. Unraveling the Search
Space of Abusive Language in Wikipedia with Dynamic Lexicon Acquisition. In: Proceedings
of the Second Workshop on Natural Language Processing for Internet Freedom.
; 2019:76-82.'
apa: Chen, W.-F., Al-Khatib, K., Hagen, M., Wachsmuth, H., & Stein, B. (2019).
Unraveling the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon
Acquisition. Proceedings of the Second Workshop on Natural Language Processing
for Internet Freedom, 76–82.
bibtex: '@inproceedings{Chen_Al-Khatib_Hagen_Wachsmuth_Stein_2019, title={Unraveling
the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon Acquisition},
booktitle={Proceedings of the Second Workshop on Natural Language Processing for
Internet Freedom}, author={Chen, Wei-Fan and Al-Khatib, Khalid and Hagen, Matthias
and Wachsmuth, Henning and Stein, Benno}, year={2019}, pages={76–82} }'
chicago: Chen, Wei-Fan, Khalid Al-Khatib, Matthias Hagen, Henning Wachsmuth, and
Benno Stein. “Unraveling the Search Space of Abusive Language in Wikipedia with
Dynamic Lexicon Acquisition.” In Proceedings of the Second Workshop on Natural
Language Processing for Internet Freedom, 76–82, 2019.
ieee: W.-F. Chen, K. Al-Khatib, M. Hagen, H. Wachsmuth, and B. Stein, “Unraveling
the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon Acquisition,”
in Proceedings of the Second Workshop on Natural Language Processing for Internet
Freedom, 2019, pp. 76–82.
mla: Chen, Wei-Fan, et al. “Unraveling the Search Space of Abusive Language in Wikipedia
with Dynamic Lexicon Acquisition.” Proceedings of the Second Workshop on Natural
Language Processing for Internet Freedom, 2019, pp. 76–82.
short: 'W.-F. Chen, K. Al-Khatib, M. Hagen, H. Wachsmuth, B. Stein, in: Proceedings
of the Second Workshop on Natural Language Processing for Internet Freedom, 2019,
pp. 76–82.'
date_created: 2019-09-17T14:42:43Z
date_updated: 2022-05-09T15:04:18Z
department:
- _id: '600'
- _id: '568'
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/D19-5009.pdf
page: 76-82
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '9'
name: 'SFB 901 - B1: SFB 901 - Subproject B1'
publication: Proceedings of the Second Workshop on Natural Language Processing for
Internet Freedom
status: public
title: Unraveling the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon
Acquisition
type: conference
user_id: '82920'
year: '2019'
...
---
_id: '10108'
abstract:
- lang: eng
text: "Recent years have seen the development of numerous tools for the analysis
of taint flows in Android apps. Taint analyses aim at detecting data leaks, accidentally
or by purpose programmed into apps. Often, such tools specialize in the treatment
of specific features impeding precise taint analysis (like reflection or inter-app
communication). This multitude of tools, their specific applicability and their
various combination options complicate the selection of a tool (or multiple tools)
when faced with an analysis instance, even for knowledgeable users, and hence
hinders the successful adoption of taint analyses.\r\n\r\nIn this work, we thus
present CoDiDroid, a framework for cooperative Android app analysis. CoDiDroid
(1) allows users to ask questions about flows in apps in varying degrees of detail,
(2) automatically generates subtasks for answering such questions, (3) distributes
tasks onto analysis tools (currently DroidRA, FlowDroid, HornDroid, IC3 and two
novel tools) and (4) at the end merges tool answers on subtasks into an overall
answer. Thereby, users are freed from having to learn about the use and functionality
of all these tools while still being able to leverage their capabilities. Moreover,
we experimentally show that cooperation among tools pays off with respect to effectiveness,
precision and scalability."
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Pauck F, Wehrheim H. Together Strong: Cooperative Android App Analysis. In:
Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering
Conference and Symposium on the Foundations of Software Engineering. ; 2019:374-384.
doi:10.1145/3338906.3338915'
apa: 'Pauck, F., & Wehrheim, H. (2019). Together Strong: Cooperative Android
App Analysis. Proceedings of the 2019 27th ACM Joint Meeting on European Software
Engineering Conference and Symposium on the Foundations of Software Engineering,
374–384. https://doi.org/10.1145/3338906.3338915'
bibtex: '@inproceedings{Pauck_Wehrheim_2019, title={Together Strong: Cooperative
Android App Analysis}, DOI={10.1145/3338906.3338915},
booktitle={Proceedings of the 2019 27th ACM Joint Meeting on European Software
Engineering Conference and Symposium on the Foundations of Software Engineering},
author={Pauck, Felix and Wehrheim, Heike}, year={2019}, pages={374–384} }'
chicago: 'Pauck, Felix, and Heike Wehrheim. “Together Strong: Cooperative Android
App Analysis.” In Proceedings of the 2019 27th ACM Joint Meeting on European
Software Engineering Conference and Symposium on the Foundations of Software Engineering,
374–84, 2019. https://doi.org/10.1145/3338906.3338915.'
ieee: 'F. Pauck and H. Wehrheim, “Together Strong: Cooperative Android App Analysis,”
in Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering
Conference and Symposium on the Foundations of Software Engineering, 2019,
pp. 374–384, doi: 10.1145/3338906.3338915.'
mla: 'Pauck, Felix, and Heike Wehrheim. “Together Strong: Cooperative Android App
Analysis.” Proceedings of the 2019 27th ACM Joint Meeting on European Software
Engineering Conference and Symposium on the Foundations of Software Engineering,
2019, pp. 374–84, doi:10.1145/3338906.3338915.'
short: 'F. Pauck, H. Wehrheim, in: Proceedings of the 2019 27th ACM Joint Meeting
on European Software Engineering Conference and Symposium on the Foundations of
Software Engineering, 2019, pp. 374–384.'
date_created: 2019-06-04T11:15:25Z
date_updated: 2023-01-18T08:32:47Z
ddc:
- '004'
department:
- _id: '77'
doi: 10.1145/3338906.3338915
file:
- access_level: closed
content_type: application/pdf
creator: fpauck
date_created: 2019-08-20T08:47:20Z
date_updated: 2019-08-20T08:47:20Z
file_id: '12947'
file_name: fse19main-id44-p-ef9ce42-41855-final.pdf
file_size: 442603
relation: main_file
file_date_updated: 2019-08-20T08:47:20Z
has_accepted_license: '1'
keyword:
- Android Taint Analysis
- Cooperation
- Precision
- Tools
language:
- iso: eng
page: 374-384
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering
Conference and Symposium on the Foundations of Software Engineering
publication_identifier:
isbn:
- 978-1-4503-5572-8
publication_status: published
status: public
title: 'Together Strong: Cooperative Android App Analysis'
type: conference
user_id: '22398'
year: '2019'
...
---
_id: '13874'
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Isenberg T, Jakobs M-C, Pauck F, Wehrheim H. When Are Software Verification
Results Valid for Approximate Hardware? In: Tests and Proofs - 13th International
Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods
2019, Porto, Portugal, October 9-11, 2019, Proceedings. ; 2019:3-20. doi:10.1007/978-3-030-31157-5_1'
apa: Isenberg, T., Jakobs, M.-C., Pauck, F., & Wehrheim, H. (2019). When Are
Software Verification Results Valid for Approximate Hardware? Tests and Proofs
- 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress
on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings,
3–20. https://doi.org/10.1007/978-3-030-31157-5_1
bibtex: '@inproceedings{Isenberg_Jakobs_Pauck_Wehrheim_2019, title={When Are Software
Verification Results Valid for Approximate Hardware?}, DOI={10.1007/978-3-030-31157-5_1},
booktitle={Tests and Proofs - 13th International Conference, {TAP} 2019, Held
as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October
9-11, 2019, Proceedings}, author={Isenberg, Tobias and Jakobs, Marie-Christine
and Pauck, Felix and Wehrheim, Heike}, year={2019}, pages={3–20} }'
chicago: Isenberg, Tobias, Marie-Christine Jakobs, Felix Pauck, and Heike Wehrheim.
“When Are Software Verification Results Valid for Approximate Hardware?” In Tests
and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third
World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings,
3–20, 2019. https://doi.org/10.1007/978-3-030-31157-5_1.
ieee: 'T. Isenberg, M.-C. Jakobs, F. Pauck, and H. Wehrheim, “When Are Software
Verification Results Valid for Approximate Hardware?,” in Tests and Proofs
- 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress
on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings,
2019, pp. 3–20, doi: 10.1007/978-3-030-31157-5_1.'
mla: Isenberg, Tobias, et al. “When Are Software Verification Results Valid for
Approximate Hardware?” Tests and Proofs - 13th International Conference, {TAP}
2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto,
Portugal, October 9-11, 2019, Proceedings, 2019, pp. 3–20, doi:10.1007/978-3-030-31157-5_1.
short: 'T. Isenberg, M.-C. Jakobs, F. Pauck, H. Wehrheim, in: Tests and Proofs -
13th International Conference, {TAP} 2019, Held as Part of the Third World Congress
on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings, 2019,
pp. 3–20.'
date_created: 2019-10-16T09:40:20Z
date_updated: 2023-01-18T08:41:17Z
department:
- _id: '77'
doi: 10.1007/978-3-030-31157-5_1
language:
- iso: eng
page: 3-20
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publication: Tests and Proofs - 13th International Conference, {TAP} 2019, Held as
Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October
9-11, 2019, Proceedings
publication_status: published
status: public
title: When Are Software Verification Results Valid for Approximate Hardware?
type: conference
user_id: '22398'
year: '2019'
...