---
_id: '11959'
author:
- first_name: Moritz
full_name: Wegener, Moritz
last_name: Wegener
citation:
ama: Wegener M. It’s a match! - Entwicklung eines Ansatzes zur Identifikation
von Cross-Listings auf Airbnb und TripAdvisor.; 2019.
apa: Wegener, M. (2019). It’s a match! - Entwicklung eines Ansatzes zur Identifikation
von Cross-Listings auf Airbnb und TripAdvisor.
bibtex: '@book{Wegener_2019, place={Universität Paderborn}, title={It’s a match!
- Entwicklung eines Ansatzes zur Identifikation von Cross-Listings auf Airbnb
und TripAdvisor}, author={Wegener, Moritz}, year={2019} }'
chicago: Wegener, Moritz. It’s a match! - Entwicklung eines Ansatzes zur Identifikation
von Cross-Listings auf Airbnb und TripAdvisor. Universität Paderborn, 2019.
ieee: M. Wegener, It’s a match! - Entwicklung eines Ansatzes zur Identifikation
von Cross-Listings auf Airbnb und TripAdvisor. Universität Paderborn, 2019.
mla: Wegener, Moritz. It’s a match! - Entwicklung eines Ansatzes zur Identifikation
von Cross-Listings auf Airbnb und TripAdvisor. 2019.
short: M. Wegener, It’s a match! - Entwicklung eines Ansatzes zur Identifikation
von Cross-Listings auf Airbnb und TripAdvisor, Universität Paderborn, 2019.
date_created: 2019-07-16T10:04:30Z
date_updated: 2022-07-14T13:13:43Z
language:
- iso: other
place: Universität Paderborn
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
status: public
supervisor:
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
title: It's a match! - Entwicklung eines Ansatzes zur Identifikation von Cross-Listings
auf Airbnb und TripAdvisor
type: mastersthesis
user_id: '16205'
year: '2019'
...
---
_id: '13449'
author:
- first_name: Gabriele
full_name: Gerzen, Gabriele
last_name: Gerzen
citation:
ama: Gerzen G. Do Online Ratings Matter in the Sharing Economy? Analyzing the
Impact of Online Ratings on Demand on Airbnb.; 2019.
apa: Gerzen, G. (2019). Do Online Ratings Matter in the Sharing Economy? Analyzing
the Impact of Online Ratings on Demand on Airbnb.
bibtex: '@book{Gerzen_2019, place={Universität Paderborn}, title={Do Online Ratings
Matter in the Sharing Economy? Analyzing the Impact of Online Ratings on Demand
on Airbnb}, author={Gerzen, Gabriele}, year={2019} }'
chicago: Gerzen, Gabriele. Do Online Ratings Matter in the Sharing Economy? Analyzing
the Impact of Online Ratings on Demand on Airbnb. Universität Paderborn, 2019.
ieee: G. Gerzen, Do Online Ratings Matter in the Sharing Economy? Analyzing the
Impact of Online Ratings on Demand on Airbnb. Universität Paderborn, 2019.
mla: Gerzen, Gabriele. Do Online Ratings Matter in the Sharing Economy? Analyzing
the Impact of Online Ratings on Demand on Airbnb. 2019.
short: G. Gerzen, Do Online Ratings Matter in the Sharing Economy? Analyzing the
Impact of Online Ratings on Demand on Airbnb, Universität Paderborn, 2019.
date_created: 2019-09-25T15:13:25Z
date_updated: 2022-07-14T13:13:37Z
language:
- iso: eng
place: Universität Paderborn
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
status: public
supervisor:
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
title: Do Online Ratings Matter in the Sharing Economy? Analyzing the Impact of Online
Ratings on Demand on Airbnb
type: mastersthesis
user_id: '16205'
year: '2019'
...
---
_id: '14987'
author:
- first_name: Tim
full_name: Resch, Tim
last_name: Resch
citation:
ama: Resch T. Möglichkeiten und Grenzen crowdbasierter Ideenbewertung - Ein systematischer
Literaturüberblick.; 2019.
apa: Resch, T. (2019). Möglichkeiten und Grenzen crowdbasierter Ideenbewertung
- Ein systematischer Literaturüberblick.
bibtex: '@book{Resch_2019, place={Universität Paderborn}, title={Möglichkeiten und
Grenzen crowdbasierter Ideenbewertung - Ein systematischer Literaturüberblick},
author={Resch, Tim}, year={2019} }'
chicago: Resch, Tim. Möglichkeiten und Grenzen crowdbasierter Ideenbewertung
- Ein systematischer Literaturüberblick. Universität Paderborn, 2019.
ieee: T. Resch, Möglichkeiten und Grenzen crowdbasierter Ideenbewertung - Ein
systematischer Literaturüberblick. Universität Paderborn, 2019.
mla: Resch, Tim. Möglichkeiten und Grenzen crowdbasierter Ideenbewertung - Ein
systematischer Literaturüberblick. 2019.
short: T. Resch, Möglichkeiten und Grenzen crowdbasierter Ideenbewertung - Ein systematischer
Literaturüberblick, Universität Paderborn, 2019.
date_created: 2019-11-14T14:13:04Z
date_updated: 2022-07-14T13:13:25Z
language:
- iso: ger
place: Universität Paderborn
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
status: public
supervisor:
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
title: Möglichkeiten und Grenzen crowdbasierter Ideenbewertung - Ein systematischer
Literaturüberblick
type: mastersthesis
user_id: '16205'
year: '2019'
...
---
_id: '13748'
author:
- first_name: Christoph
full_name: Milder, Christoph
last_name: Milder
citation:
ama: 'Milder C. Externe Stimuli zur Geschäftsmodell-Ideengenerierung: Ein Experimenteller
Ansatz.; 2019.'
apa: 'Milder, C. (2019). Externe Stimuli zur Geschäftsmodell-Ideengenerierung:
Ein Experimenteller Ansatz.'
bibtex: '@book{Milder_2019, place={Universität Paderborn}, title={Externe Stimuli
zur Geschäftsmodell-Ideengenerierung: Ein Experimenteller Ansatz}, author={Milder,
Christoph}, year={2019} }'
chicago: 'Milder, Christoph. Externe Stimuli zur Geschäftsmodell-Ideengenerierung:
Ein Experimenteller Ansatz. Universität Paderborn, 2019.'
ieee: 'C. Milder, Externe Stimuli zur Geschäftsmodell-Ideengenerierung: Ein Experimenteller
Ansatz. Universität Paderborn, 2019.'
mla: 'Milder, Christoph. Externe Stimuli zur Geschäftsmodell-Ideengenerierung:
Ein Experimenteller Ansatz. 2019.'
short: 'C. Milder, Externe Stimuli zur Geschäftsmodell-Ideengenerierung: Ein Experimenteller
Ansatz, Universität Paderborn, 2019.'
date_created: 2019-10-10T11:43:25Z
date_updated: 2022-07-14T13:13:31Z
language:
- iso: ger
place: Universität Paderborn
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
status: public
supervisor:
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
title: 'Externe Stimuli zur Geschäftsmodell-Ideengenerierung: Ein Experimenteller
Ansatz'
type: mastersthesis
user_id: '16205'
year: '2019'
...
---
_id: '34167'
author:
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
citation:
ama: Riebler H. Efficient Parallel Branch-and-Bound Search on FPGAs Using Work
Stealing and Instance-Specific Designs.; 2019. doi:10.17619/UNIPB/1-830
apa: Riebler, H. (2019). Efficient parallel branch-and-bound search on FPGAs
using work stealing and instance-specific designs. https://doi.org/10.17619/UNIPB/1-830
bibtex: '@book{Riebler_2019, title={Efficient parallel branch-and-bound search on
FPGAs using work stealing and instance-specific designs}, DOI={10.17619/UNIPB/1-830},
author={Riebler, Heinrich}, year={2019} }'
chicago: Riebler, Heinrich. Efficient Parallel Branch-and-Bound Search on FPGAs
Using Work Stealing and Instance-Specific Designs, 2019. https://doi.org/10.17619/UNIPB/1-830.
ieee: H. Riebler, Efficient parallel branch-and-bound search on FPGAs using work
stealing and instance-specific designs. 2019.
mla: Riebler, Heinrich. Efficient Parallel Branch-and-Bound Search on FPGAs Using
Work Stealing and Instance-Specific Designs. 2019, doi:10.17619/UNIPB/1-830.
short: H. Riebler, Efficient Parallel Branch-and-Bound Search on FPGAs Using Work
Stealing and Instance-Specific Designs, 2019.
date_created: 2022-11-30T14:36:04Z
date_updated: 2022-11-30T14:44:15Z
department:
- _id: '27'
doi: 10.17619/UNIPB/1-830
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '14'
name: 'SFB 901 - C2: SFB 901 - Subproject C2'
status: public
supervisor:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
title: Efficient parallel branch-and-bound search on FPGAs using work stealing and
instance-specific designs
type: dissertation
user_id: '15504'
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: '13904'
abstract:
- lang: eng
text: In this paper, we introduce updatable anonymous credential systems (UACS)
and use them to construct a new privacy-preserving incentive system. In a UACS,
a user holding a credential certifying some attributes can interact with the corresponding
issuer to update his attributes. During this, the issuer knows which update function
is run, but does not learn the user's previous attributes. Hence the update process
preserves anonymity of the user. One example for a class of update functions are
additive updates of integer attributes, where the issuer increments an unknown
integer attribute value v by some known value k. This kind of update is motivated
by an application of UACS to incentive systems. Users in an incentive system can
anonymously accumulate points, e.g. in a shop at checkout, and spend them later,
e.g. for a discount.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
- first_name: Denis Pascal
full_name: Diemert, Denis Pascal
id: '44071'
last_name: Diemert
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
citation:
ama: 'Blömer J, Bobolz J, Diemert DP, Eidens F. Updatable Anonymous Credentials
and Applications to Incentive Systems. In: Proceedings of the 2019 ACM SIGSAC
Conference on Computer and Communications Security - CCS ’19. Proceedings
of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS
’19. ; 2019. doi:10.1145/3319535.3354223'
apa: Blömer, J., Bobolz, J., Diemert, D. P., & Eidens, F. (2019). Updatable
Anonymous Credentials and Applications to Incentive Systems. Proceedings of
the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19.
26th ACM Conference on Computer and Communications Security, London. https://doi.org/10.1145/3319535.3354223
bibtex: '@inproceedings{Blömer_Bobolz_Diemert_Eidens_2019, series={Proceedings of
the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19},
title={Updatable Anonymous Credentials and Applications to Incentive Systems},
DOI={10.1145/3319535.3354223},
booktitle={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications
Security - CCS ’19}, author={Blömer, Johannes and Bobolz, Jan and Diemert, Denis
Pascal and Eidens, Fabian}, year={2019}, collection={Proceedings of the 2019 ACM
SIGSAC Conference on Computer and Communications Security - CCS ’19} }'
chicago: Blömer, Johannes, Jan Bobolz, Denis Pascal Diemert, and Fabian Eidens.
“Updatable Anonymous Credentials and Applications to Incentive Systems.” In Proceedings
of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS
’19. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications
Security - CCS ’19, 2019. https://doi.org/10.1145/3319535.3354223.
ieee: 'J. Blömer, J. Bobolz, D. P. Diemert, and F. Eidens, “Updatable Anonymous
Credentials and Applications to Incentive Systems,” presented at the 26th ACM
Conference on Computer and Communications Security, London, 2019, doi: 10.1145/3319535.3354223.'
mla: Blömer, Johannes, et al. “Updatable Anonymous Credentials and Applications
to Incentive Systems.” Proceedings of the 2019 ACM SIGSAC Conference on Computer
and Communications Security - CCS ’19, 2019, doi:10.1145/3319535.3354223.
short: 'J. Blömer, J. Bobolz, D.P. Diemert, F. Eidens, in: Proceedings of the 2019
ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019.'
conference:
end_date: 2019-11-15
location: London
name: 26th ACM Conference on Computer and Communications Security
start_date: 2019-11-11
date_created: 2019-10-18T08:09:44Z
date_updated: 2023-01-10T10:25:27Z
ddc:
- '006'
department:
- _id: '7'
- _id: '64'
doi: 10.1145/3319535.3354223
file:
- access_level: closed
content_type: application/pdf
creator: jbobolz
date_created: 2019-10-18T08:07:49Z
date_updated: 2019-10-18T08:07:49Z
file_id: '13907'
file_name: full_eprinted_v2.pdf
file_size: 838949
relation: main_file
file_date_updated: 2019-10-18T08:07:49Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/169.pdf
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications
Security - CCS '19
series_title: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications
Security - CCS '19
status: public
title: Updatable Anonymous Credentials and Applications to Incentive Systems
type: conference
user_id: '25078'
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'
...
---
_id: '39056'
author:
- first_name: Dennis
full_name: Lütkevedder, Dennis
last_name: Lütkevedder
citation:
ama: Lütkevedder D. “Data-Driven Mergers” in digitalen Märkten - eine wettbewerbspolitische
Analyse.; 2019.
apa: Lütkevedder, D. (2019). “Data-Driven Mergers” in digitalen Märkten - eine
wettbewerbspolitische Analyse.
bibtex: '@book{Lütkevedder_2019, title={“Data-Driven Mergers” in digitalen Märkten
- eine wettbewerbspolitische Analyse}, author={Lütkevedder, Dennis}, year={2019}
}'
chicago: Lütkevedder, Dennis. “Data-Driven Mergers” in digitalen Märkten - eine
wettbewerbspolitische Analyse, 2019.
ieee: D. Lütkevedder, “Data-Driven Mergers” in digitalen Märkten - eine wettbewerbspolitische
Analyse. 2019.
mla: Lütkevedder, Dennis. “Data-Driven Mergers” in digitalen Märkten - eine wettbewerbspolitische
Analyse. 2019.
short: D. Lütkevedder, “Data-Driven Mergers” in digitalen Märkten - eine wettbewerbspolitische
Analyse, 2019.
date_created: 2023-01-24T08:49:54Z
date_updated: 2023-01-24T08:50:04Z
department:
- _id: '280'
language:
- iso: ger
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
name: 'SFB 901 - A3: SFB 901 - Subproject A3'
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: '"Data-Driven Mergers" in digitalen Märkten - eine wettbewerbspolitische Analyse'
type: mastersthesis
user_id: '37953'
year: '2019'
...
---
_id: '39059'
author:
- first_name: Uzair Ahmed
full_name: Memon, Uzair Ahmed
last_name: Memon
citation:
ama: Memon UA. On the Implications of Big Data for Competition Policy - Big Data,
Market Power, Competition Law.; 2019.
apa: Memon, U. A. (2019). On the Implications of Big Data for Competition Policy
- Big data, Market power, Competition law.
bibtex: '@book{Memon_2019, title={On the Implications of Big Data for Competition
Policy - Big data, Market power, Competition law}, author={Memon, Uzair Ahmed},
year={2019} }'
chicago: Memon, Uzair Ahmed. On the Implications of Big Data for Competition
Policy - Big Data, Market Power, Competition Law, 2019.
ieee: U. A. Memon, On the Implications of Big Data for Competition Policy - Big
data, Market power, Competition law. 2019.
mla: Memon, Uzair Ahmed. On the Implications of Big Data for Competition Policy
- Big Data, Market Power, Competition Law. 2019.
short: U.A. Memon, On the Implications of Big Data for Competition Policy - Big
Data, Market Power, Competition Law, 2019.
date_created: 2023-01-24T08:51:46Z
date_updated: 2023-01-24T08:51:59Z
department:
- _id: '280'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
name: 'SFB 901 - A3: SFB 901 - Subproject A3'
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: On the Implications of Big Data for Competition Policy - Big data, Market power,
Competition law
type: mastersthesis
user_id: '37953'
year: '2019'
...
---
_id: '39067'
author:
- first_name: André
full_name: Milczarek, André
last_name: Milczarek
citation:
ama: Milczarek A. Risiken und Gefahren von Marktmacht in digitalen Märkten -
eine wettbewerbspolitische Analyse.; 2019.
apa: Milczarek, A. (2019). Risiken und Gefahren von Marktmacht in digitalen Märkten
- eine wettbewerbspolitische Analyse.
bibtex: '@book{Milczarek_2019, title={Risiken und Gefahren von Marktmacht in digitalen
Märkten - eine wettbewerbspolitische Analyse}, author={Milczarek, André}, year={2019}
}'
chicago: Milczarek, André. Risiken und Gefahren von Marktmacht in digitalen Märkten
- eine wettbewerbspolitische Analyse, 2019.
ieee: A. Milczarek, Risiken und Gefahren von Marktmacht in digitalen Märkten
- eine wettbewerbspolitische Analyse. 2019.
mla: Milczarek, André. Risiken und Gefahren von Marktmacht in digitalen Märkten
- eine wettbewerbspolitische Analyse. 2019.
short: A. Milczarek, Risiken und Gefahren von Marktmacht in digitalen Märkten -
eine wettbewerbspolitische Analyse, 2019.
date_created: 2023-01-24T09:01:50Z
date_updated: 2023-01-24T09:01:59Z
department:
- _id: '280'
language:
- iso: ger
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
name: 'SFB 901 - A3: SFB 901 - Subproject A3'
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Risiken und Gefahren von Marktmacht in digitalen Märkten - eine wettbewerbspolitische
Analyse
type: bachelorsthesis
user_id: '37953'
year: '2019'
...
---
_id: '37684'
author:
- first_name: Fabian
full_name: Heinrichs, Fabian
last_name: Heinrichs
citation:
ama: Heinrichs F. Digitale Märkte - Zu den Auswirkungen von Big Data auf Marktmacht
und die Bildung von Kartellen.; 2019.
apa: Heinrichs, F. (2019). Digitale Märkte - Zu den Auswirkungen von Big Data
auf Marktmacht und die Bildung von Kartellen.
bibtex: '@book{Heinrichs_2019, title={Digitale Märkte - Zu den Auswirkungen von
Big Data auf Marktmacht und die Bildung von Kartellen}, author={Heinrichs, Fabian},
year={2019} }'
chicago: Heinrichs, Fabian. Digitale Märkte - Zu den Auswirkungen von Big Data
auf Marktmacht und die Bildung von Kartellen, 2019.
ieee: F. Heinrichs, Digitale Märkte - Zu den Auswirkungen von Big Data auf Marktmacht
und die Bildung von Kartellen. 2019.
mla: Heinrichs, Fabian. Digitale Märkte - Zu den Auswirkungen von Big Data auf
Marktmacht und die Bildung von Kartellen. 2019.
short: F. Heinrichs, Digitale Märkte - Zu den Auswirkungen von Big Data auf Marktmacht
und die Bildung von Kartellen, 2019.
date_created: 2023-01-20T10:22:41Z
date_updated: 2023-01-23T09:06:32Z
department:
- _id: '280'
language:
- iso: ger
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
name: 'SFB 901 - A3: SFB 901 - Subproject A3'
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Digitale Märkte - Zu den Auswirkungen von Big Data auf Marktmacht und die Bildung
von Kartellen
type: mastersthesis
user_id: '37953'
year: '2019'
...
---
_id: '38042'
author:
- first_name: Julia
full_name: Fortmeier, Julia
last_name: Fortmeier
citation:
ama: Fortmeier J. Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische
Analyse.; 2019.
apa: Fortmeier, J. (2019). Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische
Analyse.
bibtex: '@book{Fortmeier_2019, title={Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische
Analyse}, author={Fortmeier, Julia}, year={2019} }'
chicago: Fortmeier, Julia. Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische
Analyse, 2019.
ieee: J. Fortmeier, Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische
Analyse. 2019.
mla: Fortmeier, Julia. Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische
Analyse. 2019.
short: J. Fortmeier, Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische
Analyse, 2019.
date_created: 2023-01-23T08:55:55Z
date_updated: 2023-01-23T09:05:55Z
department:
- _id: '280'
language:
- iso: ger
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
name: 'SFB 901 - A3: SFB 901 - Subproject A3'
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische Analyse
type: bachelorsthesis
user_id: '37953'
year: '2019'
...
---
_id: '38045'
author:
- first_name: Carolin
full_name: Hagedorn, Carolin
last_name: Hagedorn
citation:
ama: Hagedorn C. The Intersection of Privacy and Competition Law - Lessons from
Data-Driven Mergers.; 2019.
apa: Hagedorn, C. (2019). The intersection of privacy and competition law - Lessons
from data-driven mergers.
bibtex: '@book{Hagedorn_2019, title={The intersection of privacy and competition
law - Lessons from data-driven mergers}, author={Hagedorn, Carolin}, year={2019}
}'
chicago: Hagedorn, Carolin. The Intersection of Privacy and Competition Law -
Lessons from Data-Driven Mergers, 2019.
ieee: C. Hagedorn, The intersection of privacy and competition law - Lessons
from data-driven mergers. 2019.
mla: Hagedorn, Carolin. The Intersection of Privacy and Competition Law - Lessons
from Data-Driven Mergers. 2019.
short: C. Hagedorn, The Intersection of Privacy and Competition Law - Lessons from
Data-Driven Mergers, 2019.
date_created: 2023-01-23T09:22:37Z
date_updated: 2023-01-23T09:24:30Z
department:
- _id: '280'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
name: 'SFB 901 - A3: SFB 901 - Subproject A3'
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: The intersection of privacy and competition law - Lessons from data-driven
mergers
type: mastersthesis
user_id: '37953'
year: '2019'
...
---
_id: '38097'
author:
- first_name: Berfin
full_name: Ayyildiz, Berfin
last_name: Ayyildiz
citation:
ama: Ayyildiz B. Die Akquisition von Double Click durch Google - eine wettbewerbspolitische
Analyse.; 2019.
apa: Ayyildiz, B. (2019). Die Akquisition von Double Click durch Google - eine
wettbewerbspolitische Analyse.
bibtex: '@book{Ayyildiz_2019, title={Die Akquisition von Double Click durch Google
- eine wettbewerbspolitische Analyse}, author={Ayyildiz, Berfin}, year={2019}
}'
chicago: Ayyildiz, Berfin. Die Akquisition von Double Click durch Google - eine
wettbewerbspolitische Analyse, 2019.
ieee: B. Ayyildiz, Die Akquisition von Double Click durch Google - eine wettbewerbspolitische
Analyse. 2019.
mla: Ayyildiz, Berfin. Die Akquisition von Double Click durch Google - eine wettbewerbspolitische
Analyse. 2019.
short: B. Ayyildiz, Die Akquisition von Double Click durch Google - eine wettbewerbspolitische
Analyse, 2019.
date_created: 2023-01-23T11:39:35Z
date_updated: 2023-01-23T11:39:50Z
department:
- _id: '280'
language:
- iso: ger
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
name: 'SFB 901 - A3: SFB 901 - Subproject A3'
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Die Akquisition von Double Click durch Google - eine wettbewerbspolitische
Analyse
type: bachelorsthesis
user_id: '37953'
year: '2019'
...
---
_id: '38093'
author:
- first_name: Ekaterina
full_name: Shelepova, Ekaterina
last_name: Shelepova
citation:
ama: Shelepova E. Merger Analysis in Data-Driven Markets - An Economic Policy
Perspective.; 2019.
apa: Shelepova, E. (2019). Merger Analysis in Data-Driven Markets - An Economic
Policy Perspective.
bibtex: '@book{Shelepova_2019, title={Merger Analysis in Data-Driven Markets - An
Economic Policy Perspective}, author={Shelepova, Ekaterina}, year={2019} }'
chicago: Shelepova, Ekaterina. Merger Analysis in Data-Driven Markets - An Economic
Policy Perspective, 2019.
ieee: E. Shelepova, Merger Analysis in Data-Driven Markets - An Economic Policy
Perspective. 2019.
mla: Shelepova, Ekaterina. Merger Analysis in Data-Driven Markets - An Economic
Policy Perspective. 2019.
short: E. Shelepova, Merger Analysis in Data-Driven Markets - An Economic Policy
Perspective, 2019.
date_created: 2023-01-23T11:34:00Z
date_updated: 2023-01-23T11:34:15Z
department:
- _id: '280'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
name: 'SFB 901 - A3: SFB 901 - Subproject A3'
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Merger Analysis in Data-Driven Markets - An Economic Policy Perspective
type: mastersthesis
user_id: '37953'
year: '2019'
...
---
_id: '38096'
author:
- first_name: Suganya
full_name: Shanmugaratnam, Suganya
last_name: Shanmugaratnam
citation:
ama: Shanmugaratnam S. Marktmacht in digitalen Märkten.; 2019.
apa: Shanmugaratnam, S. (2019). Marktmacht in digitalen Märkten.
bibtex: '@book{Shanmugaratnam_2019, title={Marktmacht in digitalen Märkten}, author={Shanmugaratnam,
Suganya}, year={2019} }'
chicago: Shanmugaratnam, Suganya. Marktmacht in digitalen Märkten, 2019.
ieee: S. Shanmugaratnam, Marktmacht in digitalen Märkten. 2019.
mla: Shanmugaratnam, Suganya. Marktmacht in digitalen Märkten. 2019.
short: S. Shanmugaratnam, Marktmacht in digitalen Märkten, 2019.
date_created: 2023-01-23T11:36:24Z
date_updated: 2023-01-23T11:36:29Z
department:
- _id: '280'
language:
- iso: ger
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
name: 'SFB 901 - A3: SFB 901 - Subproject A3'
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Marktmacht in digitalen Märkten
type: mastersthesis
user_id: '37953'
year: '2019'
...
---
_id: '38099'
author:
- first_name: Ahmed
full_name: Faizan, Ahmed
last_name: Faizan
citation:
ama: Faizan A. The Effectiveness of Leniency Programs and Whistleblowing in Discouraging
Cartel Activities.; 2019.
apa: Faizan, A. (2019). The Effectiveness of Leniency Programs and Whistleblowing
in Discouraging Cartel Activities.
bibtex: '@book{Faizan_2019, title={The Effectiveness of Leniency Programs and Whistleblowing
in Discouraging Cartel Activities}, author={Faizan, Ahmed}, year={2019} }'
chicago: Faizan, Ahmed. The Effectiveness of Leniency Programs and Whistleblowing
in Discouraging Cartel Activities, 2019.
ieee: A. Faizan, The Effectiveness of Leniency Programs and Whistleblowing in
Discouraging Cartel Activities. 2019.
mla: Faizan, Ahmed. The Effectiveness of Leniency Programs and Whistleblowing
in Discouraging Cartel Activities. 2019.
short: A. Faizan, The Effectiveness of Leniency Programs and Whistleblowing in Discouraging
Cartel Activities, 2019.
date_created: 2023-01-23T11:43:52Z
date_updated: 2023-01-23T11:48:33Z
department:
- _id: '280'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
name: 'SFB 901 - A3: SFB 901 - Subproject A3'
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: The Effectiveness of Leniency Programs and Whistleblowing in Discouraging Cartel
Activities
type: mastersthesis
user_id: '37953'
year: '2019'
...
---
_id: '9913'
abstract:
- lang: eng
text: Reconfigurable hardware has received considerable attention as a platform
that enables dynamic hardware updates and thus is able to adapt new configurations
at runtime. However, due to their dynamic nature, e.g., field-programmable gate
arrays (FPGA) are subject to a constant possibility of attacks, since each new
configuration might be compromised. Trojans for reconfigurable hardware that evade
state-of-the-art detection techniques and even formal verification, are thus a
large threat to these devices. One such stealthy hardware Trojan, that is inserted
and activated in two stages by compromised electronic design automation (EDA)
tools, has recently been presented and shown to evade all forms of classical pre-configuration
detection techniques. This paper presents a successful pre-configuration countermeasure
against this ``Malicious Look-up-table (LUT)''-hardware Trojan, by employing bitstream-level
Proof-Carrying Hardware (PCH). We show that the method is able to alert innocent
module creators to infected EDA tools, and to prohibit malicious ones to sell
infected modules to unsuspecting customers.
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. Proof-Carrying Hardware Versus the Stealthy
Malicious LUT Hardware Trojan. In: Hochberger C, Nelson B, Koch A, Woods R, Diniz
P, eds. Applied Reconfigurable Computing. Vol 11444. Lecture Notes in Computer
Science. Springer International Publishing; 2019:127-136. doi:10.1007/978-3-030-17227-5_10'
apa: Ahmed, Q. A., Wiersema, T., & Platzner, M. (2019). Proof-Carrying Hardware
Versus the Stealthy Malicious LUT Hardware Trojan. In C. Hochberger, B. Nelson,
A. Koch, R. Woods, & P. Diniz (Eds.), Applied Reconfigurable Computing
(Vol. 11444, pp. 127–136). Springer International Publishing. https://doi.org/10.1007/978-3-030-17227-5_10
bibtex: '@inproceedings{Ahmed_Wiersema_Platzner_2019, place={Cham}, series={Lecture
Notes in Computer Science}, title={Proof-Carrying Hardware Versus the Stealthy
Malicious LUT Hardware Trojan}, volume={11444}, DOI={10.1007/978-3-030-17227-5_10},
booktitle={Applied Reconfigurable Computing}, publisher={Springer International
Publishing}, author={Ahmed, Qazi Arbab and Wiersema, Tobias and Platzner, Marco},
editor={Hochberger, Christian and Nelson, Brent and Koch, Andreas and Woods, Roger
and Diniz, Pedro}, year={2019}, pages={127–136}, collection={Lecture Notes in
Computer Science} }'
chicago: 'Ahmed, Qazi Arbab, Tobias Wiersema, and Marco Platzner. “Proof-Carrying
Hardware Versus the Stealthy Malicious LUT Hardware Trojan.” In Applied Reconfigurable
Computing, edited by Christian Hochberger, Brent Nelson, Andreas Koch, Roger
Woods, and Pedro Diniz, 11444:127–36. Lecture Notes in Computer Science. Cham:
Springer International Publishing, 2019. https://doi.org/10.1007/978-3-030-17227-5_10.'
ieee: 'Q. A. Ahmed, T. Wiersema, and M. Platzner, “Proof-Carrying Hardware Versus
the Stealthy Malicious LUT Hardware Trojan,” in Applied Reconfigurable Computing,
Darmstadt, Germany, 2019, vol. 11444, pp. 127–136, doi: 10.1007/978-3-030-17227-5_10.'
mla: Ahmed, Qazi Arbab, et al. “Proof-Carrying Hardware Versus the Stealthy Malicious
LUT Hardware Trojan.” Applied Reconfigurable Computing, edited by Christian
Hochberger et al., vol. 11444, Springer International Publishing, 2019, pp. 127–36,
doi:10.1007/978-3-030-17227-5_10.
short: 'Q.A. Ahmed, T. Wiersema, M. Platzner, in: C. Hochberger, B. Nelson, A. Koch,
R. Woods, P. Diniz (Eds.), Applied Reconfigurable Computing, Springer International
Publishing, Cham, 2019, pp. 127–136.'
conference:
end_date: 2019-04-11
location: Darmstadt, Germany
name: 15th International Symposium on Applied Reconfigurable Computing (ARC 2019)
start_date: 2019-04-09
date_created: 2019-05-22T07:36:05Z
date_updated: 2023-05-15T08:13:37Z
ddc:
- '000'
department:
- _id: '78'
doi: 10.1007/978-3-030-17227-5_10
editor:
- first_name: Christian
full_name: Hochberger, Christian
last_name: Hochberger
- first_name: Brent
full_name: Nelson, Brent
last_name: Nelson
- first_name: Andreas
full_name: Koch, Andreas
last_name: Koch
- first_name: Roger
full_name: Woods, Roger
last_name: Woods
- first_name: Pedro
full_name: Diniz, Pedro
last_name: Diniz
file:
- access_level: closed
content_type: application/pdf
creator: qazi
date_created: 2023-05-11T09:12:33Z
date_updated: 2023-05-11T09:12:33Z
file_id: '44749'
file_name: 978-3-030-17227-5_10.pdf
file_size: 661354
relation: main_file
success: 1
file_date_updated: 2023-05-11T09:12:33Z
has_accepted_license: '1'
intvolume: ' 11444'
language:
- iso: eng
main_file_link:
- open_access: '1'
oa: '1'
page: 127-136
place: Cham
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
publication: Applied Reconfigurable Computing
publication_identifier:
isbn:
- 978-3-030-17227-5
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan
type: conference
user_id: '72764'
volume: 11444
year: '2019'
...