---
_id: '483'
abstract:
- lang: eng
text: Modern software systems adapt themselves to changing environments, to meet
quality-of-service requirements, such as response time limits. The engineering
of the system’s self-adaptation logic does not only require new modeling methods,
but also new analyzes of transient phases. Model-driven software performance engineering
methods already allow design-time analysis of steady states of non-adaptive system
models. In order to validate requirements for transient phases, new modeling and
analysis methods are needed. In this paper, we present SimuLizar, our initial
model-driven approach to model self-adaptive systems and analyze the performance
of their transient phases. Our evaluation of a load balancer toy example shows
the applicability of our modeling approach. Additionally, a comparison of our
performance analysis with a prototypical implementation of our example system
shows that the prediction accuracy is sufficient to identify unsatisfactory self-adaptations.
author:
- first_name: Matthias
full_name: Becker, Matthias
last_name: Becker
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
- first_name: Joachim
full_name: Meyer, Joachim
last_name: Meyer
citation:
ama: 'Becker M, Becker S, Meyer J. SimuLizar: Design-Time modeling and Performance
Analysis of Self-Adaptive Systems. In: Proceedings of the Software Engineering
Conference (SE). Lecture Notes in Informatics (LNI). ; 2013:71-84.'
apa: 'Becker, M., Becker, S., & Meyer, J. (2013). SimuLizar: Design-Time modeling
and Performance Analysis of Self-Adaptive Systems. In Proceedings of the Software
Engineering Conference (SE) (pp. 71–84).'
bibtex: '@inproceedings{Becker_Becker_Meyer_2013, series={Lecture Notes in Informatics
(LNI)}, title={SimuLizar: Design-Time modeling and Performance Analysis of Self-Adaptive
Systems}, booktitle={Proceedings of the Software Engineering Conference (SE)},
author={Becker, Matthias and Becker, Steffen and Meyer, Joachim}, year={2013},
pages={71–84}, collection={Lecture Notes in Informatics (LNI)} }'
chicago: 'Becker, Matthias, Steffen Becker, and Joachim Meyer. “SimuLizar: Design-Time
Modeling and Performance Analysis of Self-Adaptive Systems.” In Proceedings
of the Software Engineering Conference (SE), 71–84. Lecture Notes in Informatics
(LNI), 2013.'
ieee: 'M. Becker, S. Becker, and J. Meyer, “SimuLizar: Design-Time modeling and
Performance Analysis of Self-Adaptive Systems,” in Proceedings of the Software
Engineering Conference (SE), 2013, pp. 71–84.'
mla: 'Becker, Matthias, et al. “SimuLizar: Design-Time Modeling and Performance
Analysis of Self-Adaptive Systems.” Proceedings of the Software Engineering
Conference (SE), 2013, pp. 71–84.'
short: 'M. Becker, S. Becker, J. Meyer, in: Proceedings of the Software Engineering
Conference (SE), 2013, pp. 71–84.'
date_created: 2017-10-17T12:42:26Z
date_updated: 2022-01-06T07:01:25Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:58:42Z
date_updated: 2018-03-15T13:58:42Z
file_id: '1320'
file_name: 483-paper.pdf
file_size: 649508
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:58:42Z
has_accepted_license: '1'
main_file_link:
- url: http://subs.emis.de/LNI/Proceedings/Proceedings213/article35.html
page: 71-84
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the Software Engineering Conference (SE)
series_title: Lecture Notes in Informatics (LNI)
status: public
title: 'SimuLizar: Design-Time modeling and Performance Analysis of Self-Adaptive
Systems'
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '484'
abstract:
- lang: eng
text: One of the main ideas of Service-Oriented Computing (SOC) is the delivery
of flexibly composable services provided on world-wide markets. For a successful
service discovery,service requests have to be matched with the available service
offers. However, in a situation in which no service that completely matches the
request can be discovered, the customer may tolerate slight discrepancies between
request and offer. Some existing fuzzy matching approaches are able to detectsuch
service variants, but they do not allow to explicitly specify which parts of a
request are not mandatory. In this paper, we improve an existing service matching
approach based onVisual Contracts leveraging our preliminary work of design pattern
detection. Thereby, we support explicit specifications of service variants and
realize gradual matching results that can be ranked in order to discover the service
offer that matches a customer’s request best.
author:
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Markus
full_name: von Detten, Markus
last_name: von Detten
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Platenius MC, von Detten M, Gerth C, Schäfer W, Engels G. Service Matching
under Consideration of Explicitly Specified Service Variants. In: IEEE 20th
International Conference on Web Services (ICWS 2013). ; 2013:613-614. doi:10.1109/ICWS.2013.98'
apa: Platenius, M. C., von Detten, M., Gerth, C., Schäfer, W., & Engels, G.
(2013). Service Matching under Consideration of Explicitly Specified Service Variants.
In IEEE 20th International Conference on Web Services (ICWS 2013) (pp.
613–614). https://doi.org/10.1109/ICWS.2013.98
bibtex: '@inproceedings{Platenius_von Detten_Gerth_Schäfer_Engels_2013, title={Service
Matching under Consideration of Explicitly Specified Service Variants}, DOI={10.1109/ICWS.2013.98}, booktitle={IEEE
20th International Conference on Web Services (ICWS 2013)}, author={Platenius,
Marie Christin and von Detten, Markus and Gerth, Christian and Schäfer, Wilhelm
and Engels, Gregor}, year={2013}, pages={613–614} }'
chicago: Platenius, Marie Christin, Markus von Detten, Christian Gerth, Wilhelm
Schäfer, and Gregor Engels. “Service Matching under Consideration of Explicitly
Specified Service Variants.” In IEEE 20th International Conference on Web Services
(ICWS 2013), 613–14, 2013. https://doi.org/10.1109/ICWS.2013.98.
ieee: M. C. Platenius, M. von Detten, C. Gerth, W. Schäfer, and G. Engels, “Service
Matching under Consideration of Explicitly Specified Service Variants,” in IEEE
20th International Conference on Web Services (ICWS 2013), 2013, pp. 613–614.
mla: Platenius, Marie Christin, et al. “Service Matching under Consideration of
Explicitly Specified Service Variants.” IEEE 20th International Conference
on Web Services (ICWS 2013), 2013, pp. 613–14, doi:10.1109/ICWS.2013.98.
short: 'M.C. Platenius, M. von Detten, C. Gerth, W. Schäfer, G. Engels, in: IEEE
20th International Conference on Web Services (ICWS 2013), 2013, pp. 613–614.'
date_created: 2017-10-17T12:42:26Z
date_updated: 2022-01-06T07:01:27Z
ddc:
- '040'
department:
- _id: '66'
- _id: '76'
doi: 10.1109/ICWS.2013.98
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:57:42Z
date_updated: 2018-03-15T13:57:42Z
file_id: '1319'
file_name: 484-Platenius_et_al_ICWS2013.pdf
file_size: 262082
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:57:42Z
has_accepted_license: '1'
language:
- iso: eng
page: 613-614
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: IEEE 20th International Conference on Web Services (ICWS 2013)
status: public
title: Service Matching under Consideration of Explicitly Specified Service Variants
type: conference
user_id: '477'
year: '2013'
...
---
_id: '485'
abstract:
- lang: eng
text: Software composition has been studied as a subject of state based planning
for decades. Existing composition approaches that are efficient enough to be used
in practice are limited to sequential arrangements of software components. This
restriction dramatically reduces the number of composition problems that can be
solved. However, there are many composition problems that could be solved by existing
approaches if they had a possibility to combine components in very simple non-sequential
ways. To this end, we present an approach that arranges not only basic components
but also composite components. Composite components enhance the structure of the
composition by conditional control flows. Through algorithms that are written
by experts, composite components are automatically generated before the composition
process starts. Therefore, our approach is not a substitute for existing composition
algorithms but complements them with a preprocessing step. We verified the validity
of our approach through implementation of the presented algorithms.
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Hans
full_name: Kleine Büning, Hans
last_name: Kleine Büning
citation:
ama: 'Mohr F, Kleine Büning H. Semi-Automated Software Composition Through Generated
Components. In: Proceedings of the 15th International Conference on Information
Integration and Web-Based Applications & Services (IiWAS). ; 2013:676-680.
doi:10.1145/2539150.2539235'
apa: Mohr, F., & Kleine Büning, H. (2013). Semi-Automated Software Composition
Through Generated Components. In Proceedings of the 15th International Conference
on Information Integration and Web-based Applications & Services (iiWAS)
(pp. 676–680). https://doi.org/10.1145/2539150.2539235
bibtex: '@inproceedings{Mohr_Kleine Büning_2013, title={Semi-Automated Software
Composition Through Generated Components}, DOI={10.1145/2539150.2539235},
booktitle={Proceedings of the 15th International Conference on Information Integration
and Web-based Applications & Services (iiWAS)}, author={Mohr, Felix and Kleine
Büning, Hans}, year={2013}, pages={676–680} }'
chicago: Mohr, Felix, and Hans Kleine Büning. “Semi-Automated Software Composition
Through Generated Components.” In Proceedings of the 15th International Conference
on Information Integration and Web-Based Applications & Services (IiWAS),
676–80, 2013. https://doi.org/10.1145/2539150.2539235.
ieee: F. Mohr and H. Kleine Büning, “Semi-Automated Software Composition Through
Generated Components,” in Proceedings of the 15th International Conference
on Information Integration and Web-based Applications & Services (iiWAS),
2013, pp. 676–680.
mla: Mohr, Felix, and Hans Kleine Büning. “Semi-Automated Software Composition Through
Generated Components.” Proceedings of the 15th International Conference on
Information Integration and Web-Based Applications & Services (IiWAS),
2013, pp. 676–80, doi:10.1145/2539150.2539235.
short: 'F. Mohr, H. Kleine Büning, in: Proceedings of the 15th International Conference
on Information Integration and Web-Based Applications & Services (IiWAS),
2013, pp. 676–680.'
date_created: 2017-10-17T12:42:26Z
date_updated: 2022-01-06T07:01:27Z
ddc:
- '040'
department:
- _id: '355'
doi: 10.1145/2539150.2539235
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:56:49Z
date_updated: 2018-03-15T13:56:49Z
file_id: '1318'
file_name: 485-paper86_mohr.pdf
file_size: 368152
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:56:49Z
has_accepted_license: '1'
language:
- iso: eng
page: 676-680
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 15th International Conference on Information Integration
and Web-based Applications & Services (iiWAS)
status: public
title: Semi-Automated Software Composition Through Generated Components
type: conference
user_id: '477'
year: '2013'
...
---
_id: '4851'
author:
- first_name: Ina
full_name: Garnefeld, Ina
last_name: Garnefeld
- first_name: Andreas
full_name: Eggert, Andreas
last_name: Eggert
- first_name: Sabrina V
full_name: Helm, Sabrina V
last_name: Helm
- first_name: Stephen S
full_name: Tax, Stephen S
last_name: Tax
citation:
ama: Garnefeld I, Eggert A, Helm SV, Tax SS. Growing existing customers’ revenue
streams through customer referral programs. Journal of Marketing. 2013;(4):17--32.
apa: Garnefeld, I., Eggert, A., Helm, S. V., & Tax, S. S. (2013). Growing existing
customers’ revenue streams through customer referral programs. Journal of Marketing,
(4), 17--32.
bibtex: '@article{Garnefeld_Eggert_Helm_Tax_2013, title={Growing existing customers’
revenue streams through customer referral programs}, number={4}, journal={Journal
of Marketing}, author={Garnefeld, Ina and Eggert, Andreas and Helm, Sabrina V
and Tax, Stephen S}, year={2013}, pages={17--32} }'
chicago: 'Garnefeld, Ina, Andreas Eggert, Sabrina V Helm, and Stephen S Tax. “Growing
Existing Customers’ Revenue Streams through Customer Referral Programs.” Journal
of Marketing, no. 4 (2013): 17--32.'
ieee: I. Garnefeld, A. Eggert, S. V. Helm, and S. S. Tax, “Growing existing customers’
revenue streams through customer referral programs,” Journal of Marketing,
no. 4, pp. 17--32, 2013.
mla: Garnefeld, Ina, et al. “Growing Existing Customers’ Revenue Streams through
Customer Referral Programs.” Journal of Marketing, no. 4, 2013, pp. 17--32.
short: I. Garnefeld, A. Eggert, S.V. Helm, S.S. Tax, Journal of Marketing (2013)
17--32.
date_created: 2018-10-25T09:39:22Z
date_updated: 2022-01-06T07:01:27Z
department:
- _id: '180'
issue: '4'
page: 17--32
publication: Journal of Marketing
status: public
title: Growing existing customers' revenue streams through customer referral programs
type: journal_article
user_id: '57352'
year: '2013'
...
---
_id: '4852'
author:
- first_name: Alexander
full_name: Haas, Alexander
last_name: Haas
- first_name: Andreas
full_name: Eggert, Andreas
last_name: Eggert
- first_name: Harri
full_name: Terho, Harri
last_name: Terho
- first_name: Wolfgang
full_name: Ulaga, Wolfgang
last_name: Ulaga
citation:
ama: Haas A, Eggert A, Terho H, Ulaga W. Erfolgsfaktor Value-Based Selling—Verkaufen,
wenn Kundenorientierung nicht zum Erfolg führt. Marketing Review St Gallen.
2013;(4):64--73.
apa: Haas, A., Eggert, A., Terho, H., & Ulaga, W. (2013). Erfolgsfaktor Value-Based
Selling—Verkaufen, wenn Kundenorientierung nicht zum Erfolg führt. Marketing
Review St. Gallen, (4), 64--73.
bibtex: '@article{Haas_Eggert_Terho_Ulaga_2013, title={Erfolgsfaktor Value-Based
Selling—Verkaufen, wenn Kundenorientierung nicht zum Erfolg führt}, number={4},
journal={Marketing Review St. Gallen}, author={Haas, Alexander and Eggert, Andreas
and Terho, Harri and Ulaga, Wolfgang}, year={2013}, pages={64--73} }'
chicago: 'Haas, Alexander, Andreas Eggert, Harri Terho, and Wolfgang Ulaga. “Erfolgsfaktor
Value-Based Selling—Verkaufen, Wenn Kundenorientierung Nicht Zum Erfolg Führt.”
Marketing Review St. Gallen, no. 4 (2013): 64--73.'
ieee: A. Haas, A. Eggert, H. Terho, and W. Ulaga, “Erfolgsfaktor Value-Based Selling—Verkaufen,
wenn Kundenorientierung nicht zum Erfolg führt,” Marketing Review St. Gallen,
no. 4, pp. 64--73, 2013.
mla: Haas, Alexander, et al. “Erfolgsfaktor Value-Based Selling—Verkaufen, Wenn
Kundenorientierung Nicht Zum Erfolg Führt.” Marketing Review St. Gallen,
no. 4, 2013, pp. 64--73.
short: A. Haas, A. Eggert, H. Terho, W. Ulaga, Marketing Review St. Gallen (2013)
64--73.
date_created: 2018-10-25T09:40:32Z
date_updated: 2022-01-06T07:01:27Z
department:
- _id: '180'
issue: '4'
language:
- iso: eng
page: 64--73
publication: Marketing Review St. Gallen
status: public
title: Erfolgsfaktor Value-Based Selling—Verkaufen, wenn Kundenorientierung nicht
zum Erfolg führt
type: journal_article
user_id: '57352'
year: '2013'
...
---
_id: '486'
author:
- first_name: Oliver
full_name: Otte, Oliver
last_name: Otte
citation:
ama: Otte O. Seitenkanalresistenz paarungsbasierter Kryptographie. Universität
Paderborn; 2013.
apa: Otte, O. (2013). Seitenkanalresistenz paarungsbasierter Kryptographie.
Universität Paderborn.
bibtex: '@book{Otte_2013, title={Seitenkanalresistenz paarungsbasierter Kryptographie},
publisher={Universität Paderborn}, author={Otte, Oliver}, year={2013} }'
chicago: Otte, Oliver. Seitenkanalresistenz paarungsbasierter Kryptographie.
Universität Paderborn, 2013.
ieee: O. Otte, Seitenkanalresistenz paarungsbasierter Kryptographie. Universität
Paderborn, 2013.
mla: Otte, Oliver. Seitenkanalresistenz paarungsbasierter Kryptographie.
Universität Paderborn, 2013.
short: O. Otte, Seitenkanalresistenz paarungsbasierter Kryptographie, Universität
Paderborn, 2013.
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:27Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '43'
name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Seitenkanalresistenz paarungsbasierter Kryptographie
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '487'
author:
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
citation:
ama: Bobolz J. Security Proofs for Pairing-Based Cryptography in the Generic
Group Model. Universität Paderborn; 2013.
apa: Bobolz, J. (2013). Security Proofs for Pairing-Based Cryptography in the
Generic Group Model. Universität Paderborn.
bibtex: '@book{Bobolz_2013, title={Security Proofs for Pairing-Based Cryptography
in the Generic Group Model}, publisher={Universität Paderborn}, author={Bobolz,
Jan}, year={2013} }'
chicago: Bobolz, Jan. Security Proofs for Pairing-Based Cryptography in the Generic
Group Model. Universität Paderborn, 2013.
ieee: J. Bobolz, Security Proofs for Pairing-Based Cryptography in the Generic
Group Model. Universität Paderborn, 2013.
mla: Bobolz, Jan. Security Proofs for Pairing-Based Cryptography in the Generic
Group Model. Universität Paderborn, 2013.
short: J. Bobolz, Security Proofs for Pairing-Based Cryptography in the Generic
Group Model, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:28Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: open_access
content_type: application/pdf
creator: jbobolz
date_created: 2018-04-13T11:42:08Z
date_updated: 2018-06-29T09:56:54Z
file_id: '2346'
file_name: thesis_jbobolz_final.pdf
file_size: 874286
relation: main_file
file_date_updated: 2018-06-29T09:56:54Z
has_accepted_license: '1'
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
title: Security Proofs for Pairing-Based Cryptography in the Generic Group Model
type: bachelorsthesis
urn: '4875'
user_id: '27207'
year: '2013'
...
---
_id: '488'
abstract:
- lang: eng
text: Unattended systems are key ingredients of various critical infrastruc-tures
like networks of self service terminals or automated teller machines.For cost
and efficiency reasons they should mostly run autonomously.Unattended systems
are attractive and lucrative targets for various kindsof attacks, including attacks
on the integrity of their components and thecommunication between components.
In this paper, we propose a gen-eral cryptographic framework to protect unattended
systems. We alsodemonstrate that instantiating the framework with techniques from
iden-tity based cryptography is particularly well-suited to efficiently secureunattended
systems.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Peter
full_name: Günther, Peter
last_name: Günther
- first_name: Volker
full_name: Krummel, Volker
last_name: Krummel
citation:
ama: 'Blömer J, Günther P, Krummel V. Securing Critical Unattended Systems with
Identity Based Cryptography - A Case Study. In: Proceedings of the 5th International
Conference on Mathematical Aspects of Computer and Information Sciences (MACIS).
; 2013:98-105.'
apa: Blömer, J., Günther, P., & Krummel, V. (2013). Securing Critical Unattended
Systems with Identity Based Cryptography - A Case Study. In Proceedings of
the 5th International Conference on Mathematical Aspects of Computer and Information
Sciences (MACIS) (pp. 98–105).
bibtex: '@inproceedings{Blömer_Günther_Krummel_2013, title={Securing Critical Unattended
Systems with Identity Based Cryptography - A Case Study}, booktitle={Proceedings
of the 5th International Conference on Mathematical Aspects of Computer and Information
Sciences (MACIS)}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker},
year={2013}, pages={98–105} }'
chicago: Blömer, Johannes, Peter Günther, and Volker Krummel. “Securing Critical
Unattended Systems with Identity Based Cryptography - A Case Study.” In Proceedings
of the 5th International Conference on Mathematical Aspects of Computer and Information
Sciences (MACIS), 98–105, 2013.
ieee: J. Blömer, P. Günther, and V. Krummel, “Securing Critical Unattended Systems
with Identity Based Cryptography - A Case Study,” in Proceedings of the 5th
International Conference on Mathematical Aspects of Computer and Information Sciences
(MACIS), 2013, pp. 98–105.
mla: Blömer, Johannes, et al. “Securing Critical Unattended Systems with Identity
Based Cryptography - A Case Study.” Proceedings of the 5th International Conference
on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013,
pp. 98–105.
short: 'J. Blömer, P. Günther, V. Krummel, in: Proceedings of the 5th International
Conference on Mathematical Aspects of Computer and Information Sciences (MACIS),
2013, pp. 98–105.'
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:28Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:46:52Z
date_updated: 2018-03-15T13:46:52Z
file_id: '1317'
file_name: 488-MACIS13.pdf
file_size: 301962
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:46:52Z
has_accepted_license: '1'
page: 98-105
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 5th International Conference on Mathematical Aspects
of Computer and Information Sciences (MACIS)
status: public
title: Securing Critical Unattended Systems with Identity Based Cryptography - A Case
Study
type: conference
user_id: '477'
year: '2013'
...
---
_id: '4880'
author:
- first_name: Susi
full_name: St{\, Susi
last_name: St{\
- first_name: Rene
full_name: Fahr, Rene
id: '111'
last_name: Fahr
citation:
ama: 'St{\ S, Fahr R. Individual determinants of work attendance: Evidence on the
role of personality. Applied Economics. 2013;(19):2863--2875.'
apa: 'St{\, S., & Fahr, R. (2013). Individual determinants of work attendance:
Evidence on the role of personality. Applied Economics, (19), 2863--2875.'
bibtex: '@article{St{\_Fahr_2013, title={Individual determinants of work attendance:
Evidence on the role of personality}, number={19}, journal={Applied Economics},
author={St{\, Susi and Fahr, Rene}, year={2013}, pages={2863--2875} }'
chicago: 'St{\, Susi, and Rene Fahr. “Individual Determinants of Work Attendance:
Evidence on the Role of Personality.” Applied Economics, no. 19 (2013):
2863--2875.'
ieee: 'S. St{\ and R. Fahr, “Individual determinants of work attendance: Evidence
on the role of personality,” Applied Economics, no. 19, pp. 2863--2875,
2013.'
mla: 'St{\, Susi, and Rene Fahr. “Individual Determinants of Work Attendance: Evidence
on the Role of Personality.” Applied Economics, no. 19, 2013, pp. 2863--2875.'
short: S. St{\, R. Fahr, Applied Economics (2013) 2863--2875.
date_created: 2018-10-26T07:40:07Z
date_updated: 2022-01-06T07:01:28Z
department:
- _id: '178'
- _id: '179'
issue: '19'
page: 2863--2875
publication: Applied Economics
status: public
title: 'Individual determinants of work attendance: Evidence on the role of personality'
type: journal_article
user_id: '69384'
year: '2013'
...
---
_id: '489'
author:
- first_name: Michael
full_name: Knopf, Michael
last_name: Knopf
citation:
ama: Knopf M. Scheduling Variants with Speed-Scaling via the Primal-Dual Approach.
Universität Paderborn; 2013.
apa: Knopf, M. (2013). Scheduling Variants with Speed-Scaling via the Primal-Dual
Approach. Universität Paderborn.
bibtex: '@book{Knopf_2013, title={Scheduling Variants with Speed-Scaling via the
Primal-Dual Approach}, publisher={Universität Paderborn}, author={Knopf, Michael},
year={2013} }'
chicago: Knopf, Michael. Scheduling Variants with Speed-Scaling via the Primal-Dual
Approach. Universität Paderborn, 2013.
ieee: M. Knopf, Scheduling Variants with Speed-Scaling via the Primal-Dual Approach.
Universität Paderborn, 2013.
mla: Knopf, Michael. Scheduling Variants with Speed-Scaling via the Primal-Dual
Approach. Universität Paderborn, 2013.
short: M. Knopf, Scheduling Variants with Speed-Scaling via the Primal-Dual Approach,
Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:28Z
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Scheduling Variants with Speed-Scaling via the Primal-Dual Approach
type: mastersthesis
user_id: '15504'
year: '2013'
...
---
_id: '490'
author:
- first_name: Felix
full_name: Wallaschek, Felix
last_name: Wallaschek
citation:
ama: Wallaschek F. Routing in heterogenen OpenFlow Netzwerken. Universität
Paderborn; 2013.
apa: Wallaschek, F. (2013). Routing in heterogenen OpenFlow Netzwerken. Universität
Paderborn.
bibtex: '@book{Wallaschek_2013, title={Routing in heterogenen OpenFlow Netzwerken},
publisher={Universität Paderborn}, author={Wallaschek, Felix}, year={2013} }'
chicago: Wallaschek, Felix. Routing in heterogenen OpenFlow Netzwerken. Universität
Paderborn, 2013.
ieee: F. Wallaschek, Routing in heterogenen OpenFlow Netzwerken. Universität
Paderborn, 2013.
mla: Wallaschek, Felix. Routing in heterogenen OpenFlow Netzwerken. Universität
Paderborn, 2013.
short: F. Wallaschek, Routing in heterogenen OpenFlow Netzwerken, Universität Paderborn,
2013.
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:28Z
department:
- _id: '75'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Routing in heterogenen OpenFlow Netzwerken
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '4911'
author:
- first_name: Klaus F
full_name: Zimmermann, Klaus F
last_name: Zimmermann
- first_name: Thomas K
full_name: Bauer, Thomas K
last_name: Bauer
- first_name: Holger
full_name: Bonin, Holger
last_name: Bonin
- first_name: Rene
full_name: Fahr, Rene
id: '111'
last_name: Fahr
- first_name: Holger
full_name: Hinte, Holger
last_name: Hinte
citation:
ama: 'Zimmermann KF, Bauer TK, Bonin H, Fahr R, Hinte H. Arbeitskräftebedarf
Bei Hoher Arbeitslosigkeit: Ein Ökonomisches Zuwanderungskonzept Für Deutschland.;
2013.'
apa: 'Zimmermann, K. F., Bauer, T. K., Bonin, H., Fahr, R., & Hinte, H. (2013).
Arbeitskräftebedarf bei hoher Arbeitslosigkeit: ein ökonomisches Zuwanderungskonzept
für Deutschland.'
bibtex: '@book{Zimmermann_Bauer_Bonin_Fahr_Hinte_2013, title={Arbeitskräftebedarf
bei hoher Arbeitslosigkeit: ein ökonomisches Zuwanderungskonzept für Deutschland},
author={Zimmermann, Klaus F and Bauer, Thomas K and Bonin, Holger and Fahr, Rene
and Hinte, Holger}, year={2013} }'
chicago: 'Zimmermann, Klaus F, Thomas K Bauer, Holger Bonin, Rene Fahr, and Holger
Hinte. Arbeitskräftebedarf Bei Hoher Arbeitslosigkeit: Ein Ökonomisches Zuwanderungskonzept
Für Deutschland, 2013.'
ieee: 'K. F. Zimmermann, T. K. Bauer, H. Bonin, R. Fahr, and H. Hinte, Arbeitskräftebedarf
bei hoher Arbeitslosigkeit: ein ökonomisches Zuwanderungskonzept für Deutschland.
2013.'
mla: 'Zimmermann, Klaus F., et al. Arbeitskräftebedarf Bei Hoher Arbeitslosigkeit:
Ein Ökonomisches Zuwanderungskonzept Für Deutschland. 2013.'
short: 'K.F. Zimmermann, T.K. Bauer, H. Bonin, R. Fahr, H. Hinte, Arbeitskräftebedarf
Bei Hoher Arbeitslosigkeit: Ein Ökonomisches Zuwanderungskonzept Für Deutschland,
2013.'
date_created: 2018-10-26T08:46:52Z
date_updated: 2022-01-06T07:01:29Z
department:
- _id: '178'
- _id: '179'
status: public
title: 'Arbeitskräftebedarf bei hoher Arbeitslosigkeit: ein ökonomisches Zuwanderungskonzept
für Deutschland'
type: book
user_id: '69384'
year: '2013'
...
---
_id: '4915'
author:
- first_name: Behnud
full_name: Mir Djawadi, Behnud
last_name: Mir Djawadi
- first_name: Rene
full_name: Fahr, Rene
id: '111'
last_name: Fahr
citation:
ama: 'Mir Djawadi B, Fahr R. The Impact of Risk Perception and Risk Attitudes
on Corrupt Behavior: Evidence from a Petty Corruption Experiment.; 2013.'
apa: 'Mir Djawadi, B., & Fahr, R. (2013). The impact of risk perception and
risk attitudes on corrupt behavior: Evidence from a petty corruption experiment.'
bibtex: '@book{Mir Djawadi_Fahr_2013, title={The impact of risk perception and risk
attitudes on corrupt behavior: Evidence from a petty corruption experiment}, author={Mir
Djawadi, Behnud and Fahr, Rene}, year={2013} }'
chicago: 'Mir Djawadi, Behnud, and Rene Fahr. The Impact of Risk Perception and
Risk Attitudes on Corrupt Behavior: Evidence from a Petty Corruption Experiment,
2013.'
ieee: 'B. Mir Djawadi and R. Fahr, The impact of risk perception and risk attitudes
on corrupt behavior: Evidence from a petty corruption experiment. 2013.'
mla: 'Mir Djawadi, Behnud, and Rene Fahr. The Impact of Risk Perception and Risk
Attitudes on Corrupt Behavior: Evidence from a Petty Corruption Experiment.
2013.'
short: 'B. Mir Djawadi, R. Fahr, The Impact of Risk Perception and Risk Attitudes
on Corrupt Behavior: Evidence from a Petty Corruption Experiment, 2013.'
date_created: 2018-10-26T08:49:05Z
date_updated: 2022-01-06T07:01:29Z
department:
- _id: '178'
- _id: '179'
status: public
title: 'The impact of risk perception and risk attitudes on corrupt behavior: Evidence
from a petty corruption experiment'
type: working_paper
user_id: '69384'
year: '2013'
...
---
_id: '4917'
author:
- first_name: Behnud Mir
full_name: Djawadi, Behnud Mir
last_name: Djawadi
- first_name: Rene
full_name: Fahr, Rene
id: '111'
last_name: Fahr
citation:
ama: Djawadi BM, Fahr R. The Impact of Tax Knowledge and Budget Spending Influence
on Tax Compliance.; 2013.
apa: Djawadi, B. M., & Fahr, R. (2013). The impact of tax knowledge and budget
spending influence on tax compliance.
bibtex: '@book{Djawadi_Fahr_2013, title={The impact of tax knowledge and budget
spending influence on tax compliance}, author={Djawadi, Behnud Mir and Fahr, Rene},
year={2013} }'
chicago: Djawadi, Behnud Mir, and Rene Fahr. The Impact of Tax Knowledge and
Budget Spending Influence on Tax Compliance, 2013.
ieee: B. M. Djawadi and R. Fahr, The impact of tax knowledge and budget spending
influence on tax compliance. 2013.
mla: Djawadi, Behnud Mir, and Rene Fahr. The Impact of Tax Knowledge and Budget
Spending Influence on Tax Compliance. 2013.
short: B.M. Djawadi, R. Fahr, The Impact of Tax Knowledge and Budget Spending Influence
on Tax Compliance, 2013.
date_created: 2018-10-26T08:55:28Z
date_updated: 2022-01-06T07:01:29Z
status: public
title: The impact of tax knowledge and budget spending influence on tax compliance
type: report
user_id: '69384'
year: '2013'
...
---
_id: '492'
author:
- first_name: Christoph
full_name: Robbert, Christoph
last_name: Robbert
citation:
ama: Robbert C. Ressource-Optimized Deployment of Multi-Tier Applications - The
Data Rate-Constrained Case. Universität Paderborn; 2013.
apa: Robbert, C. (2013). Ressource-Optimized Deployment of Multi-Tier Applications
- The Data Rate-Constrained Case. Universität Paderborn.
bibtex: '@book{Robbert_2013, title={Ressource-Optimized Deployment of Multi-Tier
Applications - The Data Rate-Constrained Case}, publisher={Universität Paderborn},
author={Robbert, Christoph}, year={2013} }'
chicago: Robbert, Christoph. Ressource-Optimized Deployment of Multi-Tier Applications
- The Data Rate-Constrained Case. Universität Paderborn, 2013.
ieee: C. Robbert, Ressource-Optimized Deployment of Multi-Tier Applications -
The Data Rate-Constrained Case. Universität Paderborn, 2013.
mla: Robbert, Christoph. Ressource-Optimized Deployment of Multi-Tier Applications
- The Data Rate-Constrained Case. Universität Paderborn, 2013.
short: C. Robbert, Ressource-Optimized Deployment of Multi-Tier Applications - The
Data Rate-Constrained Case, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:28Z
date_updated: 2022-01-06T07:01:29Z
department:
- _id: '75'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained
Case
type: bachelorsthesis
user_id: '15504'
year: '2013'
...
---
_id: '493'
author:
- first_name: Artjom
full_name: Terentjew, Artjom
last_name: Terentjew
citation:
ama: Terentjew A. Reputationssysteme und Gerichtsverfahren als Wekzeuge zur Sicherstellung
von Qualitätsstandards in Transaktionen. Universität Paderborn; 2013.
apa: Terentjew, A. (2013). Reputationssysteme und Gerichtsverfahren als Wekzeuge
zur Sicherstellung von Qualitätsstandards in Transaktionen. Universität Paderborn.
bibtex: '@book{Terentjew_2013, title={Reputationssysteme und Gerichtsverfahren als
Wekzeuge zur Sicherstellung von Qualitätsstandards in Transaktionen}, publisher={Universität
Paderborn}, author={Terentjew, Artjom}, year={2013} }'
chicago: Terentjew, Artjom. Reputationssysteme und Gerichtsverfahren als Wekzeuge
zur Sicherstellung von Qualitätsstandards in Transaktionen. Universität Paderborn,
2013.
ieee: A. Terentjew, Reputationssysteme und Gerichtsverfahren als Wekzeuge zur
Sicherstellung von Qualitätsstandards in Transaktionen. Universität Paderborn,
2013.
mla: Terentjew, Artjom. Reputationssysteme und Gerichtsverfahren als Wekzeuge
zur Sicherstellung von Qualitätsstandards in Transaktionen. Universität Paderborn,
2013.
short: A. Terentjew, Reputationssysteme und Gerichtsverfahren als Wekzeuge zur Sicherstellung
von Qualitätsstandards in Transaktionen, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:28Z
date_updated: 2022-01-06T07:01:29Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Reputationssysteme und Gerichtsverfahren als Wekzeuge zur Sicherstellung von
Qualitätsstandards in Transaktionen
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '494'
abstract:
- lang: eng
text: The maintenance of component-based software systems requires up-to-date models
of their concrete architecture, i.e. the architecture that is realised in the
source code. These models help in systematically planning, analysing and executing
typical reengineering activities. Often no or only outdated architectural models
of such systems exist. Therefore, various reverse engineering methods have been
developed which try to recover a system's components, subsystems and connectors.
However, these reverse engineering methods are severely impacted by design deciencies
in the system's code base, especially violations of the component encapsulation.
As long as design deciencies are not considered in the reverse engineering process,
they reduce the quality of the recovered component structures. Despite this impact
of design deciencies, no existing architecture reconstruction approach explicitly
integrates a systematic deciency detection and removal into the recovery process.
Therefore, I have developed Archimetrix. Archimetrix is a tool-supported architecture
reconstruction process. It enhances a clustering-based architecture recovery approach
with an extensible, pattern-based deciency detection. After the detection of deciencies,
Archimetrix supports the software architect in removing the de ciencies and provides
the means to preview the architectural consequences of such a removal. I also
provide a process to identify and formalise additional deciencies. I validated
the approach on three case studies which show that Archimetrix is able to identify
relevant deciencies and that the removal of these deciencies leads to an increased
quality of the recovered architectures, i.e. they are closer to the corresponding
conceptual architectures.
author:
- first_name: Markus
full_name: von Detten, Markus
last_name: von Detten
citation:
ama: von Detten M. Reengineering of Component-Based Software Systems in the Presence
of Design Deficiencies. Universität Paderborn; 2013.
apa: von Detten, M. (2013). Reengineering of Component-Based Software Systems
in the Presence of Design Deficiencies. Universität Paderborn.
bibtex: '@book{von Detten_2013, title={Reengineering of Component-Based Software
Systems in the Presence of Design Deficiencies}, publisher={Universität Paderborn},
author={von Detten, Markus}, year={2013} }'
chicago: Detten, Markus von. Reengineering of Component-Based Software Systems
in the Presence of Design Deficiencies. Universität Paderborn, 2013.
ieee: M. von Detten, Reengineering of Component-Based Software Systems in the
Presence of Design Deficiencies. Universität Paderborn, 2013.
mla: von Detten, Markus. Reengineering of Component-Based Software Systems in
the Presence of Design Deficiencies. Universität Paderborn, 2013.
short: M. von Detten, Reengineering of Component-Based Software Systems in the Presence
of Design Deficiencies, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:28Z
date_updated: 2022-01-06T07:01:30Z
ddc:
- '040'
department:
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:43:42Z
date_updated: 2018-03-15T13:43:42Z
file_id: '1315'
file_name: 494-Dissertation-vonDetten.pdf
file_size: 11101635
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:43:42Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
title: Reengineering of Component-Based Software Systems in the Presence of Design
Deficiencies
type: dissertation
user_id: '477'
year: '2013'
...
---
_id: '495'
abstract:
- lang: eng
text: Automated service composition has been studied as a subject of state based
planning for a decade. A great deal of service composition tasks can only be solved
if concrete output values of the services are considered in the composition process.
However, the fact that those values are not known before runtime leads to nondeterministic
planning problems, which have proven to be notoriously difficult in practical
automated service composition applications. Even though this problem is frequently
recognized, it has still received remarkably few attention and remains unsolved.This
paper shows how nondeterminism in automated service composition can be reduced.
We introduce context rules as a means to derive semantic knowledge from output
values of services. These rules enable us to replace nondeterministic composition
operations by less nondeterministic or even completely deterministic ones. We
show the validity of our solutions not only theoretically but also have evaluated
them practically through implementation.
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Theodor
full_name: Lettmann, Theodor
id: '315'
last_name: Lettmann
orcid: 0000-0001-5859-2457
- first_name: Hans
full_name: Kleine Büning, Hans
last_name: Kleine Büning
citation:
ama: 'Mohr F, Lettmann T, Kleine Büning H. Reducing Nondeterminism in Automated
Service Composition. In: Proceedings of the 6th International Conference on
Service Oriented Computing and Applications (SOCA). ; 2013:154-161. doi:10.1109/SOCA.2013.25'
apa: Mohr, F., Lettmann, T., & Kleine Büning, H. (2013). Reducing Nondeterminism
in Automated Service Composition. In Proceedings of the 6th International Conference
on Service Oriented Computing and Applications (SOCA) (pp. 154–161). https://doi.org/10.1109/SOCA.2013.25
bibtex: '@inproceedings{Mohr_Lettmann_Kleine Büning_2013, title={Reducing Nondeterminism
in Automated Service Composition}, DOI={10.1109/SOCA.2013.25},
booktitle={Proceedings of the 6th International Conference on Service Oriented
Computing and Applications (SOCA)}, author={Mohr, Felix and Lettmann, Theodor
and Kleine Büning, Hans}, year={2013}, pages={154–161} }'
chicago: Mohr, Felix, Theodor Lettmann, and Hans Kleine Büning. “Reducing Nondeterminism
in Automated Service Composition.” In Proceedings of the 6th International
Conference on Service Oriented Computing and Applications (SOCA), 154–61,
2013. https://doi.org/10.1109/SOCA.2013.25.
ieee: F. Mohr, T. Lettmann, and H. Kleine Büning, “Reducing Nondeterminism in Automated
Service Composition,” in Proceedings of the 6th International Conference on
Service Oriented Computing and Applications (SOCA), 2013, pp. 154–161.
mla: Mohr, Felix, et al. “Reducing Nondeterminism in Automated Service Composition.”
Proceedings of the 6th International Conference on Service Oriented Computing
and Applications (SOCA), 2013, pp. 154–61, doi:10.1109/SOCA.2013.25.
short: 'F. Mohr, T. Lettmann, H. Kleine Büning, in: Proceedings of the 6th International
Conference on Service Oriented Computing and Applications (SOCA), 2013, pp. 154–161.'
date_created: 2017-10-17T12:42:28Z
date_updated: 2022-01-06T07:01:30Z
ddc:
- '040'
department:
- _id: '355'
doi: 10.1109/SOCA.2013.25
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:43:08Z
date_updated: 2018-03-15T13:43:08Z
file_id: '1314'
file_name: 495-paper52_mohr.pdf
file_size: 603822
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:43:08Z
has_accepted_license: '1'
language:
- iso: eng
page: 154-161
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 6th International Conference on Service Oriented Computing
and Applications (SOCA)
status: public
title: Reducing Nondeterminism in Automated Service Composition
type: conference
user_id: '477'
year: '2013'
...
---
_id: '496'
abstract:
- lang: eng
text: Within reactive topology control, a node determines its adjacent edges of
a network subgraph without prior knowledge of its neighborhood. The goal is to
construct a local view on a topology which provides certain desired properties
such as planarity. During algorithm execution, a node, in general, is not allowed
to determine all its neighbors of the network graph. There are well-known reactive
algorithms for computing planar subgraphs. However, the subgraphs obtained do
not have constant Euclidean spanning ratio. This means that routing along these
subgraphs may result in potentially long detours. So far, it has been unknown
if planar spanners can be constructed reactively. In this work, we show that at
least under the unit disk network model, this is indeed possible, by proposing
an algorithm for reactive construction of the partial Delaunay triangulation,
which recently turned out to be a spanner. Furthermore, we show that our algorithm
is message-optimal as a node will only exchange messages with nodes that are also
neighbors in the spanner. The algorithm’s presentation is complemented by a rigorous
proof of correctness.
author:
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Florentin
full_name: Neumann, Florentin
last_name: Neumann
- first_name: Hannes
full_name: Frey, Hannes
last_name: Frey
citation:
ama: 'Benter M, Neumann F, Frey H. Reactive Planar Spanner Construction in Wireless
Ad Hoc and Sensor Networks. In: Proceedings of the 32nd IEEE International
Conference on Computer Communications (INFOCOM). ; 2013:2193-2201. doi:10.1109/INFCOM.2013.6567022'
apa: Benter, M., Neumann, F., & Frey, H. (2013). Reactive Planar Spanner Construction
in Wireless Ad Hoc and Sensor Networks. In Proceedings of the 32nd IEEE International
Conference on Computer Communications (INFOCOM) (pp. 2193–2201). https://doi.org/10.1109/INFCOM.2013.6567022
bibtex: '@inproceedings{Benter_Neumann_Frey_2013, title={Reactive Planar Spanner
Construction in Wireless Ad Hoc and Sensor Networks}, DOI={10.1109/INFCOM.2013.6567022},
booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications
(INFOCOM)}, author={Benter, Markus and Neumann, Florentin and Frey, Hannes}, year={2013},
pages={2193–2201} }'
chicago: Benter, Markus, Florentin Neumann, and Hannes Frey. “Reactive Planar Spanner
Construction in Wireless Ad Hoc and Sensor Networks.” In Proceedings of the
32nd IEEE International Conference on Computer Communications (INFOCOM), 2193–2201,
2013. https://doi.org/10.1109/INFCOM.2013.6567022.
ieee: M. Benter, F. Neumann, and H. Frey, “Reactive Planar Spanner Construction
in Wireless Ad Hoc and Sensor Networks,” in Proceedings of the 32nd IEEE International
Conference on Computer Communications (INFOCOM), 2013, pp. 2193–2201.
mla: Benter, Markus, et al. “Reactive Planar Spanner Construction in Wireless Ad
Hoc and Sensor Networks.” Proceedings of the 32nd IEEE International Conference
on Computer Communications (INFOCOM), 2013, pp. 2193–201, doi:10.1109/INFCOM.2013.6567022.
short: 'M. Benter, F. Neumann, H. Frey, in: Proceedings of the 32nd IEEE International
Conference on Computer Communications (INFOCOM), 2013, pp. 2193–2201.'
date_created: 2017-10-17T12:42:29Z
date_updated: 2022-01-06T07:01:31Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/INFCOM.2013.6567022
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:41:34Z
date_updated: 2018-03-15T13:41:34Z
file_id: '1312'
file_name: 496-reactivePDT-copyright.pdf
file_size: 352571
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:41:34Z
has_accepted_license: '1'
page: 2193-2201
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 32nd IEEE International Conference on Computer Communications
(INFOCOM)
status: public
title: Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '498'
abstract:
- lang: eng
text: Proof-carrying code approaches aim at safe execution of untrusted code by
having the code producer attach a safety proof to the code which the code consumer
only has to validate. Depending on the type of safety property, proofs can however
become quite large and their validation - though faster than their construction
- still time consuming. In this paper we introduce a new concept for safe execution
of untrusted code. It keeps the idea of putting the time consuming part of proving
on the side of the code producer, however, attaches no proofs to code anymore
but instead uses the proof to transform the program into an equivalent but more
efficiently verifiable program. Code consumers thus still do proving themselves,
however, on a computationally inexpensive level only. Experimental results show
that the proof effort can be reduced by several orders of magnitude, both with
respect to time and space.
author:
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
- first_name: Alexander
full_name: Schremmer, Alexander
last_name: Schremmer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs – A PCC Alternative.
In: Proceedings of the 25th International Conference on Computer Aided Verification
(CAV). LNCS. ; 2013:912-927. doi:10.1007/978-3-642-39799-8_65'
apa: Wonisch, D., Schremmer, A., & Wehrheim, H. (2013). Programs from Proofs
– A PCC Alternative. In Proceedings of the 25th International Conference on
Computer Aided Verification (CAV) (pp. 912–927). https://doi.org/10.1007/978-3-642-39799-8_65
bibtex: '@inproceedings{Wonisch_Schremmer_Wehrheim_2013, series={LNCS}, title={Programs
from Proofs – A PCC Alternative}, DOI={10.1007/978-3-642-39799-8_65},
booktitle={Proceedings of the 25th International Conference on Computer Aided
Verification (CAV)}, author={Wonisch, Daniel and Schremmer, Alexander and Wehrheim,
Heike}, year={2013}, pages={912–927}, collection={LNCS} }'
chicago: Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Programs from
Proofs – A PCC Alternative.” In Proceedings of the 25th International Conference
on Computer Aided Verification (CAV), 912–27. LNCS, 2013. https://doi.org/10.1007/978-3-642-39799-8_65.
ieee: D. Wonisch, A. Schremmer, and H. Wehrheim, “Programs from Proofs – A PCC Alternative,”
in Proceedings of the 25th International Conference on Computer Aided Verification
(CAV), 2013, pp. 912–927.
mla: Wonisch, Daniel, et al. “Programs from Proofs – A PCC Alternative.” Proceedings
of the 25th International Conference on Computer Aided Verification (CAV),
2013, pp. 912–27, doi:10.1007/978-3-642-39799-8_65.
short: 'D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the 25th International
Conference on Computer Aided Verification (CAV), 2013, pp. 912–927.'
date_created: 2017-10-17T12:42:29Z
date_updated: 2022-01-06T07:01:32Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-39799-8_65
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:42:30Z
date_updated: 2018-03-15T13:42:30Z
file_id: '1313'
file_name: 498-WonischSchremmerWehrheim2013.pdf
file_size: 487617
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:42:30Z
has_accepted_license: '1'
language:
- iso: eng
page: 912-927
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 25th International Conference on Computer Aided Verification
(CAV)
series_title: LNCS
status: public
title: Programs from Proofs – A PCC Alternative
type: conference
user_id: '477'
year: '2013'
...