---
_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: '68'
abstract:
- lang: eng
text: Proof-carrying hardware (PCH) is a principle for achieving safety for dynamically
reconfigurable hardware systems. The producer of a hardware module spends huge
effort when creating a proof for a safety policy. The proof is then transferred
as a certificate together with the configuration bitstream to the consumer of
the hardware module, who can quickly verify the given proof. Previous work utilized
SAT solvers and resolution traces to set up a PCH technology and corresponding
tool flows. In this article, we present a novel technology for PCH based on inductive
invariants. For sequential circuits, our approach is fundamentally stronger than
the previous SAT-based one since we avoid the limitations of bounded unrolling.
We contrast our technology to existing ones and show that it fits into previously
proposed tool flows. We conduct experiments with four categories of benchmark
circuits and report consumer and producer runtime and peak memory consumption,
as well as the size of the certificates and the distribution of the workload between
producer and consumer. Experiments clearly show that our new induction-based technology
is superior for sequential circuits, whereas the previous SAT-based technology
is the better choice for combinational circuits.
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
citation:
ama: Isenberg T, Platzner M, Wehrheim H, Wiersema T. Proof-Carrying Hardware via
Inductive Invariants. ACM Transactions on Design Automation of Electronic Systems.
2017;(4):61:1--61:23. doi:10.1145/3054743
apa: Isenberg, T., Platzner, M., Wehrheim, H., & Wiersema, T. (2017). Proof-Carrying
Hardware via Inductive Invariants. ACM Transactions on Design Automation of
Electronic Systems, (4), 61:1--61:23. https://doi.org/10.1145/3054743
bibtex: '@article{Isenberg_Platzner_Wehrheim_Wiersema_2017, title={Proof-Carrying
Hardware via Inductive Invariants}, DOI={10.1145/3054743},
number={4}, journal={ACM Transactions on Design Automation of Electronic Systems},
publisher={ACM}, author={Isenberg, Tobias and Platzner, Marco and Wehrheim, Heike
and Wiersema, Tobias}, year={2017}, pages={61:1--61:23} }'
chicago: 'Isenberg, Tobias, Marco Platzner, Heike Wehrheim, and Tobias Wiersema.
“Proof-Carrying Hardware via Inductive Invariants.” ACM Transactions on Design
Automation of Electronic Systems, no. 4 (2017): 61:1--61:23. https://doi.org/10.1145/3054743.'
ieee: T. Isenberg, M. Platzner, H. Wehrheim, and T. Wiersema, “Proof-Carrying Hardware
via Inductive Invariants,” ACM Transactions on Design Automation of Electronic
Systems, no. 4, pp. 61:1--61:23, 2017.
mla: Isenberg, Tobias, et al. “Proof-Carrying Hardware via Inductive Invariants.”
ACM Transactions on Design Automation of Electronic Systems, no. 4, ACM,
2017, pp. 61:1--61:23, doi:10.1145/3054743.
short: T. Isenberg, M. Platzner, H. Wehrheim, T. Wiersema, ACM Transactions on Design
Automation of Electronic Systems (2017) 61:1--61:23.
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:20Z
ddc:
- '000'
department:
- _id: '77'
- _id: '78'
doi: 10.1145/3054743
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T16:08:17Z
date_updated: 2018-11-02T16:08:17Z
file_id: '5324'
file_name: a61-isenberg.pdf
file_size: 806356
relation: main_file
success: 1
file_date_updated: 2018-11-02T16:08:17Z
has_accepted_license: '1'
issue: '4'
language:
- iso: eng
page: 61:1--61:23
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: ACM Transactions on Design Automation of Electronic Systems
publisher: ACM
status: public
title: Proof-Carrying Hardware via Inductive Invariants
type: journal_article
user_id: '3118'
year: '2017'
...
---
_id: '685'
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
citation:
ama: Jakobs M-C. On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-104
apa: Jakobs, M.-C. (2017). On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-104
bibtex: '@book{Jakobs_2017, title={On-The-Fly Safety Checking - Customizing Program
Certification and Program Restructuring}, DOI={10.17619/UNIPB/1-104},
publisher={Universität Paderborn}, author={Jakobs, Marie-Christine}, year={2017}
}'
chicago: Jakobs, Marie-Christine. On-The-Fly Safety Checking - Customizing Program
Certification and Program Restructuring. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-104.
ieee: M.-C. Jakobs, On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring. Universität Paderborn, 2017.
mla: Jakobs, Marie-Christine. On-The-Fly Safety Checking - Customizing Program
Certification and Program Restructuring. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-104.
short: M.-C. Jakobs, On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring, Universität Paderborn, 2017.
date_created: 2017-11-13T08:13:29Z
date_updated: 2022-01-06T07:03:22Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.17619/UNIPB/1-104
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T12:26:52Z
date_updated: 2018-03-14T12:26:52Z
file_id: '1211'
file_name: 685-Dissertation-Jakobs.pdf
file_size: 11828624
relation: main_file
success: 1
file_date_updated: 2018-03-14T12:26:52Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: On-The-Fly Safety Checking - Customizing Program Certification and Program
Restructuring
type: dissertation
user_id: '477'
year: '2017'
...
---
_id: '69'
abstract:
- lang: eng
text: 'Today, software is traded worldwide on global markets, with apps being downloaded
to smartphones within minutes or seconds. This poses, more than ever, the challenge
of ensuring safety of software in the face of (1) unknown or untrusted software
providers together with (2) resource-limited software consumers. The concept of
Proof-Carrying Code (PCC), years ago suggested by Necula, provides one framework
for securing the execution of untrusted code. PCC techniques attach safety proofs,
constructed by software producers, to code. Based on the assumption that checking
proofs is usually much simpler than constructing proofs, software consumers should
thus be able to quickly check the safety of software. However, PCC techniques
often suffer from the size of certificates (i.e., the attached proofs), making
PCC techniques inefficient in practice.In this article, we introduce a new framework
for the safe execution of untrusted code called Programs from Proofs (PfP). The
basic assumption underlying the PfP technique is the fact that the structure of
programs significantly influences the complexity of checking a specific safety
property. Instead of attaching proofs to program code, the PfP technique transforms
the program into an efficiently checkable form, thus guaranteeing quick safety
checks for software consumers. For this transformation, the technique also uses
a producer-side automatic proof of safety. More specifically, safety proving for
the software producer proceeds via the construction of an abstract reachability
graph (ARG) unfolding the control-flow automaton (CFA) up to the degree necessary
for simple checking. To this end, we combine different sorts of software analysis:
expensive analyses incrementally determining the degree of unfolding, and cheap
analyses responsible for safety checking. Out of the abstract reachability graph
we generate the new program. In its CFA structure, it is isomorphic to the graph
and hence another, this time consumer-side, cheap analysis can quickly determine
its safety.Like PCC, Programs from Proofs is a general framework instantiable
with different sorts of (expensive and cheap) analysis. Here, we present the general
framework and exemplify it by some concrete examples. We have implemented different
instantiations on top of the configurable program analysis tool CPAchecker and
report on experiments, in particular on comparisons with PCC techniques.'
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. Programs from Proofs: A Framework for the Safe Execution
of Untrusted Software. ACM Transactions on Programming Languages and Systems.
2017;(2):7:1-7:56. doi:10.1145/3014427'
apa: 'Jakobs, M.-C., & Wehrheim, H. (2017). Programs from Proofs: A Framework
for the Safe Execution of Untrusted Software. ACM Transactions on Programming
Languages and Systems, (2), 7:1-7:56. https://doi.org/10.1145/3014427'
bibtex: '@article{Jakobs_Wehrheim_2017, title={Programs from Proofs: A Framework
for the Safe Execution of Untrusted Software}, DOI={10.1145/3014427},
number={2}, journal={ACM Transactions on Programming Languages and Systems}, publisher={ACM},
author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017}, pages={7:1-7:56}
}'
chicago: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs: A
Framework for the Safe Execution of Untrusted Software.” ACM Transactions on
Programming Languages and Systems, no. 2 (2017): 7:1-7:56. https://doi.org/10.1145/3014427.'
ieee: 'M.-C. Jakobs and H. Wehrheim, “Programs from Proofs: A Framework for the
Safe Execution of Untrusted Software,” ACM Transactions on Programming Languages
and Systems, no. 2, pp. 7:1-7:56, 2017.'
mla: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs: A Framework
for the Safe Execution of Untrusted Software.” ACM Transactions on Programming
Languages and Systems, no. 2, ACM, 2017, pp. 7:1-7:56, doi:10.1145/3014427.'
short: M.-C. Jakobs, H. Wehrheim, ACM Transactions on Programming Languages and
Systems (2017) 7:1-7:56.
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:23Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1145/3014427
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:15:09Z
date_updated: 2018-03-21T13:15:09Z
file_id: '1575'
file_name: 69-a7-jakobs.pdf
file_size: 1215139
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:15:09Z
has_accepted_license: '1'
issue: '2'
language:
- iso: eng
page: 7:1-7:56
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 Programming Languages and Systems
publisher: ACM
status: public
title: 'Programs from Proofs: A Framework for the Safe Execution of Untrusted Software'
type: journal_article
user_id: '477'
year: '2017'
...
---
_id: '109'
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
citation:
ama: Pauck F. Cooperative Static Analysis of Android Applications. Universität
Paderborn; 2017.
apa: Pauck, F. (2017). Cooperative static analysis of Android applications.
Universität Paderborn.
bibtex: '@book{Pauck_2017, title={Cooperative static analysis of Android applications},
publisher={Universität Paderborn}, author={Pauck, Felix}, year={2017} }'
chicago: Pauck, Felix. Cooperative Static Analysis of Android Applications.
Universität Paderborn, 2017.
ieee: F. Pauck, Cooperative static analysis of Android applications. Universität
Paderborn, 2017.
mla: Pauck, Felix. Cooperative Static Analysis of Android Applications. Universität
Paderborn, 2017.
short: F. Pauck, Cooperative Static Analysis of Android Applications, Universität
Paderborn, 2017.
date_created: 2017-10-17T12:41:12Z
date_updated: 2022-01-06T06:50:52Z
ddc:
- '000'
department:
- _id: '77'
file:
- access_level: open_access
content_type: application/pdf
creator: fpauck
date_created: 2019-08-07T08:55:58Z
date_updated: 2019-08-07T09:03:48Z
file_id: '12905'
file_name: fpauck_2017.pdf
file_size: 5093611
relation: main_file
title: Master's Thesis
file_date_updated: 2019-08-07T09:03:48Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Cooperative static analysis of Android applications
type: mastersthesis
user_id: '22398'
year: '2017'
...
---
_id: '201'
author:
- first_name: Henrik
full_name: Bröcher, Henrik
last_name: Bröcher
citation:
ama: Bröcher H. Evaluation von Graphpartitionierungsalgorithmen im Kontext von
Konfigurierbarer Softwarezertifizierung. Universität Paderborn; 2016.
apa: Bröcher, H. (2016). Evaluation von Graphpartitionierungsalgorithmen im Kontext
von Konfigurierbarer Softwarezertifizierung. Universität Paderborn.
bibtex: '@book{Bröcher_2016, title={Evaluation von Graphpartitionierungsalgorithmen
im Kontext von Konfigurierbarer Softwarezertifizierung}, publisher={Universität
Paderborn}, author={Bröcher, Henrik}, year={2016} }'
chicago: Bröcher, Henrik. Evaluation von Graphpartitionierungsalgorithmen im
Kontext von Konfigurierbarer Softwarezertifizierung. Universität Paderborn,
2016.
ieee: H. Bröcher, Evaluation von Graphpartitionierungsalgorithmen im Kontext
von Konfigurierbarer Softwarezertifizierung. Universität Paderborn, 2016.
mla: Bröcher, Henrik. Evaluation von Graphpartitionierungsalgorithmen im Kontext
von Konfigurierbarer Softwarezertifizierung. Universität Paderborn, 2016.
short: H. Bröcher, Evaluation von Graphpartitionierungsalgorithmen im Kontext von
Konfigurierbarer Softwarezertifizierung, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:31Z
date_updated: 2022-01-06T06:54:18Z
department:
- _id: '77'
language:
- iso: ger
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: Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer
Softwarezertifizierung
type: bachelorsthesis
user_id: '15504'
year: '2016'
...
---
_id: '3157'
author:
- first_name: Steffen
full_name: Beringer, Steffen
last_name: Beringer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Beringer S, Wehrheim H. Verification of AUTOSAR Software Architectures with
Timed Automata. In: H. ter Beek M, Gnesi S, Knapp A, eds. Critical Systems:
Formal Methods and Automated Verification - Joint 21st International Workshop
on Formal Methods for Industrial Critical Systems and 16th International Workshop
on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy,
September 26-28, 2016, Proceedings. Lecture Notes in Computer Science. ; 2016:189--204.
doi:10.1007/978-3-319-45943-1_13'
apa: 'Beringer, S., & Wehrheim, H. (2016). Verification of AUTOSAR Software
Architectures with Timed Automata. In M. H. ter Beek, S. Gnesi, & A. Knapp
(Eds.), Critical Systems: Formal Methods and Automated Verification - Joint
21st International Workshop on Formal Methods for Industrial Critical Systems
and 16th International Workshop on Automated Verification of Critical Systems,
FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings (pp. 189--204).
https://doi.org/10.1007/978-3-319-45943-1_13'
bibtex: '@inproceedings{Beringer_Wehrheim_2016, series={Lecture Notes in Computer
Science}, title={Verification of AUTOSAR Software Architectures with Timed Automata},
DOI={10.1007/978-3-319-45943-1_13},
booktitle={Critical Systems: Formal Methods and Automated Verification - Joint
21st International Workshop on Formal Methods for Industrial Critical Systems
and 16th International Workshop on Automated Verification of Critical Systems,
FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings}, author={Beringer,
Steffen and Wehrheim, Heike}, editor={H. ter Beek, Maurice and Gnesi, Stefania
and Knapp, AlexanderEditors}, year={2016}, pages={189--204}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software
Architectures with Timed Automata.” In Critical Systems: Formal Methods and
Automated Verification - Joint 21st International Workshop on Formal Methods for
Industrial Critical Systems and 16th International Workshop on Automated Verification
of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings,
edited by Maurice H. ter Beek, Stefania Gnesi, and Alexander Knapp, 189--204.
Lecture Notes in Computer Science, 2016. https://doi.org/10.1007/978-3-319-45943-1_13.'
ieee: 'S. Beringer and H. Wehrheim, “Verification of AUTOSAR Software Architectures
with Timed Automata,” in Critical Systems: Formal Methods and Automated Verification
- Joint 21st International Workshop on Formal Methods for Industrial Critical
Systems and 16th International Workshop on Automated Verification of Critical
Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings,
2016, pp. 189--204.'
mla: 'Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures
with Timed Automata.” Critical Systems: Formal Methods and Automated Verification
- Joint 21st International Workshop on Formal Methods for Industrial Critical
Systems and 16th International Workshop on Automated Verification of Critical
Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings,
edited by Maurice H. ter Beek et al., 2016, pp. 189--204, doi:10.1007/978-3-319-45943-1_13.'
short: 'S. Beringer, H. Wehrheim, in: M. H. ter Beek, S. Gnesi, A. Knapp (Eds.),
Critical Systems: Formal Methods and Automated Verification - Joint 21st International
Workshop on Formal Methods for Industrial Critical Systems and 16th International
Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa,
Italy, September 26-28, 2016, Proceedings, 2016, pp. 189--204.'
date_created: 2018-06-13T07:39:35Z
date_updated: 2022-01-06T06:59:01Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1007/978-3-319-45943-1_13
editor:
- first_name: Maurice
full_name: H. ter Beek, Maurice
last_name: H. ter Beek
- first_name: Stefania
full_name: Gnesi, Stefania
last_name: Gnesi
- first_name: Alexander
full_name: Knapp, Alexander
last_name: Knapp
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:17:13Z
date_updated: 2018-11-02T14:17:13Z
file_id: '5267'
file_name: VerificationOfAUTOSARSoftwareA.pdf
file_size: 2640695
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:17:13Z
has_accepted_license: '1'
language:
- iso: eng
page: 189--204
project:
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subproject B3
publication: 'Critical Systems: Formal Methods and Automated Verification - Joint
21st International Workshop on Formal Methods for Industrial Critical Systems and
16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS
2016, Pisa, Italy, September 26-28, 2016, Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: Verification of AUTOSAR Software Architectures with Timed Automata
type: conference
user_id: '477'
year: '2016'
...
---
_id: '3158'
author:
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Travkin O, Wehrheim H. Verification of Concurrent Programs on Weak Memory
Models. In: Sampaio A, Wang F, eds. Theoretical Aspects of Computing - {ICTAC}
2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016,
Proceedings. Lecture Notes in Computer Science. ; 2016:3--24. doi:10.1007/978-3-319-46750-4_1'
apa: Travkin, O., & Wehrheim, H. (2016). Verification of Concurrent Programs
on Weak Memory Models. In A. Sampaio & F. Wang (Eds.), Theoretical Aspects
of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC,
October 24-31, 2016, Proceedings (pp. 3--24). https://doi.org/10.1007/978-3-319-46750-4_1
bibtex: '@inproceedings{Travkin_Wehrheim_2016, series={Lecture Notes in Computer
Science}, title={Verification of Concurrent Programs on Weak Memory Models}, DOI={10.1007/978-3-319-46750-4_1},
booktitle={Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International
Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings}, author={Travkin,
Oleg and Wehrheim, Heike}, editor={Sampaio, Augusto and Wang, FarnEditors}, year={2016},
pages={3--24}, collection={Lecture Notes in Computer Science} }'
chicago: Travkin, Oleg, and Heike Wehrheim. “Verification of Concurrent Programs
on Weak Memory Models.” In Theoretical Aspects of Computing - {ICTAC} 2016
- 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings,
edited by Augusto Sampaio and Farn Wang, 3--24. Lecture Notes in Computer Science,
2016. https://doi.org/10.1007/978-3-319-46750-4_1.
ieee: O. Travkin and H. Wehrheim, “Verification of Concurrent Programs on Weak Memory
Models,” in Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International
Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings, 2016, pp.
3--24.
mla: Travkin, Oleg, and Heike Wehrheim. “Verification of Concurrent Programs on
Weak Memory Models.” Theoretical Aspects of Computing - {ICTAC} 2016 - 13th
International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings,
edited by Augusto Sampaio and Farn Wang, 2016, pp. 3--24, doi:10.1007/978-3-319-46750-4_1.
short: 'O. Travkin, H. Wehrheim, in: A. Sampaio, F. Wang (Eds.), Theoretical Aspects
of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC,
October 24-31, 2016, Proceedings, 2016, pp. 3--24.'
date_created: 2018-06-13T07:41:07Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-46750-4_1
editor:
- first_name: Augusto
full_name: Sampaio, Augusto
last_name: Sampaio
- first_name: Farn
full_name: Wang, Farn
last_name: Wang
page: 3--24
publication: Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International
Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Verification of Concurrent Programs on Weak Memory Models
type: conference
user_id: '29719'
year: '2016'
...
---
_id: '3159'
author:
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Schellhorn G, Travkin O, Wehrheim H. Towards a Thread-Local Proof Technique
for Starvation Freedom. In: Huisman M, ed. Integrated Formal Methods - 12th
International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings.
Lecture Notes in Computer Science. ; 2016:193--209. doi:10.1007/978-3-319-33693-0_13'
apa: Schellhorn, G., Travkin, O., & Wehrheim, H. (2016). Towards a Thread-Local
Proof Technique for Starvation Freedom. In M. Huisman (Ed.), Integrated Formal
Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June
1-5, 2016, Proceedings (pp. 193--209). https://doi.org/10.1007/978-3-319-33693-0_13
bibtex: '@inproceedings{Schellhorn_Travkin_Wehrheim_2016, series={Lecture Notes
in Computer Science}, title={Towards a Thread-Local Proof Technique for Starvation
Freedom}, DOI={10.1007/978-3-319-33693-0_13},
booktitle={Integrated Formal Methods - 12th International Conference, {IFM} 2016,
Reykjavik, Iceland, June 1-5, 2016, Proceedings}, author={Schellhorn, Gerhard
and Travkin, Oleg and Wehrheim, Heike}, editor={Huisman, MariekeEditor}, year={2016},
pages={193--209}, collection={Lecture Notes in Computer Science} }'
chicago: Schellhorn, Gerhard, Oleg Travkin, and Heike Wehrheim. “Towards a Thread-Local
Proof Technique for Starvation Freedom.” In Integrated Formal Methods - 12th
International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings,
edited by Marieke Huisman, 193--209. Lecture Notes in Computer Science, 2016.
https://doi.org/10.1007/978-3-319-33693-0_13.
ieee: G. Schellhorn, O. Travkin, and H. Wehrheim, “Towards a Thread-Local Proof
Technique for Starvation Freedom,” in Integrated Formal Methods - 12th International
Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings, 2016,
pp. 193--209.
mla: Schellhorn, Gerhard, et al. “Towards a Thread-Local Proof Technique for Starvation
Freedom.” Integrated Formal Methods - 12th International Conference, {IFM}
2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings, edited by Marieke Huisman,
2016, pp. 193--209, doi:10.1007/978-3-319-33693-0_13.
short: 'G. Schellhorn, O. Travkin, H. Wehrheim, in: M. Huisman (Ed.), Integrated
Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland,
June 1-5, 2016, Proceedings, 2016, pp. 193--209.'
date_created: 2018-06-13T07:42:34Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-33693-0_13
editor:
- first_name: Marieke
full_name: Huisman, Marieke
last_name: Huisman
page: 193--209
publication: Integrated Formal Methods - 12th International Conference, {IFM} 2016,
Reykjavik, Iceland, June 1-5, 2016, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Towards a Thread-Local Proof Technique for Starvation Freedom
type: conference
user_id: '29719'
year: '2016'
...
---
_id: '3160'
author:
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Doherty S, Dongol B, Derrick J, Schellhorn G, Wehrheim H. Proving Opacity
of a Pessimistic {STM}. In: Fatourou P, Jim{\’{e}}nez E, Pedone F, eds. 20th
International Conference on Principles of Distributed Systems, {OPODIS} 2016,
December 13-16, 2016, Madrid, Spain. LIPIcs. ; 2016:35:1--35:17. doi:10.4230/LIPIcs.OPODIS.2016.35'
apa: Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., & Wehrheim, H. (2016).
Proving Opacity of a Pessimistic {STM}. In P. Fatourou, E. Jim{\’{e}}nez, &
F. Pedone (Eds.), 20th International Conference on Principles of Distributed
Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain (pp. 35:1--35:17).
https://doi.org/10.4230/LIPIcs.OPODIS.2016.35
bibtex: '@inproceedings{Doherty_Dongol_Derrick_Schellhorn_Wehrheim_2016, series={LIPIcs},
title={Proving Opacity of a Pessimistic {STM}}, DOI={10.4230/LIPIcs.OPODIS.2016.35},
booktitle={20th International Conference on Principles of Distributed Systems,
{OPODIS} 2016, December 13-16, 2016, Madrid, Spain}, author={Doherty, Simon and
Dongol, Brijesh and Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike},
editor={Fatourou, Panagiota and Jim{\’{e}}nez, Ernesto and Pedone, FernandoEditors},
year={2016}, pages={35:1--35:17}, collection={LIPIcs} }'
chicago: Doherty, Simon, Brijesh Dongol, John Derrick, Gerhard Schellhorn, and Heike
Wehrheim. “Proving Opacity of a Pessimistic {STM}.” In 20th International Conference
on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid,
Spain, edited by Panagiota Fatourou, Ernesto Jim{\’{e}}nez, and Fernando Pedone,
35:1--35:17. LIPIcs, 2016. https://doi.org/10.4230/LIPIcs.OPODIS.2016.35.
ieee: S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, and H. Wehrheim, “Proving
Opacity of a Pessimistic {STM},” in 20th International Conference on Principles
of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain,
2016, pp. 35:1--35:17.
mla: Doherty, Simon, et al. “Proving Opacity of a Pessimistic {STM}.” 20th International
Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16,
2016, Madrid, Spain, edited by Panagiota Fatourou et al., 2016, pp. 35:1--35:17,
doi:10.4230/LIPIcs.OPODIS.2016.35.
short: 'S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, H. Wehrheim, in: P. Fatourou,
E. Jim{\’{e}}nez, F. Pedone (Eds.), 20th International Conference on Principles
of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain, 2016,
pp. 35:1--35:17.'
date_created: 2018-06-13T07:44:15Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.4230/LIPIcs.OPODIS.2016.35
editor:
- first_name: Panagiota
full_name: Fatourou, Panagiota
last_name: Fatourou
- first_name: Ernesto
full_name: Jim{\'{e}}nez, Ernesto
last_name: Jim{\'{e}}nez
- first_name: Fernando
full_name: Pedone, Fernando
last_name: Pedone
page: 35:1--35:17
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: 20th International Conference on Principles of Distributed Systems, {OPODIS}
2016, December 13-16, 2016, Madrid, Spain
series_title: LIPIcs
status: public
title: Proving Opacity of a Pessimistic {STM}
type: conference
user_id: '29719'
year: '2016'
...
---
_id: '3161'
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
- first_name: Marie{-}Christine
full_name: Jakobs, Marie{-}Christine
last_name: Jakobs
- first_name: Felix
full_name: Pauck, Felix
last_name: Pauck
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Isenberg T, Jakobs M-}Christine, Pauck F, Wehrheim H. Deriving approximation
tolerance constraints from verification runs. CoRR. 2016.
apa: Isenberg, T., Jakobs, M.-}Christine, Pauck, F., & Wehrheim, H. (2016).
Deriving approximation tolerance constraints from verification runs. CoRR.
bibtex: '@article{Isenberg_Jakobs_Pauck_Wehrheim_2016, title={Deriving approximation
tolerance constraints from verification runs}, journal={CoRR}, author={Isenberg,
Tobias and Jakobs, Marie{-}Christine and Pauck, Felix and Wehrheim, Heike}, year={2016}
}'
chicago: Isenberg, Tobias, Marie{-}Christine Jakobs, Felix Pauck, and Heike Wehrheim.
“Deriving Approximation Tolerance Constraints from Verification Runs.” CoRR,
2016.
ieee: T. Isenberg, M.-}Christine Jakobs, F. Pauck, and H. Wehrheim, “Deriving approximation
tolerance constraints from verification runs,” CoRR, 2016.
mla: Isenberg, Tobias, et al. “Deriving Approximation Tolerance Constraints from
Verification Runs.” CoRR, 2016.
short: T. Isenberg, M.-}Christine Jakobs, F. Pauck, H. Wehrheim, CoRR (2016).
date_created: 2018-06-13T07:45:27Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
publication: CoRR
status: public
title: Deriving approximation tolerance constraints from verification runs
type: journal_article
user_id: '29719'
year: '2016'
...
---
_id: '175'
abstract:
- lang: eng
text: Today, service compositions often need to be assembled or changed on-the-fly,
which leaves only little time for quality assurance. Moreover, quality assurance
is complicated by service providers only giving information on their services
in terms of domain specific concepts with only limited semantic meaning.In this
paper, we propose a method for constructing service compositions based on pre-verified
templates. Templates, given as workflow descriptions, are typed over a (domain-independent)
template ontology defining concepts and predicates. Their meaning is defined by
an abstract semantics, leaving the specific meaning of ontology concepts open,
however, only up to given ontology rules. Templates are proven correct using a
Hoare-style proof calculus, extended by a specific rule for service calls. Construction
of service compositions amounts to instantiation of templates with domain-specific
services. Correctness of an instantiation can then simply be checked by verifying
that the domain ontology (a) adheres to the rules of the template ontology, and
(b) fulfills the constraints of the employed template.
author:
- first_name: Sven
full_name: Walther, Sven
last_name: Walther
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Walther S, Wehrheim H. On-The-Fly Construction of Provably Correct Service
Compositions - Templates and Proofs. Science of Computer Programming. 2016:2--23.
doi:10.1016/j.scico.2016.04.002
apa: Walther, S., & Wehrheim, H. (2016). On-The-Fly Construction of Provably
Correct Service Compositions - Templates and Proofs. Science of Computer Programming,
2--23. https://doi.org/10.1016/j.scico.2016.04.002
bibtex: '@article{Walther_Wehrheim_2016, title={On-The-Fly Construction of Provably
Correct Service Compositions - Templates and Proofs}, DOI={10.1016/j.scico.2016.04.002},
journal={Science of Computer Programming}, publisher={Elsevier}, author={Walther,
Sven and Wehrheim, Heike}, year={2016}, pages={2--23} }'
chicago: Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably
Correct Service Compositions - Templates and Proofs.” Science of Computer Programming,
2016, 2--23. https://doi.org/10.1016/j.scico.2016.04.002.
ieee: S. Walther and H. Wehrheim, “On-The-Fly Construction of Provably Correct Service
Compositions - Templates and Proofs,” Science of Computer Programming,
pp. 2--23, 2016.
mla: Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably Correct
Service Compositions - Templates and Proofs.” Science of Computer Programming,
Elsevier, 2016, pp. 2--23, doi:10.1016/j.scico.2016.04.002.
short: S. Walther, H. Wehrheim, Science of Computer Programming (2016) 2--23.
date_created: 2017-10-17T12:41:26Z
date_updated: 2022-01-06T06:53:13Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.scico.2016.04.002
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:38:40Z
date_updated: 2018-03-21T12:38:40Z
file_id: '1536'
file_name: 175-1-s2.0-S0167642316300028-main.pdf
file_size: 630739
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:38:40Z
has_accepted_license: '1'
language:
- iso: eng
page: 2--23
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Science of Computer Programming
publisher: Elsevier
status: public
title: On-The-Fly Construction of Provably Correct Service Compositions - Templates
and Proofs
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '186'
abstract:
- lang: eng
text: Software verification is an established method to ensure software safety.
Nevertheless, verification still often fails, either because it consumes too much
resources, e.g., time or memory, or the technique is not mature enough to verify
the property. Often then discarding the partial verification, the validation process
proceeds with techniques like testing.To enable standard testing to profit from
previous, partial verification, we use a summary of the verification effort to
simplify the program for subsequent testing. Our techniques use this summary to
construct a residual program which only contains program paths with unproven assertions.
Afterwards, the residual program can be used with standard testing tools.Our first
experiments show that testing profits from the partial verification.The test effort
is reduced and combined verification and testing is faster than a complete verification.
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: Jens
Knoop UZ, ed. Software Engineering 2016. Lecture Notes in Informatics.
; 2016:17-18.'
apa: Czech, M., Jakobs, M.-C., & Wehrheim, H. (2016). Just test what you cannot
verify! In U. Z. Jens Knoop (Ed.), Software Engineering 2016 (pp. 17–18).
bibtex: '@inproceedings{Czech_Jakobs_Wehrheim_2016, series={Lecture Notes in Informatics},
title={Just test what you cannot verify!}, booktitle={Software Engineering 2016},
author={Czech, Mike and Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Jens
Knoop, Uwe ZdunEditor}, year={2016}, pages={17–18}, collection={Lecture Notes
in Informatics} }'
chicago: Czech, Mike, Marie-Christine Jakobs, and Heike Wehrheim. “Just Test What
You Cannot Verify!” In Software Engineering 2016, edited by Uwe Zdun Jens
Knoop, 17–18. Lecture Notes in Informatics, 2016.
ieee: M. Czech, M.-C. Jakobs, and H. Wehrheim, “Just test what you cannot verify!,”
in Software Engineering 2016, 2016, pp. 17–18.
mla: Czech, Mike, et al. “Just Test What You Cannot Verify!” Software Engineering
2016, edited by Uwe Zdun Jens Knoop, 2016, pp. 17–18.
short: 'M. Czech, M.-C. Jakobs, H. Wehrheim, in: U.Z. Jens Knoop (Ed.), Software
Engineering 2016, 2016, pp. 17–18.'
date_created: 2017-10-17T12:41:28Z
date_updated: 2022-01-06T06:53:43Z
ddc:
- '040'
department:
- _id: '77'
editor:
- first_name: Uwe Zdun
full_name: Jens Knoop, Uwe Zdun
last_name: Jens Knoop
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:32:11Z
date_updated: 2018-03-21T12:32:11Z
file_id: '1532'
file_name: 186-SEsubmission8.pdf
file_size: 55775
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:32:11Z
has_accepted_license: '1'
language:
- iso: eng
page: 17-18
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Software Engineering 2016
series_title: Lecture Notes in Informatics
status: public
title: Just test what you cannot verify!
type: conference
user_id: '477'
year: '2016'
...
---
_id: '224'
abstract:
- lang: eng
text: In modern software development, paradigms like component-based software engineering
(CBSE) and service-oriented architectures (SOA) emphasize the construction of
large software systems out of existing components or services. Therein, a service
is a self-contained piece of software, which adheres to a specified interface.
In a model-based software design, this interface constitutes our sole knowledge
of the service at design time, while service implementations are not available.
Therefore, correctness checks or detection of potential errors in service compositions
has to be carried out without the possibility of executing services. This challenges
the usage of standard software error localization techniques for service compositions.
In this paper, we review state-of-the-art approaches for error localization of
software and discuss their applicability to service compositions.
author:
- first_name: Julia
full_name: Krämer, Julia
last_name: Krämer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Krämer J, Wehrheim H. A short survey on using software error localization
for service compositions. In: Proceedings of the 5th European Conference on
Service-Oriented and Cloud Computing (ESOCC 2016). LNCS. ; 2016:248--262.
doi:10.1007/978-3-319-44482-6_16'
apa: Krämer, J., & Wehrheim, H. (2016). A short survey on using software error
localization for service compositions. In Proceedings of the 5th European Conference
on Service-Oriented and Cloud Computing (ESOCC 2016) (pp. 248--262). https://doi.org/10.1007/978-3-319-44482-6_16
bibtex: '@inproceedings{Krämer_Wehrheim_2016, series={LNCS}, title={A short survey
on using software error localization for service compositions}, DOI={10.1007/978-3-319-44482-6_16},
booktitle={Proceedings of the 5th European Conference on Service-Oriented and
Cloud Computing (ESOCC 2016)}, author={Krämer, Julia and Wehrheim, Heike}, year={2016},
pages={248--262}, collection={LNCS} }'
chicago: Krämer, Julia, and Heike Wehrheim. “A Short Survey on Using Software Error
Localization for Service Compositions.” In Proceedings of the 5th European
Conference on Service-Oriented and Cloud Computing (ESOCC 2016), 248--262.
LNCS, 2016. https://doi.org/10.1007/978-3-319-44482-6_16.
ieee: J. Krämer and H. Wehrheim, “A short survey on using software error localization
for service compositions,” in Proceedings of the 5th European Conference on
Service-Oriented and Cloud Computing (ESOCC 2016), 2016, pp. 248--262.
mla: Krämer, Julia, and Heike Wehrheim. “A Short Survey on Using Software Error
Localization for Service Compositions.” Proceedings of the 5th European Conference
on Service-Oriented and Cloud Computing (ESOCC 2016), 2016, pp. 248--262,
doi:10.1007/978-3-319-44482-6_16.
short: 'J. Krämer, H. Wehrheim, in: Proceedings of the 5th European Conference on
Service-Oriented and Cloud Computing (ESOCC 2016), 2016, pp. 248--262.'
date_created: 2017-10-17T12:41:35Z
date_updated: 2022-01-06T06:55:32Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-44482-6_16
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:35:04Z
date_updated: 2018-03-21T10:35:04Z
file_id: '1509'
file_name: 224-chp_3A10.1007_2F978-3-319-44482-6_16.pdf
file_size: 389042
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:35:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 248--262
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 5th European Conference on Service-Oriented and Cloud
Computing (ESOCC 2016)
series_title: LNCS
status: public
title: A short survey on using software error localization for service compositions
type: conference
user_id: '477'
year: '2016'
...
---
_id: '226'
abstract:
- lang: eng
text: Error detection, localization and correction are time-intensive tasks in software
development, but crucial to deliver functionally correct products. Thus, automated
approaches to these tasks have been intensively studied for standard software
systems. For model-based software systems, the situation is different. While error
detection is still well-studied, error localization and correction is a less-studied
domain. In this paper, we examine error localization and correction for models
of service compositions. Based on formal definitions of error and correction in
this context, we show that the classical approach of error localization and correction,
i.e. first determining a set of suspicious statements and then proposing changes
to these statements, is ineffective in our context. In fact, it lessens the chance
to succeed in finding a correction at all.In this paper, we introduce correction
proposal as a novel approach on error correction in service compositions integrating
error localization and correction in one combined step. In addition, we provide
an algorithm to compute such correction proposals automatically.
author:
- first_name: Julia
full_name: Krämer, Julia
last_name: Krämer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Krämer J, Wehrheim H. A Formal Approach to Error Localization and Correction
in Service Compositions. In: Proceedings of the 1st International Workshop
on Formal to Practical Software Verification and Composition (VeryComp 2016).
LNCS. ; 2016:445--457. doi:10.1007/978-3-319-50230-4_35'
apa: Krämer, J., & Wehrheim, H. (2016). A Formal Approach to Error Localization
and Correction in Service Compositions. In Proceedings of the 1st International
Workshop on Formal to Practical Software Verification and Composition (VeryComp
2016) (pp. 445--457). https://doi.org/10.1007/978-3-319-50230-4_35
bibtex: '@inproceedings{Krämer_Wehrheim_2016, series={LNCS}, title={A Formal Approach
to Error Localization and Correction in Service Compositions}, DOI={10.1007/978-3-319-50230-4_35},
booktitle={Proceedings of the 1st International Workshop on Formal to Practical
Software Verification and Composition (VeryComp 2016)}, author={Krämer, Julia
and Wehrheim, Heike}, year={2016}, pages={445--457}, collection={LNCS} }'
chicago: Krämer, Julia, and Heike Wehrheim. “A Formal Approach to Error Localization
and Correction in Service Compositions.” In Proceedings of the 1st International
Workshop on Formal to Practical Software Verification and Composition (VeryComp
2016), 445--457. LNCS, 2016. https://doi.org/10.1007/978-3-319-50230-4_35.
ieee: J. Krämer and H. Wehrheim, “A Formal Approach to Error Localization and Correction
in Service Compositions,” in Proceedings of the 1st International Workshop
on Formal to Practical Software Verification and Composition (VeryComp 2016),
2016, pp. 445--457.
mla: Krämer, Julia, and Heike Wehrheim. “A Formal Approach to Error Localization
and Correction in Service Compositions.” Proceedings of the 1st International
Workshop on Formal to Practical Software Verification and Composition (VeryComp
2016), 2016, pp. 445--457, doi:10.1007/978-3-319-50230-4_35.
short: 'J. Krämer, H. Wehrheim, in: Proceedings of the 1st International Workshop
on Formal to Practical Software Verification and Composition (VeryComp 2016),
2016, pp. 445--457.'
date_created: 2017-10-17T12:41:36Z
date_updated: 2022-01-06T06:55:37Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-50230-4_35
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:34:08Z
date_updated: 2018-03-21T10:34:08Z
file_id: '1507'
file_name: 226-chp_3A10.1007_2F978-3-319-50230-4_35.pdf
file_size: 492018
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:34:08Z
has_accepted_license: '1'
language:
- iso: eng
page: 445--457
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 1st International Workshop on Formal to Practical
Software Verification and Composition (VeryComp 2016)
series_title: LNCS
status: public
title: A Formal Approach to Error Localization and Correction in Service Compositions
type: conference
user_id: '477'
year: '2016'
...
---
_id: '227'
abstract:
- lang: eng
text: Information flow analysis studies the flow of data between program entities
(e.g. variables), where the allowed flow is specified via security policies. Typical
information flow analyses compute a conservative (over-)approximation of the flows
in a program. Such an analysis may thus signal non-existing violations of the
security policy.In this paper, we propose a new technique for inspecting the reported
violations (counterexamples) for spuriousity. Similar to counterexample-guided-abstraction-refinement
(CEGAR) in software verification, we use the result of this inspection to improve
the next round of the analysis. We prove soundness of this scheme.
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. A CEGAR Scheme for Information Flow Analysis. In: Proceedings
of the 18th International Conference on Formal Engineering Methods (ICFEM 2016).
LNCS. ; 2016:466--483. doi:10.1007/978-3-319-47846-3_29'
apa: Töws, M., & Wehrheim, H. (2016). A CEGAR Scheme for Information Flow Analysis.
In Proceedings of the 18th International Conference on Formal Engineering Methods
(ICFEM 2016) (pp. 466--483). https://doi.org/10.1007/978-3-319-47846-3_29
bibtex: '@inproceedings{Töws_Wehrheim_2016, series={LNCS}, title={A CEGAR Scheme
for Information Flow Analysis}, DOI={10.1007/978-3-319-47846-3_29},
booktitle={Proceedings of the 18th International Conference on Formal Engineering
Methods (ICFEM 2016)}, author={Töws, Manuel and Wehrheim, Heike}, year={2016},
pages={466--483}, collection={LNCS} }'
chicago: Töws, Manuel, and Heike Wehrheim. “A CEGAR Scheme for Information Flow
Analysis.” In Proceedings of the 18th International Conference on Formal Engineering
Methods (ICFEM 2016), 466--483. LNCS, 2016. https://doi.org/10.1007/978-3-319-47846-3_29.
ieee: M. Töws and H. Wehrheim, “A CEGAR Scheme for Information Flow Analysis,” in
Proceedings of the 18th International Conference on Formal Engineering Methods
(ICFEM 2016), 2016, pp. 466--483.
mla: Töws, Manuel, and Heike Wehrheim. “A CEGAR Scheme for Information Flow Analysis.”
Proceedings of the 18th International Conference on Formal Engineering Methods
(ICFEM 2016), 2016, pp. 466--483, doi:10.1007/978-3-319-47846-3_29.
short: 'M. Töws, H. Wehrheim, in: Proceedings of the 18th International Conference
on Formal Engineering Methods (ICFEM 2016), 2016, pp. 466--483.'
date_created: 2017-10-17T12:41:36Z
date_updated: 2022-01-06T06:55:39Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-47846-3_29
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:33:38Z
date_updated: 2018-03-21T10:33:38Z
file_id: '1506'
file_name: 227-chp_3A10.1007_2F978-3-319-47846-3_29.pdf
file_size: 682849
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:33:38Z
has_accepted_license: '1'
language:
- iso: eng
page: 466--483
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 18th International Conference on Formal Engineering
Methods (ICFEM 2016)
series_title: LNCS
status: public
title: A CEGAR Scheme for Information Flow Analysis
type: conference
user_id: '477'
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'
...