---
_id: '14885'
author:
- first_name: Martin
full_name: Potthast, Martin
last_name: Potthast
- first_name: Wei-Fan
full_name: Chen, Wei-Fan
id: '82920'
last_name: Chen
- first_name: Matthias
full_name: Hagen, Matthias
last_name: Hagen
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Potthast M, Chen W-F, Hagen M, Stein B. A Plan for Ancillary Copyright: Original
Snippets. In: Proceedings of the Second International Workshop on Recent Trends
in News Information Retrieval. ; 2018:3-5.'
apa: 'Potthast, M., Chen, W.-F., Hagen, M., & Stein, B. (2018). A Plan for Ancillary
Copyright: Original Snippets. Proceedings of the Second International Workshop
on Recent Trends in News Information Retrieval, 3–5.'
bibtex: '@inproceedings{Potthast_Chen_Hagen_Stein_2018, title={A Plan for Ancillary
Copyright: Original Snippets.}, booktitle={Proceedings of the Second International
Workshop on Recent Trends in News Information Retrieval}, author={Potthast, Martin
and Chen, Wei-Fan and Hagen, Matthias and Stein, Benno}, year={2018}, pages={3–5}
}'
chicago: 'Potthast, Martin, Wei-Fan Chen, Matthias Hagen, and Benno Stein. “A Plan
for Ancillary Copyright: Original Snippets.” In Proceedings of the Second International
Workshop on Recent Trends in News Information Retrieval, 3–5, 2018.'
ieee: 'M. Potthast, W.-F. Chen, M. Hagen, and B. Stein, “A Plan for Ancillary Copyright:
Original Snippets.,” in Proceedings of the Second International Workshop on
Recent Trends in News Information Retrieval, 2018, pp. 3–5.'
mla: 'Potthast, Martin, et al. “A Plan for Ancillary Copyright: Original Snippets.”
Proceedings of the Second International Workshop on Recent Trends in News Information
Retrieval, 2018, pp. 3–5.'
short: 'M. Potthast, W.-F. Chen, M. Hagen, B. Stein, in: Proceedings of the Second
International Workshop on Recent Trends in News Information Retrieval, 2018, pp.
3–5.'
date_created: 2019-11-11T12:32:01Z
date_updated: 2022-05-09T15:05:42Z
department:
- _id: '600'
language:
- iso: eng
main_file_link:
- url: https://webis.de/downloads/publications/papers/stein_2018b.pdf
page: 3-5
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '9'
name: 'SFB 901 - B1: SFB 901 - Subproject B1'
publication: Proceedings of the Second International Workshop on Recent Trends in
News Information Retrieval
status: public
title: 'A Plan for Ancillary Copyright: Original Snippets.'
type: conference
user_id: '82920'
year: '2018'
...
---
_id: '3325'
author:
- first_name: Vitalik
full_name: Melnikov, Vitalik
last_name: Melnikov
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Melnikov V, Hüllermeier E. Optimizing the Structure of Nested Dichotomies:
A Comparison of Two Heuristics. In: Proceedings. 27. Workshop Computational
Intelligence, Dortmund, 23. - 24. November 2017. KIT Scientific Publishing;
2017. doi:10.5445/KSP/1000074341'
apa: 'Melnikov, V., & Hüllermeier, E. (2017). Optimizing the Structure of Nested
Dichotomies: A Comparison of Two Heuristics. In Proceedings. 27. Workshop Computational
Intelligence, Dortmund, 23. - 24. November 2017. KIT Scientific Publishing.
https://doi.org/10.5445/KSP/1000074341'
bibtex: '@inproceedings{Melnikov_Hüllermeier_2017, title={Optimizing the Structure
of Nested Dichotomies: A Comparison of Two Heuristics}, DOI={10.5445/KSP/1000074341},
booktitle={Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23.
- 24. November 2017}, publisher={KIT Scientific Publishing}, author={Melnikov,
Vitalik and Hüllermeier, Eyke}, year={2017} }'
chicago: 'Melnikov, Vitalik, and Eyke Hüllermeier. “Optimizing the Structure of
Nested Dichotomies: A Comparison of Two Heuristics.” In Proceedings. 27. Workshop
Computational Intelligence, Dortmund, 23. - 24. November 2017. KIT Scientific
Publishing, 2017. https://doi.org/10.5445/KSP/1000074341.'
ieee: 'V. Melnikov and E. Hüllermeier, “Optimizing the Structure of Nested Dichotomies:
A Comparison of Two Heuristics,” in Proceedings. 27. Workshop Computational
Intelligence, Dortmund, 23. - 24. November 2017, 2017.'
mla: 'Melnikov, Vitalik, and Eyke Hüllermeier. “Optimizing the Structure of Nested
Dichotomies: A Comparison of Two Heuristics.” Proceedings. 27. Workshop Computational
Intelligence, Dortmund, 23. - 24. November 2017, KIT Scientific Publishing,
2017, doi:10.5445/KSP/1000074341.'
short: 'V. Melnikov, E. Hüllermeier, in: Proceedings. 27. Workshop Computational
Intelligence, Dortmund, 23. - 24. November 2017, KIT Scientific Publishing, 2017.'
date_created: 2018-06-25T08:14:49Z
date_updated: 2022-01-06T06:59:10Z
ddc:
- '000'
department:
- _id: '355'
doi: 10.5445/KSP/1000074341
file:
- access_level: closed
content_type: application/pdf
creator: melnikov
date_created: 2018-11-30T09:47:59Z
date_updated: 2018-11-30T09:47:59Z
file_id: '5987'
file_name: main.pdf
file_size: 1829552
relation: main_file
success: 1
file_date_updated: 2018-11-30T09:47:59Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publication: Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. -
24. November 2017
publisher: KIT Scientific Publishing
status: public
title: 'Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics'
type: conference
user_id: '15504'
year: '2017'
...
---
_id: '3512'
author:
- first_name: Paul
full_name: Börding, Paul
last_name: Börding
citation:
ama: Börding P. Testing Java Method Contracts. Universität Paderborn; 2017.
apa: Börding, P. (2017). Testing Java Method Contracts. Universität Paderborn.
bibtex: '@book{Börding_2017, title={Testing Java Method Contracts}, publisher={Universität
Paderborn}, author={Börding, Paul}, year={2017} }'
chicago: Börding, Paul. Testing Java Method Contracts. Universität Paderborn,
2017.
ieee: P. Börding, Testing Java Method Contracts. Universität Paderborn, 2017.
mla: Börding, Paul. Testing Java Method Contracts. Universität Paderborn,
2017.
short: P. Börding, Testing Java Method Contracts, Universität Paderborn, 2017.
date_created: 2018-07-09T09:32:41Z
date_updated: 2022-01-06T06:59:21Z
department:
- _id: '7'
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Testing Java Method Contracts
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '3580'
author:
- first_name: Tim
full_name: Hansmeier, Tim
id: '49992'
last_name: Hansmeier
orcid: 0000-0003-1377-3339
citation:
ama: Hansmeier T. An FPGA Accelerator for Checking Resolution Proofs. Universität
Paderborn; 2017.
apa: Hansmeier, T. (2017). An FPGA Accelerator for Checking Resolution Proofs.
Universität Paderborn.
bibtex: '@book{Hansmeier_2017, title={An FPGA Accelerator for Checking Resolution
Proofs}, publisher={Universität Paderborn}, author={Hansmeier, Tim}, year={2017}
}'
chicago: Hansmeier, Tim. An FPGA Accelerator for Checking Resolution Proofs.
Universität Paderborn, 2017.
ieee: T. Hansmeier, An FPGA Accelerator for Checking Resolution Proofs. Universität
Paderborn, 2017.
mla: Hansmeier, Tim. An FPGA Accelerator for Checking Resolution Proofs.
Universität Paderborn, 2017.
short: T. Hansmeier, An FPGA Accelerator for Checking Resolution Proofs, Universität
Paderborn, 2017.
date_created: 2018-07-20T13:44:34Z
date_updated: 2022-01-06T06:59:25Z
department:
- _id: '78'
- _id: '34'
- _id: '7'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
title: An FPGA Accelerator for Checking Resolution Proofs
type: bachelorsthesis
user_id: '3118'
year: '2017'
...
---
_id: '114'
abstract:
- lang: eng
text: Proof witnesses are proof artifacts showing correctness of programs wrt. safety
properties. The recent past has seen a rising interest in witnesses as (a) proofs
in a proof-carrying-code context, (b) certificates for the correct functioning
of verification tools, or simply (c) exchange formats for (partial) verification
results. As witnesses in all theses scenarios need to be stored and processed,
witnesses are required to be as small as possible. However, software verification
tools – the prime suppliers of witnesses – do not necessarily construct small
witnesses. In this paper, we present a formal account of proof witnesses. We introduce
the concept of weakenings, reducing the complexity of proof witnesses while preserving
the ability of witnessing safety. We develop aweakening technique for a specific
class of program analyses, and prove it to be sound. Finally, we experimentally
demonstrate our weakening technique to indeed achieve a size reduction of proof
witnesses.
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Jakobs M-C, Wehrheim H. Compact Proof Witnesses. In: Barrett C, Davies M,
Kahsai T, eds. NASA Formal Methods: 9th International Symposium. Lecture
Notes in Computer Science. ; 2017:389-403. doi:10.1007/978-3-319-57288-8_28'
apa: 'Jakobs, M.-C., & Wehrheim, H. (2017). Compact Proof Witnesses. In C. Barrett,
M. Davies, & T. Kahsai (Eds.), NASA Formal Methods: 9th International Symposium
(pp. 389–403). https://doi.org/10.1007/978-3-319-57288-8_28'
bibtex: '@inproceedings{Jakobs_Wehrheim_2017, series={Lecture Notes in Computer
Science}, title={Compact Proof Witnesses}, DOI={10.1007/978-3-319-57288-8_28},
booktitle={NASA Formal Methods: 9th International Symposium}, author={Jakobs,
Marie-Christine and Wehrheim, Heike}, editor={Barrett, Clark and Davies, Misty
and Kahsai, TemesghenEditors}, year={2017}, pages={389–403}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Compact Proof Witnesses.”
In NASA Formal Methods: 9th International Symposium, edited by Clark Barrett,
Misty Davies, and Temesghen Kahsai, 389–403. Lecture Notes in Computer Science,
2017. https://doi.org/10.1007/978-3-319-57288-8_28.'
ieee: 'M.-C. Jakobs and H. Wehrheim, “Compact Proof Witnesses,” in NASA Formal
Methods: 9th International Symposium, 2017, pp. 389–403.'
mla: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Compact Proof Witnesses.” NASA
Formal Methods: 9th International Symposium, edited by Clark Barrett et al.,
2017, pp. 389–403, doi:10.1007/978-3-319-57288-8_28.'
short: 'M.-C. Jakobs, H. Wehrheim, in: C. Barrett, M. Davies, T. Kahsai (Eds.),
NASA Formal Methods: 9th International Symposium, 2017, pp. 389–403.'
date_created: 2017-10-17T12:41:13Z
date_updated: 2022-01-06T06:51:00Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-57288-8_28
editor:
- first_name: Clark
full_name: Barrett, Clark
last_name: Barrett
- first_name: Misty
full_name: Davies, Misty
last_name: Davies
- first_name: Temesghen
full_name: Kahsai, Temesghen
last_name: Kahsai
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:05:02Z
date_updated: 2018-03-21T13:05:02Z
file_id: '1565'
file_name: 114-chp_3A10.1007_2F978-3-319-57288-8_28.pdf
file_size: 492800
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:05:02Z
has_accepted_license: '1'
language:
- iso: eng
page: 389-403
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: 'NASA Formal Methods: 9th International Symposium'
series_title: Lecture Notes in Computer Science
status: public
title: Compact Proof Witnesses
type: conference
user_id: '477'
year: '2017'
...
---
_id: '115'
abstract:
- lang: eng
text: 'Whenever customers have to decide between different instances of the same
product, they are interested in buying the best product. In contrast, companies
are interested in reducing the construction effort (and usually as a consequence
thereof, the quality) to gain profit. The described setting is widely known as
opposed preferences in quality of the product and also applies to the context
of service-oriented computing. In general, service-oriented computing emphasizes
the construction of large software systems out of existing services, where services
are small and self-contained pieces of software that adhere to a specified interface.
Several implementations of the same interface are considered as several instances
of the same service. Thereby, customers are interested in buying the best service
implementation for their service composition wrt. to metrics, such as costs, energy,
memory consumption, or execution time. One way to ensure the service quality is
to employ certificates, which can come in different kinds: Technical certificates
proving correctness can be automatically constructed by the service provider and
again be automatically checked by the user. Digital certificates allow proof of
the integrity of a product. Other certificates might be rolled out if service
providers follow a good software construction principle, which is checked in annual
audits. Whereas all of these certificates are handled differently in service markets,
what they have in common is that they influence the buying decisions of customers.
In this paper, we review state-of-the-art developments in certification with respect
to service-oriented computing. We not only discuss how certificates are constructed
and handled in service-oriented computing but also review the effects of certificates
on the market from an economic perspective.'
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Julia
full_name: Krämer, Julia
last_name: Krämer
- first_name: Dirk
full_name: van Straaten, Dirk
id: '10311'
last_name: van Straaten
- first_name: Theodor
full_name: Lettmann, Theodor
id: '315'
last_name: Lettmann
orcid: 0000-0001-5859-2457
citation:
ama: 'Jakobs M-C, Krämer J, van Straaten D, Lettmann T. Certification Matters for
Service Markets. In: Marcelo De Barros, Janusz Klink,Tadeus Uhl TP, ed. The
Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION).
; 2017:7-12.'
apa: Jakobs, M.-C., Krämer, J., van Straaten, D., & Lettmann, T. (2017). Certification
Matters for Service Markets. In T. P. Marcelo De Barros, Janusz Klink,Tadeus Uhl
(Ed.), The Ninth International Conferences on Advanced Service Computing (SERVICE
COMPUTATION) (pp. 7–12).
bibtex: '@inproceedings{Jakobs_Krämer_van Straaten_Lettmann_2017, title={Certification
Matters for Service Markets}, booktitle={The Ninth International Conferences on
Advanced Service Computing (SERVICE COMPUTATION)}, author={Jakobs, Marie-Christine
and Krämer, Julia and van Straaten, Dirk and Lettmann, Theodor}, editor={Marcelo
De Barros, Janusz Klink,Tadeus Uhl, Thomas PrinzEditor}, year={2017}, pages={7–12}
}'
chicago: Jakobs, Marie-Christine, Julia Krämer, Dirk van Straaten, and Theodor Lettmann.
“Certification Matters for Service Markets.” In The Ninth International Conferences
on Advanced Service Computing (SERVICE COMPUTATION), edited by Thomas Prinz
Marcelo De Barros, Janusz Klink,Tadeus Uhl, 7–12, 2017.
ieee: M.-C. Jakobs, J. Krämer, D. van Straaten, and T. Lettmann, “Certification Matters
for Service Markets,” in The Ninth International Conferences on Advanced Service
Computing (SERVICE COMPUTATION), 2017, pp. 7–12.
mla: Jakobs, Marie-Christine, et al. “Certification Matters for Service Markets.”
The Ninth International Conferences on Advanced Service Computing (SERVICE
COMPUTATION), edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus
Uhl, 2017, pp. 7–12.
short: 'M.-C. Jakobs, J. Krämer, D. van Straaten, T. Lettmann, in: T.P. Marcelo
De Barros, Janusz Klink,Tadeus Uhl (Ed.), The Ninth International Conferences
on Advanced Service Computing (SERVICE COMPUTATION), 2017, pp. 7–12.'
date_created: 2017-10-17T12:41:14Z
date_updated: 2022-01-06T06:51:02Z
ddc:
- '040'
department:
- _id: '77'
- _id: '355'
- _id: '179'
editor:
- first_name: Thomas Prinz
full_name: Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas Prinz
last_name: Marcelo De Barros, Janusz Klink,Tadeus Uhl
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:04:12Z
date_updated: 2018-03-21T13:04:12Z
file_id: '1564'
file_name: 115-JakobsKraemerVanStraatenLettmann2017.pdf
file_size: 133531
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:04:12Z
has_accepted_license: '1'
language:
- iso: eng
page: 7-12
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '8'
name: SFB 901 - Subproject A4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '3'
name: SFB 901 - Project Area B
publication: The Ninth International Conferences on Advanced Service Computing (SERVICE
COMPUTATION)
status: public
title: Certification Matters for Service Markets
type: conference
user_id: '477'
year: '2017'
...
---
_id: '1157'
author:
- first_name: Linus Matthias
full_name: Witschen, Linus Matthias
id: '49051'
last_name: Witschen
citation:
ama: Witschen LM. A Framework for the Synthesis of Approximate Circuits.
Universität Paderborn; 2017.
apa: Witschen, L. M. (2017). A Framework for the Synthesis of Approximate Circuits.
Universität Paderborn.
bibtex: '@book{Witschen_2017, title={A Framework for the Synthesis of Approximate
Circuits}, publisher={Universität Paderborn}, author={Witschen, Linus Matthias},
year={2017} }'
chicago: Witschen, Linus Matthias. A Framework for the Synthesis of Approximate
Circuits. Universität Paderborn, 2017.
ieee: L. M. Witschen, A Framework for the Synthesis of Approximate Circuits.
Universität Paderborn, 2017.
mla: Witschen, Linus Matthias. A Framework for the Synthesis of Approximate Circuits.
Universität Paderborn, 2017.
short: L.M. Witschen, A Framework for the Synthesis of Approximate Circuits, Universität
Paderborn, 2017.
date_created: 2018-02-01T14:21:19Z
date_updated: 2022-01-06T06:51:03Z
department:
- _id: '78'
- _id: '7'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
title: A Framework for the Synthesis of Approximate Circuits
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '90'
abstract:
- lang: eng
text: We propose and extend an approach for the verification of safety properties
for parameterized timed systems modeled as networks of timed automata. For this
task, we introduce an incremental workflow that is based on our algorithm IC3
with Zones. It proceeds in a cycle in which single models of the system are verified,
and the verification results are employed for the reasoning about the entire system.
Starting with the smallest instances, the verification of the safety property
is carried out fast and efficient. On successful verification, the algorithm produces
an inductive strengthening of the safety property. We reuse this result and try
to reason about the entire parameterized timed system. To this end, we extrapolate
the inductive strengthening into a candidate for the next-larger model. In case
this candidate is a valid inductive strengthening for the next larger model, our
main theorem reasons about all models of the parameterized timed system, stating
that the safety property holds true for all models. Otherwise, the main cycle
starts over with the verification of the next larger model. This workflow is iterated
indefinitely, until able to reason about the entire parameterized timed system,
until a counterexample trace is found, or until the single models become too large
to be handled in the verification. We reuse the intermediate results in a Feedback-loop
in order to accelerate the verification runs for the single models. Furthermore,
we consider an extended formalism in comparison to our previous publications.
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
citation:
ama: Isenberg T. Incremental Inductive Verification of Parameterized Timed Systems.
ACM Transactions on Embedded Computing Systems. 2017;(2):47:1-47:24. doi:10.1145/2984640
apa: Isenberg, T. (2017). Incremental Inductive Verification of Parameterized Timed
Systems. ACM Transactions on Embedded Computing Systems, (2), 47:1-47:24.
https://doi.org/10.1145/2984640
bibtex: '@article{Isenberg_2017, title={Incremental Inductive Verification of Parameterized
Timed Systems}, DOI={10.1145/2984640},
number={2}, journal={ACM Transactions on Embedded Computing Systems}, publisher={ACM},
author={Isenberg, Tobias}, year={2017}, pages={47:1-47:24} }'
chicago: 'Isenberg, Tobias. “Incremental Inductive Verification of Parameterized
Timed Systems.” ACM Transactions on Embedded Computing Systems, no. 2 (2017):
47:1-47:24. https://doi.org/10.1145/2984640.'
ieee: T. Isenberg, “Incremental Inductive Verification of Parameterized Timed Systems,”
ACM Transactions on Embedded Computing Systems, no. 2, pp. 47:1-47:24,
2017.
mla: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed
Systems.” ACM Transactions on Embedded Computing Systems, no. 2, ACM, 2017,
pp. 47:1-47:24, doi:10.1145/2984640.
short: T. Isenberg, ACM Transactions on Embedded Computing Systems (2017) 47:1-47:24.
date_created: 2017-10-17T12:41:09Z
date_updated: 2022-01-06T07:04:06Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1145/2984640
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:13:04Z
date_updated: 2018-03-21T13:13:04Z
file_id: '1572'
file_name: 90-a47-isenberg.pdf
file_size: 584870
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:13:04Z
has_accepted_license: '1'
issue: '2'
language:
- iso: eng
page: 47:1-47:24
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: ACM Transactions on Embedded Computing Systems
publisher: ACM
status: public
title: Incremental Inductive Verification of Parameterized Timed Systems
type: journal_article
user_id: '477'
year: '2017'
...
---
_id: '93'
abstract:
- lang: eng
text: "In recent years, there has been a proliferation of technological developments
that incorporate processing of human language. Hardware and software can be specialized
for designated subject areas, and computational devices are designed for a widening
variety of applications. At the same time, new areas and applications are emerging
by demanding intelligent technology enhanced by the processing of human language.
These new applications often perform tasks which handle information, and they
have a capacity to reason, using both formal and human language. Many sub-areas
of Artificial Intelligence demand integration of Natural Language Processing,
at least to some degree. Furthermore, technologies require coverage of known as
well as unknown agents, and tasks with potential variations. All of this takes
place in environments with unknown factors.\r\nThe book covers theoretical work,
advanced applications, approaches, and techniques for computational models of
information, reasoning systems, and presentation in language. The book promotes
work on intelligent natural language processing and related models of information,
thought, reasoning, and other cognitive processes. The topics covered by the chapters
prompt further research and developments of advanced systems in the areas of logic,
computability, computational linguistics, cognitive science, neuroscience of language,
robotics, and artificial intelligence, among others."
author:
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
citation:
ama: 'Geierhos M, Bäumer FS. Guesswork? Resolving Vagueness in User-Generated Software
Requirements. In: Christiansen H, Jiménez-López MD, Loukanova R, Moss LS, eds.
Partiality and Underspecification in Information, Languages, and Knowledge.
1st ed. Newcastle upon Tyne, UK: Cambridge Scholars Publishing; 2017:65-108.'
apa: 'Geierhos, M., & Bäumer, F. S. (2017). Guesswork? Resolving Vagueness in
User-Generated Software Requirements. In H. Christiansen, M. D. Jiménez-López,
R. Loukanova, & L. S. Moss (Eds.), Partiality and Underspecification in
Information, Languages, and Knowledge (1st ed., pp. 65–108). Newcastle upon
Tyne, UK: Cambridge Scholars Publishing.'
bibtex: '@inbook{Geierhos_Bäumer_2017, place={Newcastle upon Tyne, UK}, edition={1},
title={Guesswork? Resolving Vagueness in User-Generated Software Requirements},
booktitle={Partiality and Underspecification in Information, Languages, and Knowledge},
publisher={Cambridge Scholars Publishing}, author={Geierhos, Michaela and Bäumer,
Frederik Simon}, editor={Christiansen, Henning and Jiménez-López, M. Dolores
and Loukanova, Roussanka and Moss, Lawrence S.Editors}, year={2017}, pages={65–108}
}'
chicago: 'Geierhos, Michaela, and Frederik Simon Bäumer. “Guesswork? Resolving Vagueness
in User-Generated Software Requirements.” In Partiality and Underspecification
in Information, Languages, and Knowledge, edited by Henning Christiansen,
M. Dolores Jiménez-López, Roussanka Loukanova, and Lawrence S. Moss, 1st ed.,
65–108. Newcastle upon Tyne, UK: Cambridge Scholars Publishing, 2017.'
ieee: 'M. Geierhos and F. S. Bäumer, “Guesswork? Resolving Vagueness in User-Generated
Software Requirements,” in Partiality and Underspecification in Information,
Languages, and Knowledge, 1st ed., H. Christiansen, M. D. Jiménez-López, R.
Loukanova, and L. S. Moss, Eds. Newcastle upon Tyne, UK: Cambridge Scholars Publishing,
2017, pp. 65–108.'
mla: Geierhos, Michaela, and Frederik Simon Bäumer. “Guesswork? Resolving Vagueness
in User-Generated Software Requirements.” Partiality and Underspecification
in Information, Languages, and Knowledge, edited by Henning Christiansen
et al., 1st ed., Cambridge Scholars Publishing, 2017, pp. 65–108.
short: 'M. Geierhos, F.S. Bäumer, in: H. Christiansen, M.D. Jiménez-López, R. Loukanova,
L.S. Moss (Eds.), Partiality and Underspecification in Information, Languages,
and Knowledge, 1st ed., Cambridge Scholars Publishing, Newcastle upon Tyne, UK,
2017, pp. 65–108.'
date_created: 2017-10-17T12:41:09Z
date_updated: 2022-01-06T07:04:13Z
ddc:
- '004'
department:
- _id: '36'
- _id: '1'
- _id: '579'
edition: '1'
editor:
- first_name: 'Henning '
full_name: 'Christiansen, Henning '
last_name: Christiansen
- first_name: M. Dolores
full_name: Jiménez-López, M. Dolores
last_name: Jiménez-López
- first_name: 'Roussanka '
full_name: 'Loukanova, Roussanka '
last_name: Loukanova
- first_name: Lawrence S.
full_name: Moss, Lawrence S.
last_name: Moss
file:
- access_level: closed
content_type: application/pdf
creator: fbaeumer
date_created: 2019-01-11T11:43:23Z
date_updated: 2019-01-11T11:43:23Z
file_id: '6625'
file_name: CSP_Chapter_GeierhosBaeumer.pdf
file_size: 2888473
relation: main_file
success: 1
file_date_updated: 2019-01-11T11:43:23Z
has_accepted_license: '1'
language:
- iso: eng
page: 65-108
place: Newcastle upon Tyne, UK
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: Partiality and Underspecification in Information, Languages, and Knowledge
publication_identifier:
isbn:
- 978-1- 4438-7947-7
publication_status: published
publisher: Cambridge Scholars Publishing
quality_controlled: '1'
status: public
title: Guesswork? Resolving Vagueness in User-Generated Software Requirements
type: book_chapter
user_id: '38837'
year: '2017'
...
---
_id: '5694'
author:
- first_name: Nino Noel
full_name: Schnitker, Nino Noel
last_name: Schnitker
citation:
ama: Schnitker NN. Genetischer Algorithmus zur Erstellung von Ensembles von Nested
Dichotomies. Universität Paderborn; 2017.
apa: Schnitker, N. N. (2017). Genetischer Algorithmus zur Erstellung von Ensembles
von Nested Dichotomies. Universität Paderborn.
bibtex: '@book{Schnitker_2017, title={Genetischer Algorithmus zur Erstellung von
Ensembles von Nested Dichotomies}, publisher={Universität Paderborn}, author={Schnitker,
Nino Noel}, year={2017} }'
chicago: Schnitker, Nino Noel. Genetischer Algorithmus zur Erstellung von Ensembles
von Nested Dichotomies. Universität Paderborn, 2017.
ieee: N. N. Schnitker, Genetischer Algorithmus zur Erstellung von Ensembles von
Nested Dichotomies. Universität Paderborn, 2017.
mla: Schnitker, Nino Noel. Genetischer Algorithmus zur Erstellung von Ensembles
von Nested Dichotomies. Universität Paderborn, 2017.
short: N.N. Schnitker, Genetischer Algorithmus zur Erstellung von Ensembles von
Nested Dichotomies, Universität Paderborn, 2017.
date_created: 2018-11-15T08:10:48Z
date_updated: 2022-01-06T07:02:35Z
department:
- _id: '355'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
title: Genetischer Algorithmus zur Erstellung von Ensembles von Nested Dichotomies
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '57'
abstract:
- lang: eng
text: 'Users prefer natural language software requirements because of their usability
and accessibility. Many approaches exist to elaborate these requirements and to
support the users during the elicitation process. But there is a lack of adequate
resources, which are needed to train and evaluate approaches for requirement refinement.
We are trying to close this gap by using online available software descriptions
from SourceForge and app stores. Thus, we present two real-life requirements collections
based on online-available software descriptions. Our goal is to show the domain-specific
characteristics of content words describing functional requirements. On the one
hand, we created a semantic role-labeled requirements set, which we use for requirements
classification. On the other hand, we enriched software descriptions with linguistic
features and dependencies to provide evidence for the context-awareness of software
functionalities. '
author:
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
- first_name: Markus
full_name: Dollmann, Markus
id: '27578'
last_name: Dollmann
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
citation:
ama: 'Bäumer FS, Dollmann M, Geierhos M. Studying Software Descriptions in SourceForge
and App Stores for a better Understanding of real-life Requirements. In: Sarro
F, Shihab E, Nagappan M, Platenius MC, Kaimann D, eds. Proceedings of the 2nd
ACM SIGSOFT International Workshop on App Market Analytics. New York, NY,
USA: ACM; 2017:19-25. doi:10.1145/3121264.3121269'
apa: 'Bäumer, F. S., Dollmann, M., & Geierhos, M. (2017). Studying Software
Descriptions in SourceForge and App Stores for a better Understanding of real-life
Requirements. In F. Sarro, E. Shihab, M. Nagappan, M. C. Platenius, & D. Kaimann
(Eds.), Proceedings of the 2nd ACM SIGSOFT International Workshop on App Market
Analytics (pp. 19–25). New York, NY, USA: ACM. https://doi.org/10.1145/3121264.3121269'
bibtex: '@inproceedings{Bäumer_Dollmann_Geierhos_2017, place={New York, NY, USA},
title={Studying Software Descriptions in SourceForge and App Stores for a better
Understanding of real-life Requirements}, DOI={10.1145/3121264.3121269},
booktitle={Proceedings of the 2nd ACM SIGSOFT International Workshop on App Market
Analytics}, publisher={ACM}, author={Bäumer, Frederik Simon and Dollmann, Markus
and Geierhos, Michaela}, editor={Sarro, Federica and Shihab, Emad and Nagappan,
Meiyappan and Platenius, Marie Christin and Kaimann, DanielEditors}, year={2017},
pages={19–25} }'
chicago: 'Bäumer, Frederik Simon, Markus Dollmann, and Michaela Geierhos. “Studying
Software Descriptions in SourceForge and App Stores for a Better Understanding
of Real-Life Requirements.” In Proceedings of the 2nd ACM SIGSOFT International
Workshop on App Market Analytics, edited by Federica Sarro, Emad Shihab,
Meiyappan Nagappan, Marie Christin Platenius, and Daniel Kaimann, 19–25. New
York, NY, USA: ACM, 2017. https://doi.org/10.1145/3121264.3121269.'
ieee: F. S. Bäumer, M. Dollmann, and M. Geierhos, “Studying Software Descriptions
in SourceForge and App Stores for a better Understanding of real-life Requirements,”
in Proceedings of the 2nd ACM SIGSOFT International Workshop on App Market
Analytics, Paderborn, Germany, 2017, pp. 19–25.
mla: Bäumer, Frederik Simon, et al. “Studying Software Descriptions in SourceForge
and App Stores for a Better Understanding of Real-Life Requirements.” Proceedings
of the 2nd ACM SIGSOFT International Workshop on App Market Analytics, edited
by Federica Sarro et al., ACM, 2017, pp. 19–25, doi:10.1145/3121264.3121269.
short: 'F.S. Bäumer, M. Dollmann, M. Geierhos, in: F. Sarro, E. Shihab, M. Nagappan,
M.C. Platenius, D. Kaimann (Eds.), Proceedings of the 2nd ACM SIGSOFT International
Workshop on App Market Analytics, ACM, New York, NY, USA, 2017, pp. 19–25.'
conference:
end_date: 2017-09-05
location: Paderborn, Germany
name: 2nd ACM SIGSOFT International Workshop on App Market Analytics
start_date: 2017-09-05
date_created: 2017-10-17T12:41:02Z
date_updated: 2022-01-06T07:02:36Z
ddc:
- '000'
department:
- _id: '36'
- _id: '1'
- _id: '579'
doi: 10.1145/3121264.3121269
editor:
- first_name: 'Federica '
full_name: 'Sarro, Federica '
last_name: Sarro
- first_name: 'Emad '
full_name: 'Shihab, Emad '
last_name: Shihab
- first_name: 'Meiyappan '
full_name: 'Nagappan, Meiyappan '
last_name: Nagappan
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Daniel
full_name: Kaimann, Daniel
last_name: Kaimann
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:27:00Z
date_updated: 2018-11-02T14:27:00Z
file_id: '5272'
file_name: fsews17wama-wamamainid5.pdf
file_size: 1546837
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:27:00Z
has_accepted_license: '1'
language:
- iso: eng
page: 19-25
place: New York, NY, USA
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 2nd ACM SIGSOFT International Workshop on App Market
Analytics
publication_identifier:
isbn:
- 978-1-4503-5158-4
publication_status: published
publisher: ACM
quality_controlled: '1'
status: public
title: Studying Software Descriptions in SourceForge and App Stores for a better Understanding
of real-life Requirements
type: conference
user_id: '477'
year: '2017'
...
---
_id: '5724'
author:
- first_name: Alexander
full_name: Hetzer, Alexander
id: '38209'
last_name: Hetzer
- first_name: Tanja
full_name: Tornede, Tanja
last_name: Tornede
citation:
ama: Hetzer A, Tornede T. Solving the Container Pre-Marshalling Problem Using
Reinforcement Learning and Structured Output Prediction. Universität Paderborn;
2017.
apa: Hetzer, A., & Tornede, T. (2017). Solving the Container Pre-Marshalling
Problem using Reinforcement Learning and Structured Output Prediction. Universität
Paderborn.
bibtex: '@book{Hetzer_Tornede_2017, title={Solving the Container Pre-Marshalling
Problem using Reinforcement Learning and Structured Output Prediction}, publisher={Universität
Paderborn}, author={Hetzer, Alexander and Tornede, Tanja}, year={2017} }'
chicago: Hetzer, Alexander, and Tanja Tornede. Solving the Container Pre-Marshalling
Problem Using Reinforcement Learning and Structured Output Prediction. Universität
Paderborn, 2017.
ieee: A. Hetzer and T. Tornede, Solving the Container Pre-Marshalling Problem
using Reinforcement Learning and Structured Output Prediction. Universität
Paderborn, 2017.
mla: Hetzer, Alexander, and Tanja Tornede. Solving the Container Pre-Marshalling
Problem Using Reinforcement Learning and Structured Output Prediction. Universität
Paderborn, 2017.
short: A. Hetzer, T. Tornede, Solving the Container Pre-Marshalling Problem Using
Reinforcement Learning and Structured Output Prediction, Universität Paderborn,
2017.
date_created: 2018-11-19T07:49:13Z
date_updated: 2022-01-06T07:02:37Z
department:
- _id: '355'
- _id: '199'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Kevin
full_name: Tierney, Kevin
last_name: Tierney
title: Solving the Container Pre-Marshalling Problem using Reinforcement Learning
and Structured Output Prediction
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '5769'
abstract:
- lang: eng
text: "Information Flow Analysis (IFA) aims at detecting illegal flows of information
between program entities. “Legality” is therein specified in terms of various
security policies. For the analysis, this opens up two possibilities: building
generic, policy independent and building specific, policy dependent IFAs. While
the former needs to track all dependencies between program entities, the latter
allows for a reduced and thus more efficient analysis.\r\n\r\nIn this paper, we
start out by formally defining a policy independent information flow analysis.
Next, we show how to specialize this IFA via policy specific variable tracking,
and prove soundness of the specialization. We furthermore investigate refinement
relationships between policies, allowing an IFA for one policy to be employed
for its refinements. As policy refinement depends on concrete program entities,
we additionally propose a precomputation of policy refinement conditions, enabling
an efficient refinement check for concrete programs."
author:
- first_name: Manuel
full_name: Töws, Manuel
id: '11315'
last_name: Töws
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Töws M, Wehrheim H. Policy Dependent and Independent Information Flow Analyses.
In: Formal Methods and Software Engineering - 19th International Conference
on Formal Engineering Methods (ICFEM 2017). Springer International Publishing;
2017:362-378. doi:10.1007/978-3-319-68690-5_22'
apa: Töws, M., & Wehrheim, H. (2017). Policy Dependent and Independent Information
Flow Analyses. In Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods (ICFEM 2017) (pp. 362–378). Springer
International Publishing. https://doi.org/10.1007/978-3-319-68690-5_22
bibtex: '@inproceedings{Töws_Wehrheim_2017, title={Policy Dependent and Independent
Information Flow Analyses}, DOI={10.1007/978-3-319-68690-5_22},
booktitle={Formal Methods and Software Engineering - 19th International Conference
on Formal Engineering Methods (ICFEM 2017)}, publisher={Springer International
Publishing}, author={Töws, Manuel and Wehrheim, Heike}, year={2017}, pages={362–378}
}'
chicago: Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information
Flow Analyses.” In Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods (ICFEM 2017), 362–78. Springer International
Publishing, 2017. https://doi.org/10.1007/978-3-319-68690-5_22.
ieee: M. Töws and H. Wehrheim, “Policy Dependent and Independent Information Flow
Analyses,” in Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods (ICFEM 2017), 2017, pp. 362–378.
mla: Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information
Flow Analyses.” Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods (ICFEM 2017), Springer International
Publishing, 2017, pp. 362–78, doi:10.1007/978-3-319-68690-5_22.
short: 'M. Töws, H. Wehrheim, in: Formal Methods and Software Engineering - 19th
International Conference on Formal Engineering Methods (ICFEM 2017), Springer
International Publishing, 2017, pp. 362–378.'
date_created: 2018-11-21T09:38:43Z
date_updated: 2022-01-06T07:02:39Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1007/978-3-319-68690-5_22
file:
- access_level: closed
content_type: application/pdf
creator: mtoews
date_created: 2018-11-26T15:07:42Z
date_updated: 2018-11-26T15:07:42Z
file_id: '5836'
file_name: Töws-Wehrheim2017_Chapter_PolicyDependentAndIndependentI.pdf
file_size: 424031
relation: main_file
success: 1
file_date_updated: 2018-11-26T15:07:42Z
has_accepted_license: '1'
language:
- iso: eng
page: 362-378
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publication: Formal Methods and Software Engineering - 19th International Conference on
Formal Engineering Methods (ICFEM 2017)
publication_identifier:
isbn:
- '9783319686899'
- '9783319686905'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Policy Dependent and Independent Information Flow Analyses
type: conference
user_id: '477'
year: '2017'
...
---
_id: '46'
author:
- first_name: Florian
full_name: Grobbel, Florian
last_name: Grobbel
citation:
ama: Grobbel F. Was kommt zuerst? Erkennung von zeitlichen Abläufen infunktionalen
Softwareanforderungsbeschreibungen. Universität Paderborn; 2017.
apa: Grobbel, F. (2017). Was kommt zuerst? Erkennung von zeitlichen Abläufen
infunktionalen Softwareanforderungsbeschreibungen. Universität Paderborn.
bibtex: '@book{Grobbel_2017, title={Was kommt zuerst? Erkennung von zeitlichen Abläufen
infunktionalen Softwareanforderungsbeschreibungen}, publisher={Universität Paderborn},
author={Grobbel, Florian}, year={2017} }'
chicago: Grobbel, Florian. Was kommt zuerst? Erkennung von zeitlichen Abläufen
infunktionalen Softwareanforderungsbeschreibungen. Universität Paderborn,
2017.
ieee: F. Grobbel, Was kommt zuerst? Erkennung von zeitlichen Abläufen infunktionalen
Softwareanforderungsbeschreibungen. Universität Paderborn, 2017.
mla: Grobbel, Florian. Was kommt zuerst? Erkennung von zeitlichen Abläufen infunktionalen
Softwareanforderungsbeschreibungen. Universität Paderborn, 2017.
short: F. Grobbel, Was kommt zuerst? Erkennung von zeitlichen Abläufen infunktionalen
Softwareanforderungsbeschreibungen, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:00Z
date_updated: 2022-01-06T07:01:14Z
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: Was kommt zuerst? Erkennung von zeitlichen Abläufen infunktionalen Softwareanforderungsbeschreibungen
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '47'
author:
- first_name: Mona
full_name: Theda, Mona
last_name: Theda
citation:
ama: Theda M. Was ist gemeint? Strukturell ambige Sätze als Herausforderung für
Parsing-Ansätze. Universität Paderborn; 2017.
apa: Theda, M. (2017). Was ist gemeint? Strukturell ambige Sätze als Herausforderung
für Parsing-Ansätze. Universität Paderborn.
bibtex: '@book{Theda_2017, title={Was ist gemeint? Strukturell ambige Sätze als
Herausforderung für Parsing-Ansätze}, publisher={Universität Paderborn}, author={Theda,
Mona}, year={2017} }'
chicago: Theda, Mona. Was ist gemeint? Strukturell ambige Sätze als Herausforderung
für Parsing-Ansätze. Universität Paderborn, 2017.
ieee: M. Theda, Was ist gemeint? Strukturell ambige Sätze als Herausforderung
für Parsing-Ansätze. Universität Paderborn, 2017.
mla: Theda, Mona. Was ist gemeint? Strukturell ambige Sätze als Herausforderung
für Parsing-Ansätze. Universität Paderborn, 2017.
short: M. Theda, Was ist gemeint? Strukturell ambige Sätze als Herausforderung für
Parsing-Ansätze, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:00Z
date_updated: 2022-01-06T07:01:18Z
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: Was ist gemeint? Strukturell ambige Sätze als Herausforderung für Parsing-Ansätze
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '707'
author:
- first_name: Sven
full_name: Walther, Sven
last_name: Walther
citation:
ama: Walther S. Knowledge-Based Verification of Service Compositions. Universität
Paderborn; 2017. doi:10.17619/UNIPB/1-307
apa: Walther, S. (2017). Knowledge-based Verification of Service Compositions.
Universität Paderborn. https://doi.org/10.17619/UNIPB/1-307
bibtex: '@book{Walther_2017, title={Knowledge-based Verification of Service Compositions},
DOI={10.17619/UNIPB/1-307},
publisher={Universität Paderborn}, author={Walther, Sven}, year={2017} }'
chicago: Walther, Sven. Knowledge-Based Verification of Service Compositions.
Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-307.
ieee: S. Walther, Knowledge-based Verification of Service Compositions. Universität
Paderborn, 2017.
mla: Walther, Sven. Knowledge-Based Verification of Service Compositions.
Universität Paderborn, 2017, doi:10.17619/UNIPB/1-307.
short: S. Walther, Knowledge-Based Verification of Service Compositions, Universität
Paderborn, 2017.
date_created: 2017-11-20T07:59:31Z
date_updated: 2022-01-06T07:03:27Z
department:
- _id: '77'
doi: 10.17619/UNIPB/1-307
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subproject B3
- _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: Knowledge-based Verification of Service Compositions
type: dissertation
user_id: '477'
year: '2017'
...
---
_id: '71'
abstract:
- lang: eng
text: Today, software verification tools have reached the maturity to be used for
large scale programs. Different tools perform differently well on varying code.
A software developer is hence faced with the problem of choosing a tool appropriate
for her program at hand. A ranking of tools on programs could facilitate the choice.
Such rankings can, however, so far only be obtained by running all considered
tools on the program.In this paper, we present a machine learning approach to
predicting rankings of tools on programs. The method builds upon so-called label
ranking algorithms, which we complement with appropriate kernels providing a similarity
measure for programs. Our kernels employ a graph representation for software source
code that mixes elements of control flow and program dependence graphs with abstract
syntax trees. Using data sets from the software verification competition SV-COMP,
we demonstrate our rank prediction technique to generalize well and achieve a
rather high predictive accuracy (rank correlation > 0.6).
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- 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, Hüllermeier E, Jakobs M-C, Wehrheim H. Predicting Rankings of Software
Verification Tools. In: Proceedings of the 3rd International Workshop on Software
Analytics. SWAN’17. ; 2017:23-26. doi:10.1145/3121257.3121262'
apa: Czech, M., Hüllermeier, E., Jakobs, M.-C., & Wehrheim, H. (2017). Predicting
Rankings of Software Verification Tools. In Proceedings of the 3rd International
Workshop on Software Analytics (pp. 23–26). https://doi.org/10.1145/3121257.3121262
bibtex: '@inproceedings{Czech_Hüllermeier_Jakobs_Wehrheim_2017, series={SWAN’17},
title={Predicting Rankings of Software Verification Tools}, DOI={10.1145/3121257.3121262},
booktitle={Proceedings of the 3rd International Workshop on Software Analytics},
author={Czech, Mike and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim,
Heike}, year={2017}, pages={23–26}, collection={SWAN’17} }'
chicago: Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim.
“Predicting Rankings of Software Verification Tools.” In Proceedings of the
3rd International Workshop on Software Analytics, 23–26. SWAN’17, 2017. https://doi.org/10.1145/3121257.3121262.
ieee: M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Predicting Rankings
of Software Verification Tools,” in Proceedings of the 3rd International Workshop
on Software Analytics, 2017, pp. 23–26.
mla: Czech, Mike, et al. “Predicting Rankings of Software Verification Tools.” Proceedings
of the 3rd International Workshop on Software Analytics, 2017, pp. 23–26,
doi:10.1145/3121257.3121262.
short: 'M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, in: Proceedings of
the 3rd International Workshop on Software Analytics, 2017, pp. 23–26.'
date_created: 2017-10-17T12:41:05Z
date_updated: 2022-01-06T07:03:28Z
ddc:
- '000'
department:
- _id: '355'
- _id: '77'
doi: 10.1145/3121257.3121262
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:24:29Z
date_updated: 2018-11-02T14:24:29Z
file_id: '5271'
file_name: fsews17swan-swanmain1.pdf
file_size: 822383
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:24:29Z
has_accepted_license: '1'
language:
- iso: eng
page: 23-26
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
publication: Proceedings of the 3rd International Workshop on Software Analytics
series_title: SWAN'17
status: public
title: Predicting Rankings of Software Verification Tools
type: conference
user_id: '15504'
year: '2017'
...
---
_id: '72'
abstract:
- lang: eng
text: 'Software verification competitions, such as the annual SV-COMP, evaluate
software verification tools with respect to their effectivity and efficiency.
Typically, the outcome of a competition is a (possibly category-specific) ranking
of the tools. For many applications, such as building portfolio solvers, it would
be desirable to have an idea of the (relative) performance of verification tools
on a given verification task beforehand, i.e., prior to actually running all tools
on the task.In this paper, we present a machine learning approach to predicting
rankings of tools on verification tasks. The method builds upon so-called label
ranking algorithms, which we complement with appropriate kernels providing a similarity
measure for verification tasks. Our kernels employ a graph representation for
software source code that mixes elements of control flow and program dependence
graphs with abstract syntax trees. Using data sets from SV-COMP, we demonstrate
our rank prediction technique to generalize well and achieve a rather high predictive
accuracy. In particular, our method outperforms a recently proposed feature-based
approach of Demyanova et al. (when applied to rank predictions). '
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- 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, Hüllermeier E, Jakobs M-C, Wehrheim H. Predicting Rankings of Software
Verification Competitions.; 2017.
apa: Czech, M., Hüllermeier, E., Jakobs, M.-C., & Wehrheim, H. (2017). Predicting
Rankings of Software Verification Competitions.
bibtex: '@book{Czech_Hüllermeier_Jakobs_Wehrheim_2017, title={Predicting Rankings
of Software Verification Competitions}, author={Czech, Mike and Hüllermeier, Eyke
and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017} }'
chicago: Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim.
Predicting Rankings of Software Verification Competitions, 2017.
ieee: M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, Predicting Rankings
of Software Verification Competitions. 2017.
mla: Czech, Mike, et al. Predicting Rankings of Software Verification Competitions.
2017.
short: M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Predicting Rankings
of Software Verification Competitions, 2017.
date_created: 2017-10-17T12:41:05Z
date_updated: 2022-01-06T07:03:29Z
ddc:
- '000'
department:
- _id: '77'
- _id: '355'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-11-21T10:50:11Z
date_updated: 2018-11-21T10:50:11Z
file_id: '5782'
file_name: "Predicting Rankings of So\x81ware Verification Competitions.pdf"
file_size: 869984
relation: main_file
success: 1
file_date_updated: 2018-11-21T10:50:11Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
status: public
title: Predicting Rankings of Software Verification Competitions
type: report
user_id: '15504'
year: '2017'
...
---
_id: '73'
abstract:
- lang: eng
text: Today, verification tools do not only output yes or no, but also provide correctness
arguments or counterexamples. While counterexamples help to fix bugs, correctness
arguments are used to increase the trust in program correctness, e.g., in Proof-Carrying
Code (PCC). Correctness arguments are well-studied for single analyses, but not
when a set of analyses together verifies a program, each of the analyses checking
only a particular part. Such a set of partial, complementary analyses is often
used when a single analysis would fail or is inefficient on some program parts.We
propose PART_PW, a technique which allows us to automatically construct a proof
witness (correctness argument) from the analysis results obtained by a set of
partial, complementary analyses. The constructed proof witnesses are proven to
be valid correctness arguments and in our experiments we use them seamlessly and
efficiently in existing PCC approaches.
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
citation:
ama: 'Jakobs M-C. PART_PW: From Partial Analysis Results to a Proof Witness. In:
Cimatti A, Sirjani M, eds. Software Engineering and Formal Methods. Lecture
Notes in Computer Science. ; 2017:120-135. doi:10.1007/978-3-319-66197-1_8'
apa: 'Jakobs, M.-C. (2017). PART_PW: From Partial Analysis Results to a Proof Witness.
In A. Cimatti & M. Sirjani (Eds.), Software Engineering and Formal Methods
(pp. 120–135). https://doi.org/10.1007/978-3-319-66197-1_8'
bibtex: '@inproceedings{Jakobs_2017, series={Lecture Notes in Computer Science},
title={PART_PW: From Partial Analysis Results to a Proof Witness}, DOI={10.1007/978-3-319-66197-1_8},
booktitle={Software Engineering and Formal Methods}, author={Jakobs, Marie-Christine},
editor={Cimatti, Alessandro and Sirjani, MarjanEditors}, year={2017}, pages={120–135},
collection={Lecture Notes in Computer Science} }'
chicago: 'Jakobs, Marie-Christine. “PART_PW: From Partial Analysis Results to a
Proof Witness.” In Software Engineering and Formal Methods, edited by Alessandro
Cimatti and Marjan Sirjani, 120–35. Lecture Notes in Computer Science, 2017. https://doi.org/10.1007/978-3-319-66197-1_8.'
ieee: 'M.-C. Jakobs, “PART_PW: From Partial Analysis Results to a Proof Witness,”
in Software Engineering and Formal Methods, 2017, pp. 120–135.'
mla: 'Jakobs, Marie-Christine. “PART_PW: From Partial Analysis Results to a Proof
Witness.” Software Engineering and Formal Methods, edited by Alessandro
Cimatti and Marjan Sirjani, 2017, pp. 120–35, doi:10.1007/978-3-319-66197-1_8.'
short: 'M.-C. Jakobs, in: A. Cimatti, M. Sirjani (Eds.), Software Engineering and
Formal Methods, 2017, pp. 120–135.'
date_created: 2017-10-17T12:41:05Z
date_updated: 2022-01-06T07:03:32Z
ddc:
- '000'
doi: 10.1007/978-3-319-66197-1_8
editor:
- first_name: Alessandro
full_name: Cimatti, Alessandro
last_name: Cimatti
- first_name: Marjan
full_name: Sirjani, Marjan
last_name: Sirjani
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:47:04Z
date_updated: 2018-11-02T14:47:04Z
file_id: '5283'
file_name: PARTMathrmPWFromPartialAnalysi.pdf
file_size: 496965
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:47:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 120-135
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Software Engineering and Formal Methods
series_title: Lecture Notes in Computer Science
status: public
title: 'PART_PW: From Partial Analysis Results to a Proof Witness'
type: conference
user_id: '477'
year: '2017'
...
---
_id: '84'
abstract:
- lang: eng
text: The increasing popularity of paradigms like service-oriented computing and
cloud com-puting is leading to a growing amount of service providers offering
software componentsin the form of deployed, ready-to-use services (Software as
a Service, SaaS) [14, 20].In order to discover and select software services, intermediaries
apply service matchingapproaches for determining whether the specification of
a provided service satisfies therequester’s requirements. There are already lots
of different service matching approachesconsidering different service properties
(structural, behavioral, and non-functional proper-ties). However, each of these
approaches alone is not enough to provide a high matchingresult quality (e.g.,
accurate matching results) [BOR04].Thus, such approaches should be combined into
a more holistic approach leading to moreaccurate matching results. However, this
combination is a manual, error-prone procedurewhere many design decisions are
made. Furthermore, this procedure has to be repeatedfrequently depending on the
context, e.g., to consider different requesters or markets.
author:
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Svetlana
full_name: Arifulina, Svetlana
last_name: Arifulina
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
citation:
ama: 'Platenius MC, Arifulina S, Schäfer W. MatchBox: A Framework for Dynamic Configuration
of Service Matching Processes (Extended Abstract). In: Tagungsband Software
Engineering. Lecture Notes in Informatics (LNI). ; 2017:81--82.'
apa: 'Platenius, M. C., Arifulina, S., & Schäfer, W. (2017). MatchBox: A Framework
for Dynamic Configuration of Service Matching Processes (Extended Abstract). In
Tagungsband Software Engineering (pp. 81--82).'
bibtex: '@inproceedings{Platenius_Arifulina_Schäfer_2017, series={Lecture Notes
in Informatics (LNI)}, title={MatchBox: A Framework for Dynamic Configuration
of Service Matching Processes (Extended Abstract)}, booktitle={Tagungsband Software
Engineering}, author={Platenius, Marie Christin and Arifulina, Svetlana and Schäfer,
Wilhelm}, year={2017}, pages={81--82}, collection={Lecture Notes in Informatics
(LNI)} }'
chicago: 'Platenius, Marie Christin, Svetlana Arifulina, and Wilhelm Schäfer. “MatchBox:
A Framework for Dynamic Configuration of Service Matching Processes (Extended
Abstract).” In Tagungsband Software Engineering, 81--82. Lecture Notes
in Informatics (LNI), 2017.'
ieee: 'M. C. Platenius, S. Arifulina, and W. Schäfer, “MatchBox: A Framework for
Dynamic Configuration of Service Matching Processes (Extended Abstract),” in Tagungsband
Software Engineering, 2017, pp. 81--82.'
mla: 'Platenius, Marie Christin, et al. “MatchBox: A Framework for Dynamic Configuration
of Service Matching Processes (Extended Abstract).” Tagungsband Software Engineering,
2017, pp. 81--82.'
short: 'M.C. Platenius, S. Arifulina, W. Schäfer, in: Tagungsband Software Engineering,
2017, pp. 81--82.'
date_created: 2017-10-17T12:41:07Z
date_updated: 2022-01-06T07:03:54Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:13:41Z
date_updated: 2018-03-21T13:13:41Z
file_id: '1573'
file_name: 84-paper_04.pdf
file_size: 200998
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:13:41Z
has_accepted_license: '1'
page: 81--82
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Tagungsband Software Engineering
series_title: Lecture Notes in Informatics (LNI)
status: public
title: 'MatchBox: A Framework for Dynamic Configuration of Service Matching Processes
(Extended Abstract)'
type: conference
user_id: '15504'
year: '2017'
...