---
_id: '422'
author:
- first_name: Maryam
full_name: Sanati, Maryam
last_name: Sanati
citation:
ama: Sanati M. Formal Semantics of Probabilistic SMT Solving in Verification
of Service Compositions. Universität Paderborn; 2014.
apa: Sanati, M. (2014). Formal Semantics of Probabilistic SMT Solving in Verification
of Service Compositions. Universität Paderborn.
bibtex: '@book{Sanati_2014, title={Formal Semantics of Probabilistic SMT Solving
in Verification of Service Compositions}, publisher={Universität Paderborn}, author={Sanati,
Maryam}, year={2014} }'
chicago: Sanati, Maryam. Formal Semantics of Probabilistic SMT Solving in Verification
of Service Compositions. Universität Paderborn, 2014.
ieee: M. Sanati, Formal Semantics of Probabilistic SMT Solving in Verification
of Service Compositions. Universität Paderborn, 2014.
mla: Sanati, Maryam. Formal Semantics of Probabilistic SMT Solving in Verification
of Service Compositions. Universität Paderborn, 2014.
short: M. Sanati, Formal Semantics of Probabilistic SMT Solving in Verification
of Service Compositions, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:14Z
date_updated: 2022-01-06T07:00:38Z
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Formal Semantics of Probabilistic SMT Solving in Verification of Service Compositions
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '423'
author:
- first_name: Suman
full_name: Jojiju, Suman
last_name: Jojiju
citation:
ama: Jojiju S. Finding Optimal Self-Adaption Rules by Design-Space Exploration.
Universität Paderborn; 2014.
apa: Jojiju, S. (2014). Finding Optimal Self-Adaption Rules by Design-Space Exploration.
Universität Paderborn.
bibtex: '@book{Jojiju_2014, title={Finding Optimal Self-Adaption Rules by Design-Space
Exploration}, publisher={Universität Paderborn}, author={Jojiju, Suman}, year={2014}
}'
chicago: Jojiju, Suman. Finding Optimal Self-Adaption Rules by Design-Space Exploration.
Universität Paderborn, 2014.
ieee: S. Jojiju, Finding Optimal Self-Adaption Rules by Design-Space Exploration.
Universität Paderborn, 2014.
mla: Jojiju, Suman. Finding Optimal Self-Adaption Rules by Design-Space Exploration.
Universität Paderborn, 2014.
short: S. Jojiju, Finding Optimal Self-Adaption Rules by Design-Space Exploration,
Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:14Z
date_updated: 2022-01-06T07:00:40Z
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Finding Optimal Self-Adaption Rules by Design-Space Exploration
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '424'
author:
- first_name: Christoph
full_name: Finkensiep, Christoph
last_name: Finkensiep
citation:
ama: Finkensiep C. Fast and Flexible Automatic Composition of Semantic Web Services.
Universität Paderborn; 2014.
apa: Finkensiep, C. (2014). Fast and Flexible Automatic Composition of Semantic
Web Services. Universität Paderborn.
bibtex: '@book{Finkensiep_2014, title={Fast and Flexible Automatic Composition of
Semantic Web Services}, publisher={Universität Paderborn}, author={Finkensiep,
Christoph}, year={2014} }'
chicago: Finkensiep, Christoph. Fast and Flexible Automatic Composition of Semantic
Web Services. Universität Paderborn, 2014.
ieee: C. Finkensiep, Fast and Flexible Automatic Composition of Semantic Web
Services. Universität Paderborn, 2014.
mla: Finkensiep, Christoph. Fast and Flexible Automatic Composition of Semantic
Web Services. Universität Paderborn, 2014.
short: C. Finkensiep, Fast and Flexible Automatic Composition of Semantic Web Services,
Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:14Z
date_updated: 2022-01-06T07:00:40Z
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Fast and Flexible Automatic Composition of Semantic Web Services
type: bachelorsthesis
user_id: '15504'
year: '2014'
...
---
_id: '425'
abstract:
- lang: eng
text: In this paper, we evaluate the robustness of our color-based segmentation
approach in combination with different color spaces, namely RGB, L*a*b*, HSV,
and log-chromaticity (LCCS). For this purpose, we describe our deterministic segmentation
algorithm including its gradually transformation of pixel-precise image data into
a less error-prone and therefore more robust statistical representation in terms
of moments. To investigate the robustness of a specific segmentation setting,
we introduce our evaluation framework that directly works on the statistical representation.
It is based on two different types of robustness measures, namely relative and
absolute robustness. While relative robustness measures stability of segmentation
results over time, absolute robustness measures stability regarding varying illumination
by comparing results with ground truth data. The significance of these robustness
measures is shown by evaluating our segmentation approach with different color
spaces. For the evaluation process, an artificial scene was chosen as representative
for application scenarios based on artificial landmarks.
author:
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
- first_name: Jan
full_name: Jatzkowski, Jan
last_name: Jatzkowski
- first_name: Bernd
full_name: Kleinjohann, Bernd
last_name: Kleinjohann
citation:
ama: 'Jungmann A, Jatzkowski J, Kleinjohann B. Evaluation of Color Spaces for Robust
Image Segmentation. In: Proceedings of the 9th International Conference on
Computer Vision Theory and Applications (VISAPP). ; 2014:648-655.'
apa: Jungmann, A., Jatzkowski, J., & Kleinjohann, B. (2014). Evaluation of Color
Spaces for Robust Image Segmentation. In Proceedings of the 9th International
Conference on Computer Vision Theory and Applications (VISAPP) (pp. 648–655).
bibtex: '@inproceedings{Jungmann_Jatzkowski_Kleinjohann_2014, title={Evaluation
of Color Spaces for Robust Image Segmentation}, booktitle={Proceedings of the
9th International Conference on Computer Vision Theory and Applications (VISAPP)},
author={Jungmann, Alexander and Jatzkowski, Jan and Kleinjohann, Bernd}, year={2014},
pages={648–655} }'
chicago: Jungmann, Alexander, Jan Jatzkowski, and Bernd Kleinjohann. “Evaluation
of Color Spaces for Robust Image Segmentation.” In Proceedings of the 9th International
Conference on Computer Vision Theory and Applications (VISAPP), 648–55, 2014.
ieee: A. Jungmann, J. Jatzkowski, and B. Kleinjohann, “Evaluation of Color Spaces
for Robust Image Segmentation,” in Proceedings of the 9th International Conference
on Computer Vision Theory and Applications (VISAPP), 2014, pp. 648–655.
mla: Jungmann, Alexander, et al. “Evaluation of Color Spaces for Robust Image Segmentation.”
Proceedings of the 9th International Conference on Computer Vision Theory and
Applications (VISAPP), 2014, pp. 648–55.
short: 'A. Jungmann, J. Jatzkowski, B. Kleinjohann, in: Proceedings of the 9th International
Conference on Computer Vision Theory and Applications (VISAPP), 2014, pp. 648–655.'
date_created: 2017-10-17T12:42:14Z
date_updated: 2022-01-06T07:00:42Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:32:35Z
date_updated: 2018-03-16T11:32:35Z
file_id: '1358'
file_name: 425-visapp2014-camera-ready.pdf
file_size: 6355291
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:32:35Z
has_accepted_license: '1'
page: 648-655
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 9th International Conference on Computer Vision Theory
and Applications (VISAPP)
status: public
title: Evaluation of Color Spaces for Robust Image Segmentation
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '427'
author:
- first_name: Benjamin
full_name: Bulk, Benjamin
last_name: Bulk
citation:
ama: Bulk B. Evaluating the Influence of Different Abstraction Levels of Software
Design on Performance Prediction. Universität Paderborn; 2014.
apa: Bulk, B. (2014). Evaluating the Influence of Different Abstraction Levels
of Software Design on Performance prediction. Universität Paderborn.
bibtex: '@book{Bulk_2014, title={Evaluating the Influence of Different Abstraction
Levels of Software Design on Performance prediction}, publisher={Universität Paderborn},
author={Bulk, Benjamin}, year={2014} }'
chicago: Bulk, Benjamin. Evaluating the Influence of Different Abstraction Levels
of Software Design on Performance Prediction. Universität Paderborn, 2014.
ieee: B. Bulk, Evaluating the Influence of Different Abstraction Levels of Software
Design on Performance prediction. Universität Paderborn, 2014.
mla: Bulk, Benjamin. Evaluating the Influence of Different Abstraction Levels
of Software Design on Performance Prediction. Universität Paderborn, 2014.
short: B. Bulk, Evaluating the Influence of Different Abstraction Levels of Software
Design on Performance Prediction, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:15Z
date_updated: 2022-01-06T07:00:45Z
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Evaluating the Influence of Different Abstraction Levels of Software Design
on Performance prediction
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '428'
abstract:
- lang: eng
text: Services are self-contained software components that can be used platform
independent and that aim at maximizing software reuse. A basic concern in service
oriented architectures is to measure the reusability of services. One of the most
important qualities is the functional reusability, which indicates how relevant
the task is that a service solves. Current metrics for functional reusability
of software, however, either require source code analysis or have very little
explanatory power. This paper gives a formally described vision statement for
the estimation of functional reusability of services and sketches an exemplary
reusability metric that is based on the service descriptions.
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
citation:
ama: 'Mohr F. Estimating Functional Reusability of Services. In: Proceedings
of the 12th International Conference on Service Oriented Computing (ICSOC).
LNCS. ; 2014:411-418.'
apa: Mohr, F. (2014). Estimating Functional Reusability of Services. In Proceedings
of the 12th International Conference on Service Oriented Computing (ICSOC)
(pp. 411–418).
bibtex: '@inproceedings{Mohr_2014, series={LNCS}, title={Estimating Functional Reusability
of Services}, booktitle={Proceedings of the 12th International Conference on Service
Oriented Computing (ICSOC)}, author={Mohr, Felix}, year={2014}, pages={411–418},
collection={LNCS} }'
chicago: Mohr, Felix. “Estimating Functional Reusability of Services.” In Proceedings
of the 12th International Conference on Service Oriented Computing (ICSOC),
411–18. LNCS, 2014.
ieee: F. Mohr, “Estimating Functional Reusability of Services,” in Proceedings
of the 12th International Conference on Service Oriented Computing (ICSOC),
2014, pp. 411–418.
mla: Mohr, Felix. “Estimating Functional Reusability of Services.” Proceedings
of the 12th International Conference on Service Oriented Computing (ICSOC),
2014, pp. 411–18.
short: 'F. Mohr, in: Proceedings of the 12th International Conference on Service
Oriented Computing (ICSOC), 2014, pp. 411–418.'
date_created: 2017-10-17T12:42:15Z
date_updated: 2022-01-06T07:00:47Z
ddc:
- '040'
department:
- _id: '355'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:32:02Z
date_updated: 2018-03-16T11:32:02Z
file_id: '1357'
file_name: 428-ICSOC14.pdf
file_size: 200063
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:32:02Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007%2F978-3-662-45391-9_31
page: 411-418
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 12th International Conference on Service Oriented
Computing (ICSOC)
series_title: LNCS
status: public
title: Estimating Functional Reusability of Services
type: conference
user_id: '477'
year: '2014'
...
---
_id: '430'
author:
- first_name: Andreas
full_name: Krakau, Andreas
last_name: Krakau
citation:
ama: Krakau A. Entwicklung eines Konzepts zur Kodierung eines objektorientierten
Typsystems in SMT. Universität Paderborn; 2014.
apa: Krakau, A. (2014). Entwicklung eines Konzepts zur Kodierung eines objektorientierten
Typsystems in SMT. Universität Paderborn.
bibtex: '@book{Krakau_2014, title={Entwicklung eines Konzepts zur Kodierung eines
objektorientierten Typsystems in SMT}, publisher={Universität Paderborn}, author={Krakau,
Andreas}, year={2014} }'
chicago: Krakau, Andreas. Entwicklung eines Konzepts zur Kodierung eines objektorientierten
Typsystems in SMT. Universität Paderborn, 2014.
ieee: A. Krakau, Entwicklung eines Konzepts zur Kodierung eines objektorientierten
Typsystems in SMT. Universität Paderborn, 2014.
mla: Krakau, Andreas. Entwicklung eines Konzepts zur Kodierung eines objektorientierten
Typsystems in SMT. Universität Paderborn, 2014.
short: A. Krakau, Entwicklung eines Konzepts zur Kodierung eines objektorientierten
Typsystems in SMT, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:15Z
date_updated: 2022-01-06T07:00:50Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Entwicklung eines Konzepts zur Kodierung eines objektorientierten Typsystems
in SMT
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '433'
abstract:
- lang: eng
text: Virtual FPGAs are overlay architectures realized on top of physical FPGAs.
They are proposed to enhance or abstract away from the physical FPGA for experimenting
with novel architectures and design tool flows. In this paper, we present an embedding
of a ZUMA-based virtual FPGA fabric into a complete configurable system-on-chip.
Such an embedding is required to fully harness the potential of virtual FPGAs,
in particular to give the virtual circuits access to main memory and operating
system services, and to enable a concurrent operation of virtualized and non-virtualized
circuitry. We discuss our extension to ZUMA and its embedding into the ReconOS
operating system for hardware/software systems. Furthermore, we present an open
source tool flow to synthesize configurations for the virtual FPGA.
author:
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Arne
full_name: Bockhorn, Arne
last_name: Bockhorn
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Wiersema T, Bockhorn A, Platzner M. Embedding FPGA Overlays into Configurable
Systems-on-Chip: ReconOS meets ZUMA. In: Proceedings of the International Conference
on ReConFigurable Computing and FPGAs (ReConFig). ; 2014:1-6. doi:10.1109/ReConFig.2014.7032514'
apa: 'Wiersema, T., Bockhorn, A., & Platzner, M. (2014). Embedding FPGA Overlays
into Configurable Systems-on-Chip: ReconOS meets ZUMA. In Proceedings of the
International Conference on ReConFigurable Computing and FPGAs (ReConFig)
(pp. 1–6). https://doi.org/10.1109/ReConFig.2014.7032514'
bibtex: '@inproceedings{Wiersema_Bockhorn_Platzner_2014, title={Embedding FPGA Overlays
into Configurable Systems-on-Chip: ReconOS meets ZUMA}, DOI={10.1109/ReConFig.2014.7032514},
booktitle={Proceedings of the International Conference on ReConFigurable Computing
and FPGAs (ReConFig)}, author={Wiersema, Tobias and Bockhorn, Arne and Platzner,
Marco}, year={2014}, pages={1–6} }'
chicago: 'Wiersema, Tobias, Arne Bockhorn, and Marco Platzner. “Embedding FPGA Overlays
into Configurable Systems-on-Chip: ReconOS Meets ZUMA.” In Proceedings of the
International Conference on ReConFigurable Computing and FPGAs (ReConFig),
1–6, 2014. https://doi.org/10.1109/ReConFig.2014.7032514.'
ieee: 'T. Wiersema, A. Bockhorn, and M. Platzner, “Embedding FPGA Overlays into
Configurable Systems-on-Chip: ReconOS meets ZUMA,” in Proceedings of the International
Conference on ReConFigurable Computing and FPGAs (ReConFig), 2014, pp. 1–6.'
mla: 'Wiersema, Tobias, et al. “Embedding FPGA Overlays into Configurable Systems-on-Chip:
ReconOS Meets ZUMA.” Proceedings of the International Conference on ReConFigurable
Computing and FPGAs (ReConFig), 2014, pp. 1–6, doi:10.1109/ReConFig.2014.7032514.'
short: 'T. Wiersema, A. Bockhorn, M. Platzner, in: Proceedings of the International
Conference on ReConFigurable Computing and FPGAs (ReConFig), 2014, pp. 1–6.'
date_created: 2017-10-17T12:42:16Z
date_updated: 2022-01-06T07:00:56Z
ddc:
- '040'
department:
- _id: '78'
doi: 10.1109/ReConFig.2014.7032514
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:30:58Z
date_updated: 2018-03-16T11:30:58Z
file_id: '1355'
file_name: 433-wiersema14_reconfig_IEEE_approved.pdf
file_size: 369333
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:30:58Z
has_accepted_license: '1'
language:
- iso: eng
page: '1-6 '
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 International Conference on ReConFigurable Computing
and FPGAs (ReConFig)
status: public
title: 'Embedding FPGA Overlays into Configurable Systems-on-Chip: ReconOS meets ZUMA'
type: conference
user_id: '477'
year: '2014'
...
---
_id: '5189'
author:
- first_name: Steven
full_name: Arzt, Steven
last_name: Arzt
- first_name: Siegfried
full_name: Rasthofer, Siegfried
last_name: Rasthofer
- first_name: Christian
full_name: Fritz, Christian
last_name: Fritz
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Alexandre
full_name: Bartel, Alexandre
last_name: Bartel
- first_name: Jacques
full_name: Klein, Jacques
last_name: Klein
- first_name: Yves
full_name: Le Traon, Yves
last_name: Le Traon
- first_name: Damien
full_name: Octeau, Damien
last_name: Octeau
- first_name: Patrick
full_name: McDaniel, Patrick
last_name: McDaniel
citation:
ama: 'Arzt S, Rasthofer S, Fritz C, et al. FlowDroid: Precise Context, Flow, Field,
Object-sensitive and Lifecycle-aware Taint Analysis for Android Apps. In: Proceedings
of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation
- PLDI ’14. ACM Press; 2014. doi:10.1145/2594291.2594299'
apa: 'Arzt, S., Rasthofer, S., Fritz, C., Bodden, E., Bartel, A., Klein, J., … McDaniel,
P. (2014). FlowDroid: Precise Context, Flow, Field, Object-sensitive and Lifecycle-aware
Taint Analysis for Android Apps. In Proceedings of the 35th ACM SIGPLAN Conference
on Programming Language Design and Implementation - PLDI ’14. ACM Press. https://doi.org/10.1145/2594291.2594299'
bibtex: '@inproceedings{Arzt_Rasthofer_Fritz_Bodden_Bartel_Klein_Le Traon_Octeau_McDaniel_2014,
title={FlowDroid: Precise Context, Flow, Field, Object-sensitive and Lifecycle-aware
Taint Analysis for Android Apps}, DOI={10.1145/2594291.2594299},
booktitle={Proceedings of the 35th ACM SIGPLAN Conference on Programming Language
Design and Implementation - PLDI ’14}, publisher={ACM Press}, author={Arzt, Steven
and Rasthofer, Siegfried and Fritz, Christian and Bodden, Eric and Bartel, Alexandre
and Klein, Jacques and Le Traon, Yves and Octeau, Damien and McDaniel, Patrick},
year={2014} }'
chicago: 'Arzt, Steven, Siegfried Rasthofer, Christian Fritz, Eric Bodden, Alexandre
Bartel, Jacques Klein, Yves Le Traon, Damien Octeau, and Patrick McDaniel. “FlowDroid:
Precise Context, Flow, Field, Object-Sensitive and Lifecycle-Aware Taint Analysis
for Android Apps.” In Proceedings of the 35th ACM SIGPLAN Conference on Programming
Language Design and Implementation - PLDI ’14. ACM Press, 2014. https://doi.org/10.1145/2594291.2594299.'
ieee: 'S. Arzt et al., “FlowDroid: Precise Context, Flow, Field, Object-sensitive
and Lifecycle-aware Taint Analysis for Android Apps,” in Proceedings of the
35th ACM SIGPLAN Conference on Programming Language Design and Implementation
- PLDI ’14, 2014.'
mla: 'Arzt, Steven, et al. “FlowDroid: Precise Context, Flow, Field, Object-Sensitive
and Lifecycle-Aware Taint Analysis for Android Apps.” Proceedings of the 35th
ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI
’14, ACM Press, 2014, doi:10.1145/2594291.2594299.'
short: 'S. Arzt, S. Rasthofer, C. Fritz, E. Bodden, A. Bartel, J. Klein, Y. Le Traon,
D. Octeau, P. McDaniel, in: Proceedings of the 35th ACM SIGPLAN Conference on
Programming Language Design and Implementation - PLDI ’14, ACM Press, 2014.'
date_created: 2018-10-31T10:55:28Z
date_updated: 2022-01-06T07:01:42Z
ddc:
- '000'
department:
- _id: '76'
doi: 10.1145/2594291.2594299
extern: '1'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:59:33Z
date_updated: 2018-11-02T13:59:33Z
file_id: '5258'
file_name: p259-arzt.pdf
file_size: 406920
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:59:33Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://www.bodden.de/pubs/far+14flowdroid.pdf
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language
Design and Implementation - PLDI '14
publication_identifier:
isbn:
- '9781450327848'
publication_status: published
publisher: ACM Press
status: public
title: 'FlowDroid: Precise Context, Flow, Field, Object-sensitive and Lifecycle-aware
Taint Analysis for Android Apps'
type: conference
user_id: '477'
year: '2014'
...
---
_id: '5190'
author:
- first_name: Steven
full_name: Arzt, Steven
last_name: Arzt
- first_name: Siegfried
full_name: Rasthofer, Siegfried
last_name: Rasthofer
- first_name: Enrico
full_name: Lovat, Enrico
last_name: Lovat
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: 'Arzt S, Rasthofer S, Lovat E, Bodden E. DroidForce: Enforcing Complex, Data-Centric,
System-Wide Policies in Android. In: International Conference on Availability,
Reliability and Security (ARES 2014). IEEE; 2014:40-49.'
apa: 'Arzt, S., Rasthofer, S., Lovat, E., & Bodden, E. (2014). DroidForce: Enforcing
Complex, Data-Centric, System-Wide Policies in Android. In International Conference
on Availability, Reliability and Security (ARES 2014) (pp. 40–49). IEEE.'
bibtex: '@inproceedings{Arzt_Rasthofer_Lovat_Bodden_2014, title={DroidForce: Enforcing
Complex, Data-Centric, System-Wide Policies in Android}, booktitle={International
Conference on Availability, Reliability and Security (ARES 2014)}, publisher={IEEE},
author={Arzt, Steven and Rasthofer, Siegfried and Lovat, Enrico and Bodden, Eric},
year={2014}, pages={40–49} }'
chicago: 'Arzt, Steven, Siegfried Rasthofer, Enrico Lovat, and Eric Bodden. “DroidForce:
Enforcing Complex, Data-Centric, System-Wide Policies in Android.” In International
Conference on Availability, Reliability and Security (ARES 2014), 40–49. IEEE,
2014.'
ieee: 'S. Arzt, S. Rasthofer, E. Lovat, and E. Bodden, “DroidForce: Enforcing Complex,
Data-Centric, System-Wide Policies in Android,” in International Conference
on Availability, Reliability and Security (ARES 2014), 2014, pp. 40–49.'
mla: 'Arzt, Steven, et al. “DroidForce: Enforcing Complex, Data-Centric, System-Wide
Policies in Android.” International Conference on Availability, Reliability
and Security (ARES 2014), IEEE, 2014, pp. 40–49.'
short: 'S. Arzt, S. Rasthofer, E. Lovat, E. Bodden, in: International Conference
on Availability, Reliability and Security (ARES 2014), IEEE, 2014, pp. 40–49.'
date_created: 2018-10-31T11:04:43Z
date_updated: 2022-01-06T07:01:43Z
ddc:
- '004'
department:
- _id: '76'
extern: '1'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:21:13Z
date_updated: 2018-11-02T13:21:13Z
file_id: '5247'
file_name: ralb14droidforce.pdf
file_size: 661565
relation: main_file
file_date_updated: 2018-11-02T13:21:13Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://www.bodden.de/pubs/ralb14droidforce.pdf
page: 40-49
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: International Conference on Availability, Reliability and Security (ARES
2014)
publisher: IEEE
status: public
title: 'DroidForce: Enforcing Complex, Data-Centric, System-Wide Policies in Android'
type: conference
user_id: '477'
year: '2014'
...
---
_id: '469'
abstract:
- lang: eng
text: Runtime monitoring aims at ensuring program safety by monitoring the program's
behaviour during execution and taking appropriate action before a program violates
some property.Runtime monitoring is in particular important when an exhaustive
formal verification fails. While the approach allows for a safe execution of programs,
it may impose a significant runtime overhead.In this paper, we propose a novel
technique combining verification and monitoring which incurs no overhead during
runtime at all. The technique proceeds by using the inconclusive result of a verification
run as the basis for transforming the program into one where all potential points
of failure are replaced by HALT statements. The new program is safe by construction,
behaviourally equivalent to the original program (except for unsafe behaviour),and
has the same performance characteristics.
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. Zero Overhead Runtime Monitoring. In:
Proceedings of the 11th International Conference on Software Engineering and
Formal Methods (SEFM). LNCS. ; 2013:244-258. doi:10.1007/978-3-642-40561-7_17'
apa: Wonisch, D., Schremmer, A., & Wehrheim, H. (2013). Zero Overhead Runtime
Monitoring. In Proceedings of the 11th International Conference on Software
Engineering and Formal Methods (SEFM) (pp. 244–258). https://doi.org/10.1007/978-3-642-40561-7_17
bibtex: '@inproceedings{Wonisch_Schremmer_Wehrheim_2013, series={LNCS}, title={Zero
Overhead Runtime Monitoring}, DOI={10.1007/978-3-642-40561-7_17},
booktitle={Proceedings of the 11th International Conference on Software Engineering
and Formal Methods (SEFM)}, author={Wonisch, Daniel and Schremmer, Alexander and
Wehrheim, Heike}, year={2013}, pages={244–258}, collection={LNCS} }'
chicago: Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Zero Overhead
Runtime Monitoring.” In Proceedings of the 11th International Conference on
Software Engineering and Formal Methods (SEFM), 244–58. LNCS, 2013. https://doi.org/10.1007/978-3-642-40561-7_17.
ieee: D. Wonisch, A. Schremmer, and H. Wehrheim, “Zero Overhead Runtime Monitoring,”
in Proceedings of the 11th International Conference on Software Engineering
and Formal Methods (SEFM), 2013, pp. 244–258.
mla: Wonisch, Daniel, et al. “Zero Overhead Runtime Monitoring.” Proceedings
of the 11th International Conference on Software Engineering and Formal Methods
(SEFM), 2013, pp. 244–58, doi:10.1007/978-3-642-40561-7_17.
short: 'D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the 11th International
Conference on Software Engineering and Formal Methods (SEFM), 2013, pp. 244–258.'
date_created: 2017-10-17T12:42:23Z
date_updated: 2022-01-06T07:01:18Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-40561-7_17
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:18:41Z
date_updated: 2018-03-16T11:18:41Z
file_id: '1332'
file_name: 469-WSW2013-2.pdf
file_size: 394804
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:18:41Z
has_accepted_license: '1'
language:
- iso: eng
page: 244-258
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 11th International Conference on Software Engineering
and Formal Methods (SEFM)
series_title: LNCS
status: public
title: Zero Overhead Runtime Monitoring
type: conference
user_id: '477'
year: '2013'
...
---
_id: '472'
author:
- first_name: Marco
full_name: Engelbrecht, Marco
last_name: Engelbrecht
citation:
ama: Engelbrecht M. Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern.
Universität Paderborn; 2013.
apa: Engelbrecht, M. (2013). Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern.
Universität Paderborn.
bibtex: '@book{Engelbrecht_2013, title={Vergleichsstudie zur Ausdrucksstärke von
SMT-Solvern}, publisher={Universität Paderborn}, author={Engelbrecht, Marco},
year={2013} }'
chicago: Engelbrecht, Marco. Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern.
Universität Paderborn, 2013.
ieee: M. Engelbrecht, Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern.
Universität Paderborn, 2013.
mla: Engelbrecht, Marco. Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern.
Universität Paderborn, 2013.
short: M. Engelbrecht, Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern, Universität
Paderborn, 2013.
date_created: 2017-10-17T12:42:24Z
date_updated: 2022-01-06T07:01:19Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '478'
abstract:
- lang: eng
text: 'Software systems are playing an increasing role in our everyday life, and
as the amount of software applications grows, so does their complexity and the
relevance of their computations. Software components can be found in many systems
that are charged with safety-critical tasks, such as control systems for aviation
or power plants. Hence, software verification techniques that are capable of proving
the absence of critical errors are becoming more and more important in the field
software engineering. A well-established approach to software verification is
model checking. Applying this technique involves an exhaustive exploration of
a state space model corresponding to the system under consideration. The major
challenge in model checking is the so-called state explosion problem: The state
space of a software system grows exponentially with its size. Thus, the straightforward
modelling of real-life systems practically impossible. A common approach to this
problem is the application of abstraction techniques, which reduce the original
state space by mapping it on a significantly smaller abstract one. Abstraction
inherently involves a loss of information, and thus, the resulting abstract model
may be too imprecise for a definite result in verification. Therefore, abstraction
is typically combined with abstraction refinement: An initially very coarse abstract
model is iteratively refined, i.e. enriched with new details about the original
system, until a level of abstraction is reached that is precise enough for a definite
outcome. Abstraction refinement-based model checking is fully automatable and
it is considered as one of the most promising approaches to the state explosion
problem in verification. However, it is still faced with a number of challenges.
There exist several types of abstraction techniques and not every type is equally
well-suited for all kinds of systems and verification tasks. Moreover, the selection
of adequate refinement steps is nontrivial and typically the most crucial part
of the overall approach: Unfavourable refinement decisions can compromise the
state space-reducing effect of abstraction, and as a consequence, can easily lead
to the failure of verification. It is, however, hard to predict which refinement
steps will eventually be expedient for verification – and which not.'
author:
- first_name: Nils
full_name: Timm, Nils
last_name: Timm
citation:
ama: Timm N. Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying
Concurrent Systems. Universität Paderborn; 2013.
apa: Timm, N. (2013). Three-Valued Abstraction and Heuristic-Guided Refinement
for Verifying Concurrent Systems. Universität Paderborn.
bibtex: '@book{Timm_2013, title={Three-Valued Abstraction and Heuristic-Guided Refinement
for Verifying Concurrent Systems}, publisher={Universität Paderborn}, author={Timm,
Nils}, year={2013} }'
chicago: Timm, Nils. Three-Valued Abstraction and Heuristic-Guided Refinement
for Verifying Concurrent Systems. Universität Paderborn, 2013.
ieee: N. Timm, Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying
Concurrent Systems. Universität Paderborn, 2013.
mla: Timm, Nils. Three-Valued Abstraction and Heuristic-Guided Refinement for
Verifying Concurrent Systems. Universität Paderborn, 2013.
short: N. Timm, Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying
Concurrent Systems, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:25Z
date_updated: 2022-01-06T07:01:22Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:06:05Z
date_updated: 2018-03-15T14:06:05Z
file_id: '1324'
file_name: 478-Dissertation-Timm.pdf
file_size: 931458
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:06:05Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent
Systems
type: dissertation
user_id: '477'
year: '2013'
...
---
_id: '482'
author:
- first_name: Maarten
full_name: Bieshaar, Maarten
last_name: Bieshaar
citation:
ama: Bieshaar M. Statistisches Planen von Aktionen für autonome mobile Roboter
in realen Umgebungen. Universität Paderborn; 2013.
apa: Bieshaar, M. (2013). Statistisches Planen von Aktionen für autonome mobile
Roboter in realen Umgebungen. Universität Paderborn.
bibtex: '@book{Bieshaar_2013, title={Statistisches Planen von Aktionen für autonome
mobile Roboter in realen Umgebungen}, publisher={Universität Paderborn}, author={Bieshaar,
Maarten}, year={2013} }'
chicago: Bieshaar, Maarten. Statistisches Planen von Aktionen für autonome mobile
Roboter in realen Umgebungen. Universität Paderborn, 2013.
ieee: M. Bieshaar, Statistisches Planen von Aktionen für autonome mobile Roboter
in realen Umgebungen. Universität Paderborn, 2013.
mla: Bieshaar, Maarten. Statistisches Planen von Aktionen für autonome mobile
Roboter in realen Umgebungen. Universität Paderborn, 2013.
short: M. Bieshaar, Statistisches Planen von Aktionen für autonome mobile Roboter
in realen Umgebungen, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:26Z
date_updated: 2022-01-06T07:01:25Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Statistisches Planen von Aktionen für autonome mobile Roboter in realen Umgebungen
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_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: '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: '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'
...