---
_id: '31060'
author:
- first_name: Michael
full_name: Feldmann, Michael
last_name: Feldmann
- first_name: Andreas
full_name: Padalkin, Andreas
id: '88238'
last_name: Padalkin
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Shlomi
full_name: Dolev, Shlomi
last_name: Dolev
citation:
ama: Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable
Circuits. J Comput Biol. 2022;29(4):317–343. doi:10.1089/cmb.2021.0363
apa: Feldmann, M., Padalkin, A., Scheideler, C., & Dolev, S. (2022). Coordinating
Amoebots via Reconfigurable Circuits. J. Comput. Biol., 29(4), 317–343.
https://doi.org/10.1089/cmb.2021.0363
bibtex: '@article{Feldmann_Padalkin_Scheideler_Dolev_2022, title={Coordinating Amoebots
via Reconfigurable Circuits}, volume={29}, DOI={10.1089/cmb.2021.0363},
number={4}, journal={J. Comput. Biol.}, author={Feldmann, Michael and Padalkin,
Andreas and Scheideler, Christian and Dolev, Shlomi}, year={2022}, pages={317–343}
}'
chicago: 'Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi
Dolev. “Coordinating Amoebots via Reconfigurable Circuits.” J. Comput. Biol.
29, no. 4 (2022): 317–343. https://doi.org/10.1089/cmb.2021.0363.'
ieee: 'M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots
via Reconfigurable Circuits,” J. Comput. Biol., vol. 29, no. 4, pp. 317–343,
2022, doi: 10.1089/cmb.2021.0363.'
mla: Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.”
J. Comput. Biol., vol. 29, no. 4, 2022, pp. 317–343, doi:10.1089/cmb.2021.0363.
short: M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, J. Comput. Biol. 29 (2022)
317–343.
date_created: 2022-05-04T12:29:22Z
date_updated: 2022-05-04T12:31:27Z
department:
- _id: '79'
doi: 10.1089/cmb.2021.0363
intvolume: ' 29'
issue: '4'
language:
- iso: eng
page: 317–343
publication: J. Comput. Biol.
status: public
title: Coordinating Amoebots via Reconfigurable Circuits
type: journal_article
user_id: '15504'
volume: 29
year: '2022'
...
---
_id: '31844'
abstract:
- lang: eng
text: "Encrypting data before sending it to the cloud ensures data confidentiality
but requires the cloud to compute on encrypted data. Trusted execution environments,
such as Intel SGX enclaves, promise to provide a secure environment in which data
can be decrypted and then processed. However, vulnerabilities in the executed
program give attackers ample opportunities to execute arbitrary code inside the
enclave. This code can modify the dataflow of the program and leak secrets via
SGX side channels. Fully homomorphic encryption would be an alternative to compute
on encrypted data without data leaks. However, due to its high computational complexity,
its applicability to general-purpose computing remains limited. Researchers have
made several proposals for transforming programs to perform encrypted computations
on less powerful encryption schemes. Yet current approaches do not support programs
making control-flow decisions based on encrypted data.\r\n \r\n
\ We introduce the concept of\r\n dataflow authentication\r\n
\ (DFAuth) to enable such programs. DFAuth prevents an adversary from
arbitrarily deviating from the dataflow of a program. Our technique hence offers
protections against the side-channel attacks described previously. We implemented
two flavors of DFAuth, a Java bytecode-to-bytecode compiler, and an SGX enclave
running a small and program-independent trusted code base. We applied DFAuth to
a neural network performing machine learning on sensitive medical data and a smart
charging scheduler for electric vehicles. Our transformation yields a neural network
with encrypted weights, which can be evaluated on encrypted inputs in\r\n \r\n \\( 12.55 \\,\\mathrm{m}\\mathrm{s} \\)\r\n
\ \r\n . Our protected scheduler is
capable of updating the encrypted charging plan in approximately 1.06 seconds.\r\n
\ "
author:
- first_name: Andreas
full_name: Fischer, Andreas
last_name: Fischer
- first_name: Benny
full_name: Fuhry, Benny
last_name: Fuhry
- first_name: Jörn
full_name: Kußmaul, Jörn
last_name: Kußmaul
- first_name: Jonas
full_name: Janneck, Jonas
last_name: Janneck
- 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, Kußmaul J, Janneck J, Kerschbaum F, Bodden E. Computation
on Encrypted Data Using Dataflow Authentication. ACM Transactions on Privacy
and Security. 2022;25(3):1-36. doi:10.1145/3513005
apa: Fischer, A., Fuhry, B., Kußmaul, J., Janneck, J., Kerschbaum, F., & Bodden,
E. (2022). Computation on Encrypted Data Using Dataflow Authentication. ACM
Transactions on Privacy and Security, 25(3), 1–36. https://doi.org/10.1145/3513005
bibtex: '@article{Fischer_Fuhry_Kußmaul_Janneck_Kerschbaum_Bodden_2022, title={Computation
on Encrypted Data Using Dataflow Authentication}, volume={25}, DOI={10.1145/3513005},
number={3}, journal={ACM Transactions on Privacy and Security}, publisher={Association
for Computing Machinery (ACM)}, author={Fischer, Andreas and Fuhry, Benny and
Kußmaul, Jörn and Janneck, Jonas and Kerschbaum, Florian and Bodden, Eric}, year={2022},
pages={1–36} }'
chicago: 'Fischer, Andreas, Benny Fuhry, Jörn Kußmaul, Jonas Janneck, Florian Kerschbaum,
and Eric Bodden. “Computation on Encrypted Data Using Dataflow Authentication.”
ACM Transactions on Privacy and Security 25, no. 3 (2022): 1–36. https://doi.org/10.1145/3513005.'
ieee: 'A. Fischer, B. Fuhry, J. Kußmaul, J. Janneck, F. Kerschbaum, and E. Bodden,
“Computation on Encrypted Data Using Dataflow Authentication,” ACM Transactions
on Privacy and Security, vol. 25, no. 3, pp. 1–36, 2022, doi: 10.1145/3513005.'
mla: Fischer, Andreas, et al. “Computation on Encrypted Data Using Dataflow Authentication.”
ACM Transactions on Privacy and Security, vol. 25, no. 3, Association for
Computing Machinery (ACM), 2022, pp. 1–36, doi:10.1145/3513005.
short: A. Fischer, B. Fuhry, J. Kußmaul, J. Janneck, F. Kerschbaum, E. Bodden, ACM
Transactions on Privacy and Security 25 (2022) 1–36.
date_created: 2022-06-09T10:28:03Z
date_updated: 2022-06-09T10:29:19Z
department:
- _id: '76'
doi: 10.1145/3513005
intvolume: ' 25'
issue: '3'
keyword:
- Safety
- Risk
- Reliability and Quality
- General Computer Science
language:
- iso: eng
page: 1-36
publication: ACM Transactions on Privacy and Security
publication_identifier:
issn:
- 2471-2566
- 2471-2574
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Computation on Encrypted Data Using Dataflow Authentication
type: journal_article
user_id: '15249'
volume: 25
year: '2022'
...
---
_id: '31947'
author:
- first_name: Henning
full_name: Hillebrandt, Henning
last_name: Hillebrandt
citation:
ama: Hillebrandt H. Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk
Graphen.; 2022.
apa: Hillebrandt, H. (2022). Verteiltes Berechnen kompakter Routingtabellen in
Unit Disk Graphen.
bibtex: '@book{Hillebrandt_2022, title={Verteiltes Berechnen kompakter Routingtabellen
in Unit Disk Graphen}, author={Hillebrandt, Henning}, year={2022} }'
chicago: Hillebrandt, Henning. Verteiltes Berechnen Kompakter Routingtabellen
in Unit Disk Graphen, 2022.
ieee: H. Hillebrandt, Verteiltes Berechnen kompakter Routingtabellen in Unit
Disk Graphen. 2022.
mla: Hillebrandt, Henning. Verteiltes Berechnen Kompakter Routingtabellen in
Unit Disk Graphen. 2022.
short: H. Hillebrandt, Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk
Graphen, 2022.
date_created: 2022-06-20T06:16:32Z
date_updated: 2022-06-20T06:16:49Z
ddc:
- '000'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2022-06-20T06:16:09Z
date_updated: 2022-06-20T06:16:09Z
file_id: '31950'
file_name: BA_Hillebrandt.pdf
file_size: 1585281
relation: main_file
success: 1
file_date_updated: 2022-06-20T06:16:09Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen
type: bachelorsthesis
user_id: '15504'
year: '2022'
...
---
_id: '32311'
abstract:
- lang: eng
text: Testing is one of the most frequent means of quality assurance for software.
Property-based testing aims at generating test suites for checking code against
user-defined properties. Test input generation is, however, most often independent
of the property to be checked, and is instead based on random or user-defined
data generation.In this paper, we present property-driven unit testing of functions
with numerical inputs and outputs. Alike property-based testing, it allows users
to define the properties to be tested for. Contrary to property-based testing,
it also uses the property for a targeted generation of test inputs. Our approach
is a form of learning-based testing where we first of all learn a model of a given
black-box function using standard machine learning algorithms, and in a second
step use model and property for test input generation. This allows us to test
both predefined functions as well as machine learned regression models. Our experimental
evaluation shows that our property-driven approach is more effective than standard
property-based testing techniques.
author:
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
- first_name: Vitaly
full_name: Melnikov, Vitaly
id: '58747'
last_name: Melnikov
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Sharma A, Melnikov V, Hüllermeier E, Wehrheim H. Property-Driven Testing of
Black-Box Functions. In: Proceedings of the 10th IEEE/ACM International Conference
on Formal Methods in Software Engineering (FormaliSE). IEEE; 2022:113-123.'
apa: Sharma, A., Melnikov, V., Hüllermeier, E., & Wehrheim, H. (2022). Property-Driven
Testing of Black-Box Functions. Proceedings of the 10th IEEE/ACM International
Conference on Formal Methods in Software Engineering (FormaliSE), 113–123.
bibtex: '@inproceedings{Sharma_Melnikov_Hüllermeier_Wehrheim_2022, title={Property-Driven
Testing of Black-Box Functions}, booktitle={Proceedings of the 10th IEEE/ACM International
Conference on Formal Methods in Software Engineering (FormaliSE)}, publisher={IEEE},
author={Sharma, Arnab and Melnikov, Vitaly and Hüllermeier, Eyke and Wehrheim,
Heike}, year={2022}, pages={113–123} }'
chicago: Sharma, Arnab, Vitaly Melnikov, Eyke Hüllermeier, and Heike Wehrheim. “Property-Driven
Testing of Black-Box Functions.” In Proceedings of the 10th IEEE/ACM International
Conference on Formal Methods in Software Engineering (FormaliSE), 113–23.
IEEE, 2022.
ieee: A. Sharma, V. Melnikov, E. Hüllermeier, and H. Wehrheim, “Property-Driven
Testing of Black-Box Functions,” in Proceedings of the 10th IEEE/ACM International
Conference on Formal Methods in Software Engineering (FormaliSE), 2022, pp.
113–123.
mla: Sharma, Arnab, et al. “Property-Driven Testing of Black-Box Functions.” Proceedings
of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering
(FormaliSE), IEEE, 2022, pp. 113–23.
short: 'A. Sharma, V. Melnikov, E. Hüllermeier, H. Wehrheim, in: Proceedings of
the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering
(FormaliSE), IEEE, 2022, pp. 113–123.'
date_created: 2022-07-01T11:18:03Z
date_updated: 2022-07-01T11:21:36Z
department:
- _id: '7'
language:
- iso: eng
page: 113-123
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '11'
name: 'SFB 901 - B3: SFB 901 - Subproject B3'
publication: Proceedings of the 10th IEEE/ACM International Conference on Formal Methods
in Software Engineering (FormaliSE)
publisher: IEEE
status: public
title: Property-Driven Testing of Black-Box Functions
type: conference
user_id: '477'
year: '2022'
...
---
_id: '29842'
abstract:
- lang: eng
text: To build successful software products, developers continuously have to discover
what features the users really need. This discovery can be achieved with continuous
experimentation, testing different software variants with distinct user groups,
and deploying the superior variant for all users. However, existing approaches
do not focus on explicit modeling of variants and experiments, which offers advantages
such as traceability of decisions and combinability of experiments. Therefore,
our vision is the provision of model-driven continuous experimentation, which
provides the developer with a framework for structuring the experimentation process.
For that, we introduce the overall concept, apply it to the experimentation on
component-based software architectures and point out future research questions.
In particular, we show the applicability by combining feature models for modeling
the software variants, users, and experiments (i.e., model-driven) with MAPE-K
for the adaptation (i.e., continuous experimentation) and implementing the concept
based on the component-based Angular framework.
author:
- first_name: Sebastian
full_name: Gottschalk, Sebastian
id: '47208'
last_name: Gottschalk
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Gottschalk S, Yigitbas E, Engels G. Model-driven Continuous Experimentation
on Component-based Software Architectures . In: Proceedings of the 18th International
Conference on Software Architecture Companion . IEEE; 2022. doi:10.1109/ICSA-C54293.2022.00011'
apa: Gottschalk, S., Yigitbas, E., & Engels, G. (2022). Model-driven Continuous
Experimentation on Component-based Software Architectures . Proceedings of
the 18th International Conference on Software Architecture Companion . 18th
International Conference on Software Architecture , Hawaii. https://doi.org/10.1109/ICSA-C54293.2022.00011
bibtex: '@inproceedings{Gottschalk_Yigitbas_Engels_2022, title={Model-driven Continuous
Experimentation on Component-based Software Architectures }, DOI={10.1109/ICSA-C54293.2022.00011},
booktitle={Proceedings of the 18th International Conference on Software Architecture
Companion }, publisher={IEEE}, author={Gottschalk, Sebastian and Yigitbas, Enes
and Engels, Gregor}, year={2022} }'
chicago: Gottschalk, Sebastian, Enes Yigitbas, and Gregor Engels. “Model-Driven
Continuous Experimentation on Component-Based Software Architectures .” In Proceedings
of the 18th International Conference on Software Architecture Companion .
IEEE, 2022. https://doi.org/10.1109/ICSA-C54293.2022.00011.
ieee: 'S. Gottschalk, E. Yigitbas, and G. Engels, “Model-driven Continuous Experimentation
on Component-based Software Architectures ,” presented at the 18th International
Conference on Software Architecture , Hawaii, 2022, doi: 10.1109/ICSA-C54293.2022.00011.'
mla: Gottschalk, Sebastian, et al. “Model-Driven Continuous Experimentation on Component-Based
Software Architectures .” Proceedings of the 18th International Conference
on Software Architecture Companion , IEEE, 2022, doi:10.1109/ICSA-C54293.2022.00011.
short: 'S. Gottschalk, E. Yigitbas, G. Engels, in: Proceedings of the 18th International
Conference on Software Architecture Companion , IEEE, 2022.'
conference:
end_date: 2022-03-15
location: Hawaii
name: '18th International Conference on Software Architecture '
start_date: 2022-03-12
date_created: 2022-02-15T07:32:10Z
date_updated: 2022-07-04T12:34:53Z
ddc:
- '000'
department:
- _id: '66'
- _id: '534'
doi: 10.1109/ICSA-C54293.2022.00011
file:
- access_level: open_access
content_type: application/pdf
creator: sego
date_created: 2022-07-04T12:33:18Z
date_updated: 2022-07-04T12:34:52Z
file_id: '32322'
file_name: ICSA_CR.pdf
file_size: 183185
relation: main_file
file_date_updated: 2022-07-04T12:34:52Z
has_accepted_license: '1'
keyword:
- continuous experimentation
- model-driven
- component-based software architectures
- self-adaptation
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '17'
name: 'SFB 901 - C5: SFB 901 - Subproject C5'
publication: 'Proceedings of the 18th International Conference on Software Architecture
Companion '
publisher: IEEE
status: public
title: 'Model-driven Continuous Experimentation on Component-based Software Architectures '
type: conference
user_id: '47208'
year: '2022'
...
---
_id: '32335'
abstract:
- lang: eng
text: Aspects of data science surround us in many contexts, for example regarding
climate change, air pollution, and other environmental issues. To open the “data-science-black-box”
for lower secondary school students we developed a data science project focussing
on the analysis of self-collected environmental data. We embed this project in
computer science education, which enables us to use a new knowledge-based programming
approach for the data analysis within Jupyter Notebooks and the programming language
Python. In this paper, we evaluate the second cycle of this project which took
place in a ninth-grade computer science class. In particular, we present how the
students coped with the professional tool of Jupyter Notebooks for doing statistical
investigations and which insights they gained.
article_number: '6'
author:
- first_name: SUSANNE
full_name: PODWORNY, SUSANNE
last_name: PODWORNY
- first_name: Sven
full_name: Hüsing, Sven
id: '58465'
last_name: Hüsing
- first_name: CARSTEN
full_name: SCHULTE, CARSTEN
last_name: SCHULTE
citation:
ama: 'PODWORNY S, Hüsing S, SCHULTE C. A PLACE FOR A DATA SCIENCE PROJECT IN SCHOOL:
BETWEEN STATISTICS AND EPISTEMIC PROGRAMMING. STATISTICS EDUCATION RESEARCH
JOURNAL. 2022;21(2). doi:10.52041/serj.v21i2.46'
apa: 'PODWORNY, S., Hüsing, S., & SCHULTE, C. (2022). A PLACE FOR A DATA SCIENCE
PROJECT IN SCHOOL: BETWEEN STATISTICS AND EPISTEMIC PROGRAMMING. STATISTICS
EDUCATION RESEARCH JOURNAL, 21(2), Article 6. https://doi.org/10.52041/serj.v21i2.46'
bibtex: '@article{PODWORNY_Hüsing_SCHULTE_2022, title={A PLACE FOR A DATA SCIENCE
PROJECT IN SCHOOL: BETWEEN STATISTICS AND EPISTEMIC PROGRAMMING}, volume={21},
DOI={10.52041/serj.v21i2.46},
number={26}, journal={STATISTICS EDUCATION RESEARCH JOURNAL}, publisher={International
Association for Statistical Education}, author={PODWORNY, SUSANNE and Hüsing,
Sven and SCHULTE, CARSTEN}, year={2022} }'
chicago: 'PODWORNY, SUSANNE, Sven Hüsing, and CARSTEN SCHULTE. “A PLACE FOR A DATA
SCIENCE PROJECT IN SCHOOL: BETWEEN STATISTICS AND EPISTEMIC PROGRAMMING.” STATISTICS
EDUCATION RESEARCH JOURNAL 21, no. 2 (2022). https://doi.org/10.52041/serj.v21i2.46.'
ieee: 'S. PODWORNY, S. Hüsing, and C. SCHULTE, “A PLACE FOR A DATA SCIENCE PROJECT
IN SCHOOL: BETWEEN STATISTICS AND EPISTEMIC PROGRAMMING,” STATISTICS EDUCATION
RESEARCH JOURNAL, vol. 21, no. 2, Art. no. 6, 2022, doi: 10.52041/serj.v21i2.46.'
mla: 'PODWORNY, SUSANNE, et al. “A PLACE FOR A DATA SCIENCE PROJECT IN SCHOOL: BETWEEN
STATISTICS AND EPISTEMIC PROGRAMMING.” STATISTICS EDUCATION RESEARCH JOURNAL,
vol. 21, no. 2, 6, International Association for Statistical Education, 2022,
doi:10.52041/serj.v21i2.46.'
short: S. PODWORNY, S. Hüsing, C. SCHULTE, STATISTICS EDUCATION RESEARCH JOURNAL
21 (2022).
date_created: 2022-07-08T12:06:48Z
date_updated: 2022-07-08T12:07:46Z
department:
- _id: '67'
doi: 10.52041/serj.v21i2.46
intvolume: ' 21'
issue: '2'
keyword:
- Education
- Statistics and Probability
language:
- iso: eng
publication: STATISTICS EDUCATION RESEARCH JOURNAL
publication_identifier:
issn:
- 1570-1824
publication_status: published
publisher: International Association for Statistical Education
status: public
title: 'A PLACE FOR A DATA SCIENCE PROJECT IN SCHOOL: BETWEEN STATISTICS AND EPISTEMIC
PROGRAMMING'
type: journal_article
user_id: '58465'
volume: 21
year: '2022'
...
---
_id: '29673'
abstract:
- lang: eng
text: Koopman operator theory has been successfully applied to problems from various
research areas such as fluid dynamics, molecular dynamics, climate science, engineering,
and biology. Applications include detecting metastable or coherent sets, coarse-graining,
system identification, and control. There is an intricate connection between dynamical
systems driven by stochastic differential equations and quantum mechanics. In
this paper, we compare the ground-state transformation and Nelson's stochastic
mechanics and demonstrate how data-driven methods developed for the approximation
of the Koopman operator can be used to analyze quantum physics problems. Moreover,
we exploit the relationship between Schrödinger operators and stochastic control
problems to show that modern data-driven methods for stochastic control can be
used to solve the stationary or imaginary-time Schrödinger equation. Our findings
open up a new avenue towards solving Schrödinger's equation using recently developed
tools from data science.
author:
- first_name: Stefan
full_name: Klus, Stefan
last_name: Klus
- first_name: Feliks
full_name: Nüske, Feliks
id: '81513'
last_name: Nüske
orcid: 0000-0003-2444-7889
- first_name: Sebastian
full_name: Peitz, Sebastian
id: '47427'
last_name: Peitz
orcid: 0000-0002-3389-793X
citation:
ama: 'Klus S, Nüske F, Peitz S. Koopman analysis of quantum systems. Journal
of Physics A: Mathematical and Theoretical. 2022;55(31):314002. doi:10.1088/1751-8121/ac7d22'
apa: 'Klus, S., Nüske, F., & Peitz, S. (2022). Koopman analysis of quantum systems.
Journal of Physics A: Mathematical and Theoretical, 55(31), 314002.
https://doi.org/10.1088/1751-8121/ac7d22'
bibtex: '@article{Klus_Nüske_Peitz_2022, title={Koopman analysis of quantum systems},
volume={55}, DOI={10.1088/1751-8121/ac7d22},
number={31}, journal={Journal of Physics A: Mathematical and Theoretical}, publisher={IOP
Publishing Ltd.}, author={Klus, Stefan and Nüske, Feliks and Peitz, Sebastian},
year={2022}, pages={314002} }'
chicago: 'Klus, Stefan, Feliks Nüske, and Sebastian Peitz. “Koopman Analysis of
Quantum Systems.” Journal of Physics A: Mathematical and Theoretical 55,
no. 31 (2022): 314002. https://doi.org/10.1088/1751-8121/ac7d22.'
ieee: 'S. Klus, F. Nüske, and S. Peitz, “Koopman analysis of quantum systems,” Journal
of Physics A: Mathematical and Theoretical, vol. 55, no. 31, p. 314002, 2022,
doi: 10.1088/1751-8121/ac7d22.'
mla: 'Klus, Stefan, et al. “Koopman Analysis of Quantum Systems.” Journal of
Physics A: Mathematical and Theoretical, vol. 55, no. 31, IOP Publishing Ltd.,
2022, p. 314002, doi:10.1088/1751-8121/ac7d22.'
short: 'S. Klus, F. Nüske, S. Peitz, Journal of Physics A: Mathematical and Theoretical
55 (2022) 314002.'
date_created: 2022-01-31T09:49:40Z
date_updated: 2022-07-18T14:26:41Z
department:
- _id: '655'
- _id: '101'
doi: 10.1088/1751-8121/ac7d22
external_id:
arxiv:
- '2201.12062'
intvolume: ' 55'
issue: '31'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://iopscience.iop.org/article/10.1088/1751-8121/ac7d22/pdf
oa: '1'
page: '314002'
publication: 'Journal of Physics A: Mathematical and Theoretical'
publication_status: published
publisher: IOP Publishing Ltd.
status: public
title: Koopman analysis of quantum systems
type: journal_article
user_id: '47427'
volume: 55
year: '2022'
...
---
_id: '32409'
abstract:
- lang: eng
text: 'Context: Cryptographic APIs are often misused in real-world applications.
Therefore, many cryptographic API misuse detection tools have been introduced.
However, there exists no established reference benchmark for a fair and comprehensive
comparison and evaluation of these tools. While there are benchmarks, they often
only address a subset of the domain or were only used to evaluate a subset of
existing misuse detection tools. Objective: To fairly compare cryptographic API
misuse detection tools and to drive future development in this domain, we will
devise such a benchmark. Openness and transparency in the generation process are
key factors to fairly generate and establish the needed benchmark. Method: We
propose an approach where we derive the benchmark generation methodology from
the literature which consists of general best practices in benchmarking and domain-specific
benchmark generation. A part of this methodology is transparency and openness
of the generation process, which is achieved by pre-registering this work. Based
on our methodology we design CamBench, a fair "Cryptographic API Misuse Detection
Tool Benchmark Suite". We will implement the first version of CamBench limiting
the domain to Java, the JCA, and static analyses. Finally, we will use CamBench
to compare current misuse detection tools and compare CamBench to related benchmarks
of its domain.'
author:
- first_name: Michael
full_name: Schlichtig, Michael
id: '32312'
last_name: Schlichtig
orcid: 0000-0001-6600-6171
- first_name: Anna-Katharina
full_name: Wickert, Anna-Katharina
last_name: Wickert
- first_name: Stefan
full_name: Krüger, Stefan
last_name: Krüger
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Mira
full_name: Mezini, Mira
last_name: Mezini
citation:
ama: Schlichtig M, Wickert A-K, Krüger S, Bodden E, Mezini M. CamBench -- Cryptographic
API Misuse Detection Tool Benchmark Suite.; 2022. doi:10.48550/ARXIV.2204.06447
apa: Schlichtig, M., Wickert, A.-K., Krüger, S., Bodden, E., & Mezini, M. (2022).
CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite. https://doi.org/10.48550/ARXIV.2204.06447
bibtex: '@book{Schlichtig_Wickert_Krüger_Bodden_Mezini_2022, title={CamBench --
Cryptographic API Misuse Detection Tool Benchmark Suite}, DOI={10.48550/ARXIV.2204.06447},
author={Schlichtig, Michael and Wickert, Anna-Katharina and Krüger, Stefan and
Bodden, Eric and Mezini, Mira}, year={2022} }'
chicago: Schlichtig, Michael, Anna-Katharina Wickert, Stefan Krüger, Eric Bodden,
and Mira Mezini. CamBench -- Cryptographic API Misuse Detection Tool Benchmark
Suite, 2022. https://doi.org/10.48550/ARXIV.2204.06447.
ieee: M. Schlichtig, A.-K. Wickert, S. Krüger, E. Bodden, and M. Mezini, CamBench
-- Cryptographic API Misuse Detection Tool Benchmark Suite. 2022.
mla: Schlichtig, Michael, et al. CamBench -- Cryptographic API Misuse Detection
Tool Benchmark Suite. 2022, doi:10.48550/ARXIV.2204.06447.
short: M. Schlichtig, A.-K. Wickert, S. Krüger, E. Bodden, M. Mezini, CamBench --
Cryptographic API Misuse Detection Tool Benchmark Suite, 2022.
date_created: 2022-07-25T07:56:59Z
date_updated: 2022-07-25T10:23:44Z
department:
- _id: '76'
doi: 10.48550/ARXIV.2204.06447
keyword:
- cryptography
- benchmark
- API misuse
- static analysis
language:
- iso: eng
related_material:
link:
- relation: confirmation
url: https://arxiv.org/abs/2204.06447
status: public
title: CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite
type: misc
user_id: '32312'
year: '2022'
...
---
_id: '32414'
author:
- first_name: Michael
full_name: Lass, Michael
id: '24135'
last_name: Lass
orcid: 0000-0002-5708-7632
citation:
ama: Lass M. Bringing Massive Parallelism and Hardware Acceleration to Linear
Scaling Density Functional Theory Through Targeted Approximations. Universität
Paderborn; 2022. doi:10.17619/UNIPB/1-1281
apa: Lass, M. (2022). Bringing Massive Parallelism and Hardware Acceleration
to Linear Scaling Density Functional Theory Through Targeted Approximations.
Universität Paderborn. https://doi.org/10.17619/UNIPB/1-1281
bibtex: '@book{Lass_2022, place={Paderborn}, title={Bringing Massive Parallelism
and Hardware Acceleration to Linear Scaling Density Functional Theory Through
Targeted Approximations}, DOI={10.17619/UNIPB/1-1281},
publisher={Universität Paderborn}, author={Lass, Michael}, year={2022} }'
chicago: 'Lass, Michael. Bringing Massive Parallelism and Hardware Acceleration
to Linear Scaling Density Functional Theory Through Targeted Approximations.
Paderborn: Universität Paderborn, 2022. https://doi.org/10.17619/UNIPB/1-1281.'
ieee: 'M. Lass, Bringing Massive Parallelism and Hardware Acceleration to Linear
Scaling Density Functional Theory Through Targeted Approximations. Paderborn:
Universität Paderborn, 2022.'
mla: Lass, Michael. Bringing Massive Parallelism and Hardware Acceleration to
Linear Scaling Density Functional Theory Through Targeted Approximations.
Universität Paderborn, 2022, doi:10.17619/UNIPB/1-1281.
short: M. Lass, Bringing Massive Parallelism and Hardware Acceleration to Linear
Scaling Density Functional Theory Through Targeted Approximations, Universität
Paderborn, Paderborn, 2022.
date_created: 2022-07-25T18:13:51Z
date_updated: 2022-07-25T18:14:23Z
department:
- _id: '27'
- _id: '518'
doi: 10.17619/UNIPB/1-1281
language:
- iso: eng
place: Paderborn
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
title: Bringing Massive Parallelism and Hardware Acceleration to Linear Scaling Density
Functional Theory Through Targeted Approximations
type: dissertation
user_id: '24135'
year: '2022'
...
---
_id: '32410'
abstract:
- lang: eng
text: "Static analysis tools support developers in detecting potential coding issues,
such as bugs or vulnerabilities. Research on static analysis emphasizes its technical
challenges but also mentions severe usability shortcomings. These shortcomings
hinder the adoption of static analysis tools, and in some cases, user dissatisfaction
even leads to tool abandonment.\r\nTo comprehensively assess the current state
of the art, this paper presents the first systematic usability evaluation in a
wide range of static analysis tools. We derived a set of 36 relevant criteria
from the scientific literature and gathered a collection of 46 static analysis
tools complying with our inclusion and exclusion criteria - a representative set
of mainly non-proprietary tools. Then, we evaluated how well these tools fulfill
the aforementioned criteria.\r\nThe evaluation shows that more than half of the
considered tools offer poor warning messages, while about three-quarters of the
tools provide hardly any fix support. Furthermore, the integration of user knowledge
is strongly neglected, which could be used for improved handling of false positives
and tuning the results for the corresponding developer. Finally, issues regarding
workflow integration and specialized user interfaces are proved further.\r\nThese
findings should prove useful in guiding and focusing further research and development
in the area of user experience for static code analyses."
author:
- first_name: Marcus
full_name: Nachtigall, Marcus
id: '41213'
last_name: Nachtigall
- first_name: Michael
full_name: Schlichtig, Michael
id: '32312'
last_name: Schlichtig
orcid: 0000-0001-6600-6171
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: 'Nachtigall M, Schlichtig M, Bodden E. A Large-Scale Study of Usability Criteria
Addressed by Static Analysis Tools. In: Proceedings of the 31st ACM SIGSOFT
International Symposium on Software Testing and Analysis. ACM; 2022:532-543.
doi:10.1145/3533767'
apa: Nachtigall, M., Schlichtig, M., & Bodden, E. (2022). A Large-Scale Study
of Usability Criteria Addressed by Static Analysis Tools. Proceedings of the
31st ACM SIGSOFT International Symposium on Software Testing and Analysis,
532–543. https://doi.org/10.1145/3533767
bibtex: '@inproceedings{Nachtigall_Schlichtig_Bodden_2022, title={A Large-Scale
Study of Usability Criteria Addressed by Static Analysis Tools}, DOI={10.1145/3533767},
booktitle={Proceedings of the 31st ACM SIGSOFT International Symposium on Software
Testing and Analysis}, publisher={ACM}, author={Nachtigall, Marcus and Schlichtig,
Michael and Bodden, Eric}, year={2022}, pages={532–543} }'
chicago: Nachtigall, Marcus, Michael Schlichtig, and Eric Bodden. “A Large-Scale
Study of Usability Criteria Addressed by Static Analysis Tools.” In Proceedings
of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis,
532–43. ACM, 2022. https://doi.org/10.1145/3533767.
ieee: 'M. Nachtigall, M. Schlichtig, and E. Bodden, “A Large-Scale Study of Usability
Criteria Addressed by Static Analysis Tools,” in Proceedings of the 31st ACM
SIGSOFT International Symposium on Software Testing and Analysis, 2022, pp.
532–543, doi: 10.1145/3533767.'
mla: Nachtigall, Marcus, et al. “A Large-Scale Study of Usability Criteria Addressed
by Static Analysis Tools.” Proceedings of the 31st ACM SIGSOFT International
Symposium on Software Testing and Analysis, ACM, 2022, pp. 532–43, doi:10.1145/3533767.
short: 'M. Nachtigall, M. Schlichtig, E. Bodden, in: Proceedings of the 31st ACM
SIGSOFT International Symposium on Software Testing and Analysis, ACM, 2022, pp.
532–543.'
date_created: 2022-07-25T08:02:36Z
date_updated: 2022-07-26T11:42:23Z
department:
- _id: '76'
doi: 10.1145/3533767
keyword:
- Automated static analysis
- Software usability
language:
- iso: eng
page: 532 - 543
publication: Proceedings of the 31st ACM SIGSOFT International Symposium on Software
Testing and Analysis
publication_identifier:
isbn:
- '9781450393799'
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
link:
- relation: confirmation
url: https://dl.acm.org/doi/10.1145/3533767.3534374
status: public
title: A Large-Scale Study of Usability Criteria Addressed by Static Analysis Tools
type: conference
user_id: '32312'
year: '2022'
...
---
_id: '31133'
abstract:
- lang: eng
text: Application Programming Interfaces (APIs) are the primary mechanism that developers
use to obtain access to third-party algorithms and services. Unfortunately, APIs
can be misused, which can have catastrophic consequences, especially if the APIs
provide security-critical functionalities like cryptography. Understanding what
API misuses are, and for what reasons they are caused, is important to prevent
them, e.g., with API misuse detectors. However, definitions and nominations for
API misuses and related terms in literature vary and are diverse. This paper addresses
the problem of scattered knowledge and definitions of API misuses by presenting
a systematic literature review on the subject and introducing FUM, a novel Framework
for API Usage constraint and Misuse classification. The literature review revealed
that API misuses are violations of API usage constraints. To capture this, we
provide unified definitions and use them to derive FUM. To assess the extent to
which FUM aids in determining and guiding the improvement of an API misuses detectors'
capabilities, we performed a case study on CogniCrypt, a state-of-the-art misuse
detector for cryptographic APIs. The study showed that FUM can be used to properly
assess CogniCrypt's capabilities, identify weaknesses and assist in deriving mitigations
and improvements. And it appears that also more generally FUM can aid the development
and improvement of misuse detection tools.
author:
- first_name: Michael
full_name: Schlichtig, Michael
id: '32312'
last_name: Schlichtig
orcid: 0000-0001-6600-6171
- first_name: Steffen
full_name: Sassalla, Steffen
last_name: Sassalla
- first_name: Krishna
full_name: Narasimhan, Krishna
last_name: Narasimhan
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: 'Schlichtig M, Sassalla S, Narasimhan K, Bodden E. FUM - A Framework for API
Usage constraint and Misuse Classification. In: 2022 IEEE International Conference
on Software Analysis, Evolution and Reengineering (SANER). ; 2022:673-684.
doi:https://doi.org/10.1109/SANER53432.2022.00085'
apa: Schlichtig, M., Sassalla, S., Narasimhan, K., & Bodden, E. (2022). FUM
- A Framework for API Usage constraint and Misuse Classification. 2022 IEEE
International Conference on Software Analysis, Evolution and Reengineering (SANER),
673–684. https://doi.org/10.1109/SANER53432.2022.00085
bibtex: '@inproceedings{Schlichtig_Sassalla_Narasimhan_Bodden_2022, title={FUM -
A Framework for API Usage constraint and Misuse Classification}, DOI={https://doi.org/10.1109/SANER53432.2022.00085},
booktitle={2022 IEEE International Conference on Software Analysis, Evolution
and Reengineering (SANER)}, author={Schlichtig, Michael and Sassalla, Steffen
and Narasimhan, Krishna and Bodden, Eric}, year={2022}, pages={673–684} }'
chicago: Schlichtig, Michael, Steffen Sassalla, Krishna Narasimhan, and Eric Bodden.
“FUM - A Framework for API Usage Constraint and Misuse Classification.” In 2022
IEEE International Conference on Software Analysis, Evolution and Reengineering
(SANER), 673–84, 2022. https://doi.org/10.1109/SANER53432.2022.00085.
ieee: 'M. Schlichtig, S. Sassalla, K. Narasimhan, and E. Bodden, “FUM - A Framework
for API Usage constraint and Misuse Classification,” in 2022 IEEE International
Conference on Software Analysis, Evolution and Reengineering (SANER), 2022,
pp. 673–684, doi: https://doi.org/10.1109/SANER53432.2022.00085.'
mla: Schlichtig, Michael, et al. “FUM - A Framework for API Usage Constraint and
Misuse Classification.” 2022 IEEE International Conference on Software Analysis,
Evolution and Reengineering (SANER), 2022, pp. 673–84, doi:https://doi.org/10.1109/SANER53432.2022.00085.
short: 'M. Schlichtig, S. Sassalla, K. Narasimhan, E. Bodden, in: 2022 IEEE International
Conference on Software Analysis, Evolution and Reengineering (SANER), 2022, pp.
673–684.'
date_created: 2022-05-09T13:04:10Z
date_updated: 2022-07-26T11:42:30Z
department:
- _id: '76'
doi: https://doi.org/10.1109/SANER53432.2022.00085
keyword:
- API misuses
- API usage constraints
- classification framework
- API misuse detection
- static analysis
language:
- iso: eng
page: 673 - 684
publication: 2022 IEEE International Conference on Software Analysis, Evolution and
Reengineering (SANER)
quality_controlled: '1'
related_material:
link:
- relation: confirmation
url: https://ieeexplore.ieee.org/document/9825763
status: public
title: FUM - A Framework for API Usage constraint and Misuse Classification
type: conference
user_id: '32312'
year: '2022'
...
---
_id: '32399'
author:
- first_name: Ella
full_name: Vahle, Ella
last_name: Vahle
citation:
ama: Vahle E. Modelling and Proving Security for a Secure MPC Protocol for Stable
Matching.; 2022.
apa: Vahle, E. (2022). Modelling and Proving Security for a Secure MPC Protocol
for Stable Matching.
bibtex: '@book{Vahle_2022, title={Modelling and Proving Security for a Secure MPC
Protocol for Stable Matching}, author={Vahle, Ella}, year={2022} }'
chicago: Vahle, Ella. Modelling and Proving Security for a Secure MPC Protocol
for Stable Matching, 2022.
ieee: E. Vahle, Modelling and Proving Security for a Secure MPC Protocol for
Stable Matching. 2022.
mla: Vahle, Ella. Modelling and Proving Security for a Secure MPC Protocol for
Stable Matching. 2022.
short: E. Vahle, Modelling and Proving Security for a Secure MPC Protocol for Stable
Matching, 2022.
date_created: 2022-07-20T09:38:39Z
date_updated: 2022-07-26T14:31:54Z
department:
- _id: '64'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Modelling and Proving Security for a Secure MPC Protocol for Stable Matching
type: bachelorsthesis
user_id: '25078'
year: '2022'
...
---
_id: '31847'
abstract:
- lang: eng
text: "The famous $k$-Server Problem covers plenty of resource allocation scenarios,
and several variations have been studied extensively for decades. However, to
the best of our knowledge, no research has considered the problem if the servers
are not identical and requests can express which specific servers should serve
them. Therefore, we present a new model generalizing the $k$-Server Problem by
*preferences* of the requests and proceed to study it in a uniform metric space
for deterministic online algorithms (the special case of paging).\r\n\r\nIn our
model, requests can either demand to be answered by any server (*general requests*)
or by a specific one (*specific requests*). If only general requests appear, the
instance is one of the original $k$-Server Problem, and a lower bound for the
competitive ratio of $k$ applies. If only specific requests appear, a solution
with a competitive ratio of $1$ becomes trivial since there is no freedom regarding
the servers' movements. Perhaps counter-intuitively, we show that if both kinds
of requests appear, the lower bound raises to $2k-1$.\r\n\r\nWe study deterministic
online algorithms in uniform metrics and present two algorithms. The first one
has an adaptive competitive ratio dependent on the frequency of specific requests.
It achieves a worst-case competitive ratio of $3k-2$ while it is optimal when
only general or only specific requests appear (competitive ratio of $k$ and $1$,
respectively). The second has a fixed close-to-optimal worst-case competitive
ratio of $2k+14$. For the first algorithm, we show a lower bound of $3k-2$, while
the second algorithm has a lower bound of $2k-1$ when only general requests appear.\r\n
\ \r\nThe two algorithms differ in only one behavioral rule for each server
that significantly influences the competitive ratio. Each server acting according
to the rule allows approaching the worst-case lower bound, while it implies an
increased lower bound for $k$-Server instances. In other words, there is a trade-off
between performing well against instances of the $k$-Server Problem and instances
containing specific requests. We also show that no deterministic online algorithm
can be optimal for both kinds of instances simultaneously."
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- 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
citation:
ama: 'Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The
k-Server with Preferences Problem. In: Proceedings of the 34th ACM Symposium
on Parallelism in Algorithms and Architectures. Association for Computing
Machinery; 2022:345-356. doi:10.1145/3490148.3538595'
apa: Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der
Heide, F. (2022). The k-Server with Preferences Problem. Proceedings of the
34th ACM Symposium on Parallelism in Algorithms and Architectures, 345–356.
https://doi.org/10.1145/3490148.3538595
bibtex: '@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2022,
title={The k-Server with Preferences Problem}, DOI={10.1145/3490148.3538595},
booktitle={Proceedings of the 34th ACM Symposium on Parallelism in Algorithms
and Architectures}, publisher={Association for Computing Machinery}, author={Castenow,
Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer
auf der Heide, Friedhelm}, year={2022}, pages={345–356} }'
chicago: Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and
Friedhelm Meyer auf der Heide. “The K-Server with Preferences Problem.” In Proceedings
of the 34th ACM Symposium on Parallelism in Algorithms and Architectures,
345–56. Association for Computing Machinery, 2022. https://doi.org/10.1145/3490148.3538595.
ieee: 'J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der
Heide, “The k-Server with Preferences Problem,” in Proceedings of the 34th
ACM Symposium on Parallelism in Algorithms and Architectures, 2022, pp. 345–356,
doi: 10.1145/3490148.3538595.'
mla: Castenow, Jannik, et al. “The K-Server with Preferences Problem.” Proceedings
of the 34th ACM Symposium on Parallelism in Algorithms and Architectures,
Association for Computing Machinery, 2022, pp. 345–56, doi:10.1145/3490148.3538595.
short: 'J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide,
in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures,
Association for Computing Machinery, 2022, pp. 345–356.'
date_created: 2022-06-10T09:06:42Z
date_updated: 2022-08-02T08:07:30Z
department:
- _id: '63'
doi: 10.1145/3490148.3538595
external_id:
arxiv:
- '2205.11102'
keyword:
- K-Server Problem
- Heterogeneity
- Online Caching
language:
- iso: eng
page: 345-356
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
publication: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and
Architectures
publication_identifier:
isbn:
- '9781450391467'
publisher: Association for Computing Machinery
status: public
title: The k-Server with Preferences Problem
type: conference
user_id: '39241'
year: '2022'
...
---
_id: '34023'
abstract:
- lang: eng
text: Decision makers increasingly rely on decision support systems for optimal
decision making. Recently, special attention has been paid to process-driven decision
support systems (PD-DSS) in which a process model prescribes the invocation sequence
of software-based decision support services and the data exchange between them.
Thus, it is possible to quickly combine available decision support services as
needed for optimally supporting the decision making process of an individual decision
maker. However, process modelers may accidentally create a process model which
is technically well-formed and executable, but contains functional and behavioral
flaws such as redundant or missing services. These flaws may result in inefficient
computations or invalid decision recommendations when the corresponding PD-DSS
is utilized by a decision maker. In this paper, we therefore propose an approach
to validate functionality and behavior of a process model representing a PD-DSS.
Our approach is based on expressing flaws as anti-patterns for which the process
model can be automatically checked via graph matching. We prototypically implemented
our approach and demonstrate its applicability in the context of decision making
for energy network planning.
author:
- first_name: Jonas
full_name: Kirchhoff, Jonas
id: '39928'
last_name: Kirchhoff
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Kirchhoff J, Engels G. Anti-pattern Detection in Process-Driven Decision Support
Systems. In: Software Business. Vol 463. Lecture Notes in Business Information
Processing. Springer International Publishing; 2022:227--243. doi:10.1007/978-3-031-20706-8_16'
apa: Kirchhoff, J., & Engels, G. (2022). Anti-pattern Detection in Process-Driven
Decision Support Systems. In Software Business (Vol. 463, pp. 227--243).
Springer International Publishing. https://doi.org/10.1007/978-3-031-20706-8_16
bibtex: '@inbook{Kirchhoff_Engels_2022, place={Cham}, series={Lecture Notes in Business
Information Processing}, title={Anti-pattern Detection in Process-Driven Decision
Support Systems}, volume={463}, DOI={10.1007/978-3-031-20706-8_16},
booktitle={Software Business}, publisher={Springer International Publishing},
author={Kirchhoff, Jonas and Engels, Gregor}, year={2022}, pages={227--243}, collection={Lecture
Notes in Business Information Processing} }'
chicago: 'Kirchhoff, Jonas, and Gregor Engels. “Anti-Pattern Detection in Process-Driven
Decision Support Systems.” In Software Business, 463:227--243. Lecture
Notes in Business Information Processing. Cham: Springer International Publishing,
2022. https://doi.org/10.1007/978-3-031-20706-8_16.'
ieee: 'J. Kirchhoff and G. Engels, “Anti-pattern Detection in Process-Driven Decision
Support Systems,” in Software Business, vol. 463, Cham: Springer International
Publishing, 2022, pp. 227--243.'
mla: Kirchhoff, Jonas, and Gregor Engels. “Anti-Pattern Detection in Process-Driven
Decision Support Systems.” Software Business, vol. 463, Springer International
Publishing, 2022, pp. 227--243, doi:10.1007/978-3-031-20706-8_16.
short: 'J. Kirchhoff, G. Engels, in: Software Business, Springer International Publishing,
Cham, 2022, pp. 227--243.'
date_created: 2022-11-07T10:51:24Z
date_updated: 2022-11-07T10:54:30Z
department:
- _id: '534'
- _id: '66'
doi: 10.1007/978-3-031-20706-8_16
intvolume: ' 463'
language:
- iso: eng
page: 227--243
place: Cham
publication: Software Business
publication_identifier:
isbn:
- '9783031207051'
- '9783031207068'
issn:
- 1865-1348
- 1865-1356
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Business Information Processing
status: public
title: Anti-pattern Detection in Process-Driven Decision Support Systems
type: book_chapter
user_id: '39928'
volume: 463
year: '2022'
...
---
_id: '34040'
abstract:
- lang: eng
text: "Consider the practical goal of making a desired action profile played,\r\n\r\nwhen
the planner can only change the payoffs, bound by \r\n\r\nstringent constraints.\r\n\r\nApplications
include motivating people\r\n\r\nto choose the closest school, the closest subway
station, or to coordinate\r\n\r\non a communication protocol or an investment
strategy.\r\n\r\nEmploying subsidies and tolls, we adjust the game so that choosing
this predefined action profile\r\n\r\nbecomes strictly dominant. \r\n\r\nInspired
mainly by the work of Monderer and Tennenholtz,\r\n\r\nwhere the promised subsidies
do not materialise in the not played\r\n\r\nprofiles, we provide a fair and individually
rational game\r\n\r\nadjustment, such that the total outside investments sum up\r\n\r\nto
zero at any profile, thereby facilitating easy and frequent\r\n\r\nusage of our
adjustment without bearing costs, even if some\r\n\r\nplayers behave unexpectedly.
The resultant action profile itself needs no\r\n\r\nadjustment. Importantly, we
also prove that our adjustment minimises \r\n\r\nthe general transfer among all
such adjustments, counting the total subsidising and taxation."
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Marcin
full_name: Dziubiński, Marcin
last_name: Dziubiński
citation:
ama: 'Polevoy G, Dziubiński M. Fair, Individually Rational and Cheap Adjustment.
In: De Raedt L, ed. Proceedings of the Thirty-First International Joint Conference
on Artificial Intelligence. International Joint Conferences on Artificial
Intelligence Organization; 2022. doi:10.24963/ijcai.2022/64'
apa: Polevoy, G., & Dziubiński, M. (2022). Fair, Individually Rational and Cheap
Adjustment. In L. De Raedt (Ed.), Proceedings of the Thirty-First International
Joint Conference on Artificial Intelligence. International Joint Conferences
on Artificial Intelligence Organization. https://doi.org/10.24963/ijcai.2022/64
bibtex: '@inproceedings{Polevoy_Dziubiński_2022, title={Fair, Individually Rational
and Cheap Adjustment}, DOI={10.24963/ijcai.2022/64},
booktitle={Proceedings of the Thirty-First International Joint Conference on Artificial
Intelligence}, publisher={International Joint Conferences on Artificial Intelligence
Organization}, author={Polevoy, Gleb and Dziubiński, Marcin}, editor={De Raedt,
Luc}, year={2022} }'
chicago: Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and
Cheap Adjustment.” In Proceedings of the Thirty-First International Joint Conference
on Artificial Intelligence, edited by Luc De Raedt. International Joint Conferences
on Artificial Intelligence Organization, 2022. https://doi.org/10.24963/ijcai.2022/64.
ieee: 'G. Polevoy and M. Dziubiński, “Fair, Individually Rational and Cheap Adjustment,”
in Proceedings of the Thirty-First International Joint Conference on Artificial
Intelligence, Vienna, 2022, doi: 10.24963/ijcai.2022/64.'
mla: Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and Cheap
Adjustment.” Proceedings of the Thirty-First International Joint Conference
on Artificial Intelligence, edited by Luc De Raedt, International Joint Conferences
on Artificial Intelligence Organization, 2022, doi:10.24963/ijcai.2022/64.
short: 'G. Polevoy, M. Dziubiński, in: L. De Raedt (Ed.), Proceedings of the Thirty-First
International Joint Conference on Artificial Intelligence, International Joint
Conferences on Artificial Intelligence Organization, 2022.'
conference:
end_date: 2022-07-29
location: Vienna
name: THE 31ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
start_date: 2022-07-23
date_created: 2022-11-08T16:53:31Z
date_updated: 2022-11-08T17:34:36Z
department:
- _id: '63'
- _id: '541'
doi: 10.24963/ijcai.2022/64
editor:
- first_name: Luc
full_name: De Raedt, Luc
last_name: De Raedt
keyword:
- adjustment
- strictly dominant
- fairness
- individually rational
- transfer
- tax
- subsidy
language:
- iso: eng
main_file_link:
- url: https://www.ijcai.org/proceedings/2022/64
publication: Proceedings of the Thirty-First International Joint Conference on Artificial
Intelligence
publication_status: published
publisher: International Joint Conferences on Artificial Intelligence Organization
status: public
title: Fair, Individually Rational and Cheap Adjustment
type: conference
user_id: '83983'
year: '2022'
...
---
_id: '33085'
author:
- first_name: Leah
full_name: Epstein, Leah
last_name: Epstein
- first_name: Alexandra
full_name: Lassota, Alexandra
last_name: Lassota
- first_name: Asaf
full_name: Levin, Asaf
last_name: Levin
- first_name: Marten
full_name: Maack, Marten
id: '88252'
last_name: Maack
- first_name: Lars
full_name: Rohwedder, Lars
last_name: Rohwedder
citation:
ama: 'Epstein L, Lassota A, Levin A, Maack M, Rohwedder L. Cardinality Constrained
Scheduling in Online Models. In: Berenbrink P, Monmege B, eds. 39th International
Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18,
2022, Marseille, France (Virtual Conference). Vol 219. LIPIcs. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2022:28:1–28:15. doi:10.4230/LIPIcs.STACS.2022.28'
apa: Epstein, L., Lassota, A., Levin, A., Maack, M., & Rohwedder, L. (2022).
Cardinality Constrained Scheduling in Online Models. In P. Berenbrink & B.
Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer
Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)
(Vol. 219, p. 28:1–28:15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.STACS.2022.28
bibtex: '@inproceedings{Epstein_Lassota_Levin_Maack_Rohwedder_2022, series={LIPIcs},
title={Cardinality Constrained Scheduling in Online Models}, volume={219}, DOI={10.4230/LIPIcs.STACS.2022.28},
booktitle={39th International Symposium on Theoretical Aspects of Computer Science,
STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)}, publisher={Schloss
Dagstuhl - Leibniz-Zentrum für Informatik}, author={Epstein, Leah and Lassota,
Alexandra and Levin, Asaf and Maack, Marten and Rohwedder, Lars}, editor={Berenbrink,
Petra and Monmege, Benjamin}, year={2022}, pages={28:1–28:15}, collection={LIPIcs}
}'
chicago: Epstein, Leah, Alexandra Lassota, Asaf Levin, Marten Maack, and Lars Rohwedder.
“Cardinality Constrained Scheduling in Online Models.” In 39th International
Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18,
2022, Marseille, France (Virtual Conference), edited by Petra Berenbrink and
Benjamin Monmege, 219:28:1–28:15. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2022. https://doi.org/10.4230/LIPIcs.STACS.2022.28.
ieee: 'L. Epstein, A. Lassota, A. Levin, M. Maack, and L. Rohwedder, “Cardinality
Constrained Scheduling in Online Models,” in 39th International Symposium on
Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille,
France (Virtual Conference), 2022, vol. 219, p. 28:1–28:15, doi: 10.4230/LIPIcs.STACS.2022.28.'
mla: Epstein, Leah, et al. “Cardinality Constrained Scheduling in Online Models.”
39th International Symposium on Theoretical Aspects of Computer Science, STACS
2022, March 15-18, 2022, Marseille, France (Virtual Conference), edited by
Petra Berenbrink and Benjamin Monmege, vol. 219, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2022, p. 28:1–28:15, doi:10.4230/LIPIcs.STACS.2022.28.
short: 'L. Epstein, A. Lassota, A. Levin, M. Maack, L. Rohwedder, in: P. Berenbrink,
B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer
Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference),
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15.'
date_created: 2022-08-23T08:10:36Z
date_updated: 2022-11-08T16:34:32Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.STACS.2022.28
editor:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Benjamin
full_name: Monmege, Benjamin
last_name: Monmege
intvolume: ' 219'
language:
- iso: eng
page: 28:1–28:15
project:
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: 39th International Symposium on Theoretical Aspects of Computer Science,
STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: Cardinality Constrained Scheduling in Online Models
type: conference
user_id: '88252'
volume: 219
year: '2022'
...
---
_id: '33004'
author:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Milad
full_name: Alshomary, Milad
id: '73059'
last_name: Alshomary
citation:
ama: 'Wachsmuth H, Alshomary M. “Mama Always Had a Way of Explaining Things So I
Could Understand”: A Dialogue Corpus for Learning How to Explain. In: Proceedings
of the 29th International Conference on Computational Linguistics. ; 2022:344-354.'
apa: 'Wachsmuth, H., & Alshomary, M. (2022). “Mama Always Had a Way of Explaining
Things So I Could Understand”: A Dialogue Corpus for Learning How to Explain.
Proceedings of the 29th International Conference on Computational Linguistics,
344–354.'
bibtex: '@inproceedings{Wachsmuth_Alshomary_2022, title={“Mama Always Had a Way
of Explaining Things So I Could Understand”: A Dialogue Corpus for Learning How
to Explain}, booktitle={Proceedings of the 29th International Conference on Computational
Linguistics}, author={Wachsmuth, Henning and Alshomary, Milad}, year={2022}, pages={344–354}
}'
chicago: 'Wachsmuth, Henning, and Milad Alshomary. “‘Mama Always Had a Way of Explaining
Things So I Could Understand’: A Dialogue Corpus for Learning How to Explain.”
In Proceedings of the 29th International Conference on Computational Linguistics,
344–54, 2022.'
ieee: 'H. Wachsmuth and M. Alshomary, “‘Mama Always Had a Way of Explaining Things
So I Could Understand’: A Dialogue Corpus for Learning How to Explain,” in Proceedings
of the 29th International Conference on Computational Linguistics, 2022, pp.
344–354.'
mla: 'Wachsmuth, Henning, and Milad Alshomary. “‘Mama Always Had a Way of Explaining
Things So I Could Understand’: A Dialogue Corpus for Learning How to Explain.”
Proceedings of the 29th International Conference on Computational Linguistics,
2022, pp. 344–54.'
short: 'H. Wachsmuth, M. Alshomary, in: Proceedings of the 29th International Conference
on Computational Linguistics, 2022, pp. 344–354.'
date_created: 2022-08-18T10:00:46Z
date_updated: 2022-11-10T09:06:39Z
department:
- _id: '600'
language:
- iso: eng
page: 344 - 354
publication: Proceedings of the 29th International Conference on Computational Linguistics
status: public
title: '"Mama Always Had a Way of Explaining Things So I Could Understand": A Dialogue
Corpus for Learning How to Explain'
type: conference
user_id: '82920'
year: '2022'
...
---
_id: '34049'
author:
- first_name: Anne
full_name: Lauscher, Anne
last_name: Lauscher
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Iryna
full_name: Gurevych, Iryna
last_name: Gurevych
- first_name: Goran
full_name: Glavaš, Goran
last_name: Glavaš
citation:
ama: Lauscher A, Wachsmuth H, Gurevych I, Glavaš G. On the Role of Knowledge in
Computational Argumentation. Transactions of the Association for Computational
Linguistics. Published online 2022.
apa: Lauscher, A., Wachsmuth, H., Gurevych, I., & Glavaš, G. (2022). On the
Role of Knowledge in Computational Argumentation. Transactions of the Association
for Computational Linguistics.
bibtex: '@article{Lauscher_Wachsmuth_Gurevych_Glavaš_2022, title={On the Role of
Knowledge in Computational Argumentation}, journal={Transactions of the Association
for Computational Linguistics}, author={Lauscher, Anne and Wachsmuth, Henning
and Gurevych, Iryna and Glavaš, Goran}, year={2022} }'
chicago: Lauscher, Anne, Henning Wachsmuth, Iryna Gurevych, and Goran Glavaš. “On
the Role of Knowledge in Computational Argumentation.” Transactions of the
Association for Computational Linguistics, 2022.
ieee: A. Lauscher, H. Wachsmuth, I. Gurevych, and G. Glavaš, “On the Role of Knowledge
in Computational Argumentation,” Transactions of the Association for Computational
Linguistics, 2022.
mla: Lauscher, Anne, et al. “On the Role of Knowledge in Computational Argumentation.”
Transactions of the Association for Computational Linguistics, 2022.
short: A. Lauscher, H. Wachsmuth, I. Gurevych, G. Glavaš, Transactions of the Association
for Computational Linguistics (2022).
date_created: 2022-11-10T08:39:38Z
date_updated: 2022-11-10T08:39:48Z
department:
- _id: '600'
language:
- iso: eng
publication: Transactions of the Association for Computational Linguistics
status: public
title: On the Role of Knowledge in Computational Argumentation
type: journal_article
user_id: '82920'
year: '2022'
...
---
_id: '22157'
author:
- first_name: Johannes
full_name: Kiesel, Johannes
last_name: Kiesel
- first_name: Milad
full_name: Alshomary, Milad
id: '73059'
last_name: Alshomary
- first_name: Nicolas
full_name: Handke, Nicolas
last_name: Handke
- first_name: Xiaoni
full_name: Cai, Xiaoni
last_name: Cai
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Kiesel J, Alshomary M, Handke N, Cai X, Wachsmuth H, Stein B. Identifying
the Human Values behind Arguments. In: Proceedings of the 60th Annual Meeting
of the Association for Computational Linguistics. ; 2022:4459-4471.'
apa: Kiesel, J., Alshomary, M., Handke, N., Cai, X., Wachsmuth, H., & Stein,
B. (2022). Identifying the Human Values behind Arguments. Proceedings of the
60th Annual Meeting of the Association for Computational Linguistics, 4459–4471.
bibtex: '@inproceedings{Kiesel_Alshomary_Handke_Cai_Wachsmuth_Stein_2022, title={Identifying
the Human Values behind Arguments}, booktitle={Proceedings of the 60th Annual
Meeting of the Association for Computational Linguistics}, author={Kiesel, Johannes
and Alshomary, Milad and Handke, Nicolas and Cai, Xiaoni and Wachsmuth, Henning
and Stein, Benno}, year={2022}, pages={4459–4471} }'
chicago: Kiesel, Johannes, Milad Alshomary, Nicolas Handke, Xiaoni Cai, Henning
Wachsmuth, and Benno Stein. “Identifying the Human Values behind Arguments.” In
Proceedings of the 60th Annual Meeting of the Association for Computational
Linguistics, 4459–71, 2022.
ieee: J. Kiesel, M. Alshomary, N. Handke, X. Cai, H. Wachsmuth, and B. Stein, “Identifying
the Human Values behind Arguments,” in Proceedings of the 60th Annual Meeting
of the Association for Computational Linguistics, 2022, pp. 4459–4471.
mla: Kiesel, Johannes, et al. “Identifying the Human Values behind Arguments.” Proceedings
of the 60th Annual Meeting of the Association for Computational Linguistics,
2022, pp. 4459–71.
short: 'J. Kiesel, M. Alshomary, N. Handke, X. Cai, H. Wachsmuth, B. Stein, in:
Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics,
2022, pp. 4459–4471.'
date_created: 2021-05-11T23:15:42Z
date_updated: 2022-11-10T09:09:27Z
department:
- _id: '600'
language:
- iso: eng
page: 4459 - 4471
publication: Proceedings of the 60th Annual Meeting of the Association for Computational
Linguistics
status: public
title: Identifying the Human Values behind Arguments
type: conference
user_id: '82920'
year: '2022'
...
---
_id: '34057'
author:
- first_name: Faruk
full_name: Pasic, Faruk
last_name: Pasic
- first_name: Matthias
full_name: Becker, Matthias
last_name: Becker
citation:
ama: 'Pasic F, Becker M. Domain-specific Language for Condition Monitoring Software
Development. In: 2022 IEEE 27th International Conference on Emerging Technologies
and Factory Automation (ETFA). IEEE; 2022. doi:10.1109/etfa52439.2022.9921730'
apa: Pasic, F., & Becker, M. (2022). Domain-specific Language for Condition
Monitoring Software Development. 2022 IEEE 27th International Conference on
Emerging Technologies and Factory Automation (ETFA). https://doi.org/10.1109/etfa52439.2022.9921730
bibtex: '@inproceedings{Pasic_Becker_2022, title={Domain-specific Language for Condition
Monitoring Software Development}, DOI={10.1109/etfa52439.2022.9921730},
booktitle={2022 IEEE 27th International Conference on Emerging Technologies and
Factory Automation (ETFA)}, publisher={IEEE}, author={Pasic, Faruk and Becker,
Matthias}, year={2022} }'
chicago: Pasic, Faruk, and Matthias Becker. “Domain-Specific Language for Condition
Monitoring Software Development.” In 2022 IEEE 27th International Conference
on Emerging Technologies and Factory Automation (ETFA). IEEE, 2022. https://doi.org/10.1109/etfa52439.2022.9921730.
ieee: 'F. Pasic and M. Becker, “Domain-specific Language for Condition Monitoring
Software Development,” 2022, doi: 10.1109/etfa52439.2022.9921730.'
mla: Pasic, Faruk, and Matthias Becker. “Domain-Specific Language for Condition
Monitoring Software Development.” 2022 IEEE 27th International Conference on
Emerging Technologies and Factory Automation (ETFA), IEEE, 2022, doi:10.1109/etfa52439.2022.9921730.
short: 'F. Pasic, M. Becker, in: 2022 IEEE 27th International Conference on Emerging
Technologies and Factory Automation (ETFA), IEEE, 2022.'
date_created: 2022-11-10T14:30:16Z
date_updated: 2022-11-10T14:30:42Z
department:
- _id: '241'
- _id: '76'
doi: 10.1109/etfa52439.2022.9921730
publication: 2022 IEEE 27th International Conference on Emerging Technologies and
Factory Automation (ETFA)
publication_status: published
publisher: IEEE
status: public
title: Domain-specific Language for Condition Monitoring Software Development
type: conference
user_id: '49576'
year: '2022'
...