---
_id: '97'
abstract:
- lang: eng
text: Bridging the gap between informal, imprecise, and vague user requirements
descriptions and precise formalized specifications is the main task of requirements
engineering. Techniques such as interviews or story telling are used when requirements
engineers try to identify a user's needs. The requirements specification process
is typically done in a dialogue between users, domain experts, and requirements
engineers. In our research, we aim at automating the specification of requirements.
The idea is to distinguish between untrained users and trained users, and to exploit
domain knowledge learned from previous runs of our system. We let untrained users
provide unstructured natural language descriptions, while we allow trained users
to provide examples of behavioral descriptions. In both cases, our goal is to
synthesize formal requirements models similar to statecharts. From requirements
specification processes with trained users, behavioral ontologies are learned
which are later used to support the requirements specification process for untrained
users. Our research method is original in combining natural language processing
and search-based techniques for the synthesis of requirements specifications.
Our work is embedded in a larger project that aims at automating the whole software
development and deployment process in envisioned future software service markets.
author:
- first_name: Lorijn
full_name: van Rooijen, Lorijn
id: '58843'
last_name: van Rooijen
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'van Rooijen L, Bäumer FS, Platenius MC, Geierhos M, Hamann H, Engels G. From
User Demand to Software Service: Using Machine Learning to Automate the Requirements
Specification Process. In: 2017 IEEE 25th International Requirements Engineering
Conference Workshops (REW). Piscataway, NJ, USA: IEEE; 2017:379-385. doi:10.1109/REW.2017.26'
apa: 'van Rooijen, L., Bäumer, F. S., Platenius, M. C., Geierhos, M., Hamann, H.,
& Engels, G. (2017). From User Demand to Software Service: Using Machine Learning
to Automate the Requirements Specification Process. In 2017 IEEE 25th International
Requirements Engineering Conference Workshops (REW) (pp. 379–385). Piscataway,
NJ, USA: IEEE. https://doi.org/10.1109/REW.2017.26'
bibtex: '@inproceedings{van Rooijen_Bäumer_Platenius_Geierhos_Hamann_Engels_2017,
place={Piscataway, NJ, USA}, title={From User Demand to Software Service: Using
Machine Learning to Automate the Requirements Specification Process}, DOI={10.1109/REW.2017.26}, booktitle={2017
IEEE 25th International Requirements Engineering Conference Workshops (REW)},
publisher={IEEE}, author={van Rooijen, Lorijn and Bäumer, Frederik Simon and Platenius,
Marie Christin and Geierhos, Michaela and Hamann, Heiko and Engels, Gregor}, year={2017},
pages={379–385} }'
chicago: 'Rooijen, Lorijn van, Frederik Simon Bäumer, Marie Christin Platenius,
Michaela Geierhos, Heiko Hamann, and Gregor Engels. “From User Demand to Software
Service: Using Machine Learning to Automate the Requirements Specification Process.”
In 2017 IEEE 25th International Requirements Engineering Conference Workshops
(REW), 379–85. Piscataway, NJ, USA: IEEE, 2017. https://doi.org/10.1109/REW.2017.26.'
ieee: 'L. van Rooijen, F. S. Bäumer, M. C. Platenius, M. Geierhos, H. Hamann, and
G. Engels, “From User Demand to Software Service: Using Machine Learning to Automate
the Requirements Specification Process,” in 2017 IEEE 25th International Requirements
Engineering Conference Workshops (REW), Lisbon, Portugal, 2017, pp. 379–385.'
mla: 'van Rooijen, Lorijn, et al. “From User Demand to Software Service: Using Machine
Learning to Automate the Requirements Specification Process.” 2017 IEEE 25th
International Requirements Engineering Conference Workshops (REW), IEEE, 2017,
pp. 379–85, doi:10.1109/REW.2017.26.'
short: 'L. van Rooijen, F.S. Bäumer, M.C. Platenius, M. Geierhos, H. Hamann, G.
Engels, in: 2017 IEEE 25th International Requirements Engineering Conference Workshops
(REW), IEEE, Piscataway, NJ, USA, 2017, pp. 379–385.'
conference:
end_date: 2017-09-08
location: Lisbon, Portugal
name: 2017 IEEE 25th International Requirements Engineering Conference Workshops
(REW)
start_date: 2017-09-04
date_created: 2017-10-17T12:41:10Z
date_updated: 2022-01-06T07:04:18Z
ddc:
- '000'
department:
- _id: '36'
- _id: '1'
- _id: '579'
- _id: '34'
- _id: '7'
- _id: '66'
- _id: '238'
- _id: '63'
doi: 10.1109/REW.2017.26
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:50:35Z
date_updated: 2018-11-02T14:50:35Z
file_id: '5285'
file_name: 08054881.pdf
file_size: 433613
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:50:35Z
has_accepted_license: '1'
keyword:
- Software
- Unified modeling language
- Requirements engineering
- Ontologies
- Search problems
- Natural languages
language:
- iso: eng
page: 379-385
place: Piscataway, NJ, USA
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: 2017 IEEE 25th International Requirements Engineering Conference Workshops
(REW)
publication_identifier:
eisbn:
- '978-1-5386-3488-2 '
isbn:
- 978-1-5386-3489-9
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: 'From User Demand to Software Service: Using Machine Learning to Automate the
Requirements Specification Process'
type: conference
user_id: '57458'
year: '2017'
...
---
_id: '981'
abstract:
- lang: eng
text: "Benchmarking and profiling virtual network functions (VNFs) generates input\r\nknowledge
for resource management decisions taken by \r\nmanagement and orchestration systems.
\r\nSuch VNFs are usually not executed in isolation but are often deployed as
part of a service function chain (SFC) that connects single functions into complex
\r\nstructures. To manage such chains, isolated performance\r\nprofiles of single
functions have to be combined to get insights into \r\nthe overall behavior of
an SFC. This becomes particularly\r\nchallenging in highly agile DevOps environments
in which profiling\r\nprocesses need to be fully automated and detailed insights
about a chain's\r\ninternal structures are not always available. \r\n\r\nIn this
paper, we introduce a\r\nfully automatable, flexible, and platform-agnostic profiling\r\nsystem
that allows to profile entire SFCs at once. This obviates \r\nmanual modeling
procedures to combine profiling results from single\r\nVNFs to reflect SFC performance.
\r\nWe use a case study with different SFC configurations to show that it\r\nis
hard to model the resulting SFC performance based on single-VNF measurements and
that\r\nperformance interactions between real, non-trivial functions that are
deployed in a\r\nchain exist. "
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Peuster M, Karl H. Profile Your Chains, Not Functions. Automated Network Service
Profiling in DevOps Environments. In: IEEE Conference on Network Function Virtualisation
and Software Defined Networks (NFV-SDN). Berlin; 2017. doi:10.1109/NFV-SDN.2017.8169826'
apa: Peuster, M., & Karl, H. (2017). Profile Your Chains, Not Functions. Automated
Network Service Profiling in DevOps Environments. In IEEE Conference on Network
Function Virtualisation and Software Defined Networks (NFV-SDN). Berlin. https://doi.org/10.1109/NFV-SDN.2017.8169826
bibtex: '@inproceedings{Peuster_Karl_2017, place={Berlin}, title={Profile Your Chains,
Not Functions. Automated Network Service Profiling in DevOps Environments}, DOI={10.1109/NFV-SDN.2017.8169826},
booktitle={IEEE Conference on Network Function Virtualisation and Software Defined
Networks (NFV-SDN)}, author={Peuster, Manuel and Karl, Holger}, year={2017} }'
chicago: Peuster, Manuel, and Holger Karl. “Profile Your Chains, Not Functions.
Automated Network Service Profiling in DevOps Environments.” In IEEE Conference
on Network Function Virtualisation and Software Defined Networks (NFV-SDN).
Berlin, 2017. https://doi.org/10.1109/NFV-SDN.2017.8169826.
ieee: M. Peuster and H. Karl, “Profile Your Chains, Not Functions. Automated Network
Service Profiling in DevOps Environments,” in IEEE Conference on Network Function
Virtualisation and Software Defined Networks (NFV-SDN), Berlin, 2017.
mla: Peuster, Manuel, and Holger Karl. “Profile Your Chains, Not Functions. Automated
Network Service Profiling in DevOps Environments.” IEEE Conference on Network
Function Virtualisation and Software Defined Networks (NFV-SDN), 2017, doi:10.1109/NFV-SDN.2017.8169826.
short: 'M. Peuster, H. Karl, in: IEEE Conference on Network Function Virtualisation
and Software Defined Networks (NFV-SDN), Berlin, 2017.'
conference:
location: Berlin
name: IEEE Conference on Network Function Virtualisation and Software Defined Networks
(NFV-SDN)
date_created: 2017-11-27T10:22:29Z
date_updated: 2022-01-06T07:04:22Z
ddc:
- '004'
department:
- _id: '75'
doi: 10.1109/NFV-SDN.2017.8169826
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2018-07-05T11:14:00Z
date_updated: 2018-07-05T11:14:00Z
file_id: '3431'
file_name: main_ris.pdf
file_size: 2642306
relation: main_file
file_date_updated: 2018-07-05T11:14:00Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
place: Berlin
project:
- _id: '25'
call_identifier: 5G PPP Phase 1
grant_number: '671517'
name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
Networks'
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE Conference on Network Function Virtualisation and Software Defined
Networks (NFV-SDN)
publication_status: published
status: public
title: Profile Your Chains, Not Functions. Automated Network Service Profiling in
DevOps Environments
type: conference
urn: '9810'
user_id: '13271'
year: '2017'
...
---
_id: '983'
author:
- first_name: Sébastien
full_name: Auroux, Sébastien
id: '42575'
last_name: Auroux
- first_name: S.
full_name: Scholz, S.
last_name: Scholz
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Auroux S, Scholz S, Karl H. Assessing Genetic Algorithms for Placing Flow
Processing-aware Control Applications. In: Proc. European Wireless. ; 2017.'
apa: Auroux, S., Scholz, S., & Karl, H. (2017). Assessing Genetic Algorithms
for Placing Flow Processing-aware Control Applications. In Proc. European Wireless.
bibtex: '@inproceedings{Auroux_Scholz_Karl_2017, title={Assessing Genetic Algorithms
for Placing Flow Processing-aware Control Applications}, booktitle={Proc. European
Wireless}, author={Auroux, Sébastien and Scholz, S. and Karl, Holger}, year={2017}
}'
chicago: Auroux, Sébastien, S. Scholz, and Holger Karl. “Assessing Genetic Algorithms
for Placing Flow Processing-Aware Control Applications.” In Proc. European
Wireless, 2017.
ieee: S. Auroux, S. Scholz, and H. Karl, “Assessing Genetic Algorithms for Placing
Flow Processing-aware Control Applications,” in Proc. European Wireless,
2017.
mla: Auroux, Sébastien, et al. “Assessing Genetic Algorithms for Placing Flow Processing-Aware
Control Applications.” Proc. European Wireless, 2017.
short: 'S. Auroux, S. Scholz, H. Karl, in: Proc. European Wireless, 2017.'
date_created: 2017-11-27T10:22:29Z
date_updated: 2019-01-03T13:18:55Z
ddc:
- '004'
department:
- _id: '75'
ec_funded: '1'
main_file_link:
- url: http://ieeexplore.ieee.org/document/8011315/
project:
- _id: '22'
call_identifier: FP7-ICT-2011-C
grant_number: '318115'
name: Connectivity management for eneRgy Optimised Wireless Dense works
publication: Proc. European Wireless
status: public
title: Assessing Genetic Algorithms for Placing Flow Processing-aware Control Applications
type: conference
user_id: '126'
year: '2017'
...
---
_id: '9919'
abstract:
- lang: eng
text: This is a study of a combined load restoration and generator start-up procedure.
The procedure is structured into three stages according to the power system status
and the goal of load restoration. Moreover, for each load restoration stage, the
proposed algorithm determines a load restoration sequence by considering renewable
energy such as solar and wind park to achieve objective functions. The validity
and performance of the proposed algorithm is demonstrated through simulations
using IEEE-39 network.
author:
- first_name: Cong
full_name: Shen, Cong
last_name: Shen
- first_name: Paul
full_name: Kaufmann, Paul
last_name: Kaufmann
- first_name: Martin
full_name: Braun, Martin
last_name: Braun
citation:
ama: Shen C, Kaufmann P, Braun M. Three-Stage Power System Restoration Methodology
Considering Renewable Energies. Elsevier International Journal of Electrical
Power and Energy Systems (IJEPES). 2017;94:287-299. doi:10.1016/j.ijepes.2017.07.007
apa: Shen, C., Kaufmann, P., & Braun, M. (2017). Three-Stage Power System Restoration
Methodology Considering Renewable Energies. Elsevier International Journal
of Electrical Power and Energy Systems (IJEPES), 94, 287–299. https://doi.org/10.1016/j.ijepes.2017.07.007
bibtex: '@article{Shen_Kaufmann_Braun_2017, title={Three-Stage Power System Restoration
Methodology Considering Renewable Energies}, volume={94}, DOI={10.1016/j.ijepes.2017.07.007},
journal={Elsevier International Journal of Electrical Power and Energy Systems
(IJEPES)}, author={Shen, Cong and Kaufmann, Paul and Braun, Martin}, year={2017},
pages={287–299} }'
chicago: 'Shen, Cong, Paul Kaufmann, and Martin Braun. “Three-Stage Power System
Restoration Methodology Considering Renewable Energies.” Elsevier International
Journal of Electrical Power and Energy Systems (IJEPES) 94 (2017): 287–99.
https://doi.org/10.1016/j.ijepes.2017.07.007.'
ieee: C. Shen, P. Kaufmann, and M. Braun, “Three-Stage Power System Restoration
Methodology Considering Renewable Energies,” Elsevier International Journal
of Electrical Power and Energy Systems (IJEPES), vol. 94, pp. 287–299, 2017.
mla: Shen, Cong, et al. “Three-Stage Power System Restoration Methodology Considering
Renewable Energies.” Elsevier International Journal of Electrical Power and
Energy Systems (IJEPES), vol. 94, 2017, pp. 287–99, doi:10.1016/j.ijepes.2017.07.007.
short: C. Shen, P. Kaufmann, M. Braun, Elsevier International Journal of Electrical
Power and Energy Systems (IJEPES) 94 (2017) 287–299.
date_created: 2019-05-22T13:14:20Z
date_updated: 2019-10-06T21:56:18Z
department:
- _id: '78'
doi: 10.1016/j.ijepes.2017.07.007
intvolume: ' 94'
keyword:
- Load restorationRestoration stageRenewable energyVoltage/frequency fluctuations
language:
- iso: eng
page: 287-299
publication: Elsevier International Journal of Electrical Power and Energy Systems
(IJEPES)
publication_status: published
status: public
title: Three-Stage Power System Restoration Methodology Considering Renewable Energies
type: journal_article
user_id: '3118'
volume: 94
year: '2017'
...
---
_id: '5204'
author:
- first_name: Johannes
full_name: Späth, Johannes
last_name: Späth
- first_name: Karim
full_name: Ali, Karim
last_name: Ali
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: 'Späth J, Ali K, Bodden E. IDEal: Efficient and Precise Alias-aware Dataflow
Analysis. In: 2017 International Conference on Object-Oriented Programming,
Languages and Applications (OOPSLA/SPLASH). ACM Press; 2017.'
apa: 'Späth, J., Ali, K., & Bodden, E. (2017). IDEal: Efficient and Precise
Alias-aware Dataflow Analysis. In 2017 International Conference on Object-Oriented
Programming, Languages and Applications (OOPSLA/SPLASH). ACM Press.'
bibtex: '@inproceedings{Späth_Ali_Bodden_2017, title={IDEal: Efficient and Precise
Alias-aware Dataflow Analysis}, booktitle={2017 International Conference on Object-Oriented
Programming, Languages and Applications (OOPSLA/SPLASH)}, publisher={ACM Press},
author={Späth, Johannes and Ali, Karim and Bodden, Eric}, year={2017} }'
chicago: 'Späth, Johannes, Karim Ali, and Eric Bodden. “IDEal: Efficient and Precise
Alias-Aware Dataflow Analysis.” In 2017 International Conference on Object-Oriented
Programming, Languages and Applications (OOPSLA/SPLASH). ACM Press, 2017.'
ieee: 'J. Späth, K. Ali, and E. Bodden, “IDEal: Efficient and Precise Alias-aware
Dataflow Analysis,” in 2017 International Conference on Object-Oriented Programming,
Languages and Applications (OOPSLA/SPLASH), 2017.'
mla: 'Späth, Johannes, et al. “IDEal: Efficient and Precise Alias-Aware Dataflow
Analysis.” 2017 International Conference on Object-Oriented Programming, Languages
and Applications (OOPSLA/SPLASH), ACM Press, 2017.'
short: 'J. Späth, K. Ali, E. Bodden, in: 2017 International Conference on Object-Oriented
Programming, Languages and Applications (OOPSLA/SPLASH), ACM Press, 2017.'
date_created: 2018-10-31T12:46:50Z
date_updated: 2022-01-06T07:01:44Z
ddc:
- '000'
department:
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:28:13Z
date_updated: 2018-11-02T14:28:13Z
file_id: '5273'
file_name: sab17ideal.pdf
file_size: 1021251
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:28:13Z
has_accepted_license: '1'
keyword:
- ATTRACT
- ITSECWEBSITE
- CROSSING
language:
- iso: eng
main_file_link:
- url: ' http://bodden.de/pubs/sab17ideal.pdf'
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: 2017 International Conference on Object-Oriented Programming, Languages
and Applications (OOPSLA/SPLASH)
publisher: ACM Press
status: public
title: 'IDEal: Efficient and Precise Alias-aware Dataflow Analysis'
type: conference
user_id: '477'
year: '2017'
...
---
_id: '5209'
author:
- first_name: Andreas
full_name: Fischer, Andreas
last_name: Fischer
- first_name: Benny
full_name: Fuhry, Benny
last_name: Fuhry
- first_name: Florian
full_name: Kerschbaum, Florian
last_name: Kerschbaum
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: Fischer A, Fuhry B, Kerschbaum F, Bodden E. Computation on Encrypted Data using
Data Flow Authentication. CoRR. 2017;abs/1710.00390.
apa: Fischer, A., Fuhry, B., Kerschbaum, F., & Bodden, E. (2017). Computation
on Encrypted Data using Data Flow Authentication. CoRR, abs/1710.00390.
bibtex: '@article{Fischer_Fuhry_Kerschbaum_Bodden_2017, title={Computation on Encrypted
Data using Data Flow Authentication}, volume={abs/1710.00390}, journal={CoRR},
author={Fischer, Andreas and Fuhry, Benny and Kerschbaum, Florian and Bodden,
Eric}, year={2017} }'
chicago: Fischer, Andreas, Benny Fuhry, Florian Kerschbaum, and Eric Bodden. “Computation
on Encrypted Data Using Data Flow Authentication.” CoRR abs/1710.00390
(2017).
ieee: A. Fischer, B. Fuhry, F. Kerschbaum, and E. Bodden, “Computation on Encrypted
Data using Data Flow Authentication,” CoRR, vol. abs/1710.00390, 2017.
mla: Fischer, Andreas, et al. “Computation on Encrypted Data Using Data Flow Authentication.”
CoRR, vol. abs/1710.00390, 2017.
short: A. Fischer, B. Fuhry, F. Kerschbaum, E. Bodden, CoRR abs/1710.00390 (2017).
date_created: 2018-10-31T13:12:32Z
date_updated: 2022-01-06T07:01:46Z
ddc:
- '000'
department:
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T16:03:01Z
date_updated: 2018-11-02T16:03:01Z
file_id: '5321'
file_name: 1710.00390.pdf
file_size: 2339380
relation: main_file
success: 1
file_date_updated: 2018-11-02T16:03:01Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://arxiv.org/pdf/1710.00390.pdf
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: CoRR
status: public
title: Computation on Encrypted Data using Data Flow Authentication
type: journal_article
user_id: '477'
volume: abs/1710.00390
year: '2017'
...
---
_id: '55'
abstract:
- lang: eng
text: We introduce the mobile server problem, inspired by current trends to move
computational tasks from cloud structures to multiple devices close to the end
user. An example for this are embedded systems in autonomous cars that communicate
in order to coordinate their actions. Our model is a variant of the classical
Page Migration Problem. Moreformally, we consider a mobile server holding a data
page.The server can move in the Euclidean space (of arbitrary dimension). In every
round, requests for data items from the page pop up at arbitrary points in the
space. The requests are served, each at a cost of the distance from the requesting
point and the server, and the mobile server may move, at a cost D times the distance
traveled for some constant D . We assume a maximum distance m the server is allowed
to move per round. We show that no online algorithm can achieve a competitive
ratio independent of the length of the input sequence in this setting. Hence we
augment the maximum movement distance of the online algorithms to ( 1 + δ) times
the maximum distance of the offline solution. We provide a deterministic algorithm
which is simple to describe and works for multiple variants of our problem. The
algorithm achieves almost tight competitive ratios independent of the length of
the input sequence.
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Feldkord B, Meyer auf der Heide F. The Mobile Server Problem. In: Proceedings
of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).
; 2017:313-319. doi:10.1145/3087556.3087575'
apa: Feldkord, B., & Meyer auf der Heide, F. (2017). The Mobile Server Problem.
In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA) (pp. 313–319). https://doi.org/10.1145/3087556.3087575
bibtex: '@inproceedings{Feldkord_Meyer auf der Heide_2017, title={The Mobile Server
Problem}, DOI={10.1145/3087556.3087575},
booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm},
year={2017}, pages={313–319} }'
chicago: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server
Problem.” In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 313–19, 2017. https://doi.org/10.1145/3087556.3087575.
ieee: B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” in Proceedings
of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
2017, pp. 313–319.
mla: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.”
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 2017, pp. 313–19, doi:10.1145/3087556.3087575.
short: 'B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 29th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–319.'
date_created: 2017-10-17T12:41:02Z
date_updated: 2022-01-06T07:01:56Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3087556.3087575
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:55:10Z
date_updated: 2018-11-02T14:55:10Z
file_id: '5288'
file_name: p313-feldkord.pdf
file_size: 691691
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:55:10Z
has_accepted_license: '1'
language:
- iso: eng
page: 313-319
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: The Mobile Server Problem
type: conference
user_id: '477'
year: '2017'
...
---
_id: '65'
abstract:
- lang: eng
text: Heterogeneous compute nodes in form of CPUs with attached GPU and FPGA accelerators
have strongly gained interested in the last years. Applications differ in their
execution characteristics and can therefore benefit from such heterogeneous resources
in terms of performance or energy consumption. While performance optimization
has been the only goal for a long time, nowadays research is more and more focusing
on techniques to minimize energy consumption due to rising electricity costs.This
paper presents reMinMin, a novel static list scheduling approach for optimizing
the total energy consumption for a set of tasks executed on a heterogeneous compute
node. reMinMin bases on a new energy model that differentiates between static
and dynamic energy components and covers effects of accelerator tasks on the host
CPU. The required energy values are retrieved by measurements on the real computing
system. In order to evaluate reMinMin, we compare it with two reference implementations
on three task sets with different degrees of heterogeneity. In our experiments,
MinMin is consistently better than a scheduler optimizing for dynamic energy only,
which requires up to 19.43% more energy, and very close to optimal schedules.
author:
- first_name: Achim
full_name: Lösch, Achim
id: '43646'
last_name: Lösch
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Lösch A, Platzner M. reMinMin: A Novel Static Energy-Centric List Scheduling
Approach Based on Real Measurements. In: Proceedings of the 28th Annual IEEE
International Conference on Application-Specific Systems, Architectures and Processors
(ASAP). ; 2017. doi:10.1109/ASAP.2017.7995272'
apa: 'Lösch, A., & Platzner, M. (2017). reMinMin: A Novel Static Energy-Centric
List Scheduling Approach Based on Real Measurements. In Proceedings of the
28th Annual IEEE International Conference on Application-specific Systems, Architectures
and Processors (ASAP). https://doi.org/10.1109/ASAP.2017.7995272'
bibtex: '@inproceedings{Lösch_Platzner_2017, title={reMinMin: A Novel Static Energy-Centric
List Scheduling Approach Based on Real Measurements}, DOI={10.1109/ASAP.2017.7995272},
booktitle={Proceedings of the 28th Annual IEEE International Conference on Application-specific
Systems, Architectures and Processors (ASAP)}, author={Lösch, Achim and Platzner,
Marco}, year={2017} }'
chicago: 'Lösch, Achim, and Marco Platzner. “ReMinMin: A Novel Static Energy-Centric
List Scheduling Approach Based on Real Measurements.” In Proceedings of the
28th Annual IEEE International Conference on Application-Specific Systems, Architectures
and Processors (ASAP), 2017. https://doi.org/10.1109/ASAP.2017.7995272.'
ieee: 'A. Lösch and M. Platzner, “reMinMin: A Novel Static Energy-Centric List Scheduling
Approach Based on Real Measurements,” in Proceedings of the 28th Annual IEEE
International Conference on Application-specific Systems, Architectures and Processors
(ASAP), 2017.'
mla: 'Lösch, Achim, and Marco Platzner. “ReMinMin: A Novel Static Energy-Centric
List Scheduling Approach Based on Real Measurements.” Proceedings of the 28th
Annual IEEE International Conference on Application-Specific Systems, Architectures
and Processors (ASAP), 2017, doi:10.1109/ASAP.2017.7995272.'
short: 'A. Lösch, M. Platzner, in: Proceedings of the 28th Annual IEEE International
Conference on Application-Specific Systems, Architectures and Processors (ASAP),
2017.'
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:08Z
ddc:
- '040'
department:
- _id: '78'
doi: 10.1109/ASAP.2017.7995272
file:
- access_level: closed
content_type: application/pdf
creator: aloesch
date_created: 2018-11-14T09:37:55Z
date_updated: 2018-11-14T09:37:55Z
file_id: '5550'
file_name: loesch_asap2017.pdf
file_size: 467545
relation: main_file
success: 1
file_date_updated: 2018-11-14T09:37:55Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 28th Annual IEEE International Conference on Application-specific
Systems, Architectures and Processors (ASAP)
status: public
title: 'reMinMin: A Novel Static Energy-Centric List Scheduling Approach Based on
Real Measurements'
type: conference
user_id: '477'
year: '2017'
...
---
_id: '66'
abstract:
- lang: eng
text: In budget games, players compete over resources with finite budgets. For every
resource, a player has a specific demand and as a strategy, he chooses a subset
of resources. If the total demand on a resource does not exceed its budget, the
utility of each player who chose that resource equals his demand. Otherwise, the
budget is shared proportionally. In the general case, pure Nash equilibria (NE)
do not exist for such games. In this paper, we consider the natural classes of
singleton and matroid budget games with additional constraints and show that for
each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential
function to prove that every matroid budget game has an approximate pure NE which
depends on the largest ratio between the different demands of each individual
player.
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash Equilibria in Restricted
Budget Games. In: Proceedings of the 23rd International Computing and Combinatorics
Conference (COCOON). LNCS. ; 2017:175--187. doi:10.1007/978-3-319-62389-4_15'
apa: Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2017). Pure Nash
Equilibria in Restricted Budget Games. In Proceedings of the 23rd International
Computing and Combinatorics Conference (COCOON) (pp. 175--187). https://doi.org/10.1007/978-3-319-62389-4_15
bibtex: '@inproceedings{Drees_Feldotto_Riechers_Skopalik_2017, series={LNCS}, title={Pure
Nash Equilibria in Restricted Budget Games}, DOI={10.1007/978-3-319-62389-4_15},
booktitle={Proceedings of the 23rd International Computing and Combinatorics Conference
(COCOON)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören
and Skopalik, Alexander}, year={2017}, pages={175--187}, collection={LNCS} }'
chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik.
“Pure Nash Equilibria in Restricted Budget Games.” In Proceedings of the 23rd
International Computing and Combinatorics Conference (COCOON), 175--187. LNCS,
2017. https://doi.org/10.1007/978-3-319-62389-4_15.
ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash Equilibria
in Restricted Budget Games,” in Proceedings of the 23rd International Computing
and Combinatorics Conference (COCOON), 2017, pp. 175--187.
mla: Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.”
Proceedings of the 23rd International Computing and Combinatorics Conference
(COCOON), 2017, pp. 175--187, doi:10.1007/978-3-319-62389-4_15.
short: 'M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the
23rd International Computing and Combinatorics Conference (COCOON), 2017, pp.
175--187.'
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:13Z
ddc:
- '000'
department:
- _id: '541'
- _id: '63'
doi: 10.1007/978-3-319-62389-4_15
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T16:58:42Z
date_updated: 2018-10-31T16:58:42Z
file_id: '5228'
file_name: Drees2017_Chapter_PureNashEquilibriaInRestricted.pdf
file_size: 346390
relation: main_file
success: 1
file_date_updated: 2018-10-31T16:58:42Z
has_accepted_license: '1'
language:
- iso: eng
page: 175--187
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 23rd International Computing and Combinatorics Conference
(COCOON)
series_title: LNCS
status: public
title: Pure Nash Equilibria in Restricted Budget Games
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '67'
author:
- first_name: Mirko
full_name: Jürgens, Mirko
last_name: Jürgens
citation:
ama: Jürgens M. Provably Secure Key-Derivation-Functions for Certain Types of
Applications. Universität Paderborn; 2017.
apa: Jürgens, M. (2017). Provably Secure Key-Derivation-Functions for Certain
Types of Applications. Universität Paderborn.
bibtex: '@book{Jürgens_2017, title={Provably Secure Key-Derivation-Functions for
Certain Types of Applications}, publisher={Universität Paderborn}, author={Jürgens,
Mirko}, year={2017} }'
chicago: Jürgens, Mirko. Provably Secure Key-Derivation-Functions for Certain
Types of Applications. Universität Paderborn, 2017.
ieee: M. Jürgens, Provably Secure Key-Derivation-Functions for Certain Types
of Applications. Universität Paderborn, 2017.
mla: Jürgens, Mirko. Provably Secure Key-Derivation-Functions for Certain Types
of Applications. Universität Paderborn, 2017.
short: M. Jürgens, Provably Secure Key-Derivation-Functions for Certain Types of
Applications, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:15Z
department:
- _id: '64'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Provably Secure Key-Derivation-Functions for Certain Types of Applications
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '6725'
author:
- first_name: Wojciech
full_name: Czerwinski, Wojciech
last_name: Czerwinski
- first_name: Wim
full_name: Martens, Wim
last_name: Martens
- first_name: Lorijn
full_name: van Rooijen, Lorijn
id: '58843'
last_name: van Rooijen
- first_name: Marc
full_name: Zeitoun, Marc
last_name: Zeitoun
- first_name: Georg
full_name: Zetzsche, Georg
last_name: Zetzsche
citation:
ama: Czerwinski W, Martens W, van Rooijen L, Zeitoun M, Zetzsche G. A Characterization
for Decidable Separability by Piecewise Testable Languages. Discrete Mathematics
& Theoretical Computer Science. 2017;19(4). doi:10.23638/DMTCS-19-4-1
apa: Czerwinski, W., Martens, W., van Rooijen, L., Zeitoun, M., & Zetzsche,
G. (2017). A Characterization for Decidable Separability by Piecewise Testable
Languages. Discrete Mathematics & Theoretical Computer Science, 19(4).
https://doi.org/10.23638/DMTCS-19-4-1
bibtex: '@article{Czerwinski_Martens_van Rooijen_Zeitoun_Zetzsche_2017, title={A
Characterization for Decidable Separability by Piecewise Testable Languages},
volume={19}, DOI={10.23638/DMTCS-19-4-1},
number={4}, journal={Discrete Mathematics & Theoretical Computer Science},
author={Czerwinski, Wojciech and Martens, Wim and van Rooijen, Lorijn and Zeitoun,
Marc and Zetzsche, Georg}, year={2017} }'
chicago: Czerwinski, Wojciech, Wim Martens, Lorijn van Rooijen, Marc Zeitoun, and
Georg Zetzsche. “A Characterization for Decidable Separability by Piecewise Testable
Languages.” Discrete Mathematics & Theoretical Computer Science 19,
no. 4 (2017). https://doi.org/10.23638/DMTCS-19-4-1.
ieee: W. Czerwinski, W. Martens, L. van Rooijen, M. Zeitoun, and G. Zetzsche, “A
Characterization for Decidable Separability by Piecewise Testable Languages,”
Discrete Mathematics & Theoretical Computer Science, vol. 19, no. 4,
2017.
mla: Czerwinski, Wojciech, et al. “A Characterization for Decidable Separability
by Piecewise Testable Languages.” Discrete Mathematics & Theoretical Computer
Science, vol. 19, no. 4, 2017, doi:10.23638/DMTCS-19-4-1.
short: W. Czerwinski, W. Martens, L. van Rooijen, M. Zeitoun, G. Zetzsche, Discrete
Mathematics & Theoretical Computer Science 19 (2017).
date_created: 2019-01-15T09:54:52Z
date_updated: 2022-01-06T07:03:17Z
department:
- _id: '66'
doi: 10.23638/DMTCS-19-4-1
intvolume: ' 19'
issue: '4'
language:
- iso: eng
publication: Discrete Mathematics & Theoretical Computer Science
status: public
title: A Characterization for Decidable Separability by Piecewise Testable Languages
type: journal_article
user_id: '58843'
volume: 19
year: '2017'
...
---
_id: '6737'
author:
- first_name: Dennis
full_name: Wolters, Dennis
id: '11308'
last_name: Wolters
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: Wolters D, Gerth C, Engels G. Visual Requirements Modeling for Cross-Device
Systems. Computer Science and Information Systems (ComSIS). 2017;14(2):517-536.
doi:10.2298/CSIS160930015W
apa: Wolters, D., Gerth, C., & Engels, G. (2017). Visual Requirements Modeling
for Cross-Device Systems. Computer Science and Information Systems (ComSIS),
14(2), 517–536. https://doi.org/10.2298/CSIS160930015W
bibtex: '@article{Wolters_Gerth_Engels_2017, title={Visual Requirements Modeling
for Cross-Device Systems}, volume={14}, DOI={10.2298/CSIS160930015W},
number={2}, journal={Computer Science and Information Systems (ComSIS)}, author={Wolters,
Dennis and Gerth, Christian and Engels, Gregor}, year={2017}, pages={517–536}
}'
chicago: 'Wolters, Dennis, Christian Gerth, and Gregor Engels. “Visual Requirements
Modeling for Cross-Device Systems.” Computer Science and Information Systems
(ComSIS) 14, no. 2 (2017): 517–36. https://doi.org/10.2298/CSIS160930015W.'
ieee: D. Wolters, C. Gerth, and G. Engels, “Visual Requirements Modeling for Cross-Device
Systems,” Computer Science and Information Systems (ComSIS), vol. 14, no.
2, pp. 517–536, 2017.
mla: Wolters, Dennis, et al. “Visual Requirements Modeling for Cross-Device Systems.”
Computer Science and Information Systems (ComSIS), vol. 14, no. 2, 2017,
pp. 517–36, doi:10.2298/CSIS160930015W.
short: D. Wolters, C. Gerth, G. Engels, Computer Science and Information Systems
(ComSIS) 14 (2017) 517–536.
date_created: 2019-01-15T14:11:10Z
date_updated: 2022-01-06T07:03:17Z
department:
- _id: '66'
doi: 10.2298/CSIS160930015W
intvolume: ' 14'
issue: '2'
language:
- iso: eng
page: 517-536
publication: Computer Science and Information Systems (ComSIS)
status: public
title: Visual Requirements Modeling for Cross-Device Systems
type: journal_article
user_id: '11308'
volume: 14
year: '2017'
...
---
_id: '6764'
author:
- first_name: Ivan
full_name: Jovanovikj, Ivan
id: '39187'
last_name: Jovanovikj
orcid: https://orcid.org/0000-0002-1838-794X
- first_name: Stefan
full_name: Sauer, Stefan
id: '447'
last_name: Sauer
citation:
ama: Jovanovikj I, Sauer S. Towards a Framework for Constructing Context-Specific
Migration Methods for Test Cases. Softwaretechnik-Trends, Proceedings of the
19th Workshop Software-Reengineering & Evolution (WSRE) & 8th Workshop
Design for Future (DFF). 2017;37(2):50-51.
apa: Jovanovikj, I., & Sauer, S. (2017). Towards a Framework for Constructing
Context-Specific Migration Methods for Test Cases. Softwaretechnik-Trends,
Proceedings of the 19th Workshop Software-Reengineering & Evolution (WSRE)
& 8th Workshop Design for Future (DFF), 37(2), 50–51.
bibtex: '@article{Jovanovikj_Sauer_2017, title={Towards a Framework for Constructing
Context-Specific Migration Methods for Test Cases}, volume={37}, number={2}, journal={Softwaretechnik-Trends,
Proceedings of the 19th Workshop Software-Reengineering & Evolution (WSRE)
& 8th Workshop Design for Future (DFF)}, publisher={Gesellschaft für Informatik
e.V., Fachgruppe PARS}, author={Jovanovikj, Ivan and Sauer, Stefan}, year={2017},
pages={50–51} }'
chicago: 'Jovanovikj, Ivan, and Stefan Sauer. “Towards a Framework for Constructing
Context-Specific Migration Methods for Test Cases.” Softwaretechnik-Trends,
Proceedings of the 19th Workshop Software-Reengineering & Evolution (WSRE)
& 8th Workshop Design for Future (DFF) 37, no. 2 (2017): 50–51.'
ieee: I. Jovanovikj and S. Sauer, “Towards a Framework for Constructing Context-Specific
Migration Methods for Test Cases,” Softwaretechnik-Trends, Proceedings of the
19th Workshop Software-Reengineering & Evolution (WSRE) & 8th Workshop
Design for Future (DFF), vol. 37, no. 2, pp. 50–51, 2017.
mla: Jovanovikj, Ivan, and Stefan Sauer. “Towards a Framework for Constructing Context-Specific
Migration Methods for Test Cases.” Softwaretechnik-Trends, Proceedings of the
19th Workshop Software-Reengineering & Evolution (WSRE) & 8th Workshop
Design for Future (DFF), vol. 37, no. 2, Gesellschaft für Informatik e.V.,
Fachgruppe PARS, 2017, pp. 50–51.
short: I. Jovanovikj, S. Sauer, Softwaretechnik-Trends, Proceedings of the 19th
Workshop Software-Reengineering & Evolution (WSRE) & 8th Workshop Design
for Future (DFF) 37 (2017) 50–51.
conference:
location: Bad Honnef
name: 19th Workshop Software-Reengineering & Evolution (WSRE) & 8th Workshop Design
for Future (DFF)
date_created: 2019-01-16T09:45:29Z
date_updated: 2022-01-06T07:03:17Z
department:
- _id: '66'
- _id: '534'
intvolume: ' 37'
issue: '2'
language:
- iso: eng
page: ' 50-51 '
publication: Softwaretechnik-Trends, Proceedings of the 19th Workshop Software-Reengineering
& Evolution (WSRE) & 8th Workshop Design for Future (DFF)
publisher: Gesellschaft für Informatik e.V., Fachgruppe PARS
status: public
title: Towards a Framework for Constructing Context-Specific Migration Methods for
Test Cases
type: journal_article
user_id: '39187'
volume: 37
year: '2017'
...
---
_id: '68'
abstract:
- lang: eng
text: Proof-carrying hardware (PCH) is a principle for achieving safety for dynamically
reconfigurable hardware systems. The producer of a hardware module spends huge
effort when creating a proof for a safety policy. The proof is then transferred
as a certificate together with the configuration bitstream to the consumer of
the hardware module, who can quickly verify the given proof. Previous work utilized
SAT solvers and resolution traces to set up a PCH technology and corresponding
tool flows. In this article, we present a novel technology for PCH based on inductive
invariants. For sequential circuits, our approach is fundamentally stronger than
the previous SAT-based one since we avoid the limitations of bounded unrolling.
We contrast our technology to existing ones and show that it fits into previously
proposed tool flows. We conduct experiments with four categories of benchmark
circuits and report consumer and producer runtime and peak memory consumption,
as well as the size of the certificates and the distribution of the workload between
producer and consumer. Experiments clearly show that our new induction-based technology
is superior for sequential circuits, whereas the previous SAT-based technology
is the better choice for combinational circuits.
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
citation:
ama: Isenberg T, Platzner M, Wehrheim H, Wiersema T. Proof-Carrying Hardware via
Inductive Invariants. ACM Transactions on Design Automation of Electronic Systems.
2017;(4):61:1--61:23. doi:10.1145/3054743
apa: Isenberg, T., Platzner, M., Wehrheim, H., & Wiersema, T. (2017). Proof-Carrying
Hardware via Inductive Invariants. ACM Transactions on Design Automation of
Electronic Systems, (4), 61:1--61:23. https://doi.org/10.1145/3054743
bibtex: '@article{Isenberg_Platzner_Wehrheim_Wiersema_2017, title={Proof-Carrying
Hardware via Inductive Invariants}, DOI={10.1145/3054743},
number={4}, journal={ACM Transactions on Design Automation of Electronic Systems},
publisher={ACM}, author={Isenberg, Tobias and Platzner, Marco and Wehrheim, Heike
and Wiersema, Tobias}, year={2017}, pages={61:1--61:23} }'
chicago: 'Isenberg, Tobias, Marco Platzner, Heike Wehrheim, and Tobias Wiersema.
“Proof-Carrying Hardware via Inductive Invariants.” ACM Transactions on Design
Automation of Electronic Systems, no. 4 (2017): 61:1--61:23. https://doi.org/10.1145/3054743.'
ieee: T. Isenberg, M. Platzner, H. Wehrheim, and T. Wiersema, “Proof-Carrying Hardware
via Inductive Invariants,” ACM Transactions on Design Automation of Electronic
Systems, no. 4, pp. 61:1--61:23, 2017.
mla: Isenberg, Tobias, et al. “Proof-Carrying Hardware via Inductive Invariants.”
ACM Transactions on Design Automation of Electronic Systems, no. 4, ACM,
2017, pp. 61:1--61:23, doi:10.1145/3054743.
short: T. Isenberg, M. Platzner, H. Wehrheim, T. Wiersema, ACM Transactions on Design
Automation of Electronic Systems (2017) 61:1--61:23.
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:20Z
ddc:
- '000'
department:
- _id: '77'
- _id: '78'
doi: 10.1145/3054743
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T16:08:17Z
date_updated: 2018-11-02T16:08:17Z
file_id: '5324'
file_name: a61-isenberg.pdf
file_size: 806356
relation: main_file
success: 1
file_date_updated: 2018-11-02T16:08:17Z
has_accepted_license: '1'
issue: '4'
language:
- iso: eng
page: 61:1--61:23
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: ACM Transactions on Design Automation of Electronic Systems
publisher: ACM
status: public
title: Proof-Carrying Hardware via Inductive Invariants
type: journal_article
user_id: '3118'
year: '2017'
...
---
_id: '685'
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
citation:
ama: Jakobs M-C. On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-104
apa: Jakobs, M.-C. (2017). On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-104
bibtex: '@book{Jakobs_2017, title={On-The-Fly Safety Checking - Customizing Program
Certification and Program Restructuring}, DOI={10.17619/UNIPB/1-104},
publisher={Universität Paderborn}, author={Jakobs, Marie-Christine}, year={2017}
}'
chicago: Jakobs, Marie-Christine. On-The-Fly Safety Checking - Customizing Program
Certification and Program Restructuring. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-104.
ieee: M.-C. Jakobs, On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring. Universität Paderborn, 2017.
mla: Jakobs, Marie-Christine. On-The-Fly Safety Checking - Customizing Program
Certification and Program Restructuring. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-104.
short: M.-C. Jakobs, On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring, Universität Paderborn, 2017.
date_created: 2017-11-13T08:13:29Z
date_updated: 2022-01-06T07:03:22Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.17619/UNIPB/1-104
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T12:26:52Z
date_updated: 2018-03-14T12:26:52Z
file_id: '1211'
file_name: 685-Dissertation-Jakobs.pdf
file_size: 11828624
relation: main_file
success: 1
file_date_updated: 2018-03-14T12:26:52Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: On-The-Fly Safety Checking - Customizing Program Certification and Program
Restructuring
type: dissertation
user_id: '477'
year: '2017'
...
---
_id: '69'
abstract:
- lang: eng
text: 'Today, software is traded worldwide on global markets, with apps being downloaded
to smartphones within minutes or seconds. This poses, more than ever, the challenge
of ensuring safety of software in the face of (1) unknown or untrusted software
providers together with (2) resource-limited software consumers. The concept of
Proof-Carrying Code (PCC), years ago suggested by Necula, provides one framework
for securing the execution of untrusted code. PCC techniques attach safety proofs,
constructed by software producers, to code. Based on the assumption that checking
proofs is usually much simpler than constructing proofs, software consumers should
thus be able to quickly check the safety of software. However, PCC techniques
often suffer from the size of certificates (i.e., the attached proofs), making
PCC techniques inefficient in practice.In this article, we introduce a new framework
for the safe execution of untrusted code called Programs from Proofs (PfP). The
basic assumption underlying the PfP technique is the fact that the structure of
programs significantly influences the complexity of checking a specific safety
property. Instead of attaching proofs to program code, the PfP technique transforms
the program into an efficiently checkable form, thus guaranteeing quick safety
checks for software consumers. For this transformation, the technique also uses
a producer-side automatic proof of safety. More specifically, safety proving for
the software producer proceeds via the construction of an abstract reachability
graph (ARG) unfolding the control-flow automaton (CFA) up to the degree necessary
for simple checking. To this end, we combine different sorts of software analysis:
expensive analyses incrementally determining the degree of unfolding, and cheap
analyses responsible for safety checking. Out of the abstract reachability graph
we generate the new program. In its CFA structure, it is isomorphic to the graph
and hence another, this time consumer-side, cheap analysis can quickly determine
its safety.Like PCC, Programs from Proofs is a general framework instantiable
with different sorts of (expensive and cheap) analysis. Here, we present the general
framework and exemplify it by some concrete examples. We have implemented different
instantiations on top of the configurable program analysis tool CPAchecker and
report on experiments, in particular on comparisons with PCC techniques.'
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Jakobs M-C, Wehrheim H. Programs from Proofs: A Framework for the Safe Execution
of Untrusted Software. ACM Transactions on Programming Languages and Systems.
2017;(2):7:1-7:56. doi:10.1145/3014427'
apa: 'Jakobs, M.-C., & Wehrheim, H. (2017). Programs from Proofs: A Framework
for the Safe Execution of Untrusted Software. ACM Transactions on Programming
Languages and Systems, (2), 7:1-7:56. https://doi.org/10.1145/3014427'
bibtex: '@article{Jakobs_Wehrheim_2017, title={Programs from Proofs: A Framework
for the Safe Execution of Untrusted Software}, DOI={10.1145/3014427},
number={2}, journal={ACM Transactions on Programming Languages and Systems}, publisher={ACM},
author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017}, pages={7:1-7:56}
}'
chicago: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs: A
Framework for the Safe Execution of Untrusted Software.” ACM Transactions on
Programming Languages and Systems, no. 2 (2017): 7:1-7:56. https://doi.org/10.1145/3014427.'
ieee: 'M.-C. Jakobs and H. Wehrheim, “Programs from Proofs: A Framework for the
Safe Execution of Untrusted Software,” ACM Transactions on Programming Languages
and Systems, no. 2, pp. 7:1-7:56, 2017.'
mla: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs: A Framework
for the Safe Execution of Untrusted Software.” ACM Transactions on Programming
Languages and Systems, no. 2, ACM, 2017, pp. 7:1-7:56, doi:10.1145/3014427.'
short: M.-C. Jakobs, H. Wehrheim, ACM Transactions on Programming Languages and
Systems (2017) 7:1-7:56.
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:23Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1145/3014427
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:15:09Z
date_updated: 2018-03-21T13:15:09Z
file_id: '1575'
file_name: 69-a7-jakobs.pdf
file_size: 1215139
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:15:09Z
has_accepted_license: '1'
issue: '2'
language:
- iso: eng
page: 7:1-7:56
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: ACM Transactions on Programming Languages and Systems
publisher: ACM
status: public
title: 'Programs from Proofs: A Framework for the Safe Execution of Untrusted Software'
type: journal_article
user_id: '477'
year: '2017'
...
---
_id: '695'
author:
- first_name: Joshua
full_name: Nowack, Joshua
last_name: Nowack
citation:
ama: Nowack J. On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen
Einzelteilen. Universität Paderborn; 2017.
apa: Nowack, J. (2017). On-The-Fly Konstruktion zusammenhängender Straßennetze
aus gegebenen Einzelteilen. Universität Paderborn.
bibtex: '@book{Nowack_2017, title={On-The-Fly Konstruktion zusammenhängender Straßennetze
aus gegebenen Einzelteilen}, publisher={Universität Paderborn}, author={Nowack,
Joshua}, year={2017} }'
chicago: Nowack, Joshua. On-The-Fly Konstruktion zusammenhängender Straßennetze
aus gegebenen Einzelteilen. Universität Paderborn, 2017.
ieee: J. Nowack, On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen
Einzelteilen. Universität Paderborn, 2017.
mla: Nowack, Joshua. On-The-Fly Konstruktion zusammenhängender Straßennetze aus
gegebenen Einzelteilen. Universität Paderborn, 2017.
short: J. Nowack, On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen
Einzelteilen, Universität Paderborn, 2017.
date_created: 2017-11-14T06:57:49Z
date_updated: 2022-01-06T07:03:23Z
department:
- _id: '63'
language:
- iso: ger
publisher: Universität Paderborn
status: public
title: On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen
type: bachelorsthesis
user_id: '14052'
year: '2017'
...
---
_id: '16444'
author:
- first_name: Jürgen
full_name: Gausemeier, Jürgen
last_name: Gausemeier
- first_name: Eric
full_name: Bodden, Eric
last_name: Bodden
- first_name: Falko
full_name: ' Dressler, Falko'
last_name: ' Dressler'
- first_name: Roman
full_name: Dumitrescu, Roman
last_name: Dumitrescu
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christoph
full_name: Scheytt, Christoph
last_name: Scheytt
- first_name: Ansgar
full_name: Trächtler, Ansgar
last_name: Trächtler
citation:
ama: Gausemeier J, Bodden E, Dressler F, et al. Wissenschaftsforum Intelligente
Technische Systeme (WInTeSys). Paderborn; 2017.
apa: Gausemeier, J., Bodden, E., Dressler, F., Dumitrescu, R., Meyer auf der Heide,
F., Scheytt, C., & Trächtler, A. (2017). Wissenschaftsforum Intelligente
Technische Systeme (WInTeSys). Paderborn.
bibtex: '@book{Gausemeier_Bodden_ Dressler_Dumitrescu_Meyer auf der Heide_Scheytt_Trächtler_2017,
place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}}, title={Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)},
author={Gausemeier, Jürgen and Bodden, Eric and Dressler, Falko and Dumitrescu,
Roman and Meyer auf der Heide, Friedhelm and Scheytt, Christoph and Trächtler,
Ansgar}, year={2017}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}} }'
chicago: Gausemeier, Jürgen, Eric Bodden, Falko Dressler, Roman Dumitrescu, Friedhelm
Meyer auf der Heide, Christoph Scheytt, and Ansgar Trächtler. Wissenschaftsforum
Intelligente Technische Systeme (WInTeSys). Verlagsschriftenreihe Des Heinz
Nixdorf Instituts, Paderborn}. Paderborn, 2017.
ieee: J. Gausemeier et al., Wissenschaftsforum Intelligente Technische
Systeme (WInTeSys). Paderborn, 2017.
mla: Gausemeier, Jürgen, et al. Wissenschaftsforum Intelligente Technische Systeme
(WInTeSys). 2017.
short: J. Gausemeier, E. Bodden, F. Dressler, R. Dumitrescu, F. Meyer auf der Heide,
C. Scheytt, A. Trächtler, Wissenschaftsforum Intelligente Technische Systeme (WInTeSys),
Paderborn, 2017.
date_created: 2020-04-07T06:36:06Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
language:
- iso: eng
page: '369'
place: Paderborn
publication_status: published
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}
status: public
title: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)
type: book
user_id: '15415'
year: '2017'
...
---
_id: '16461'
author:
- first_name: Pascal
full_name: Bemmann, Pascal
last_name: Bemmann
- first_name: Felix
full_name: Biermeier, Felix
last_name: Biermeier
- first_name: Jan
full_name: Bürmann, Jan
last_name: Bürmann
- first_name: Arne
full_name: Kemper, Arne
last_name: Kemper
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Steffen
full_name: Knorr, Steffen
last_name: Knorr
- first_name: Nils
full_name: Kothe, Nils
last_name: Kothe
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Manuel
full_name: Malatyali, Manuel
id: '41265'
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Johannes Sebastian
full_name: Schaefer, Johannes Sebastian
id: '30291'
last_name: Schaefer
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: 'Bemmann P, Biermeier F, Bürmann J, et al. Monitoring of Domain-Related Problems
in Distributed Data Streams. In: Structural Information and Communication Complexity.
; 2017. doi:10.1007/978-3-319-72050-0_13'
apa: Bemmann, P., Biermeier, F., Bürmann, J., Kemper, A., Knollmann, T., Knorr,
S., Kothe, N., Mäcker, A., Malatyali, M., Meyer auf der Heide, F., Riechers, S.,
Schaefer, J. S., & Sundermeier, J. (2017). Monitoring of Domain-Related Problems
in Distributed Data Streams. In Structural Information and Communication Complexity.
https://doi.org/10.1007/978-3-319-72050-0_13
bibtex: '@inbook{Bemmann_Biermeier_Bürmann_Kemper_Knollmann_Knorr_Kothe_Mäcker_Malatyali_Meyer
auf der Heide_et al._2017, place={Cham}, title={Monitoring of Domain-Related Problems
in Distributed Data Streams}, DOI={10.1007/978-3-319-72050-0_13},
booktitle={Structural Information and Communication Complexity}, author={Bemmann,
Pascal and Biermeier, Felix and Bürmann, Jan and Kemper, Arne and Knollmann, Till
and Knorr, Steffen and Kothe, Nils and Mäcker, Alexander and Malatyali, Manuel
and Meyer auf der Heide, Friedhelm and et al.}, year={2017} }'
chicago: Bemmann, Pascal, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann,
Steffen Knorr, Nils Kothe, et al. “Monitoring of Domain-Related Problems in Distributed
Data Streams.” In Structural Information and Communication Complexity.
Cham, 2017. https://doi.org/10.1007/978-3-319-72050-0_13.
ieee: P. Bemmann et al., “Monitoring of Domain-Related Problems in Distributed
Data Streams,” in Structural Information and Communication Complexity,
Cham, 2017.
mla: Bemmann, Pascal, et al. “Monitoring of Domain-Related Problems in Distributed
Data Streams.” Structural Information and Communication Complexity, 2017,
doi:10.1007/978-3-319-72050-0_13.
short: 'P. Bemmann, F. Biermeier, J. Bürmann, A. Kemper, T. Knollmann, S. Knorr,
N. Kothe, A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, J.S. Schaefer,
J. Sundermeier, in: Structural Information and Communication Complexity, Cham,
2017.'
date_created: 2020-04-08T07:20:20Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-319-72050-0_13
external_id:
arxiv:
- 'arXiv:1706.03568 '
language:
- iso: eng
place: Cham
publication: Structural Information and Communication Complexity
publication_identifier:
isbn:
- '9783319720494'
- '9783319720500'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Monitoring of Domain-Related Problems in Distributed Data Streams
type: book_chapter
user_id: '15415'
year: '2017'
...
---
_id: '104'
author:
- first_name: Denis
full_name: Diemert, Denis
last_name: Diemert
citation:
ama: Diemert D. EAX - An Authenticated Encryption Mode for Block Ciphers.
Universität Paderborn; 2017.
apa: Diemert, D. (2017). EAX - An Authenticated Encryption Mode for Block Ciphers.
Universität Paderborn.
bibtex: '@book{Diemert_2017, title={EAX - An Authenticated Encryption Mode for Block
Ciphers}, publisher={Universität Paderborn}, author={Diemert, Denis}, year={2017}
}'
chicago: Diemert, Denis. EAX - An Authenticated Encryption Mode for Block Ciphers.
Universität Paderborn, 2017.
ieee: D. Diemert, EAX - An Authenticated Encryption Mode for Block Ciphers.
Universität Paderborn, 2017.
mla: Diemert, Denis. EAX - An Authenticated Encryption Mode for Block Ciphers.
Universität Paderborn, 2017.
short: D. Diemert, EAX - An Authenticated Encryption Mode for Block Ciphers, Universität
Paderborn, 2017.
date_created: 2017-10-17T12:41:11Z
date_updated: 2022-01-06T06:50:38Z
department:
- _id: '64'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: EAX - An Authenticated Encryption Mode for Block Ciphers
type: bachelorsthesis
user_id: '477'
year: '2017'
...