---
_id: '218'
abstract:
- lang: eng
text: In the Image Processing domain, automated generation of complex Image Processing
functionality is highly desirable; e.g., for rapid prototyping. Service composition
techniques, in turn, facilitate automated generation of complex functionality
based on building blocks in terms of services. For that reason, we aim for transferring
the Service Composition paradigm into the Image Processing domain. In this paper,
we present our symbolic composition approach that enables us to automatically
generate Image Processing applications. Functionality of Image Processing services
is described by means of a variant of first-order logic, which grounds on domain
knowledge operationalized in terms of ontologies. A Petri-net formalism serves
as basis for modeling data-flow of services and composed services. A planning-based
composition algorithm automatically composes complex data-flow for a required
functionality. A brief evaluation serves as proof of concept.
author:
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
- first_name: Bernd
full_name: Kleinjohann, Bernd
last_name: Kleinjohann
citation:
ama: 'Jungmann A, Kleinjohann B. Automatic Composition of Service-based Image Processing
Applications. In: Proceedings of the 13th IEEE International Conference on
Services Computing (SCC). ; 2016:106--113. doi:10.1109/SCC.2016.21'
apa: Jungmann, A., & Kleinjohann, B. (2016). Automatic Composition of Service-based
Image Processing Applications. In Proceedings of the 13th IEEE International
Conference on Services Computing (SCC) (pp. 106--113). https://doi.org/10.1109/SCC.2016.21
bibtex: '@inproceedings{Jungmann_Kleinjohann_2016, title={Automatic Composition
of Service-based Image Processing Applications}, DOI={10.1109/SCC.2016.21},
booktitle={Proceedings of the 13th IEEE International Conference on Services Computing
(SCC)}, author={Jungmann, Alexander and Kleinjohann, Bernd}, year={2016}, pages={106--113}
}'
chicago: Jungmann, Alexander, and Bernd Kleinjohann. “Automatic Composition of Service-Based
Image Processing Applications.” In Proceedings of the 13th IEEE International
Conference on Services Computing (SCC), 106--113, 2016. https://doi.org/10.1109/SCC.2016.21.
ieee: A. Jungmann and B. Kleinjohann, “Automatic Composition of Service-based Image
Processing Applications,” in Proceedings of the 13th IEEE International Conference
on Services Computing (SCC), 2016, pp. 106--113.
mla: Jungmann, Alexander, and Bernd Kleinjohann. “Automatic Composition of Service-Based
Image Processing Applications.” Proceedings of the 13th IEEE International
Conference on Services Computing (SCC), 2016, pp. 106--113, doi:10.1109/SCC.2016.21.
short: 'A. Jungmann, B. Kleinjohann, in: Proceedings of the 13th IEEE International
Conference on Services Computing (SCC), 2016, pp. 106--113.'
date_created: 2017-10-17T12:41:34Z
date_updated: 2022-01-06T06:55:14Z
ddc:
- '040'
doi: 10.1109/SCC.2016.21
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:38:44Z
date_updated: 2018-03-21T10:38:44Z
file_id: '1515'
file_name: 218-07557442.pdf
file_size: 836658
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:38:44Z
has_accepted_license: '1'
page: 106--113
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 13th IEEE International Conference on Services Computing
(SCC)
status: public
title: Automatic Composition of Service-based Image Processing Applications
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '5205'
author:
- first_name: Johannes
full_name: Späth, Johannes
last_name: Späth
- first_name: Lisa
full_name: Nguyen Quang Do, Lisa
last_name: Nguyen Quang Do
- first_name: Karim
full_name: Ali, Karim
last_name: Ali
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: 'Späth J, Nguyen Quang Do L, Ali K, Bodden E. Boomerang: Demand-Driven Flow-
and Context-Sensitive Pointer Analysis for Java. In: European Conference on
Object-Oriented Programming (ECOOP). ; 2016.'
apa: 'Späth, J., Nguyen Quang Do, L., Ali, K., & Bodden, E. (2016). Boomerang:
Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java. In European
Conference on Object-Oriented Programming (ECOOP).'
bibtex: '@inproceedings{Späth_Nguyen Quang Do_Ali_Bodden_2016, title={Boomerang:
Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java}, booktitle={European
Conference on Object-Oriented Programming (ECOOP)}, author={Späth, Johannes and
Nguyen Quang Do, Lisa and Ali, Karim and Bodden, Eric}, year={2016} }'
chicago: 'Späth, Johannes, Lisa Nguyen Quang Do, Karim Ali, and Eric Bodden. “Boomerang:
Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java.” In European
Conference on Object-Oriented Programming (ECOOP), 2016.'
ieee: 'J. Späth, L. Nguyen Quang Do, K. Ali, and E. Bodden, “Boomerang: Demand-Driven
Flow- and Context-Sensitive Pointer Analysis for Java,” in European Conference
on Object-Oriented Programming (ECOOP), 2016.'
mla: 'Späth, Johannes, et al. “Boomerang: Demand-Driven Flow- and Context-Sensitive
Pointer Analysis for Java.” European Conference on Object-Oriented Programming
(ECOOP), 2016.'
short: 'J. Späth, L. Nguyen Quang Do, K. Ali, E. Bodden, in: European Conference
on Object-Oriented Programming (ECOOP), 2016.'
date_created: 2018-10-31T12:51:26Z
date_updated: 2022-01-06T07:01:45Z
ddc:
- '000'
department:
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:13:19Z
date_updated: 2018-11-02T14:13:19Z
file_id: '5265'
file_name: sna+16boomerang.pdf
file_size: 1921617
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:13:19Z
has_accepted_license: '1'
keyword:
- ATTRACT
- ITSECWEBSITE
language:
- iso: eng
main_file_link:
- url: http://www.bodden.de/pubs/sna+16boomerang.pdf
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: European Conference on Object-Oriented Programming (ECOOP)
status: public
title: 'Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for
Java'
type: conference
user_id: '477'
year: '2016'
...
---
_id: '169'
abstract:
- lang: eng
text: We apply methods of genetic programming to a general problem from software
engineering, namely example-based generation of specifications. In particular,
we focus on model transformation by example. The definition and implementation
of model transformations is a task frequently carried out by domain experts, hence,
a (semi-)automatic approach is desirable. This application is challenging because
the underlying search space has rich semantics, is high-dimensional, and unstructured.
Hence, a computationally brute-force approach would be unscalable and potentially
infeasible. To address that problem, we develop a sophisticated approach of designing
complex mutation operators. We define ‘patterns’ for constructing mutation operators
and report a successful case study. Furthermore, the code of the evolved model
transformation is required to have high maintainability and extensibility, that
is, the code should be easily readable by domain experts. We report an evaluation
of this approach in a software engineering case study.
author:
- first_name: Thomas
full_name: Kühne, Thomas
id: '49079'
last_name: Kühne
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Svetlana
full_name: Arifulina, Svetlana
last_name: Arifulina
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Kühne T, Hamann H, Arifulina S, Engels G. Patterns for Constructing Mutation
Operators: Limiting the Search Space in a Software Engineering Application. In:
Proceedings of the 19th European Conference on Genetic Programming (EuroGP
2016). LNCS 9594. ; 2016:278--293. doi:10.1007/978-3-319-30668-1_18'
apa: 'Kühne, T., Hamann, H., Arifulina, S., & Engels, G. (2016). Patterns for
Constructing Mutation Operators: Limiting the Search Space in a Software Engineering
Application. In Proceedings of the 19th European Conference on Genetic Programming
(EuroGP 2016) (pp. 278--293). https://doi.org/10.1007/978-3-319-30668-1_18'
bibtex: '@inproceedings{Kühne_Hamann_Arifulina_Engels_2016, series={LNCS 9594},
title={Patterns for Constructing Mutation Operators: Limiting the Search Space
in a Software Engineering Application}, DOI={10.1007/978-3-319-30668-1_18},
booktitle={Proceedings of the 19th European Conference on Genetic Programming
(EuroGP 2016)}, author={Kühne, Thomas and Hamann, Heiko and Arifulina, Svetlana
and Engels, Gregor}, year={2016}, pages={278--293}, collection={LNCS 9594} }'
chicago: 'Kühne, Thomas, Heiko Hamann, Svetlana Arifulina, and Gregor Engels. “Patterns
for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering
Application.” In Proceedings of the 19th European Conference on Genetic Programming
(EuroGP 2016), 278--293. LNCS 9594, 2016. https://doi.org/10.1007/978-3-319-30668-1_18.'
ieee: 'T. Kühne, H. Hamann, S. Arifulina, and G. Engels, “Patterns for Constructing
Mutation Operators: Limiting the Search Space in a Software Engineering Application,”
in Proceedings of the 19th European Conference on Genetic Programming (EuroGP
2016), 2016, pp. 278--293.'
mla: 'Kühne, Thomas, et al. “Patterns for Constructing Mutation Operators: Limiting
the Search Space in a Software Engineering Application.” Proceedings of the
19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293,
doi:10.1007/978-3-319-30668-1_18.'
short: 'T. Kühne, H. Hamann, S. Arifulina, G. Engels, in: Proceedings of the 19th
European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293.'
date_created: 2017-10-17T12:41:25Z
date_updated: 2022-01-06T06:52:58Z
ddc:
- '040'
department:
- _id: '66'
- _id: '238'
- _id: '63'
doi: 10.1007/978-3-319-30668-1_18
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:41:08Z
date_updated: 2018-03-21T12:41:08Z
file_id: '1540'
file_name: 169-kuehne.pdf
file_size: 2069427
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:41:08Z
has_accepted_license: '1'
language:
- iso: eng
page: 278--293
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 19th European Conference on Genetic Programming (EuroGP
2016)
series_title: LNCS 9594
status: public
title: 'Patterns for Constructing Mutation Operators: Limiting the Search Space in
a Software Engineering Application'
type: conference
user_id: '57458'
year: '2016'
...
---
_id: '170'
abstract:
- lang: eng
text: We present PAndA2, an extendable, static analysis tool for Android apps which examines permission related
security threats like overprivilege, existence of permission redelegation and
permission flows. PAndA2 comes along with a textual and graphical visualization
of the analysis result and even supports the comparison of analysis results for
different android app versions.
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Manuel
full_name: Töws, Manuel
id: '11315'
last_name: Töws
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
citation:
ama: 'Jakobs M-C, Töws M, Pauck F. PAndA 2 : Analyzing Permission Use and Interplay
in Android Apps (Tool Paper). In: Ishikawa F, Romanovsky A TE, ed. Workshop
on Formal and Model-Driven Techniques for Developing Trustworthy Systems.
School of Computing Science Technical Report Series. ; 2016.'
apa: 'Jakobs, M.-C., Töws, M., & Pauck, F. (2016). PAndA 2 : Analyzing Permission
Use and Interplay in Android Apps (Tool Paper). In T. E. Ishikawa F, Romanovsky
A (Ed.), Workshop on Formal and Model-Driven Techniques for Developing Trustworthy
Systems.'
bibtex: '@inproceedings{Jakobs_Töws_Pauck_2016, series={School of Computing Science
Technical Report Series}, title={PAndA 2 : Analyzing Permission Use and Interplay
in Android Apps (Tool Paper)}, booktitle={Workshop on Formal and Model-Driven
Techniques for Developing Trustworthy Systems}, author={Jakobs, Marie-Christine
and Töws, Manuel and Pauck, Felix}, editor={Ishikawa F, Romanovsky A, Troubitsyna
EEditor}, year={2016}, collection={School of Computing Science Technical Report
Series} }'
chicago: 'Jakobs, Marie-Christine, Manuel Töws, and Felix Pauck. “PAndA 2 : Analyzing
Permission Use and Interplay in Android Apps (Tool Paper).” In Workshop on
Formal and Model-Driven Techniques for Developing Trustworthy Systems, edited
by Troubitsyna E Ishikawa F, Romanovsky A. School of Computing Science Technical
Report Series, 2016.'
ieee: 'M.-C. Jakobs, M. Töws, and F. Pauck, “PAndA 2 : Analyzing Permission Use
and Interplay in Android Apps (Tool Paper),” in Workshop on Formal and Model-Driven
Techniques for Developing Trustworthy Systems, 2016.'
mla: 'Jakobs, Marie-Christine, et al. “PAndA 2 : Analyzing Permission Use and Interplay
in Android Apps (Tool Paper).” Workshop on Formal and Model-Driven Techniques
for Developing Trustworthy Systems, edited by Troubitsyna E Ishikawa F, Romanovsky
A, 2016.'
short: 'M.-C. Jakobs, M. Töws, F. Pauck, in: T.E. Ishikawa F, Romanovsky A (Ed.),
Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems,
2016.'
date_created: 2017-10-17T12:41:25Z
date_updated: 2022-01-06T06:53:01Z
ddc:
- '040'
department:
- _id: '77'
editor:
- first_name: Troubitsyna E
full_name: Ishikawa F, Romanovsky A, Troubitsyna E
last_name: Ishikawa F, Romanovsky A
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:40:27Z
date_updated: 2018-03-21T12:40:27Z
file_id: '1539'
file_name: 170-main_04.pdf
file_size: 285299
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:40:27Z
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
publication: Workshop on Formal and Model-Driven Techniques for Developing Trustworthy
Systems
related_material:
link:
- relation: contains
url: https://pdfs.semanticscholar.org/58cd/94c8b2335d16aa2558f711cf81b3f7746696.pdf
series_title: School of Computing Science Technical Report Series
status: public
title: 'PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper)'
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '1190'
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
citation:
ama: Isenberg T. Induction-Based Verification of Timed Systems. Universität
Paderborn; 2016.
apa: Isenberg, T. (2016). Induction-based Verification of Timed Systems.
Universität Paderborn.
bibtex: '@book{Isenberg_2016, title={Induction-based Verification of Timed Systems},
publisher={Universität Paderborn}, author={Isenberg, Tobias}, year={2016} }'
chicago: Isenberg, Tobias. Induction-Based Verification of Timed Systems.
Universität Paderborn, 2016.
ieee: T. Isenberg, Induction-based Verification of Timed Systems. Universität
Paderborn, 2016.
mla: Isenberg, Tobias. Induction-Based Verification of Timed Systems. Universität
Paderborn, 2016.
short: T. Isenberg, Induction-Based Verification of Timed Systems, Universität Paderborn,
2016.
date_created: 2018-03-05T10:11:48Z
date_updated: 2022-01-06T06:51:12Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-08T06:23:21Z
date_updated: 2018-03-08T09:14:11Z
file_id: '1195'
file_name: 1190-thesis_abgabeversion.pdf
file_size: 3354335
relation: main_file
file_date_updated: 2018-03-08T09:14:11Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subproject 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: Induction-based Verification of Timed Systems
type: dissertation
user_id: '477'
year: '2016'
...
---
_id: '158'
abstract:
- lang: eng
text: 'While requirements focus on how the user interacts with the system, user
stories concentrate on the purpose of software features. But in practice, functional
requirements are also described in user stories. For this reason, requirements
clarification is needed, especially when they are written in natural language
and do not stick to any templates (e.g., "as an X, I want Y so that Z ..."). However,
there is a lot of implicit knowledge that is not expressed in words. As a result,
natural language requirements descriptions may suffer from incompleteness. Existing
approaches try to formalize natural language or focus only on entirely missing
and not on deficient requirements. In this paper, we therefore present an approach
to detect knowledge gaps in user-generated software requirements for interactive
requirement clarification: We provide tailored suggestions to the users in order
to get more precise descriptions. For this purpose, we identify not fully instantiated
predicate argument structures in requirements written in natural language and
use context information to realize what was meant by the user.'
author:
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
citation:
ama: 'Bäumer FS, Geierhos M. Running out of Words: How Similar User Stories Can
Help to Elaborate Individual Natural Language Requirement Descriptions. In: Dregvaite
G, Damasevicius R, eds. Proceedings of the 22nd International Conference on
Information and Software Technologies (ICIST). Vol 639. Communications in
Computer and Information Science. Cham, Switzerland: Springer; 2016:549-558. doi:10.1007/978-3-319-46254-7_44'
apa: 'Bäumer, F. S., & Geierhos, M. (2016). Running out of Words: How Similar
User Stories Can Help to Elaborate Individual Natural Language Requirement Descriptions.
In G. Dregvaite & R. Damasevicius (Eds.), Proceedings of the 22nd International
Conference on Information and Software Technologies (ICIST) (Vol. 639, pp.
549–558). Cham, Switzerland: Springer. https://doi.org/10.1007/978-3-319-46254-7_44'
bibtex: '@inproceedings{Bäumer_Geierhos_2016, place={Cham, Switzerland}, series={Communications
in Computer and Information Science}, title={Running out of Words: How Similar
User Stories Can Help to Elaborate Individual Natural Language Requirement Descriptions},
volume={639}, DOI={10.1007/978-3-319-46254-7_44},
booktitle={Proceedings of the 22nd International Conference on Information and
Software Technologies (ICIST)}, publisher={Springer}, author={Bäumer, Frederik
Simon and Geierhos, Michaela}, editor={Dregvaite, Giedre and Damasevicius, Robertas
Editors}, year={2016}, pages={549–558}, collection={Communications in Computer
and Information Science} }'
chicago: 'Bäumer, Frederik Simon, and Michaela Geierhos. “Running out of Words:
How Similar User Stories Can Help to Elaborate Individual Natural Language Requirement
Descriptions.” In Proceedings of the 22nd International Conference on Information
and Software Technologies (ICIST), edited by Giedre Dregvaite and Robertas Damasevicius,
639:549–58. Communications in Computer and Information Science. Cham, Switzerland:
Springer, 2016. https://doi.org/10.1007/978-3-319-46254-7_44.'
ieee: 'F. S. Bäumer and M. Geierhos, “Running out of Words: How Similar User Stories
Can Help to Elaborate Individual Natural Language Requirement Descriptions,” in
Proceedings of the 22nd International Conference on Information and Software
Technologies (ICIST), Druskininkai, Lithuania, 2016, vol. 639, pp. 549–558.'
mla: 'Bäumer, Frederik Simon, and Michaela Geierhos. “Running out of Words: How
Similar User Stories Can Help to Elaborate Individual Natural Language Requirement
Descriptions.” Proceedings of the 22nd International Conference on Information
and Software Technologies (ICIST), edited by Giedre Dregvaite and Robertas Damasevicius,
vol. 639, Springer, 2016, pp. 549–58, doi:10.1007/978-3-319-46254-7_44.'
short: 'F.S. Bäumer, M. Geierhos, in: G. Dregvaite, R. Damasevicius (Eds.), Proceedings
of the 22nd International Conference on Information and Software Technologies
(ICIST), Springer, Cham, Switzerland, 2016, pp. 549–558.'
conference:
end_date: 2016-10-15
location: Druskininkai, Lithuania
name: 22nd International Conference on Information and Software Technologies (ICIST
2016)
start_date: 2016-10-13
date_created: 2017-10-17T12:41:22Z
date_updated: 2022-01-06T06:52:34Z
ddc:
- '040'
department:
- _id: '36'
- _id: '1'
- _id: '579'
doi: 10.1007/978-3-319-46254-7_44
editor:
- first_name: 'Giedre '
full_name: 'Dregvaite, Giedre '
last_name: Dregvaite
- first_name: 'Robertas '
full_name: 'Damasevicius, Robertas '
last_name: Damasevicius
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:49:38Z
date_updated: 2018-03-21T12:49:38Z
file_id: '1548'
file_name: 158-06390044.pdf
file_size: 860232
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:49:38Z
has_accepted_license: '1'
intvolume: ' 639'
keyword:
- Natural language requirements clarification
- Syntactically incomplete requirements
- Compensatory user stories
language:
- iso: eng
page: 549-558
place: Cham, Switzerland
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: Proceedings of the 22nd International Conference on Information and Software
Technologies (ICIST)
publication_identifier:
eisbn:
- 978-3-319-46254-7
isbn:
- 978-3-319-46253-0
publication_status: published
publisher: Springer
quality_controlled: '1'
series_title: Communications in Computer and Information Science
status: public
title: 'Running out of Words: How Similar User Stories Can Help to Elaborate Individual
Natural Language Requirement Descriptions'
type: conference
user_id: '477'
volume: 639
year: '2016'
...
---
_id: '150'
author:
- first_name: Svetlana
full_name: Arifulina, Svetlana
last_name: Arifulina
citation:
ama: Arifulina S. Solving Heterogeneity for a Successful Service Market.
Universität Paderborn; 2016. doi:10.17619/UNIPB/1-13
apa: Arifulina, S. (2016). Solving Heterogeneity for a Successful Service Market.
Universität Paderborn. https://doi.org/10.17619/UNIPB/1-13
bibtex: '@book{Arifulina_2016, title={Solving Heterogeneity for a Successful Service
Market}, DOI={10.17619/UNIPB/1-13},
publisher={Universität Paderborn}, author={Arifulina, Svetlana}, year={2016} }'
chicago: Arifulina, Svetlana. Solving Heterogeneity for a Successful Service
Market. Universität Paderborn, 2016. https://doi.org/10.17619/UNIPB/1-13.
ieee: S. Arifulina, Solving Heterogeneity for a Successful Service Market.
Universität Paderborn, 2016.
mla: Arifulina, Svetlana. Solving Heterogeneity for a Successful Service Market.
Universität Paderborn, 2016, doi:10.17619/UNIPB/1-13.
short: S. Arifulina, Solving Heterogeneity for a Successful Service Market, Universität
Paderborn, 2016.
date_created: 2017-10-17T12:41:21Z
date_updated: 2022-01-06T06:52:13Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.17619/UNIPB/1-13
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:54:05Z
date_updated: 2018-03-21T12:54:05Z
file_id: '1552'
file_name: 150-Dissertation_Svetlana_Arifulina.pdf
file_size: 6340482
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:54:05Z
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: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
title: Solving Heterogeneity for a Successful Service Market
type: dissertation
user_id: '477'
year: '2016'
...
---
_id: '160'
abstract:
- lang: eng
text: 'A task at the beginning of the software development process is the creation
of a requirements specification. The requirements specification is usually created
by a software engineering expert. We try to substitute this expert by a domain
expert (the user) and formulate the problem of creating requirements specifications
as a search-based software engineering problem. The domain expert provides only
examples of event sequences that describe the behavior of the required software
program. These examples are represented by simple sequence diagrams and are divided
into two subsets: positive examples of required program behavior and negative
examples of prohibited program behavior. The task is then to synthesize a generalized
requirements specification that usefully describes the required software. We approach
this problem by applying a genetic algorithm and evolve deterministic finite automata
(DFAs). These DFAs take the sequence diagrams as input that should be either accepted
(positive example) or rejected (negative example). The problem is neither to find
the minimal nor the most general automaton. Instead, the user should be provided
with several appropriate automata from which the user can select, or which help
the user to refine the examples given initially. We present the context of our
research ("On-The-Fly Computing"), present our approach, report results indicating
its feasibility, and conclude with a discussion.'
author:
- first_name: Lorijn
full_name: van Rooijen, Lorijn
id: '58843'
last_name: van Rooijen
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: 'van Rooijen L, Hamann H. Requirements Specification-by-Example Using a Multi-Objective
Evolutionary Algorithm. In: Proceedings of 24th IEEE International Requirements
Engineering Conference (RE 2016). ; 2016:3--9. doi:10.1109/REW.2016.015'
apa: van Rooijen, L., & Hamann, H. (2016). Requirements Specification-by-Example
Using a Multi-Objective Evolutionary Algorithm. In Proceedings of 24th IEEE
International Requirements Engineering Conference (RE 2016) (pp. 3--9). https://doi.org/10.1109/REW.2016.015
bibtex: '@inproceedings{van Rooijen_Hamann_2016, title={Requirements Specification-by-Example
Using a Multi-Objective Evolutionary Algorithm}, DOI={10.1109/REW.2016.015},
booktitle={Proceedings of 24th IEEE International Requirements Engineering Conference
(RE 2016)}, author={van Rooijen, Lorijn and Hamann, Heiko}, year={2016}, pages={3--9}
}'
chicago: Rooijen, Lorijn van, and Heiko Hamann. “Requirements Specification-by-Example
Using a Multi-Objective Evolutionary Algorithm.” In Proceedings of 24th IEEE
International Requirements Engineering Conference (RE 2016), 3--9, 2016. https://doi.org/10.1109/REW.2016.015.
ieee: L. van Rooijen and H. Hamann, “Requirements Specification-by-Example Using
a Multi-Objective Evolutionary Algorithm,” in Proceedings of 24th IEEE International
Requirements Engineering Conference (RE 2016), 2016, pp. 3--9.
mla: van Rooijen, Lorijn, and Heiko Hamann. “Requirements Specification-by-Example
Using a Multi-Objective Evolutionary Algorithm.” Proceedings of 24th IEEE International
Requirements Engineering Conference (RE 2016), 2016, pp. 3--9, doi:10.1109/REW.2016.015.
short: 'L. van Rooijen, H. Hamann, in: Proceedings of 24th IEEE International Requirements
Engineering Conference (RE 2016), 2016, pp. 3--9.'
date_created: 2017-10-17T12:41:23Z
date_updated: 2022-01-06T06:52:42Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.1109/REW.2016.015
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:47:21Z
date_updated: 2018-03-21T12:47:21Z
file_id: '1546'
file_name: 160-07815598.pdf
file_size: 419026
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:47:21Z
has_accepted_license: '1'
language:
- iso: eng
page: 3--9
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of 24th IEEE International Requirements Engineering Conference
(RE 2016)
status: public
title: Requirements Specification-by-Example Using a Multi-Objective Evolutionary
Algorithm
type: conference
user_id: '477'
year: '2016'
...
---
_id: '162'
author:
- first_name: Guangli
full_name: Zhang, Guangli
last_name: Zhang
citation:
ama: 'Zhang G. Program Slicing: A Way of Separating WHILE Programs into Precise
and Approximate Portions. Universität Paderborn; 2016.'
apa: 'Zhang, G. (2016). Program Slicing: A Way of Separating WHILE Programs into
Precise and Approximate Portions. Universität Paderborn.'
bibtex: '@book{Zhang_2016, title={Program Slicing: A Way of Separating WHILE Programs
into Precise and Approximate Portions}, publisher={Universität Paderborn}, author={Zhang,
Guangli}, year={2016} }'
chicago: 'Zhang, Guangli. Program Slicing: A Way of Separating WHILE Programs
into Precise and Approximate Portions. Universität Paderborn, 2016.'
ieee: 'G. Zhang, Program Slicing: A Way of Separating WHILE Programs into Precise
and Approximate Portions. Universität Paderborn, 2016.'
mla: 'Zhang, Guangli. Program Slicing: A Way of Separating WHILE Programs into
Precise and Approximate Portions. Universität Paderborn, 2016.'
short: 'G. Zhang, Program Slicing: A Way of Separating WHILE Programs into Precise
and Approximate Portions, Universität Paderborn, 2016.'
date_created: 2017-10-17T12:41:23Z
date_updated: 2022-01-06T06:52:45Z
department:
- _id: '77'
language:
- iso: eng
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
last_name: Wehrheim
title: 'Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate
Portions'
type: mastersthesis
user_id: '15504'
year: '2016'
...
---
_id: '164'
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
citation:
ama: Czech M. Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data. Universität Paderborn; 2016.
apa: Czech, M. (2016). Predicting Rankings of Software Verification Tools Using
Kernels for Structured Data. Universität Paderborn.
bibtex: '@book{Czech_2016, title={Predicting Rankings of Software Verification Tools
Using Kernels for Structured Data}, publisher={Universität Paderborn}, author={Czech,
Mike}, year={2016} }'
chicago: Czech, Mike. Predicting Rankings of Software Verification Tools Using
Kernels for Structured Data. Universität Paderborn, 2016.
ieee: M. Czech, Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data. Universität Paderborn, 2016.
mla: Czech, Mike. Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data. Universität Paderborn, 2016.
short: M. Czech, Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:24Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '77'
language:
- iso: eng
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
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: Predicting Rankings of Software Verification Tools Using Kernels for Structured
Data
type: mastersthesis
user_id: '15504'
year: '2016'
...
---
_id: '140'
author:
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
citation:
ama: Jungmann A. Towards On-The-Fly Image Processing. Universität Paderborn;
2016.
apa: Jungmann, A. (2016). Towards On-The-Fly Image Processing. Universität
Paderborn.
bibtex: '@book{Jungmann_2016, title={Towards On-The-Fly Image Processing}, publisher={Universität
Paderborn}, author={Jungmann, Alexander}, year={2016} }'
chicago: Jungmann, Alexander. Towards On-The-Fly Image Processing. Universität
Paderborn, 2016.
ieee: A. Jungmann, Towards On-The-Fly Image Processing. Universität Paderborn,
2016.
mla: Jungmann, Alexander. Towards On-The-Fly Image Processing. Universität
Paderborn, 2016.
short: A. Jungmann, Towards On-The-Fly Image Processing, Universität Paderborn,
2016.
date_created: 2017-10-17T12:41:18Z
date_updated: 2022-01-06T06:51:49Z
ddc:
- '040'
department:
- _id: '70'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:00:24Z
date_updated: 2018-03-21T13:00:24Z
file_id: '1559'
file_name: 140-Dissertation-Alexander_Jungmann.pdf
file_size: 8006614
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:00:24Z
has_accepted_license: '1'
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
supervisor:
- first_name: Franz
full_name: Rammig, Franz
last_name: Rammig
title: Towards On-The-Fly Image Processing
type: dissertation
user_id: '477'
year: '2016'
...
---
_id: '141'
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
citation:
ama: Mohr F. Towards Automated Service Composition Under Quality Constraints.
Universität Paderborn; 2016. doi:10.17619/UNIPB/1-171
apa: Mohr, F. (2016). Towards Automated Service Composition Under Quality Constraints.
Universität Paderborn. https://doi.org/10.17619/UNIPB/1-171
bibtex: '@book{Mohr_2016, title={Towards Automated Service Composition Under Quality
Constraints}, DOI={10.17619/UNIPB/1-171},
publisher={Universität Paderborn}, author={Mohr, Felix}, year={2016} }'
chicago: Mohr, Felix. Towards Automated Service Composition Under Quality Constraints.
Universität Paderborn, 2016. https://doi.org/10.17619/UNIPB/1-171.
ieee: F. Mohr, Towards Automated Service Composition Under Quality Constraints.
Universität Paderborn, 2016.
mla: Mohr, Felix. Towards Automated Service Composition Under Quality Constraints.
Universität Paderborn, 2016, doi:10.17619/UNIPB/1-171.
short: F. Mohr, Towards Automated Service Composition Under Quality Constraints,
Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:19Z
date_updated: 2022-01-06T06:51:55Z
department:
- _id: '355'
doi: 10.17619/UNIPB/1-171
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
supervisor:
- first_name: Hans
full_name: Kleine Büning, Hans
last_name: Kleine Büning
title: Towards Automated Service Composition Under Quality Constraints
type: dissertation
user_id: '477'
year: '2016'
...
---
_id: '132'
abstract:
- lang: eng
text: Runtime reconfiguration can be used to replace hardware modules in the field
and even to continuously improve them during operation. Runtime reconfiguration
poses new challenges for validation, since the required properties of newly arriving
modules may be difficult to check fast enough to sustain the intended system dynamics.
In this paper we present a method for just-in-time verification of the worst-case
completion time of a reconfigurable hardware module. We assume so-called run-to-completion
modules that exhibit start and done signals indicating the start and end of execution,
respectively. We present a formal verification approach that exploits the concept
of proof-carrying hardware. The approach tasks the creator of a hardware module
with constructing a proof of the worst-case completion time, which can then easily
be checked by the user of the module, just prior to reconfiguration. After explaining
the verification approach and a corresponding tool flow, we present results from
two case studies, a short term synthesis filter and a multihead weigher. The resultsclearly
show that cost of verifying the completion time of the module is paid by the creator
instead of the user of the module.
author:
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Wiersema T, Platzner M. Verifying Worst-Case Completion Times for Reconfigurable
Hardware Modules using Proof-Carrying Hardware. In: Proceedings of the 11th
International Symposium on Reconfigurable Communication-Centric Systems-on-Chip
(ReCoSoC 2016). ; 2016:1--8. doi:10.1109/ReCoSoC.2016.7533910'
apa: Wiersema, T., & Platzner, M. (2016). Verifying Worst-Case Completion Times
for Reconfigurable Hardware Modules using Proof-Carrying Hardware. In Proceedings
of the 11th International Symposium on Reconfigurable Communication-centric Systems-on-Chip
(ReCoSoC 2016) (pp. 1--8). https://doi.org/10.1109/ReCoSoC.2016.7533910
bibtex: '@inproceedings{Wiersema_Platzner_2016, title={Verifying Worst-Case Completion
Times for Reconfigurable Hardware Modules using Proof-Carrying Hardware}, DOI={10.1109/ReCoSoC.2016.7533910},
booktitle={Proceedings of the 11th International Symposium on Reconfigurable Communication-centric
Systems-on-Chip (ReCoSoC 2016)}, author={Wiersema, Tobias and Platzner, Marco},
year={2016}, pages={1--8} }'
chicago: Wiersema, Tobias, and Marco Platzner. “Verifying Worst-Case Completion
Times for Reconfigurable Hardware Modules Using Proof-Carrying Hardware.” In Proceedings
of the 11th International Symposium on Reconfigurable Communication-Centric Systems-on-Chip
(ReCoSoC 2016), 1--8, 2016. https://doi.org/10.1109/ReCoSoC.2016.7533910.
ieee: T. Wiersema and M. Platzner, “Verifying Worst-Case Completion Times for Reconfigurable
Hardware Modules using Proof-Carrying Hardware,” in Proceedings of the 11th
International Symposium on Reconfigurable Communication-centric Systems-on-Chip
(ReCoSoC 2016), 2016, pp. 1--8.
mla: Wiersema, Tobias, and Marco Platzner. “Verifying Worst-Case Completion Times
for Reconfigurable Hardware Modules Using Proof-Carrying Hardware.” Proceedings
of the 11th International Symposium on Reconfigurable Communication-Centric Systems-on-Chip
(ReCoSoC 2016), 2016, pp. 1--8, doi:10.1109/ReCoSoC.2016.7533910.
short: 'T. Wiersema, M. Platzner, in: Proceedings of the 11th International Symposium
on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC 2016), 2016,
pp. 1--8.'
date_created: 2017-10-17T12:41:17Z
date_updated: 2022-01-06T06:51:30Z
ddc:
- '040'
department:
- _id: '78'
doi: 10.1109/ReCoSoC.2016.7533910
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:02:30Z
date_updated: 2018-03-21T13:02:30Z
file_id: '1562'
file_name: 132-07533910.pdf
file_size: 911171
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:02:30Z
has_accepted_license: '1'
language:
- iso: eng
page: 1--8
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 Symposium on Reconfigurable Communication-centric
Systems-on-Chip (ReCoSoC 2016)
status: public
title: Verifying Worst-Case Completion Times for Reconfigurable Hardware Modules using
Proof-Carrying Hardware
type: conference
user_id: '477'
year: '2016'
...
---
_id: '133'
abstract:
- lang: eng
text: .
author:
- first_name: Markus
full_name: Dewender, Markus
last_name: Dewender
citation:
ama: Dewender M. Verifikation von Service Kompositionen mit Spin. Universität
Paderborn; 2016.
apa: Dewender, M. (2016). Verifikation von Service Kompositionen mit Spin.
Universität Paderborn.
bibtex: '@book{Dewender_2016, title={Verifikation von Service Kompositionen mit
Spin}, publisher={Universität Paderborn}, author={Dewender, Markus}, year={2016}
}'
chicago: Dewender, Markus. Verifikation von Service Kompositionen mit Spin.
Universität Paderborn, 2016.
ieee: M. Dewender, Verifikation von Service Kompositionen mit Spin. Universität
Paderborn, 2016.
mla: Dewender, Markus. Verifikation von Service Kompositionen mit Spin. Universität
Paderborn, 2016.
short: M. Dewender, Verifikation von Service Kompositionen mit Spin, Universität
Paderborn, 2016.
date_created: 2017-10-17T12:41:17Z
date_updated: 2022-01-06T06:51:32Z
department:
- _id: '77'
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
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: Verifikation von Service Kompositionen mit Spin
type: bachelorsthesis
user_id: '15504'
year: '2016'
...
---
_id: '134'
abstract:
- lang: eng
text: .
author:
- first_name: Philipp
full_name: Heinisch, Philipp
last_name: Heinisch
citation:
ama: Heinisch P. Verifikation von Service Kompositionen mit Prolog. Universität
Paderborn; 2016.
apa: Heinisch, P. (2016). Verifikation von Service Kompositionen mit Prolog.
Universität Paderborn.
bibtex: '@book{Heinisch_2016, title={Verifikation von Service Kompositionen mit
Prolog}, publisher={Universität Paderborn}, author={Heinisch, Philipp}, year={2016}
}'
chicago: Heinisch, Philipp. Verifikation von Service Kompositionen mit Prolog.
Universität Paderborn, 2016.
ieee: P. Heinisch, Verifikation von Service Kompositionen mit Prolog. Universität
Paderborn, 2016.
mla: Heinisch, Philipp. Verifikation von Service Kompositionen mit Prolog.
Universität Paderborn, 2016.
short: P. Heinisch, Verifikation von Service Kompositionen mit Prolog, Universität
Paderborn, 2016.
date_created: 2017-10-17T12:41:17Z
date_updated: 2022-01-06T06:51:34Z
department:
- _id: '77'
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
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: Verifikation von Service Kompositionen mit Prolog
type: bachelorsthesis
user_id: '15504'
year: '2016'
...
---
_id: '136'
author:
- first_name: Daniel
full_name: Vollmers, Daniel
last_name: Vollmers
citation:
ama: Vollmers D. Vergleich von Disambiguierungsansätzen bei Anforderungsbeschreibungen.
Universität Paderborn; 2016.
apa: Vollmers, D. (2016). Vergleich von Disambiguierungsansätzen bei Anforderungsbeschreibungen.
Universität Paderborn.
bibtex: '@book{Vollmers_2016, title={Vergleich von Disambiguierungsansätzen bei
Anforderungsbeschreibungen}, publisher={Universität Paderborn}, author={Vollmers,
Daniel}, year={2016} }'
chicago: Vollmers, Daniel. Vergleich von Disambiguierungsansätzen bei Anforderungsbeschreibungen.
Universität Paderborn, 2016.
ieee: D. Vollmers, Vergleich von Disambiguierungsansätzen bei Anforderungsbeschreibungen.
Universität Paderborn, 2016.
mla: Vollmers, Daniel. Vergleich von Disambiguierungsansätzen bei Anforderungsbeschreibungen.
Universität Paderborn, 2016.
short: D. Vollmers, Vergleich von Disambiguierungsansätzen bei Anforderungsbeschreibungen,
Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:18Z
date_updated: 2022-01-06T06:51:40Z
language:
- iso: ger
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
title: Vergleich von Disambiguierungsansätzen bei Anforderungsbeschreibungen
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '250'
abstract:
- lang: eng
text: Before execution, users should formally validate the correctness of software
received from untrusted providers. To accelerate this validation, in the proof
carrying code (PCC) paradigm the provider delivers the software together with
a certificate, a formal proof of the software’s correctness. Thus, the user only
checks if the attached certificate shows correctness of the delivered software.Recently,
we introduced configurable program certification, a generic, PCC based framework
supporting various software analyses and safety properties. Evaluation of our
framework revealed that validation suffers from certificate reading. In this paper,
we present two orthogonal approaches which improve certificate validation, both
reducing the impact of certificate reading. The first approach reduces the certificate
size, storing information only if it cannot easily be recomputed. The second approach
partitions the certificate into independently checkable parts. The trick is to
read parts of the certificate while already checking read parts. Our experiments
show that validation highly benefits from our improvements.
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
citation:
ama: 'Jakobs M-C. Speed Up Configurable Certificate Validation by Certificate Reduction
and Partitioning. In: Proceedings of the 13th International Conference on Software
Engineering and Formal Methods (SEFM). LNCS. ; 2015:159--174. doi:10.1007/978-3-319-22969-0_12'
apa: Jakobs, M.-C. (2015). Speed Up Configurable Certificate Validation by Certificate
Reduction and Partitioning. In Proceedings of the 13th International Conference
on Software Engineering and Formal Methods (SEFM) (pp. 159--174). https://doi.org/10.1007/978-3-319-22969-0_12
bibtex: '@inproceedings{Jakobs_2015, series={LNCS}, title={Speed Up Configurable
Certificate Validation by Certificate Reduction and Partitioning}, DOI={10.1007/978-3-319-22969-0_12},
booktitle={Proceedings of the 13th International Conference on Software Engineering
and Formal Methods (SEFM)}, author={Jakobs, Marie-Christine}, year={2015}, pages={159--174},
collection={LNCS} }'
chicago: Jakobs, Marie-Christine. “Speed Up Configurable Certificate Validation
by Certificate Reduction and Partitioning.” In Proceedings of the 13th International
Conference on Software Engineering and Formal Methods (SEFM), 159--174. LNCS,
2015. https://doi.org/10.1007/978-3-319-22969-0_12.
ieee: M.-C. Jakobs, “Speed Up Configurable Certificate Validation by Certificate
Reduction and Partitioning,” in Proceedings of the 13th International Conference
on Software Engineering and Formal Methods (SEFM), 2015, pp. 159--174.
mla: Jakobs, Marie-Christine. “Speed Up Configurable Certificate Validation by Certificate
Reduction and Partitioning.” Proceedings of the 13th International Conference
on Software Engineering and Formal Methods (SEFM), 2015, pp. 159--174, doi:10.1007/978-3-319-22969-0_12.
short: 'M.-C. Jakobs, in: Proceedings of the 13th International Conference on Software
Engineering and Formal Methods (SEFM), 2015, pp. 159--174.'
date_created: 2017-10-17T12:41:40Z
date_updated: 2022-01-06T06:56:43Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-22969-0_12
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:45:15Z
date_updated: 2018-03-21T09:45:15Z
file_id: '1489'
file_name: 250-Jakobs2015.pdf
file_size: 724308
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:45:15Z
has_accepted_license: '1'
language:
- iso: eng
page: 159--174
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 13th International Conference on Software Engineering
and Formal Methods (SEFM)
series_title: LNCS
status: public
title: Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning
type: conference
user_id: '477'
year: '2015'
...
---
_id: '280'
abstract:
- lang: eng
text: The Collaborative Research Centre "On-The-Fly Computing" works on foundations
and principles for the vision of the Future Internet. It proposes the paradigm
of On-The-Fly Computing, which tackles emerging worldwide service markets. In
these markets, service providers trade software, platform, and infrastructure
as a service. Service requesters state requirements on services. To satisfy these
requirements, the new role of brokers, who are (human) actors building service
compositions on the fly, is introduced. Brokers have to specify service compositions
formally and comprehensively using a domain-specific language (DSL), and to use
service matching for the discovery of the constituent services available in the
market. The broker's choice of the DSL and matching approaches influences her
success of building compositions as distinctive properties of different service
markets play a significant role. In this paper, we propose a new approach of engineering
a situation-specific DSL by customizing a comprehensive, modular DSL and its matching
for given service market properties. This enables the broker to create market-specific
composition specifications and to perform market-specific service matching. As
a result, the broker builds service compositions satisfying the requester's requirements
more accurately. We evaluated the presented concepts using case studies in service
markets for tourism and university management.
author:
- first_name: Svetlana
full_name: Arifulina, Svetlana
last_name: Arifulina
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
citation:
ama: 'Arifulina S, Platenius MC, Mohr F, Engels G, Schäfer W. Market-Specific Service
Compositions: Specification and Matching. In: Proceedings of the IEEE 11th
World Congress on Services (SERVICES), Visionary Track: Service Composition for
the Future Internet. ; 2015:333--340. doi:10.1109/SERVICES.2015.58'
apa: 'Arifulina, S., Platenius, M. C., Mohr, F., Engels, G., & Schäfer, W. (2015).
Market-Specific Service Compositions: Specification and Matching. In Proceedings
of the IEEE 11th World Congress on Services (SERVICES), Visionary Track: Service
Composition for the Future Internet (pp. 333--340). https://doi.org/10.1109/SERVICES.2015.58'
bibtex: '@inproceedings{Arifulina_Platenius_Mohr_Engels_Schäfer_2015, title={Market-Specific
Service Compositions: Specification and Matching}, DOI={10.1109/SERVICES.2015.58},
booktitle={Proceedings of the IEEE 11th World Congress on Services (SERVICES),
Visionary Track: Service Composition for the Future Internet}, author={Arifulina,
Svetlana and Platenius, Marie Christin and Mohr, Felix and Engels, Gregor and
Schäfer, Wilhelm}, year={2015}, pages={333--340} }'
chicago: 'Arifulina, Svetlana, Marie Christin Platenius, Felix Mohr, Gregor Engels,
and Wilhelm Schäfer. “Market-Specific Service Compositions: Specification and
Matching.” In Proceedings of the IEEE 11th World Congress on Services (SERVICES),
Visionary Track: Service Composition for the Future Internet, 333--340, 2015.
https://doi.org/10.1109/SERVICES.2015.58.'
ieee: 'S. Arifulina, M. C. Platenius, F. Mohr, G. Engels, and W. Schäfer, “Market-Specific
Service Compositions: Specification and Matching,” in Proceedings of the IEEE
11th World Congress on Services (SERVICES), Visionary Track: Service Composition
for the Future Internet, 2015, pp. 333--340.'
mla: 'Arifulina, Svetlana, et al. “Market-Specific Service Compositions: Specification
and Matching.” Proceedings of the IEEE 11th World Congress on Services (SERVICES),
Visionary Track: Service Composition for the Future Internet, 2015, pp. 333--340,
doi:10.1109/SERVICES.2015.58.'
short: 'S. Arifulina, M.C. Platenius, F. Mohr, G. Engels, W. Schäfer, in: Proceedings
of the IEEE 11th World Congress on Services (SERVICES), Visionary Track: Service
Composition for the Future Internet, 2015, pp. 333--340.'
date_created: 2017-10-17T12:41:46Z
date_updated: 2022-01-06T06:57:49Z
ddc:
- '040'
department:
- _id: '66'
- _id: '76'
- _id: '355'
doi: 10.1109/SERVICES.2015.58
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:26:04Z
date_updated: 2018-03-21T09:26:04Z
file_id: '1470'
file_name: 280-07196546.pdf
file_size: 234260
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:26:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 333--340
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '3'
name: SFB 901 - Project Area B
publication: 'Proceedings of the IEEE 11th World Congress on Services (SERVICES),
Visionary Track: Service Composition for the Future Internet'
status: public
title: 'Market-Specific Service Compositions: Specification and Matching'
type: conference
user_id: '477'
year: '2015'
...
---
_id: '283'
abstract:
- lang: eng
text: Today, software verification is an established analysis method which can provide
high guarantees for software safety. However, the resources (time and/or memory)
for an exhaustive verification are not always available, and analysis then has
to resort to other techniques, like testing. Most often, the already achieved
partial verification results arediscarded in this case, and testing has to start
from scratch.In this paper, we propose a method for combining verification and
testing in which testing only needs to check the residual fraction of an uncompleted
verification. To this end, the partial results of a verification run are used
to construct a residual program (and residual assertions to be checked on it).
The residual program can afterwards be fed into standardtesting tools. The proposed
technique is sound modulo the soundness of the testing procedure. Experimental
results show that this combinedusage of verification and testing can significantly
reduce the effort for the subsequent testing.
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Czech M, Jakobs M-C, Wehrheim H. Just test what you cannot verify! In: Egyed
A, Schaefer I, eds. Fundamental Approaches to Software Engineering. Lecture
Notes in Computer Science. ; 2015:100-114. doi:10.1007/978-3-662-46675-9_7'
apa: Czech, M., Jakobs, M.-C., & Wehrheim, H. (2015). Just test what you cannot
verify! In A. Egyed & I. Schaefer (Eds.), Fundamental Approaches to Software
Engineering (pp. 100–114). https://doi.org/10.1007/978-3-662-46675-9_7
bibtex: '@inproceedings{Czech_Jakobs_Wehrheim_2015, series={Lecture Notes in Computer
Science}, title={Just test what you cannot verify!}, DOI={10.1007/978-3-662-46675-9_7},
booktitle={Fundamental Approaches to Software Engineering}, author={Czech, Mike
and Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Egyed, Alexander and
Schaefer, InaEditors}, year={2015}, pages={100–114}, collection={Lecture Notes
in Computer Science} }'
chicago: Czech, Mike, Marie-Christine Jakobs, and Heike Wehrheim. “Just Test What
You Cannot Verify!” In Fundamental Approaches to Software Engineering,
edited by Alexander Egyed and Ina Schaefer, 100–114. Lecture Notes in Computer
Science, 2015. https://doi.org/10.1007/978-3-662-46675-9_7.
ieee: M. Czech, M.-C. Jakobs, and H. Wehrheim, “Just test what you cannot verify!,”
in Fundamental Approaches to Software Engineering, 2015, pp. 100–114.
mla: Czech, Mike, et al. “Just Test What You Cannot Verify!” Fundamental Approaches
to Software Engineering, edited by Alexander Egyed and Ina Schaefer, 2015,
pp. 100–14, doi:10.1007/978-3-662-46675-9_7.
short: 'M. Czech, M.-C. Jakobs, H. Wehrheim, in: A. Egyed, I. Schaefer (Eds.), Fundamental
Approaches to Software Engineering, 2015, pp. 100–114.'
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:00Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-662-46675-9_7
editor:
- first_name: Alexander
full_name: Egyed, Alexander
last_name: Egyed
- first_name: Ina
full_name: Schaefer, Ina
last_name: Schaefer
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:25:36Z
date_updated: 2018-03-21T09:25:36Z
file_id: '1469'
file_name: 283-FASEsubmission38_01.pdf
file_size: 391253
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:25:36Z
has_accepted_license: '1'
language:
- iso: eng
page: 100-114
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Fundamental Approaches to Software Engineering
series_title: Lecture Notes in Computer Science
status: public
title: Just test what you cannot verify!
type: conference
user_id: '477'
year: '2015'
...
---
_id: '285'
abstract:
- lang: eng
text: We propose an incremental workflow for the verification of parameterized systems
modeled as symmetric networks of timed automata. Starting with a small number
of timed automata in the network, a safety property is verified using IC3, a state-of-the-art
algorithm based on induction.The result of the verification, an inductive strengthening,
is reused proposing a candidate inductive strengthening for a larger network.If
the candidate is valid, our main theorem states that the safety property holds
for all sizes of the network of timed automata. Otherwise the number of automata
is increased and the next iteration is started with a new run of IC3.We propose
and thoroughly examine optimizations to our workflow, e.g. Feedback mechanisms
to speed up the run of IC3.
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
citation:
ama: 'Isenberg T. Incremental Inductive Verification of Parameterized Timed Systems.
In: Proceedings of the 15th International Conference on Application of Concurrency
to System Design (ACSD). ; 2015:1-9. doi:10.1109/ACSD.2015.13'
apa: Isenberg, T. (2015). Incremental Inductive Verification of Parameterized Timed
Systems. In Proceedings of the 15th International Conference on Application
of Concurrency to System Design (ACSD) (pp. 1–9). https://doi.org/10.1109/ACSD.2015.13
bibtex: '@inproceedings{Isenberg_2015, title={Incremental Inductive Verification
of Parameterized Timed Systems}, DOI={10.1109/ACSD.2015.13},
booktitle={Proceedings of the 15th International Conference on Application of
Concurrency to System Design (ACSD)}, author={Isenberg, Tobias}, year={2015},
pages={1–9} }'
chicago: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized
Timed Systems.” In Proceedings of the 15th International Conference on Application
of Concurrency to System Design (ACSD), 1–9, 2015. https://doi.org/10.1109/ACSD.2015.13.
ieee: T. Isenberg, “Incremental Inductive Verification of Parameterized Timed Systems,”
in Proceedings of the 15th International Conference on Application of Concurrency
to System Design (ACSD), 2015, pp. 1–9.
mla: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed
Systems.” Proceedings of the 15th International Conference on Application of
Concurrency to System Design (ACSD), 2015, pp. 1–9, doi:10.1109/ACSD.2015.13.
short: 'T. Isenberg, in: Proceedings of the 15th International Conference on Application
of Concurrency to System Design (ACSD), 2015, pp. 1–9.'
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:07Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1109/ACSD.2015.13
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:23:45Z
date_updated: 2018-03-21T09:23:45Z
file_id: '1466'
file_name: 285-07352419.pdf
file_size: 479808
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:23:45Z
has_accepted_license: '1'
language:
- iso: eng
page: '1-9 '
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 15th International Conference on Application of Concurrency
to System Design (ACSD)
status: public
title: Incremental Inductive Verification of Parameterized Timed Systems
type: conference
user_id: '477'
year: '2015'
...