---
_id: '21238'
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. Cooperative Android App Analysis with CoDiDroid. In:
Koziolek A, Schaefer I, Seidl C, eds. Software Engineering 2021. Gesellschaft
für Informatik e.V.; 2021:83-84. doi:10.18420/SE2021_30 '
apa: Pauck, F., & Wehrheim, H. (2021). Cooperative Android App Analysis with
CoDiDroid. In A. Koziolek, I. Schaefer, & C. Seidl (Eds.), Software Engineering
2021 (pp. 83–84). Gesellschaft für Informatik e.V. https://doi.org/10.18420/SE2021_30
bibtex: '@inproceedings{Pauck_Wehrheim_2021, place={Bonn}, title={Cooperative Android
App Analysis with CoDiDroid}, DOI={10.18420/SE2021_30 }, booktitle={Software Engineering 2021}, publisher={Gesellschaft
für Informatik e.V.}, author={Pauck, Felix and Wehrheim, Heike}, editor={Koziolek,
Anne and Schaefer, Ina and Seidl, Christoph}, year={2021}, pages={83–84} }'
chicago: 'Pauck, Felix, and Heike Wehrheim. “Cooperative Android App Analysis with
CoDiDroid.” In Software Engineering 2021, edited by Anne Koziolek, Ina
Schaefer, and Christoph Seidl, 83–84. Bonn: Gesellschaft für Informatik e.V.,
2021. https://doi.org/10.18420/SE2021_30
.'
ieee: 'F. Pauck and H. Wehrheim, “Cooperative Android App Analysis with CoDiDroid,”
in Software Engineering 2021, 2021, pp. 83–84, doi: 10.18420/SE2021_30 .'
mla: Pauck, Felix, and Heike Wehrheim. “Cooperative Android App Analysis with CoDiDroid.”
Software Engineering 2021, edited by Anne Koziolek et al., Gesellschaft
für Informatik e.V., 2021, pp. 83–84, doi:10.18420/SE2021_30 .
short: 'F. Pauck, H. Wehrheim, in: A. Koziolek, I. Schaefer, C. Seidl (Eds.), Software
Engineering 2021, Gesellschaft für Informatik e.V., Bonn, 2021, pp. 83–84.'
date_created: 2021-02-16T09:28:49Z
date_updated: 2023-01-18T08:35:20Z
department:
- _id: '77'
doi: '10.18420/SE2021_30 '
editor:
- first_name: Anne
full_name: Koziolek, Anne
last_name: Koziolek
- first_name: Ina
full_name: Schaefer, Ina
last_name: Schaefer
- first_name: Christoph
full_name: Seidl, Christoph
last_name: Seidl
language:
- iso: eng
page: ' 83-84 '
place: Bonn
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: Software Engineering 2021
publication_status: published
publisher: Gesellschaft für Informatik e.V.
status: public
title: Cooperative Android App Analysis with CoDiDroid
type: conference
user_id: '22398'
year: '2021'
...
---
_id: '29138'
author:
- first_name: Qazi Arbab
full_name: Ahmed, Qazi Arbab
id: '72764'
last_name: Ahmed
orcid: 0000-0002-1837-2254
citation:
ama: 'Ahmed QA. Hardware Trojans in Reconfigurable Computing. In: 2021 IFIP/IEEE
29th International Conference on Very Large Scale Integration (VLSI-SoC).
; 2021. doi:10.1109/vlsi-soc53125.2021.9606974'
apa: Ahmed, Q. A. (2021). Hardware Trojans in Reconfigurable Computing. 2021
IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC).
https://doi.org/10.1109/vlsi-soc53125.2021.9606974
bibtex: '@inproceedings{Ahmed_2021, title={Hardware Trojans in Reconfigurable Computing},
DOI={10.1109/vlsi-soc53125.2021.9606974},
booktitle={2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration
(VLSI-SoC)}, author={Ahmed, Qazi Arbab}, year={2021} }'
chicago: Ahmed, Qazi Arbab. “Hardware Trojans in Reconfigurable Computing.” In 2021
IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC),
2021. https://doi.org/10.1109/vlsi-soc53125.2021.9606974.
ieee: 'Q. A. Ahmed, “Hardware Trojans in Reconfigurable Computing,” 2021, doi: 10.1109/vlsi-soc53125.2021.9606974.'
mla: Ahmed, Qazi Arbab. “Hardware Trojans in Reconfigurable Computing.” 2021
IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC),
2021, doi:10.1109/vlsi-soc53125.2021.9606974.
short: 'Q.A. Ahmed, in: 2021 IFIP/IEEE 29th International Conference on Very Large
Scale Integration (VLSI-SoC), 2021.'
date_created: 2021-12-30T00:02:24Z
date_updated: 2023-04-19T15:03:45Z
department:
- _id: '78'
doi: 10.1109/vlsi-soc53125.2021.9606974
language:
- iso: eng
project:
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '12'
name: 'SFB 901 - B4: SFB 901 - Subproject B4'
- _id: '1'
name: 'SFB 901: SFB 901'
publication: 2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration
(VLSI-SoC)
publication_status: published
status: public
title: Hardware Trojans in Reconfigurable Computing
type: conference
user_id: '72764'
year: '2021'
...
---
_id: '20681'
abstract:
- lang: eng
text: The battle of developing hardware Trojans and corresponding countermeasures
has taken adversaries towards ingenious ways of compromising hardware designs
by circumventing even advanced testing and verification methods. Besides conventional
methods of inserting Trojans into a design by a malicious entity, the design flow
for field-programmable gate arrays (FPGAs) can also be surreptitiously compromised
to assist the attacker to perform a successful malfunctioning or information leakage
attack. The advanced stealthy malicious look-up-table (LUT) attack activates a
Trojan only when generating the FPGA bitstream and can thus not be detected by
register transfer and gate level testing and verification. However, also this
attack was recently revealed by a bitstream-level proof-carrying hardware (PCH)
approach. In this paper, we present a novel attack that leverages malicious routing
of the inserted Trojan circuit to acquire a dormant state even in the generated
and transmitted bitstream. The Trojan's payload is connected to primary inputs/outputs
of the FPGA via a programmable interconnect point (PIP). The Trojan is detached
from inputs/outputs during place-and-route and re-connected only when the FPGA
is being programmed, thus activating the Trojan circuit without any need for a
trigger logic. Since the Trojan is injected in a post-synthesis step and remains
unconnected in the bitstream, the presented attack can currently neither be prevented
by conventional testing and verification methods nor by recent bitstream-level
verification techniques.
author:
- first_name: Qazi Arbab
full_name: Ahmed, Qazi Arbab
id: '72764'
last_name: Ahmed
orcid: 0000-0002-1837-2254
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Ahmed QA, Wiersema T, Platzner M. Malicious Routing: Circumventing Bitstream-level
Verification for FPGAs. In: 2021 Design, Automation & Test in Europe Conference
& Exhibition (DATE). 2021 Design, Automation and Test in Europe Conference
(DATE); 2021. doi:10.23919/DATE51398.2021.9474026'
apa: 'Ahmed, Q. A., Wiersema, T., & Platzner, M. (2021). Malicious Routing:
Circumventing Bitstream-level Verification for FPGAs. 2021 Design, Automation
& Test in Europe Conference & Exhibition (DATE). Design, Automation
and Test in Europe Conference (DATE’21), Alpexpo | Grenoble, France. https://doi.org/10.23919/DATE51398.2021.9474026'
bibtex: '@inproceedings{Ahmed_Wiersema_Platzner_2021, place={Alpexpo | Grenoble,
France}, title={Malicious Routing: Circumventing Bitstream-level Verification
for FPGAs}, DOI={10.23919/DATE51398.2021.9474026},
booktitle={2021 Design, Automation & Test in Europe Conference & Exhibition
(DATE)}, publisher={2021 Design, Automation and Test in Europe Conference (DATE)},
author={Ahmed, Qazi Arbab and Wiersema, Tobias and Platzner, Marco}, year={2021}
}'
chicago: 'Ahmed, Qazi Arbab, Tobias Wiersema, and Marco Platzner. “Malicious Routing:
Circumventing Bitstream-Level Verification for FPGAs.” In 2021 Design, Automation
& Test in Europe Conference & Exhibition (DATE). Alpexpo | Grenoble,
France: 2021 Design, Automation and Test in Europe Conference (DATE), 2021. https://doi.org/10.23919/DATE51398.2021.9474026.'
ieee: 'Q. A. Ahmed, T. Wiersema, and M. Platzner, “Malicious Routing: Circumventing
Bitstream-level Verification for FPGAs,” presented at the Design, Automation and
Test in Europe Conference (DATE’21), Alpexpo | Grenoble, France, 2021, doi: 10.23919/DATE51398.2021.9474026.'
mla: 'Ahmed, Qazi Arbab, et al. “Malicious Routing: Circumventing Bitstream-Level
Verification for FPGAs.” 2021 Design, Automation & Test in Europe Conference
& Exhibition (DATE), 2021 Design, Automation and Test in Europe Conference
(DATE), 2021, doi:10.23919/DATE51398.2021.9474026.'
short: 'Q.A. Ahmed, T. Wiersema, M. Platzner, in: 2021 Design, Automation &
Test in Europe Conference & Exhibition (DATE), 2021 Design, Automation and
Test in Europe Conference (DATE), Alpexpo | Grenoble, France, 2021.'
conference:
end_date: 2021-02-05
location: Alpexpo | Grenoble, France
name: Design, Automation and Test in Europe Conference (DATE'21)
start_date: 2021-02-01
date_created: 2020-12-07T14:03:00Z
date_updated: 2023-05-11T09:16:34Z
ddc:
- '006'
department:
- _id: '78'
doi: 10.23919/DATE51398.2021.9474026
file:
- access_level: closed
content_type: application/pdf
creator: qazi
date_created: 2023-05-11T09:16:15Z
date_updated: 2023-05-11T09:16:15Z
file_id: '44752'
file_name: 1812.pdf
file_size: 394011
relation: main_file
success: 1
file_date_updated: 2023-05-11T09:16:15Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
oa: '1'
place: Alpexpo | Grenoble, France
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publication: 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE)
publication_identifier:
eisbn:
- 978-3-9819263-5-4
publication_status: published
publisher: 2021 Design, Automation and Test in Europe Conference (DATE)
status: public
title: 'Malicious Routing: Circumventing Bitstream-level Verification for FPGAs'
type: conference
user_id: '72764'
year: '2021'
...
---
_id: '26406'
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
- first_name: Richard
full_name: Leer, Richard
last_name: Leer
citation:
ama: 'Schubert P, Hermann B, Bodden E, Leer R. Into the Woods: Experiences from
Building a Dataflow Analysis Framework for C/C++. In: SCAM ’21: IEEE International
Working Conference on Source Code Analysis and Manipulation (Engineering Track).
; 2021.'
apa: 'Schubert, P., Hermann, B., Bodden, E., & Leer, R. (2021). Into the Woods:
Experiences from Building a Dataflow Analysis Framework for C/C++. SCAM ’21:
IEEE International Working Conference on Source Code Analysis and Manipulation
(Engineering Track).'
bibtex: '@inproceedings{Schubert_Hermann_Bodden_Leer_2021, title={Into the Woods:
Experiences from Building a Dataflow Analysis Framework for C/C++}, booktitle={SCAM
’21: IEEE International Working Conference on Source Code Analysis and Manipulation
(Engineering Track)}, author={Schubert, Philipp and Hermann, Ben and Bodden, Eric
and Leer, Richard}, year={2021} }'
chicago: 'Schubert, Philipp, Ben Hermann, Eric Bodden, and Richard Leer. “Into the
Woods: Experiences from Building a Dataflow Analysis Framework for C/C++.” In
SCAM ’21: IEEE International Working Conference on Source Code Analysis and
Manipulation (Engineering Track), 2021.'
ieee: 'P. Schubert, B. Hermann, E. Bodden, and R. Leer, “Into the Woods: Experiences
from Building a Dataflow Analysis Framework for C/C++,” 2021.'
mla: 'Schubert, Philipp, et al. “Into the Woods: Experiences from Building a Dataflow
Analysis Framework for C/C++.” SCAM ’21: IEEE International Working Conference
on Source Code Analysis and Manipulation (Engineering Track), 2021.'
short: 'P. Schubert, B. Hermann, E. Bodden, R. Leer, in: SCAM ’21: IEEE International
Working Conference on Source Code Analysis and Manipulation (Engineering Track),
2021.'
date_created: 2021-10-18T12:52:12Z
date_updated: 2023-06-15T08:39:55Z
department:
- _id: '76'
language:
- iso: eng
project:
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '12'
name: 'SFB 901 - B4: SFB 901 - Subproject B4'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
publication: 'SCAM ''21: IEEE International Working Conference on Source Code Analysis
and Manipulation (Engineering Track)'
status: public
title: 'Into the Woods: Experiences from Building a Dataflow Analysis Framework for
C/C++'
type: conference
user_id: '15249'
year: '2021'
...
---
_id: '45788'
author:
- first_name: Jonas
full_name: Bülling, Jonas
last_name: Bülling
citation:
ama: 'Bülling J. Political Speaker Transfer: Learning to Generate Text in the
Styles of Barack Obama and Donald Trump.; 2021.'
apa: 'Bülling, J. (2021). Political Speaker Transfer: Learning to Generate Text
in the Styles of Barack Obama and Donald Trump.'
bibtex: '@book{Bülling_2021, title={Political Speaker Transfer: Learning to Generate
Text in the Styles of Barack Obama and Donald Trump}, author={Bülling, Jonas},
year={2021} }'
chicago: 'Bülling, Jonas. Political Speaker Transfer: Learning to Generate Text
in the Styles of Barack Obama and Donald Trump, 2021.'
ieee: 'J. Bülling, Political Speaker Transfer: Learning to Generate Text in the
Styles of Barack Obama and Donald Trump. 2021.'
mla: 'Bülling, Jonas. Political Speaker Transfer: Learning to Generate Text in
the Styles of Barack Obama and Donald Trump. 2021.'
short: 'J. Bülling, Political Speaker Transfer: Learning to Generate Text in the
Styles of Barack Obama and Donald Trump, 2021.'
date_created: 2023-06-27T12:54:30Z
date_updated: 2023-07-05T07:32:18Z
department:
- _id: '600'
language:
- iso: eng
project:
- _id: '9'
grant_number: '160364472'
name: 'SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject
B1)'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
status: public
supervisor:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
title: 'Political Speaker Transfer: Learning to Generate Text in the Styles of Barack
Obama and Donald Trump'
type: mastersthesis
user_id: '477'
year: '2021'
...
---
_id: '45787'
author:
- first_name: Avishek
full_name: Mishra, Avishek
last_name: Mishra
citation:
ama: Mishra A. Computational Text Professionalization Using Neural Sequence-to-Sequence
Models.; 2021.
apa: Mishra, A. (2021). Computational Text Professionalization using Neural Sequence-to-Sequence
Models.
bibtex: '@book{Mishra_2021, title={Computational Text Professionalization using
Neural Sequence-to-Sequence Models}, author={Mishra, Avishek}, year={2021} }'
chicago: Mishra, Avishek. Computational Text Professionalization Using Neural
Sequence-to-Sequence Models, 2021.
ieee: A. Mishra, Computational Text Professionalization using Neural Sequence-to-Sequence
Models. 2021.
mla: Mishra, Avishek. Computational Text Professionalization Using Neural Sequence-to-Sequence
Models. 2021.
short: A. Mishra, Computational Text Professionalization Using Neural Sequence-to-Sequence
Models, 2021.
date_created: 2023-06-27T12:51:08Z
date_updated: 2023-07-05T07:32:50Z
department:
- _id: '600'
language:
- iso: eng
project:
- _id: '9'
grant_number: '160364472'
name: 'SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject
B1)'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
status: public
supervisor:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
title: Computational Text Professionalization using Neural Sequence-to-Sequence Models
type: mastersthesis
user_id: '477'
year: '2021'
...
---
_id: '21178'
abstract:
- lang: eng
text: "When engaging in argumentative discourse, skilled human debaters tailor\r\nclaims
to the beliefs of the audience, to construct effective arguments.\r\nRecently,
the field of computational argumentation witnessed extensive effort\r\nto address
the automatic generation of arguments. However, existing approaches\r\ndo not
perform any audience-specific adaptation. In this work, we aim to bridge\r\nthis
gap by studying the task of belief-based claim generation: Given a\r\ncontroversial
topic and a set of beliefs, generate an argumentative claim\r\ntailored to the
beliefs. To tackle this task, we model the people's prior\r\nbeliefs through their
stances on controversial topics and extend\r\nstate-of-the-art text generation
models to generate claims conditioned on the\r\nbeliefs. Our automatic evaluation
confirms the ability of our approach to adapt\r\nclaims to a set of given beliefs.
In a manual study, we additionally evaluate\r\nthe generated claims in terms of
informativeness and their likelihood to be\r\nuttered by someone with a respective
belief. Our results reveal the limitations\r\nof modeling users' beliefs based
on their stances, but demonstrate the\r\npotential of encoding beliefs into argumentative
texts, laying the ground for\r\nfuture exploration of audience reach."
author:
- first_name: Milad
full_name: Alshomary, Milad
id: '73059'
last_name: Alshomary
- first_name: Wei-Fan
full_name: Chen, Wei-Fan
id: '82920'
last_name: Chen
- first_name: Timon
full_name: Gurcke, Timon
id: '52174'
last_name: Gurcke
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
citation:
ama: 'Alshomary M, Chen W-F, Gurcke T, Wachsmuth H. Belief-based Generation of Argumentative
Claims. In: Proceedings of the 16th Conference of the European Chapter of the
Association for Computational Linguistics: Main Volume. Association for Computational
Linguistics; 2021:224-233. doi:10.18653/v1/2021.eacl-main.17'
apa: 'Alshomary, M., Chen, W.-F., Gurcke, T., & Wachsmuth, H. (2021). Belief-based
Generation of Argumentative Claims. Proceedings of the 16th Conference of the
European Chapter of the Association for Computational Linguistics: Main Volume,
224–233. https://doi.org/10.18653/v1/2021.eacl-main.17'
bibtex: '@inproceedings{Alshomary_Chen_Gurcke_Wachsmuth_2021, title={Belief-based
Generation of Argumentative Claims}, DOI={10.18653/v1/2021.eacl-main.17},
booktitle={Proceedings of the 16th Conference of the European Chapter of the Association
for Computational Linguistics: Main Volume}, publisher={Association for Computational
Linguistics}, author={Alshomary, Milad and Chen, Wei-Fan and Gurcke, Timon and
Wachsmuth, Henning}, year={2021}, pages={224–233} }'
chicago: 'Alshomary, Milad, Wei-Fan Chen, Timon Gurcke, and Henning Wachsmuth. “Belief-Based
Generation of Argumentative Claims.” In Proceedings of the 16th Conference
of the European Chapter of the Association for Computational Linguistics: Main
Volume, 224–33. Association for Computational Linguistics, 2021. https://doi.org/10.18653/v1/2021.eacl-main.17.'
ieee: 'M. Alshomary, W.-F. Chen, T. Gurcke, and H. Wachsmuth, “Belief-based Generation
of Argumentative Claims,” in Proceedings of the 16th Conference of the European
Chapter of the Association for Computational Linguistics: Main Volume, Online,
2021, pp. 224–233, doi: 10.18653/v1/2021.eacl-main.17.'
mla: 'Alshomary, Milad, et al. “Belief-Based Generation of Argumentative Claims.”
Proceedings of the 16th Conference of the European Chapter of the Association
for Computational Linguistics: Main Volume, Association for Computational
Linguistics, 2021, pp. 224–33, doi:10.18653/v1/2021.eacl-main.17.'
short: 'M. Alshomary, W.-F. Chen, T. Gurcke, H. Wachsmuth, in: Proceedings of the
16th Conference of the European Chapter of the Association for Computational Linguistics:
Main Volume, Association for Computational Linguistics, 2021, pp. 224–233.'
conference:
location: Online
name: 'Proceedings of the 16th Conference of the European Chapter of the Association
for Computational Linguistics: Main Volume'
date_created: 2021-02-05T08:00:07Z
date_updated: 2026-02-23T16:06:41Z
department:
- _id: '600'
doi: 10.18653/v1/2021.eacl-main.17
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/2021.eacl-main.17
page: 224-233
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 16th Conference of the European Chapter of the Association
for Computational Linguistics: Main Volume'
publisher: Association for Computational Linguistics
status: public
title: Belief-based Generation of Argumentative Claims
type: conference
user_id: '14972'
year: '2021'
...
---
_id: '26405'
author:
- first_name: Philipp
full_name: Schubert, Philipp
id: '60543'
last_name: Schubert
orcid: 0000-0002-8674-1859
- first_name: Florian
full_name: Sattler, Florian
last_name: Sattler
- first_name: Fabian Benedikt
full_name: Schiebel, Fabian Benedikt
id: '55745'
last_name: Schiebel
orcid: 0009-0008-6867-9802
- 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, Sattler F, Schiebel FB, Hermann B, Bodden E. Modeling the Effects
of Global Variables in Data-Flow Analysis for C/C++. In: 2021 IEEE 21st International
Working Conference on Source Code Analysis and Manipulation (SCAM). ; 2021.'
apa: Schubert, P., Sattler, F., Schiebel, F. B., Hermann, B., & Bodden, E. (2021).
Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++. 2021
IEEE 21st International Working Conference on Source Code Analysis and Manipulation
(SCAM).
bibtex: '@inproceedings{Schubert_Sattler_Schiebel_Hermann_Bodden_2021, title={Modeling
the Effects of Global Variables in Data-Flow Analysis for C/C++}, booktitle={2021
IEEE 21st International Working Conference on Source Code Analysis and Manipulation
(SCAM)}, author={Schubert, Philipp and Sattler, Florian and Schiebel, Fabian Benedikt
and Hermann, Ben and Bodden, Eric}, year={2021} }'
chicago: Schubert, Philipp, Florian Sattler, Fabian Benedikt Schiebel, Ben Hermann,
and Eric Bodden. “Modeling the Effects of Global Variables in Data-Flow Analysis
for C/C++.” In 2021 IEEE 21st International Working Conference on Source Code
Analysis and Manipulation (SCAM), 2021.
ieee: P. Schubert, F. Sattler, F. B. Schiebel, B. Hermann, and E. Bodden, “Modeling
the Effects of Global Variables in Data-Flow Analysis for C/C++,” 2021.
mla: Schubert, Philipp, et al. “Modeling the Effects of Global Variables in Data-Flow
Analysis for C/C++.” 2021 IEEE 21st International Working Conference on Source
Code Analysis and Manipulation (SCAM), 2021.
short: 'P. Schubert, F. Sattler, F.B. Schiebel, B. Hermann, E. Bodden, in: 2021
IEEE 21st International Working Conference on Source Code Analysis and Manipulation
(SCAM), 2021.'
date_created: 2021-10-18T12:50:35Z
date_updated: 2025-12-04T10:43:01Z
department:
- _id: '76'
language:
- iso: eng
project:
- _id: '12'
name: 'SFB 901 - B4: SFB 901 - Subproject B4'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '1'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
publication: 2021 IEEE 21st International Working Conference on Source Code Analysis
and Manipulation (SCAM)
status: public
title: Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++
type: conference
user_id: '15249'
year: '2021'
...
---
_id: '19656'
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. Automatic Fairness Testing of Machine Learning Models.
In: Proceedings of the 32th IFIP International Conference on Testing Software
and Systems (ICTSS). LNCS. Springer.'
apa: Sharma, A., & Wehrheim, H. (n.d.). Automatic Fairness Testing of Machine
Learning Models. In Proceedings of the 32th IFIP International Conference on
Testing Software and Systems (ICTSS). Springer.
bibtex: '@inproceedings{Sharma_Wehrheim, series={LNCS}, title={Automatic Fairness
Testing of Machine Learning Models}, booktitle={Proceedings of the 32th IFIP International
Conference on Testing Software and Systems (ICTSS)}, publisher={Springer}, author={Sharma,
Arnab and Wehrheim, Heike}, collection={LNCS} }'
chicago: Sharma, Arnab, and Heike Wehrheim. “Automatic Fairness Testing of Machine
Learning Models.” In Proceedings of the 32th IFIP International Conference
on Testing Software and Systems (ICTSS). LNCS. Springer, n.d.
ieee: A. Sharma and H. Wehrheim, “Automatic Fairness Testing of Machine Learning
Models,” in Proceedings of the 32th IFIP International Conference on Testing
Software and Systems (ICTSS).
mla: Sharma, Arnab, and Heike Wehrheim. “Automatic Fairness Testing of Machine Learning
Models.” Proceedings of the 32th IFIP International Conference on Testing Software
and Systems (ICTSS), Springer.
short: 'A. Sharma, H. Wehrheim, in: Proceedings of the 32th IFIP International Conference
on Testing Software and Systems (ICTSS), Springer, n.d.'
date_created: 2020-09-24T12:53:02Z
date_updated: 2022-01-06T06:54:09Z
department:
- _id: '7'
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 32th IFIP International Conference on Testing Software
and Systems (ICTSS)
publication_status: accepted
publisher: Springer
series_title: LNCS
status: public
title: Automatic Fairness Testing of Machine Learning Models
type: conference
user_id: '477'
year: '2020'
...
---
_id: '19999'
author:
- first_name: Stefan
full_name: Mayer, Stefan
last_name: Mayer
citation:
ama: Mayer S. Optimierung von JMCTest Beim Testen von Inter Method Contracts.
Universität Paderborn; 2020.
apa: Mayer, S. (2020). Optimierung von JMCTest beim Testen von Inter Method Contracts.
Universität Paderborn.
bibtex: '@book{Mayer_2020, title={Optimierung von JMCTest beim Testen von Inter
Method Contracts}, publisher={Universität Paderborn}, author={Mayer, Stefan},
year={2020} }'
chicago: Mayer, Stefan. Optimierung von JMCTest Beim Testen von Inter Method
Contracts. Universität Paderborn, 2020.
ieee: S. Mayer, Optimierung von JMCTest beim Testen von Inter Method Contracts.
Universität Paderborn, 2020.
mla: Mayer, Stefan. Optimierung von JMCTest Beim Testen von Inter Method Contracts.
Universität Paderborn, 2020.
short: S. Mayer, Optimierung von JMCTest Beim Testen von Inter Method Contracts,
Universität Paderborn, 2020.
date_created: 2020-10-15T05:15:46Z
date_updated: 2022-01-06T06:54:18Z
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: Optimierung von JMCTest beim Testen von Inter Method Contracts
type: bachelorsthesis
user_id: '477'
year: '2020'
...
---
_id: '17347'
abstract:
- lang: eng
text: Peer-to-Peer news portals allow Internet users to write news articles and
make them available online to interested readers. Despite the fact that authors
are free in their choice of topics, there are a number of quality characteristics
that an article must meet before it is published. In addition to meaningful titles,
comprehensibly written texts and meaning- ful images, relevant tags are an important
criteria for the quality of such news. In this case study, we discuss the challenges
and common mistakes that Peer-to-Peer reporters face when tagging news and how
incorrect information can be corrected through the orchestration of existing Natu-
ral Language Processing services. Lastly, we use this illustrative example to
give insight into the challenges of dealing with bottom-up taxonomies.
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: Bianca
full_name: Buff, Bianca
last_name: Buff
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
citation:
ama: 'Bäumer FS, Kersting J, Buff B, Geierhos M. Tag Me If You Can: Insights into
the Challenges of Supporting Unrestricted P2P News Tagging. In: Audrius L, Rita
B, Daina G, Vilma S, eds. Information and Software Technologies. Vol 1283.
Communications in Computer and Information Science. Springer; 2020:368--382. doi:https://doi.org/10.1007/978-3-030-59506-7_30'
apa: 'Bäumer, F. S., Kersting, J., Buff, B., & Geierhos, M. (2020). Tag Me If
You Can: Insights into the Challenges of Supporting Unrestricted P2P News Tagging.
In L. Audrius, B. Rita, G. Daina, & S. Vilma (Eds.), Information and Software
Technologies (Vol. 1283, pp. 368--382). Kaunas, Litauen: Springer. https://doi.org/10.1007/978-3-030-59506-7_30'
bibtex: '@inbook{Bäumer_Kersting_Buff_Geierhos_2020, series={Communications in Computer
and Information Science}, title={Tag Me If You Can: Insights into the Challenges
of Supporting Unrestricted P2P News Tagging}, volume={1283}, DOI={https://doi.org/10.1007/978-3-030-59506-7_30},
booktitle={Information and Software Technologies}, publisher={Springer}, author={Bäumer,
Frederik Simon and Kersting, Joschka and Buff, Bianca and Geierhos, Michaela},
editor={Audrius, Lopata and Rita, Butkienė and Daina, Gudonienė and Vilma, SukackėEditors},
year={2020}, pages={368--382}, collection={Communications in Computer and Information
Science} }'
chicago: 'Bäumer, Frederik Simon, Joschka Kersting, Bianca Buff, and Michaela Geierhos.
“Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted P2P
News Tagging.” In Information and Software Technologies, edited by Lopata
Audrius, Butkienė Rita, Gudonienė Daina, and Sukackė Vilma, 1283:368--382. Communications
in Computer and Information Science. Springer, 2020. https://doi.org/10.1007/978-3-030-59506-7_30.'
ieee: 'F. S. Bäumer, J. Kersting, B. Buff, and M. Geierhos, “Tag Me If You Can:
Insights into the Challenges of Supporting Unrestricted P2P News Tagging,” in
Information and Software Technologies, vol. 1283, L. Audrius, B. Rita,
G. Daina, and S. Vilma, Eds. Springer, 2020, pp. 368--382.'
mla: 'Bäumer, Frederik Simon, et al. “Tag Me If You Can: Insights into the Challenges
of Supporting Unrestricted P2P News Tagging.” Information and Software Technologies,
edited by Lopata Audrius et al., vol. 1283, Springer, 2020, pp. 368--382, doi:https://doi.org/10.1007/978-3-030-59506-7_30.'
short: 'F.S. Bäumer, J. Kersting, B. Buff, M. Geierhos, in: L. Audrius, B. Rita,
G. Daina, S. Vilma (Eds.), Information and Software Technologies, Springer, 2020,
pp. 368--382.'
conference:
end_date: 2020-10-17
location: Kaunas, Litauen
name: 26th International Conference on Information and Software Technologies (ICIST
2020)
start_date: 2020-10-15
date_created: 2020-06-26T14:23:52Z
date_updated: 2022-01-06T06:53:08Z
ddc:
- '004'
department:
- _id: '579'
- _id: '1'
- _id: '36'
doi: https://doi.org/10.1007/978-3-030-59506-7_30
editor:
- first_name: Lopata
full_name: Audrius, Lopata
last_name: Audrius
- first_name: Butkienė
full_name: Rita, Butkienė
last_name: Rita
- first_name: Gudonienė
full_name: Daina, Gudonienė
last_name: Daina
- first_name: Sukackė
full_name: Vilma, Sukackė
last_name: Vilma
file:
- access_level: closed
content_type: application/pdf
creator: jkers
date_created: 2020-11-07T19:47:30Z
date_updated: 2020-11-07T19:47:30Z
file_id: '20309'
file_name: Bäumer et al. (2020), Baeumer2020.pdf .pdf
file_size: 599881
relation: main_file
success: 1
file_date_updated: 2020-11-07T19:47:30Z
has_accepted_license: '1'
intvolume: ' 1283'
language:
- iso: eng
page: 368--382
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: Information and Software Technologies
publication_status: published
publisher: Springer
series_title: Communications in Computer and Information Science
status: public
title: 'Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted
P2P News Tagging'
type: book_chapter
user_id: '58701'
volume: 1283
year: '2020'
...
---
_id: '17358'
abstract:
- lang: eng
text: 'Approximate circuits trade-off computational accuracy against improvements
in hardware area, delay, or energy consumption. IP core vendors who wish to create
such circuits need to convince consumers of the resulting approximation quality.
As a solution we propose proof-carrying approximate circuits: The vendor creates
an approximate IP core together with a certificate that proves the approximation
quality. The proof certificate is bundled with the approximate IP core and sent
off to the consumer. The consumer can formally verify the approximation quality
of the IP core at a fraction of the typical computational cost for formal verification.
In this paper, we first make the case for proof-carrying approximate circuits
and then demonstrate the feasibility of the approach by a set of synthesis experiments
using an exemplary approximation framework.'
article_type: original
author:
- first_name: Linus Matthias
full_name: Witschen, Linus Matthias
id: '49051'
last_name: Witschen
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: Witschen LM, Wiersema T, Platzner M. Proof-carrying Approximate Circuits. IEEE
Transactions On Very Large Scale Integration Systems. 2020;28(9):2084-2088.
doi:10.1109/TVLSI.2020.3008061
apa: Witschen, L. M., Wiersema, T., & Platzner, M. (2020). Proof-carrying Approximate
Circuits. IEEE Transactions On Very Large Scale Integration Systems, 28(9),
2084–2088. https://doi.org/10.1109/TVLSI.2020.3008061
bibtex: '@article{Witschen_Wiersema_Platzner_2020, title={Proof-carrying Approximate
Circuits}, volume={28}, DOI={10.1109/TVLSI.2020.3008061},
number={9}, journal={IEEE Transactions On Very Large Scale Integration Systems},
publisher={IEEE}, author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner,
Marco}, year={2020}, pages={2084–2088} }'
chicago: 'Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Proof-Carrying
Approximate Circuits.” IEEE Transactions On Very Large Scale Integration Systems
28, no. 9 (2020): 2084–88. https://doi.org/10.1109/TVLSI.2020.3008061.'
ieee: L. M. Witschen, T. Wiersema, and M. Platzner, “Proof-carrying Approximate
Circuits,” IEEE Transactions On Very Large Scale Integration Systems, vol.
28, no. 9, pp. 2084–2088, 2020.
mla: Witschen, Linus Matthias, et al. “Proof-Carrying Approximate Circuits.” IEEE
Transactions On Very Large Scale Integration Systems, vol. 28, no. 9, IEEE,
2020, pp. 2084–88, doi:10.1109/TVLSI.2020.3008061.
short: L.M. Witschen, T. Wiersema, M. Platzner, IEEE Transactions On Very Large
Scale Integration Systems 28 (2020) 2084–2088.
date_created: 2020-07-06T11:21:30Z
date_updated: 2022-01-06T06:53:09Z
department:
- _id: '78'
doi: 10.1109/TVLSI.2020.3008061
funded_apc: '1'
intvolume: ' 28'
issue: '9'
keyword:
- Approximate circuit synthesis
- approximate computing
- error metrics
- formal verification
- proof-carrying hardware
language:
- iso: eng
page: 2084 - 2088
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publication: IEEE Transactions On Very Large Scale Integration Systems
publication_identifier:
eissn:
- 1557-9999
issn:
- 1063-8210
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: Proof-carrying Approximate Circuits
type: journal_article
user_id: '49051'
volume: 28
year: '2020'
...
---
_id: '17407'
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. Extreme Algorithm Selection with Dyadic
Feature Representation. In: Discovery Science. ; 2020.'
apa: Tornede, A., Wever, M. D., & Hüllermeier, E. (2020). Extreme Algorithm
Selection with Dyadic Feature Representation. Discovery Science. Discovery
Science 2020.
bibtex: '@inproceedings{Tornede_Wever_Hüllermeier_2020, title={Extreme Algorithm
Selection with Dyadic Feature Representation}, booktitle={Discovery Science},
author={Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2020}
}'
chicago: Tornede, Alexander, Marcel Dominik Wever, and Eyke Hüllermeier. “Extreme
Algorithm Selection with Dyadic Feature Representation.” In Discovery Science,
2020.
ieee: A. Tornede, M. D. Wever, and E. Hüllermeier, “Extreme Algorithm Selection
with Dyadic Feature Representation,” presented at the Discovery Science 2020,
2020.
mla: Tornede, Alexander, et al. “Extreme Algorithm Selection with Dyadic Feature
Representation.” Discovery Science, 2020.
short: 'A. Tornede, M.D. Wever, E. Hüllermeier, in: Discovery Science, 2020.'
conference:
name: Discovery Science 2020
date_created: 2020-07-21T10:06:51Z
date_updated: 2022-01-06T06:53:10Z
department:
- _id: '34'
- _id: '355'
- _id: '26'
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
publication: Discovery Science
status: public
title: Extreme Algorithm Selection with Dyadic Feature Representation
type: conference
user_id: '5786'
year: '2020'
...
---
_id: '17408'
author:
- first_name: Jonas Manuel
full_name: Hanselle, Jonas Manuel
id: '43980'
last_name: Hanselle
orcid: 0000-0002-1231-4985
- 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: 'Hanselle JM, Tornede A, Wever MD, Hüllermeier E. Hybrid Ranking and Regression
for Algorithm Selection. In: KI 2020: Advances in Artificial Intelligence.
; 2020.'
apa: 'Hanselle, J. M., Tornede, A., Wever, M. D., & Hüllermeier, E. (2020).
Hybrid Ranking and Regression for Algorithm Selection. KI 2020: Advances in
Artificial Intelligence. 43rd German Conference on Artificial Intelligence.'
bibtex: '@inproceedings{Hanselle_Tornede_Wever_Hüllermeier_2020, title={Hybrid Ranking
and Regression for Algorithm Selection}, booktitle={KI 2020: Advances in Artificial
Intelligence}, author={Hanselle, Jonas Manuel and Tornede, Alexander and Wever,
Marcel Dominik and Hüllermeier, Eyke}, year={2020} }'
chicago: 'Hanselle, Jonas Manuel, Alexander Tornede, Marcel Dominik Wever, and Eyke
Hüllermeier. “Hybrid Ranking and Regression for Algorithm Selection.” In KI
2020: Advances in Artificial Intelligence, 2020.'
ieee: J. M. Hanselle, A. Tornede, M. D. Wever, and E. Hüllermeier, “Hybrid Ranking
and Regression for Algorithm Selection,” presented at the 43rd German Conference
on Artificial Intelligence, 2020.
mla: 'Hanselle, Jonas Manuel, et al. “Hybrid Ranking and Regression for Algorithm
Selection.” KI 2020: Advances in Artificial Intelligence, 2020.'
short: 'J.M. Hanselle, A. Tornede, M.D. Wever, E. Hüllermeier, in: KI 2020: Advances
in Artificial Intelligence, 2020.'
conference:
name: 43rd German Conference on Artificial Intelligence
date_created: 2020-07-21T10:21:09Z
date_updated: 2022-01-06T06:53:10Z
department:
- _id: '34'
- _id: '355'
- _id: '26'
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
publication: 'KI 2020: Advances in Artificial Intelligence'
status: public
title: Hybrid Ranking and Regression for Algorithm Selection
type: conference
user_id: '5786'
year: '2020'
...
---
_id: '17424'
author:
- first_name: Tanja
full_name: Tornede, Tanja
id: '40795'
last_name: Tornede
- 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: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Tornede T, Tornede A, Wever MD, Mohr F, Hüllermeier E. AutoML for Predictive
Maintenance: One Tool to RUL Them All. In: Proceedings of the ECMLPKDD 2020.
; 2020. doi:10.1007/978-3-030-66770-2_8'
apa: 'Tornede, T., Tornede, A., Wever, M. D., Mohr, F., & Hüllermeier, E. (2020).
AutoML for Predictive Maintenance: One Tool to RUL Them All. Proceedings of
the ECMLPKDD 2020. IOTStream Workshop @ ECMLPKDD 2020. https://doi.org/10.1007/978-3-030-66770-2_8'
bibtex: '@inproceedings{Tornede_Tornede_Wever_Mohr_Hüllermeier_2020, title={AutoML
for Predictive Maintenance: One Tool to RUL Them All}, DOI={10.1007/978-3-030-66770-2_8},
booktitle={Proceedings of the ECMLPKDD 2020}, author={Tornede, Tanja and Tornede,
Alexander and Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2020}
}'
chicago: 'Tornede, Tanja, Alexander Tornede, Marcel Dominik Wever, Felix Mohr, and
Eyke Hüllermeier. “AutoML for Predictive Maintenance: One Tool to RUL Them All.”
In Proceedings of the ECMLPKDD 2020, 2020. https://doi.org/10.1007/978-3-030-66770-2_8.'
ieee: 'T. Tornede, A. Tornede, M. D. Wever, F. Mohr, and E. Hüllermeier, “AutoML
for Predictive Maintenance: One Tool to RUL Them All,” presented at the IOTStream
Workshop @ ECMLPKDD 2020, 2020, doi: 10.1007/978-3-030-66770-2_8.'
mla: 'Tornede, Tanja, et al. “AutoML for Predictive Maintenance: One Tool to RUL
Them All.” Proceedings of the ECMLPKDD 2020, 2020, doi:10.1007/978-3-030-66770-2_8.'
short: 'T. Tornede, A. Tornede, M.D. Wever, F. Mohr, E. Hüllermeier, in: Proceedings
of the ECMLPKDD 2020, 2020.'
conference:
name: IOTStream Workshop @ ECMLPKDD 2020
date_created: 2020-07-28T09:17:41Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '34'
- _id: '355'
- _id: '26'
doi: 10.1007/978-3-030-66770-2_8
language:
- iso: eng
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '1'
name: SFB 901
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Proceedings of the ECMLPKDD 2020
status: public
title: 'AutoML for Predictive Maintenance: One Tool to RUL Them All'
type: conference
user_id: '5786'
year: '2020'
...
---
_id: '18686'
author:
- first_name: Joschka
full_name: Kersting, Joschka
id: '58701'
last_name: Kersting
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
citation:
ama: 'Kersting J, Bäumer FS. SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS: A TRANSFORMER-BASED
APPROACH. In: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING
2020. IADIS; 2020:119--123.'
apa: 'Kersting, J., & Bäumer, F. S. (2020). SEMANTIC TAGGING OF REQUIREMENT
DESCRIPTIONS: A TRANSFORMER-BASED APPROACH. PROCEEDINGS OF THE INTERNATIONAL
CONFERENCE ON APPLIED COMPUTING 2020, 119--123.'
bibtex: '@inproceedings{Kersting_Bäumer_2020, title={SEMANTIC TAGGING OF REQUIREMENT
DESCRIPTIONS: A TRANSFORMER-BASED APPROACH}, booktitle={PROCEEDINGS OF THE INTERNATIONAL
CONFERENCE ON APPLIED COMPUTING 2020}, publisher={IADIS}, author={Kersting, Joschka
and Bäumer, Frederik Simon}, year={2020}, pages={119--123} }'
chicago: 'Kersting, Joschka, and Frederik Simon Bäumer. “SEMANTIC TAGGING OF REQUIREMENT
DESCRIPTIONS: A TRANSFORMER-BASED APPROACH.” In PROCEEDINGS OF THE INTERNATIONAL
CONFERENCE ON APPLIED COMPUTING 2020, 119--123. IADIS, 2020.'
ieee: 'J. Kersting and F. S. Bäumer, “SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS:
A TRANSFORMER-BASED APPROACH,” in PROCEEDINGS OF THE INTERNATIONAL CONFERENCE
ON APPLIED COMPUTING 2020, Lisbon, Portugal, 2020, pp. 119--123.'
mla: 'Kersting, Joschka, and Frederik Simon Bäumer. “SEMANTIC TAGGING OF REQUIREMENT
DESCRIPTIONS: A TRANSFORMER-BASED APPROACH.” PROCEEDINGS OF THE INTERNATIONAL
CONFERENCE ON APPLIED COMPUTING 2020, IADIS, 2020, pp. 119--123.'
short: 'J. Kersting, F.S. Bäumer, in: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE
ON APPLIED COMPUTING 2020, IADIS, 2020, pp. 119--123.'
conference:
end_date: 20.11.2020
location: Lisbon, Portugal
name: 17th International Conference on Applied Computing
start_date: 18.11.2020
date_created: 2020-08-31T10:59:54Z
date_updated: 2022-01-06T06:53:51Z
ddc:
- '000'
department:
- _id: '579'
file:
- access_level: closed
content_type: application/pdf
creator: jkers
date_created: 2020-11-19T17:29:03Z
date_updated: 2020-11-19T17:29:03Z
file_id: '20443'
file_name: Kersting & Bäumer (2020), Kersting2020d.pdf
file_size: 1064877
relation: main_file
success: 1
file_date_updated: 2020-11-19T17:29:03Z
has_accepted_license: '1'
keyword:
- Software Requirements
- Natural Language Processing
- Transfer Learning
- On-The-Fly Computing
language:
- iso: eng
page: 119--123
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING 2020
publisher: IADIS
status: public
title: 'SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS: A TRANSFORMER-BASED APPROACH'
type: conference
user_id: '58701'
year: '2020'
...
---
_id: '20306'
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. Towards Meta-Algorithm Selection. In:
Workshop MetaLearn 2020 @ NeurIPS 2020. ; 2020.'
apa: Tornede, A., Wever, M. D., & Hüllermeier, E. (2020). Towards Meta-Algorithm
Selection. Workshop MetaLearn 2020 @ NeurIPS 2020. Workshop MetaLearn 2020
@ NeurIPS 2020, Online.
bibtex: '@inproceedings{Tornede_Wever_Hüllermeier_2020, title={Towards Meta-Algorithm
Selection}, booktitle={Workshop MetaLearn 2020 @ NeurIPS 2020}, author={Tornede,
Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2020} }'
chicago: Tornede, Alexander, Marcel Dominik Wever, and Eyke Hüllermeier. “Towards
Meta-Algorithm Selection.” In Workshop MetaLearn 2020 @ NeurIPS 2020, 2020.
ieee: A. Tornede, M. D. Wever, and E. Hüllermeier, “Towards Meta-Algorithm Selection,”
presented at the Workshop MetaLearn 2020 @ NeurIPS 2020, Online, 2020.
mla: Tornede, Alexander, et al. “Towards Meta-Algorithm Selection.” Workshop
MetaLearn 2020 @ NeurIPS 2020, 2020.
short: 'A. Tornede, M.D. Wever, E. Hüllermeier, in: Workshop MetaLearn 2020 @ NeurIPS
2020, 2020.'
conference:
location: Online
name: Workshop MetaLearn 2020 @ NeurIPS 2020
date_created: 2020-11-06T09:42:27Z
date_updated: 2022-01-06T06:54:26Z
department:
- _id: '34'
- _id: '355'
- _id: '26'
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
publication: Workshop MetaLearn 2020 @ NeurIPS 2020
status: public
title: Towards Meta-Algorithm Selection
type: conference
user_id: '5786'
year: '2020'
...
---
_id: '20712'
author:
- first_name: Philipp
full_name: Schubert, Philipp
id: '60543'
last_name: Schubert
orcid: 0000-0002-8674-1859
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Ben
full_name: Hermann, Ben
id: '66173'
last_name: Hermann
orcid: 0000-0001-9848-2017
citation:
ama: Schubert P, Bodden E, Hermann B. Accelerating Static Call-Graph, Points-to
and Data-Flow Analysis Through Persisted Summaries.; 2020.
apa: Schubert, P., Bodden, E., & Hermann, B. (2020). Accelerating Static
Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries.
bibtex: '@book{Schubert_Bodden_Hermann_2020, title={Accelerating Static Call-Graph,
Points-to and Data-Flow Analysis Through Persisted Summaries}, author={Schubert,
Philipp and Bodden, Eric and Hermann, Ben}, year={2020} }'
chicago: Schubert, Philipp, Eric Bodden, and Ben Hermann. Accelerating Static
Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries,
2020.
ieee: P. Schubert, E. Bodden, and B. Hermann, Accelerating Static Call-Graph,
Points-to and Data-Flow Analysis Through Persisted Summaries. 2020.
mla: Schubert, Philipp, et al. Accelerating Static Call-Graph, Points-to and
Data-Flow Analysis Through Persisted Summaries. 2020.
short: P. Schubert, E. Bodden, B. Hermann, Accelerating Static Call-Graph, Points-to
and Data-Flow Analysis Through Persisted Summaries, 2020.
date_created: 2020-12-14T07:44:11Z
date_updated: 2022-01-06T06:54:34Z
ddc:
- '000'
department:
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: pdschbrt
date_created: 2020-12-14T07:39:07Z
date_updated: 2020-12-14T07:39:07Z
file_id: '20713'
file_name: main.pdf
file_size: 683576
relation: main_file
success: 1
file_date_updated: 2020-12-14T07:39:07Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
status: public
title: Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted
Summaries
type: report
user_id: '477'
year: '2020'
...
---
_id: '20748'
abstract:
- lang: eng
text: "On the circuit level, the design paradigm Approximate Computing seeks to
trade off computational accuracy against a target metric, e.g., energy consumption.
This trade-off is possible for many applications due to their inherent resiliency
against inaccuracies.\r\nIn the past, several automated approximation frameworks
have been presented, which either utilize designated approximation techniques
or libraries to replace approximable circuit parts with inaccurate versions. The
frameworks invoke a search algorithm to iteratively explore the search space of
performance degraded circuits, and validate their quality individually. \r\nIn
this paper, we propose to reverse this procedure. Rather than exploring the search
space, we delineate the approximate parts of the search space which are guaranteed
to lead to valid approximate circuits. Our methodology is supported by formal
verification and independent of approximation techniques. Eventually, the user
is provided with quality bounds of the individual approximable circuit parts.
Consequently, our approach guarantees that any approximate circuit which implements
these parts within the determined quality constraints satisfies the global quality
constraints, superseding a subsequent quality verification.\r\nIn our experimental
results, we present the runtimes of our approach."
author:
- first_name: Linus Matthias
full_name: Witschen, Linus Matthias
id: '49051'
last_name: Witschen
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: Witschen LM, Wiersema T, Platzner M. Search Space Characterization for AxC
Synthesis. Fifth Workshop on Approximate Computing (AxC 2020).
apa: Witschen, L. M., Wiersema, T., & Platzner, M. (n.d.). Search Space Characterization
for AxC Synthesis. Fifth Workshop on Approximate Computing (AxC 2020).
bibtex: '@article{Witschen_Wiersema_Platzner, title={Search Space Characterization
for AxC Synthesis}, journal={Fifth Workshop on Approximate Computing (AxC 2020)},
author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco} }'
chicago: Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Search
Space Characterization for AxC Synthesis.” Fifth Workshop on Approximate Computing
(AxC 2020), n.d.
ieee: L. M. Witschen, T. Wiersema, and M. Platzner, “Search Space Characterization
for AxC Synthesis,” Fifth Workshop on Approximate Computing (AxC 2020).
.
mla: Witschen, Linus Matthias, et al. “Search Space Characterization for AxC Synthesis.”
Fifth Workshop on Approximate Computing (AxC 2020).
short: L.M. Witschen, T. Wiersema, M. Platzner, Fifth Workshop on Approximate Computing
(AxC 2020) (n.d.).
date_created: 2020-12-15T15:13:49Z
date_updated: 2022-01-06T06:54:35Z
ddc:
- '000'
department:
- _id: '78'
file:
- access_level: closed
content_type: application/pdf
creator: witschen
date_created: 2020-12-15T15:11:06Z
date_updated: 2020-12-15T15:11:06Z
file_id: '20749'
file_name: witschen20_axc.pdf
file_size: 250870
relation: main_file
success: 1
file_date_updated: 2020-12-15T15:11:06Z
has_accepted_license: '1'
language:
- iso: eng
page: '2'
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publication: Fifth Workshop on Approximate Computing (AxC 2020)
publication_status: accepted
status: public
title: Search Space Characterization for AxC Synthesis
type: preprint
user_id: '3118'
year: '2020'
...
---
_id: '18276'
abstract:
- lang: eng
text: "Algorithm selection (AS) deals with the automatic selection of an algorithm\r\nfrom
a fixed set of candidate algorithms most suitable for a specific instance\r\nof
an algorithmic problem class, where \"suitability\" often refers to an\r\nalgorithm's
runtime. Due to possibly extremely long runtimes of candidate\r\nalgorithms, training
data for algorithm selection models is usually generated\r\nunder time constraints
in the sense that not all algorithms are run to\r\ncompletion on all instances.
Thus, training data usually comprises censored\r\ninformation, as the true runtime
of algorithms timed out remains unknown.\r\nHowever, many standard AS approaches
are not able to handle such information in\r\na proper way. On the other side,
survival analysis (SA) naturally supports\r\ncensored data and offers appropriate
ways to use such data for learning\r\ndistributional models of algorithm runtime,
as we demonstrate in this work. We\r\nleverage such models as a basis of a sophisticated
decision-theoretic approach\r\nto algorithm selection, which we dub Run2Survive.
Moreover, taking advantage of\r\na framework of this kind, we advocate a risk-averse
approach to algorithm\r\nselection, in which the avoidance of a timeout is given
high priority. In an\r\nextensive experimental study with the standard benchmark
ASlib, our approach is\r\nshown to be highly competitive and in many cases even
superior to\r\nstate-of-the-art AS approaches."
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: Stefan
full_name: Werner, Stefan
last_name: Werner
- 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: 'Tornede A, Wever MD, Werner S, Mohr F, Hüllermeier E. Run2Survive: A Decision-theoretic
Approach to Algorithm Selection based on Survival Analysis. In: ACML 2020.
; 2020.'
apa: 'Tornede, A., Wever, M. D., Werner, S., Mohr, F., & Hüllermeier, E. (2020).
Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival
Analysis. ACML 2020. 12th Asian Conference on Machine Learning, Bangkok,
Thailand.'
bibtex: '@inproceedings{Tornede_Wever_Werner_Mohr_Hüllermeier_2020, title={Run2Survive:
A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis},
booktitle={ACML 2020}, author={Tornede, Alexander and Wever, Marcel Dominik and
Werner, Stefan and Mohr, Felix and Hüllermeier, Eyke}, year={2020} }'
chicago: 'Tornede, Alexander, Marcel Dominik Wever, Stefan Werner, Felix Mohr, and
Eyke Hüllermeier. “Run2Survive: A Decision-Theoretic Approach to Algorithm Selection
Based on Survival Analysis.” In ACML 2020, 2020.'
ieee: 'A. Tornede, M. D. Wever, S. Werner, F. Mohr, and E. Hüllermeier, “Run2Survive:
A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis,”
presented at the 12th Asian Conference on Machine Learning, Bangkok, Thailand,
2020.'
mla: 'Tornede, Alexander, et al. “Run2Survive: A Decision-Theoretic Approach to
Algorithm Selection Based on Survival Analysis.” ACML 2020, 2020.'
short: 'A. Tornede, M.D. Wever, S. Werner, F. Mohr, E. Hüllermeier, in: ACML 2020,
2020.'
conference:
end_date: 2020-11-20
location: Bangkok, Thailand
name: 12th Asian Conference on Machine Learning
start_date: 2020-11-18
date_created: 2020-08-25T12:09:28Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '34'
- _id: '355'
- _id: '26'
language:
- iso: eng
main_file_link:
- url: https://arxiv.org/pdf/2007.02816.pdf
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: ACML 2020
status: public
title: 'Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on
Survival Analysis'
type: conference
user_id: '5786'
year: '2020'
...