---
_id: '35426'
author:
- first_name: Cedric
full_name: Richter, Cedric
id: '50003'
last_name: Richter
- first_name: Jan Frederik
full_name: Haltermann, Jan Frederik
id: '44413'
last_name: Haltermann
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Stefan
full_name: Schott, Stefan
id: '54847'
last_name: Schott
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Richter C, Haltermann JF, Jakobs M-C, Pauck F, Schott S, Wehrheim H. Are Neural
Bug Detectors Comparable to Software Developers on Variable Misuse Bugs? In: 37th
IEEE/ACM International Conference on Automated Software Engineering. ACM;
2023. doi:10.1145/3551349.3561156'
apa: Richter, C., Haltermann, J. F., Jakobs, M.-C., Pauck, F., Schott, S., &
Wehrheim, H. (2023). Are Neural Bug Detectors Comparable to Software Developers
on Variable Misuse Bugs? 37th IEEE/ACM International Conference on Automated
Software Engineering. https://doi.org/10.1145/3551349.3561156
bibtex: '@inproceedings{Richter_Haltermann_Jakobs_Pauck_Schott_Wehrheim_2023, title={Are
Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?},
DOI={10.1145/3551349.3561156},
booktitle={37th IEEE/ACM International Conference on Automated Software Engineering},
publisher={ACM}, author={Richter, Cedric and Haltermann, Jan Frederik and Jakobs,
Marie-Christine and Pauck, Felix and Schott, Stefan and Wehrheim, Heike}, year={2023}
}'
chicago: Richter, Cedric, Jan Frederik Haltermann, Marie-Christine Jakobs, Felix
Pauck, Stefan Schott, and Heike Wehrheim. “Are Neural Bug Detectors Comparable
to Software Developers on Variable Misuse Bugs?” In 37th IEEE/ACM International
Conference on Automated Software Engineering. ACM, 2023. https://doi.org/10.1145/3551349.3561156.
ieee: 'C. Richter, J. F. Haltermann, M.-C. Jakobs, F. Pauck, S. Schott, and H. Wehrheim,
“Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse
Bugs?,” 2023, doi: 10.1145/3551349.3561156.'
mla: Richter, Cedric, et al. “Are Neural Bug Detectors Comparable to Software Developers
on Variable Misuse Bugs?” 37th IEEE/ACM International Conference on Automated
Software Engineering, ACM, 2023, doi:10.1145/3551349.3561156.
short: 'C. Richter, J.F. Haltermann, M.-C. Jakobs, F. Pauck, S. Schott, H. Wehrheim,
in: 37th IEEE/ACM International Conference on Automated Software Engineering,
ACM, 2023.'
date_created: 2023-01-09T06:28:44Z
date_updated: 2023-01-19T13:50:18Z
department:
- _id: '77'
doi: 10.1145/3551349.3561156
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/3551349.3561156
oa: '1'
project:
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '12'
name: 'SFB 901 - B4: SFB 901 - Subproject B4'
- _id: '1'
name: 'SFB 901: SFB 901'
publication: 37th IEEE/ACM International Conference on Automated Software Engineering
publication_status: published
publisher: ACM
status: public
title: Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse
Bugs?
type: conference
user_id: '477'
year: '2023'
...
---
_id: '36848'
author:
- first_name: Stefan
full_name: Schott, Stefan
id: '54847'
last_name: Schott
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
citation:
ama: 'Schott S, Pauck F. Benchmark Fuzzing for Android Taint Analyses. In: 2022
IEEE 22nd International Working Conference on Source Code Analysis and Manipulation
(SCAM). IEEE; 2023. doi:10.1109/scam55253.2022.00007'
apa: Schott, S., & Pauck, F. (2023). Benchmark Fuzzing for Android Taint Analyses.
2022 IEEE 22nd International Working Conference on Source Code Analysis and
Manipulation (SCAM). https://doi.org/10.1109/scam55253.2022.00007
bibtex: '@inproceedings{Schott_Pauck_2023, title={Benchmark Fuzzing for Android
Taint Analyses}, DOI={10.1109/scam55253.2022.00007},
booktitle={2022 IEEE 22nd International Working Conference on Source Code Analysis
and Manipulation (SCAM)}, publisher={IEEE}, author={Schott, Stefan and Pauck,
Felix}, year={2023} }'
chicago: Schott, Stefan, and Felix Pauck. “Benchmark Fuzzing for Android Taint Analyses.”
In 2022 IEEE 22nd International Working Conference on Source Code Analysis
and Manipulation (SCAM). IEEE, 2023. https://doi.org/10.1109/scam55253.2022.00007.
ieee: 'S. Schott and F. Pauck, “Benchmark Fuzzing for Android Taint Analyses,” 2023,
doi: 10.1109/scam55253.2022.00007.'
mla: Schott, Stefan, and Felix Pauck. “Benchmark Fuzzing for Android Taint Analyses.”
2022 IEEE 22nd International Working Conference on Source Code Analysis and
Manipulation (SCAM), IEEE, 2023, doi:10.1109/scam55253.2022.00007.
short: 'S. Schott, F. Pauck, in: 2022 IEEE 22nd International Working Conference
on Source Code Analysis and Manipulation (SCAM), IEEE, 2023.'
date_created: 2023-01-16T07:17:12Z
date_updated: 2023-01-19T13:49:06Z
department:
- _id: '77'
doi: 10.1109/scam55253.2022.00007
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/10006876
project:
- _id: '107'
name: 'SFB 901 - T3: SFB 901 -Subproject T3'
- _id: '82'
name: 'SFB 901 - T: SFB 901 - Project Area T'
- _id: '1'
name: 'SFB 901: SFB 901'
publication: 2022 IEEE 22nd International Working Conference on Source Code Analysis
and Manipulation (SCAM)
publication_status: published
publisher: IEEE
status: public
title: Benchmark Fuzzing for Android Taint Analyses
type: conference
user_id: '477'
year: '2023'
...
---
_id: '35427'
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
citation:
ama: 'Pauck F. Scaling Arbitrary Android App Analyses. In: 37th IEEE/ACM International
Conference on Automated Software Engineering. ACM; 2023. doi:10.1145/3551349.3561339'
apa: Pauck, F. (2023). Scaling Arbitrary Android App Analyses. 37th IEEE/ACM
International Conference on Automated Software Engineering. https://doi.org/10.1145/3551349.3561339
bibtex: '@inproceedings{Pauck_2023, title={Scaling Arbitrary Android App Analyses},
DOI={10.1145/3551349.3561339},
booktitle={37th IEEE/ACM International Conference on Automated Software Engineering},
publisher={ACM}, author={Pauck, Felix}, year={2023} }'
chicago: Pauck, Felix. “Scaling Arbitrary Android App Analyses.” In 37th IEEE/ACM
International Conference on Automated Software Engineering. ACM, 2023. https://doi.org/10.1145/3551349.3561339.
ieee: 'F. Pauck, “Scaling Arbitrary Android App Analyses,” 2023, doi: 10.1145/3551349.3561339.'
mla: Pauck, Felix. “Scaling Arbitrary Android App Analyses.” 37th IEEE/ACM International
Conference on Automated Software Engineering, ACM, 2023, doi:10.1145/3551349.3561339.
short: 'F. Pauck, in: 37th IEEE/ACM International Conference on Automated Software
Engineering, ACM, 2023.'
date_created: 2023-01-09T06:32:33Z
date_updated: 2023-01-19T13:49:52Z
department:
- _id: '77'
doi: 10.1145/3551349.3561339
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/3551349.3561339
oa: '1'
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '12'
name: 'SFB 901 - B4: SFB 901 - Subproject B4'
publication: 37th IEEE/ACM International Conference on Automated Software Engineering
publication_status: published
publisher: ACM
status: public
title: Scaling Arbitrary Android App Analyses
type: conference
user_id: '477'
year: '2023'
...
---
_id: '43108'
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
citation:
ama: Pauck F. Cooperative Android App Analysis. Paderborn University; 2023.
doi:10.17619/UNIPB/1-1698
apa: Pauck, F. (2023). Cooperative Android App Analysis. Paderborn University.
https://doi.org/10.17619/UNIPB/1-1698
bibtex: '@book{Pauck_2023, title={Cooperative Android App Analysis}, DOI={10.17619/UNIPB/1-1698},
publisher={Paderborn University}, author={Pauck, Felix}, year={2023} }'
chicago: Pauck, Felix. Cooperative Android App Analysis. Paderborn University,
2023. https://doi.org/10.17619/UNIPB/1-1698.
ieee: F. Pauck, Cooperative Android App Analysis. Paderborn University, 2023.
mla: Pauck, Felix. Cooperative Android App Analysis. Paderborn University,
2023, doi:10.17619/UNIPB/1-1698.
short: F. Pauck, Cooperative Android App Analysis, Paderborn University, 2023.
date_created: 2023-03-27T07:39:35Z
date_updated: 2023-05-22T04:57:42Z
department:
- _id: '77'
doi: 10.17619/UNIPB/1-1698
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '12'
name: 'SFB 901 - B4: SFB 901 - Subproject B4'
publisher: Paderborn University
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Cooperative Android App Analysis
type: dissertation
user_id: '22398'
year: '2023'
...
---
_id: '47833'
author:
- first_name: Jürgen
full_name: König, Jürgen
last_name: König
citation:
ama: König J. On the Membership and Correctness Problem for State Serializability
and Value Opacity.; 2023.
apa: König, J. (2023). On the Membership and Correctness Problem for State Serializability
and Value Opacity.
bibtex: '@book{König_2023, title={On the Membership and Correctness Problem for
State Serializability and Value Opacity}, author={König, Jürgen}, year={2023}
}'
chicago: König, Jürgen. On the Membership and Correctness Problem for State Serializability
and Value Opacity, 2023.
ieee: J. König, On the Membership and Correctness Problem for State Serializability
and Value Opacity. 2023.
mla: König, Jürgen. On the Membership and Correctness Problem for State Serializability
and Value Opacity. 2023.
short: J. König, On the Membership and Correctness Problem for State Serializability
and Value Opacity, 2023.
date_created: 2023-10-06T12:41:35Z
date_updated: 2023-10-06T12:41:42Z
department:
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '11'
name: 'SFB 901 - B3: SFB 901 - Subproject B3'
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: On the Membership and Correctness Problem for State Serializability and Value
Opacity
type: dissertation
user_id: '15504'
year: '2023'
...
---
_id: '32590'
author:
- first_name: Cedric
full_name: Richter, Cedric
id: '50003'
last_name: Richter
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Richter C, Wehrheim H. Learning Realistic Mutations: Bug Creation for Neural
Bug Detectors. In: 2022 IEEE Conference on Software Testing, Verification and
Validation (ICST). ; 2022:162-173. doi:10.1109/ICST53961.2022.00027'
apa: 'Richter, C., & Wehrheim, H. (2022). Learning Realistic Mutations: Bug
Creation for Neural Bug Detectors. 2022 IEEE Conference on Software Testing,
Verification and Validation (ICST), 162–173. https://doi.org/10.1109/ICST53961.2022.00027'
bibtex: '@inproceedings{Richter_Wehrheim_2022, title={Learning Realistic Mutations:
Bug Creation for Neural Bug Detectors}, DOI={10.1109/ICST53961.2022.00027},
booktitle={2022 IEEE Conference on Software Testing, Verification and Validation
(ICST)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={162–173}
}'
chicago: 'Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug
Creation for Neural Bug Detectors.” In 2022 IEEE Conference on Software Testing,
Verification and Validation (ICST), 162–73, 2022. https://doi.org/10.1109/ICST53961.2022.00027.'
ieee: 'C. Richter and H. Wehrheim, “Learning Realistic Mutations: Bug Creation for
Neural Bug Detectors,” in 2022 IEEE Conference on Software Testing, Verification
and Validation (ICST), 2022, pp. 162–173, doi: 10.1109/ICST53961.2022.00027.'
mla: 'Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation
for Neural Bug Detectors.” 2022 IEEE Conference on Software Testing, Verification
and Validation (ICST), 2022, pp. 162–73, doi:10.1109/ICST53961.2022.00027.'
short: 'C. Richter, H. Wehrheim, in: 2022 IEEE Conference on Software Testing, Verification
and Validation (ICST), 2022, pp. 162–173.'
date_created: 2022-08-08T07:40:04Z
date_updated: 2022-11-18T09:45:40Z
department:
- _id: '77'
doi: 10.1109/ICST53961.2022.00027
language:
- iso: eng
page: 162-173
project:
- _id: '12'
name: 'SFB 901 - B4: SFB 901 - Subproject B4'
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
publication: 2022 IEEE Conference on Software Testing, Verification and Validation
(ICST)
status: public
title: 'Learning Realistic Mutations: Bug Creation for Neural Bug Detectors'
type: conference
user_id: '477'
year: '2022'
...
---
_id: '32591'
author:
- first_name: Cedric
full_name: Richter, Cedric
id: '50003'
last_name: Richter
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Richter C, Wehrheim H. TSSB-3M: Mining single statement bugs at massive scale.
In: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories
(MSR). ; 2022:418-422. doi:10.1145/3524842.3528505'
apa: 'Richter, C., & Wehrheim, H. (2022). TSSB-3M: Mining single statement bugs
at massive scale. 2022 IEEE/ACM 19th International Conference on Mining Software
Repositories (MSR), 418–422. https://doi.org/10.1145/3524842.3528505'
bibtex: '@inproceedings{Richter_Wehrheim_2022, title={TSSB-3M: Mining single statement
bugs at massive scale}, DOI={10.1145/3524842.3528505},
booktitle={2022 IEEE/ACM 19th International Conference on Mining Software Repositories
(MSR)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={418–422}
}'
chicago: 'Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement
Bugs at Massive Scale.” In 2022 IEEE/ACM 19th International Conference on Mining
Software Repositories (MSR), 418–22, 2022. https://doi.org/10.1145/3524842.3528505.'
ieee: 'C. Richter and H. Wehrheim, “TSSB-3M: Mining single statement bugs at massive
scale,” in 2022 IEEE/ACM 19th International Conference on Mining Software Repositories
(MSR), 2022, pp. 418–422, doi: 10.1145/3524842.3528505.'
mla: 'Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs
at Massive Scale.” 2022 IEEE/ACM 19th International Conference on Mining Software
Repositories (MSR), 2022, pp. 418–22, doi:10.1145/3524842.3528505.'
short: 'C. Richter, H. Wehrheim, in: 2022 IEEE/ACM 19th International Conference
on Mining Software Repositories (MSR), 2022, pp. 418–422.'
date_created: 2022-08-08T07:42:19Z
date_updated: 2022-11-18T09:45:05Z
department:
- _id: '77'
doi: 10.1145/3524842.3528505
language:
- iso: eng
page: 418-422
project:
- _id: '12'
name: 'SFB 901 - B4: SFB 901 - Subproject B4'
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
publication: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories
(MSR)
status: public
title: 'TSSB-3M: Mining single statement bugs at massive scale'
type: conference
user_id: '477'
year: '2022'
...
---
_id: '45248'
author:
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Dongol B, Schellhorn G, Wehrheim H. Weak Progressive Forward Simulation Is
Necessary and Sufficient for Strong Observational Refinement. In: Klin B, Lasota
S, Muscholl A, eds. 33rd International Conference on Concurrency Theory, CONCUR
2022, September 12-16, 2022, Warsaw, Poland. Vol 243. LIPIcs. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2022:31:1–31:23. doi:10.4230/LIPIcs.CONCUR.2022.31'
apa: Dongol, B., Schellhorn, G., & Wehrheim, H. (2022). Weak Progressive Forward
Simulation Is Necessary and Sufficient for Strong Observational Refinement. In
B. Klin, S. Lasota, & A. Muscholl (Eds.), 33rd International Conference
on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland
(Vol. 243, p. 31:1–31:23). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.CONCUR.2022.31
bibtex: '@inproceedings{Dongol_Schellhorn_Wehrheim_2022, series={LIPIcs}, title={Weak
Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational
Refinement}, volume={243}, DOI={10.4230/LIPIcs.CONCUR.2022.31},
booktitle={33rd International Conference on Concurrency Theory, CONCUR 2022, September
12-16, 2022, Warsaw, Poland}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für
Informatik}, author={Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike},
editor={Klin, Bartek and Lasota, Slawomir and Muscholl, Anca}, year={2022}, pages={31:1–31:23},
collection={LIPIcs} }'
chicago: Dongol, Brijesh, Gerhard Schellhorn, and Heike Wehrheim. “Weak Progressive
Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement.”
In 33rd International Conference on Concurrency Theory, CONCUR 2022, September
12-16, 2022, Warsaw, Poland, edited by Bartek Klin, Slawomir Lasota, and Anca
Muscholl, 243:31:1–31:23. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2022. https://doi.org/10.4230/LIPIcs.CONCUR.2022.31.
ieee: 'B. Dongol, G. Schellhorn, and H. Wehrheim, “Weak Progressive Forward Simulation
Is Necessary and Sufficient for Strong Observational Refinement,” in 33rd International
Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw,
Poland, 2022, vol. 243, p. 31:1–31:23, doi: 10.4230/LIPIcs.CONCUR.2022.31.'
mla: Dongol, Brijesh, et al. “Weak Progressive Forward Simulation Is Necessary and
Sufficient for Strong Observational Refinement.” 33rd International Conference
on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland,
edited by Bartek Klin et al., vol. 243, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2022, p. 31:1–31:23, doi:10.4230/LIPIcs.CONCUR.2022.31.
short: 'B. Dongol, G. Schellhorn, H. Wehrheim, in: B. Klin, S. Lasota, A. Muscholl
(Eds.), 33rd International Conference on Concurrency Theory, CONCUR 2022, September
12-16, 2022, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2022, p. 31:1–31:23.'
date_created: 2023-05-24T07:55:24Z
date_updated: 2023-08-28T12:24:57Z
department:
- _id: '77'
doi: 10.4230/LIPIcs.CONCUR.2022.31
editor:
- first_name: Bartek
full_name: Klin, Bartek
last_name: Klin
- first_name: Slawomir
full_name: Lasota, Slawomir
last_name: Lasota
- first_name: Anca
full_name: Muscholl, Anca
last_name: Muscholl
intvolume: ' 243'
language:
- iso: eng
page: 31:1–31:23
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '12'
name: 'SFB 901 - B4: SFB 901 - Subproject B4'
publication: 33rd International Conference on Concurrency Theory, CONCUR 2022, September
12-16, 2022, Warsaw, Poland
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong
Observational Refinement
type: conference
user_id: '477'
volume: 243
year: '2022'
...
---
_id: '28350'
abstract:
- lang: eng
text: "In recent years, we observe an increasing amount of software with machine
learning components being deployed. This poses the question of quality assurance
for such components: how can we validate whether specified requirements are fulfilled
by a machine learned software? Current testing and verification approaches either
focus on a single requirement (e.g., fairness) or specialize on a single type
of machine learning model (e.g., neural networks).\r\nIn this paper, we propose
property-driven testing of machine learning models. Our approach MLCheck encompasses
(1) a language for property specification, and (2) a technique for systematic
test case generation. The specification language is comparable to property-based
testing languages. Test case generation employs advanced verification technology
for a systematic, property dependent construction of test suites, without additional
user supplied generator functions. We evaluate MLCheck using requirements and
data sets from three different application areas (software\r\ndiscrimination,
learning on knowledge graphs and security). Our evaluation shows that despite
its generality MLCheck can even outperform specialised testing approaches while
having a comparable runtime"
author:
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
- first_name: Caglar
full_name: Demir, Caglar
id: '43817'
last_name: Demir
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Sharma A, Demir C, Ngonga Ngomo A-C, Wehrheim H. MLCHECK–Property-Driven Testing
of Machine Learning Classifiers. In: Proceedings of the 20th IEEE International
Conference on Machine Learning and Applications (ICMLA). IEEE.'
apa: Sharma, A., Demir, C., Ngonga Ngomo, A.-C., & Wehrheim, H. (n.d.). MLCHECK–Property-Driven
Testing of Machine Learning Classifiers. Proceedings of the 20th IEEE International
Conference on Machine Learning and Applications (ICMLA).
bibtex: '@inproceedings{Sharma_Demir_Ngonga Ngomo_Wehrheim, title={MLCHECK–Property-Driven
Testing of Machine Learning Classifiers}, booktitle={Proceedings of the 20th IEEE
International Conference on Machine Learning and Applications (ICMLA)}, publisher={IEEE},
author={Sharma, Arnab and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille and Wehrheim,
Heike} }'
chicago: Sharma, Arnab, Caglar Demir, Axel-Cyrille Ngonga Ngomo, and Heike Wehrheim.
“MLCHECK–Property-Driven Testing of Machine Learning Classifiers.” In Proceedings
of the 20th IEEE International Conference on Machine Learning and Applications
(ICMLA). IEEE, n.d.
ieee: A. Sharma, C. Demir, A.-C. Ngonga Ngomo, and H. Wehrheim, “MLCHECK–Property-Driven
Testing of Machine Learning Classifiers.”
mla: Sharma, Arnab, et al. “MLCHECK–Property-Driven Testing of Machine Learning
Classifiers.” Proceedings of the 20th IEEE International Conference on Machine
Learning and Applications (ICMLA), IEEE.
short: 'A. Sharma, C. Demir, A.-C. Ngonga Ngomo, H. Wehrheim, in: Proceedings of
the 20th IEEE International Conference on Machine Learning and Applications (ICMLA),
IEEE, n.d.'
date_created: 2021-12-07T11:11:36Z
date_updated: 2022-01-06T06:58:02Z
department:
- _id: '7'
- _id: '77'
- _id: '574'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '10'
name: SFB 901 - Subproject B2
publication: Proceedings of the 20th IEEE International Conference on Machine Learning
and Applications (ICMLA)
publication_status: accepted
publisher: IEEE
status: public
title: MLCHECK–Property-Driven Testing of Machine Learning Classifiers
type: conference
user_id: '477'
year: '2021'
...
---
_id: '27045'
abstract:
- lang: eng
text: 'Due to the lack of established real-world benchmark suites for static taint
analyses of Android applications, evaluations of these analyses are often restricted
and hard to compare. Even in evaluations that do use real-world apps, details
about the ground truth in those apps are rarely documented, which makes it difficult
to compare and reproduce the results. To push Android taint analysis research
forward, this paper thus recommends criteria for constructing real-world benchmark
suites for this specific domain, and presents TaintBench, the first real-world
malware benchmark suite with documented taint flows. TaintBench benchmark apps
include taint flows with complex structures, and addresses static challenges that
are commonly agreed on by the community. Together with the TaintBench suite, we
introduce the TaintBench framework, whose goal is to simplify real-world benchmarking
of Android taint analyses. First, a usability test shows that the framework improves
experts’ performance and perceived usability when documenting and inspecting taint
flows. Second, experiments using TaintBench reveal new insights for the taint
analysis tools Amandroid and FlowDroid: (i) They are less effective on real-world
malware apps than on synthetic benchmark apps. (ii) Predefined lists of sources
and sinks heavily impact the tools’ accuracy. (iii) Surprisingly, up-to-date versions
of both tools are less accurate than their predecessors.'
author:
- first_name: Linghui
full_name: Luo, Linghui
last_name: Luo
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Goran
full_name: Piskachev, Goran
id: '41936'
last_name: Piskachev
orcid: 0000-0003-4424-5838
- first_name: Manuel
full_name: Benz, Manuel
last_name: Benz
- first_name: Ivan
full_name: Pashchenko, Ivan
last_name: Pashchenko
- first_name: Martin
full_name: Mory, Martin
id: '65667'
last_name: Mory
orcid: 0000-0001-5609-0031
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Ben
full_name: Hermann, Ben
id: '66173'
last_name: Hermann
orcid: 0000-0001-9848-2017
- first_name: Fabio
full_name: Massacci, Fabio
last_name: Massacci
citation:
ama: 'Luo L, Pauck F, Piskachev G, et al. TaintBench: Automatic real-world malware
benchmarking of Android taint analyses. Empirical Software Engineering.
Published online 2021. doi:10.1007/s10664-021-10013-5'
apa: 'Luo, L., Pauck, F., Piskachev, G., Benz, M., Pashchenko, I., Mory, M., Bodden,
E., Hermann, B., & Massacci, F. (2021). TaintBench: Automatic real-world malware
benchmarking of Android taint analyses. Empirical Software Engineering.
https://doi.org/10.1007/s10664-021-10013-5'
bibtex: '@article{Luo_Pauck_Piskachev_Benz_Pashchenko_Mory_Bodden_Hermann_Massacci_2021,
title={TaintBench: Automatic real-world malware benchmarking of Android taint
analyses}, DOI={10.1007/s10664-021-10013-5},
journal={Empirical Software Engineering}, author={Luo, Linghui and Pauck, Felix
and Piskachev, Goran and Benz, Manuel and Pashchenko, Ivan and Mory, Martin and
Bodden, Eric and Hermann, Ben and Massacci, Fabio}, year={2021} }'
chicago: 'Luo, Linghui, Felix Pauck, Goran Piskachev, Manuel Benz, Ivan Pashchenko,
Martin Mory, Eric Bodden, Ben Hermann, and Fabio Massacci. “TaintBench: Automatic
Real-World Malware Benchmarking of Android Taint Analyses.” Empirical Software
Engineering, 2021. https://doi.org/10.1007/s10664-021-10013-5.'
ieee: 'L. Luo et al., “TaintBench: Automatic real-world malware benchmarking
of Android taint analyses,” Empirical Software Engineering, 2021, doi:
10.1007/s10664-021-10013-5.'
mla: 'Luo, Linghui, et al. “TaintBench: Automatic Real-World Malware Benchmarking
of Android Taint Analyses.” Empirical Software Engineering, 2021, doi:10.1007/s10664-021-10013-5.'
short: L. Luo, F. Pauck, G. Piskachev, M. Benz, I. Pashchenko, M. Mory, E. Bodden,
B. Hermann, F. Massacci, Empirical Software Engineering (2021).
date_created: 2021-11-02T05:13:49Z
date_updated: 2022-01-06T06:57:32Z
ddc:
- '000'
department:
- _id: '77'
- _id: '76'
doi: 10.1007/s10664-021-10013-5
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/content/pdf/10.1007/s10664-021-10013-5.pdf
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: Empirical Software Engineering
publication_identifier:
issn:
- 1382-3256
- 1573-7616
publication_status: published
status: public
title: 'TaintBench: Automatic real-world malware benchmarking of Android taint analyses'
type: journal_article
user_id: '15249'
year: '2021'
...
---
_id: '22304'
author:
- first_name: Stefan
full_name: Schott, Stefan
id: '54847'
last_name: Schott
citation:
ama: Schott S. Android App Analysis Benchmark Case Generation. Paderborn;
2021.
apa: Schott, S. (2021). Android App Analysis Benchmark Case Generation. Paderborn.
bibtex: '@book{Schott_2021, place={Paderborn}, title={Android App Analysis Benchmark
Case Generation}, author={Schott, Stefan}, year={2021} }'
chicago: Schott, Stefan. Android App Analysis Benchmark Case Generation.
Paderborn, 2021.
ieee: S. Schott, Android App Analysis Benchmark Case Generation. Paderborn,
2021.
mla: Schott, Stefan. Android App Analysis Benchmark Case Generation. 2021.
short: S. Schott, Android App Analysis Benchmark Case Generation, Paderborn, 2021.
date_created: 2021-06-09T06:04:12Z
date_updated: 2022-01-06T06:55:31Z
ddc:
- '000'
department:
- _id: '77'
extern: '1'
file:
- access_level: open_access
content_type: application/pdf
creator: fpauck
date_created: 2021-06-09T06:01:45Z
date_updated: 2021-06-09T06:01:45Z
file_id: '22305'
file_name: Masters_Thesis_Stefan_Schott_unsigned.pdf
file_size: 1918444
relation: main_file
file_date_updated: 2021-06-09T06:01:45Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
place: Paderborn
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Android App Analysis Benchmark Case Generation
type: mastersthesis
user_id: '477'
year: '2021'
...
---
_id: '28199'
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Pauck F, Wehrheim H. Jicer: Simplifying Cooperative Android App Analysis Tasks.
In: 2021 IEEE 21st International Working Conference on Source Code Analysis
and Manipulation (SCAM). ; 2021. doi:10.1109/scam52516.2021.00031'
apa: 'Pauck, F., & Wehrheim, H. (2021). Jicer: Simplifying Cooperative Android
App Analysis Tasks. 2021 IEEE 21st International Working Conference on Source
Code Analysis and Manipulation (SCAM). https://doi.org/10.1109/scam52516.2021.00031'
bibtex: '@inproceedings{Pauck_Wehrheim_2021, title={Jicer: Simplifying Cooperative
Android App Analysis Tasks}, DOI={10.1109/scam52516.2021.00031},
booktitle={2021 IEEE 21st International Working Conference on Source Code Analysis
and Manipulation (SCAM)}, author={Pauck, Felix and Wehrheim, Heike}, year={2021}
}'
chicago: 'Pauck, Felix, and Heike Wehrheim. “Jicer: Simplifying Cooperative Android
App Analysis Tasks.” In 2021 IEEE 21st International Working Conference on
Source Code Analysis and Manipulation (SCAM), 2021. https://doi.org/10.1109/scam52516.2021.00031.'
ieee: 'F. Pauck and H. Wehrheim, “Jicer: Simplifying Cooperative Android App Analysis
Tasks,” 2021, doi: 10.1109/scam52516.2021.00031.'
mla: 'Pauck, Felix, and Heike Wehrheim. “Jicer: Simplifying Cooperative Android
App Analysis Tasks.” 2021 IEEE 21st International Working Conference on Source
Code Analysis and Manipulation (SCAM), 2021, doi:10.1109/scam52516.2021.00031.'
short: 'F. Pauck, H. Wehrheim, in: 2021 IEEE 21st International Working Conference
on Source Code Analysis and Manipulation (SCAM), 2021.'
date_created: 2021-12-01T08:53:29Z
date_updated: 2022-11-17T14:26:19Z
department:
- _id: '77'
doi: 10.1109/scam52516.2021.00031
language:
- iso: eng
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
publication: 2021 IEEE 21st International Working Conference on Source Code Analysis
and Manipulation (SCAM)
publication_status: published
status: public
title: 'Jicer: Simplifying Cooperative Android App Analysis Tasks'
type: conference
user_id: '477'
year: '2021'
...
---
_id: '21238'
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Pauck F, Wehrheim H. Cooperative Android App Analysis with CoDiDroid. In:
Koziolek A, Schaefer I, Seidl C, eds. Software Engineering 2021. Gesellschaft
für Informatik e.V.; 2021:83-84. doi:10.18420/SE2021_30 '
apa: Pauck, F., & Wehrheim, H. (2021). Cooperative Android App Analysis with
CoDiDroid. In A. Koziolek, I. Schaefer, & C. Seidl (Eds.), Software Engineering
2021 (pp. 83–84). Gesellschaft für Informatik e.V. https://doi.org/10.18420/SE2021_30
bibtex: '@inproceedings{Pauck_Wehrheim_2021, place={Bonn}, title={Cooperative Android
App Analysis with CoDiDroid}, DOI={10.18420/SE2021_30 }, booktitle={Software Engineering 2021}, publisher={Gesellschaft
für Informatik e.V.}, author={Pauck, Felix and Wehrheim, Heike}, editor={Koziolek,
Anne and Schaefer, Ina and Seidl, Christoph}, year={2021}, pages={83–84} }'
chicago: 'Pauck, Felix, and Heike Wehrheim. “Cooperative Android App Analysis with
CoDiDroid.” In Software Engineering 2021, edited by Anne Koziolek, Ina
Schaefer, and Christoph Seidl, 83–84. Bonn: Gesellschaft für Informatik e.V.,
2021. https://doi.org/10.18420/SE2021_30
.'
ieee: 'F. Pauck and H. Wehrheim, “Cooperative Android App Analysis with CoDiDroid,”
in Software Engineering 2021, 2021, pp. 83–84, doi: 10.18420/SE2021_30 .'
mla: Pauck, Felix, and Heike Wehrheim. “Cooperative Android App Analysis with CoDiDroid.”
Software Engineering 2021, edited by Anne Koziolek et al., Gesellschaft
für Informatik e.V., 2021, pp. 83–84, doi:10.18420/SE2021_30 .
short: 'F. Pauck, H. Wehrheim, in: A. Koziolek, I. Schaefer, C. Seidl (Eds.), Software
Engineering 2021, Gesellschaft für Informatik e.V., Bonn, 2021, pp. 83–84.'
date_created: 2021-02-16T09:28:49Z
date_updated: 2023-01-18T08:35:20Z
department:
- _id: '77'
doi: '10.18420/SE2021_30 '
editor:
- first_name: Anne
full_name: Koziolek, Anne
last_name: Koziolek
- first_name: Ina
full_name: Schaefer, Ina
last_name: Schaefer
- first_name: Christoph
full_name: Seidl, Christoph
last_name: Seidl
language:
- iso: eng
page: ' 83-84 '
place: Bonn
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: Software Engineering 2021
publication_status: published
publisher: Gesellschaft für Informatik e.V.
status: public
title: Cooperative Android App Analysis with CoDiDroid
type: conference
user_id: '22398'
year: '2021'
...
---
_id: '19656'
author:
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Sharma A, Wehrheim H. Automatic Fairness Testing of Machine Learning Models.
In: Proceedings of the 32th IFIP International Conference on Testing Software
and Systems (ICTSS). LNCS. Springer.'
apa: Sharma, A., & Wehrheim, H. (n.d.). Automatic Fairness Testing of Machine
Learning Models. In Proceedings of the 32th IFIP International Conference on
Testing Software and Systems (ICTSS). Springer.
bibtex: '@inproceedings{Sharma_Wehrheim, series={LNCS}, title={Automatic Fairness
Testing of Machine Learning Models}, booktitle={Proceedings of the 32th IFIP International
Conference on Testing Software and Systems (ICTSS)}, publisher={Springer}, author={Sharma,
Arnab and Wehrheim, Heike}, collection={LNCS} }'
chicago: Sharma, Arnab, and Heike Wehrheim. “Automatic Fairness Testing of Machine
Learning Models.” In Proceedings of the 32th IFIP International Conference
on Testing Software and Systems (ICTSS). LNCS. Springer, n.d.
ieee: A. Sharma and H. Wehrheim, “Automatic Fairness Testing of Machine Learning
Models,” in Proceedings of the 32th IFIP International Conference on Testing
Software and Systems (ICTSS).
mla: Sharma, Arnab, and Heike Wehrheim. “Automatic Fairness Testing of Machine Learning
Models.” Proceedings of the 32th IFIP International Conference on Testing Software
and Systems (ICTSS), Springer.
short: 'A. Sharma, H. Wehrheim, in: Proceedings of the 32th IFIP International Conference
on Testing Software and Systems (ICTSS), Springer, n.d.'
date_created: 2020-09-24T12:53:02Z
date_updated: 2022-01-06T06:54:09Z
department:
- _id: '7'
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 32th IFIP International Conference on Testing Software
and Systems (ICTSS)
publication_status: accepted
publisher: Springer
series_title: LNCS
status: public
title: Automatic Fairness Testing of Machine Learning Models
type: conference
user_id: '477'
year: '2020'
...
---
_id: '19999'
author:
- first_name: Stefan
full_name: Mayer, Stefan
last_name: Mayer
citation:
ama: Mayer S. Optimierung von JMCTest Beim Testen von Inter Method Contracts.
Universität Paderborn; 2020.
apa: Mayer, S. (2020). Optimierung von JMCTest beim Testen von Inter Method Contracts.
Universität Paderborn.
bibtex: '@book{Mayer_2020, title={Optimierung von JMCTest beim Testen von Inter
Method Contracts}, publisher={Universität Paderborn}, author={Mayer, Stefan},
year={2020} }'
chicago: Mayer, Stefan. Optimierung von JMCTest Beim Testen von Inter Method
Contracts. Universität Paderborn, 2020.
ieee: S. Mayer, Optimierung von JMCTest beim Testen von Inter Method Contracts.
Universität Paderborn, 2020.
mla: Mayer, Stefan. Optimierung von JMCTest Beim Testen von Inter Method Contracts.
Universität Paderborn, 2020.
short: S. Mayer, Optimierung von JMCTest Beim Testen von Inter Method Contracts,
Universität Paderborn, 2020.
date_created: 2020-10-15T05:15:46Z
date_updated: 2022-01-06T06:54:18Z
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: Optimierung von JMCTest beim Testen von Inter Method Contracts
type: bachelorsthesis
user_id: '477'
year: '2020'
...
---
_id: '20274'
author:
- first_name: Eleni
full_name: Bila, Eleni
last_name: Bila
- 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: 'Bila E, Doherty S, Dongol B, Derrick J, Schellhorn G, Wehrheim H. Defining
and Verifying Durable Opacity: Correctness for Persistent Software Transactional
Memory. In: Gotsman A, Sokolova A, eds. Formal Techniques for Distributed Objects,
Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE}
2020, Held as Part of the 15th International Federated Conference on Distributed
Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings.
Vol 12136. Lecture Notes in Computer Science. Springer; 2020:39-58. doi:10.1007/978-3-030-50086-3\_3'
apa: 'Bila, E., Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., & Wehrheim,
H. (2020). Defining and Verifying Durable Opacity: Correctness for Persistent
Software Transactional Memory. In A. Gotsman & A. Sokolova (Eds.), Formal
Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG}
6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International
Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta,
Malta, June 15-19, 2020, Proceedings (Vol. 12136, pp. 39–58). Springer. https://doi.org/10.1007/978-3-030-50086-3\_3'
bibtex: '@inproceedings{Bila_Doherty_Dongol_Derrick_Schellhorn_Wehrheim_2020, series={Lecture
Notes in Computer Science}, title={Defining and Verifying Durable Opacity: Correctness
for Persistent Software Transactional Memory}, volume={12136}, DOI={10.1007/978-3-030-50086-3\_3},
booktitle={Formal Techniques for Distributed Objects, Components, and Systems
- 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of
the 15th International Federated Conference on Distributed Computing Techniques,
DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings}, publisher={Springer},
author={Bila, Eleni and Doherty, Simon and Dongol, Brijesh and Derrick, John and
Schellhorn, Gerhard and Wehrheim, Heike}, editor={Gotsman, Alexey and Sokolova,
AnaEditors}, year={2020}, pages={39–58}, collection={Lecture Notes in Computer
Science} }'
chicago: 'Bila, Eleni, Simon Doherty, Brijesh Dongol, John Derrick, Gerhard Schellhorn,
and Heike Wehrheim. “Defining and Verifying Durable Opacity: Correctness for Persistent
Software Transactional Memory.” In Formal Techniques for Distributed Objects,
Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE}
2020, Held as Part of the 15th International Federated Conference on Distributed
Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings,
edited by Alexey Gotsman and Ana Sokolova, 12136:39–58. Lecture Notes in Computer
Science. Springer, 2020. https://doi.org/10.1007/978-3-030-50086-3\_3.'
ieee: 'E. Bila, S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, and H. Wehrheim,
“Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional
Memory,” in Formal Techniques for Distributed Objects, Components, and Systems
- 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of
the 15th International Federated Conference on Distributed Computing Techniques,
DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings, 2020, vol.
12136, pp. 39–58.'
mla: 'Bila, Eleni, et al. “Defining and Verifying Durable Opacity: Correctness for
Persistent Software Transactional Memory.” Formal Techniques for Distributed
Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference,
{FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed
Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings,
edited by Alexey Gotsman and Ana Sokolova, vol. 12136, Springer, 2020, pp. 39–58,
doi:10.1007/978-3-030-50086-3\_3.'
short: 'E. Bila, S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, H. Wehrheim,
in: A. Gotsman, A. Sokolova (Eds.), Formal Techniques for Distributed Objects,
Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE}
2020, Held as Part of the 15th International Federated Conference on Distributed
Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings,
Springer, 2020, pp. 39–58.'
date_created: 2020-11-04T08:27:09Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '77'
doi: 10.1007/978-3-030-50086-3\_3
editor:
- first_name: Alexey
full_name: Gotsman, Alexey
last_name: Gotsman
- first_name: Ana
full_name: Sokolova, Ana
last_name: Sokolova
intvolume: ' 12136'
language:
- iso: eng
page: 39-58
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: Formal Techniques for Distributed Objects, Components, and Systems -
40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the
15th International Federated Conference on Distributed Computing Techniques, DisCoTec
2020, Valletta, Malta, June 15-19, 2020, Proceedings
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Defining and Verifying Durable Opacity: Correctness for Persistent Software
Transactional Memory'
type: conference
user_id: '29719'
volume: 12136
year: '2020'
...
---
_id: '20275'
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. Consistency Analysis of AUTOSAR Timing Requirements.
In: van Sinderen M, Fill H-}Georg, A. Maciaszek L, eds. Proceedings of the
15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint,
Paris, France, July 7-9, 2020. ScitePress; 2020:15-26. doi:10.5220/0009766600150026'
apa: Beringer, S., & Wehrheim, H. (2020). Consistency Analysis of AUTOSAR Timing
Requirements. In M. van Sinderen, H.-}Georg Fill, & L. A. Maciaszek (Eds.),
Proceedings of the 15th International Conference on Software Technologies,
{ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020 (pp. 15–26). ScitePress.
https://doi.org/10.5220/0009766600150026
bibtex: '@inproceedings{Beringer_Wehrheim_2020, title={Consistency Analysis of AUTOSAR
Timing Requirements}, DOI={10.5220/0009766600150026},
booktitle={Proceedings of the 15th International Conference on Software Technologies,
{ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020}, publisher={ScitePress},
author={Beringer, Steffen and Wehrheim, Heike}, editor={van Sinderen, Marten and
Fill, Hans{-}Georg and A. Maciaszek, LeszekEditors}, year={2020}, pages={15–26}
}'
chicago: Beringer, Steffen, and Heike Wehrheim. “Consistency Analysis of AUTOSAR
Timing Requirements.” In Proceedings of the 15th International Conference on
Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020,
edited by Marten van Sinderen, Hans{-}Georg Fill, and Leszek A. Maciaszek, 15–26.
ScitePress, 2020. https://doi.org/10.5220/0009766600150026.
ieee: S. Beringer and H. Wehrheim, “Consistency Analysis of AUTOSAR Timing Requirements,”
in Proceedings of the 15th International Conference on Software Technologies,
{ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020, 2020, pp. 15–26.
mla: Beringer, Steffen, and Heike Wehrheim. “Consistency Analysis of AUTOSAR Timing
Requirements.” Proceedings of the 15th International Conference on Software
Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020, edited
by Marten van Sinderen et al., ScitePress, 2020, pp. 15–26, doi:10.5220/0009766600150026.
short: 'S. Beringer, H. Wehrheim, in: M. van Sinderen, H.-}Georg Fill, L. A. Maciaszek
(Eds.), Proceedings of the 15th International Conference on Software Technologies,
{ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020, ScitePress, 2020, pp.
15–26.'
date_created: 2020-11-04T08:31:37Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '77'
doi: 10.5220/0009766600150026
editor:
- first_name: Marten
full_name: van Sinderen, Marten
last_name: van Sinderen
- first_name: Hans{-}Georg
full_name: Fill, Hans{-}Georg
last_name: Fill
- first_name: Leszek
full_name: A. Maciaszek, Leszek
last_name: A. Maciaszek
language:
- iso: eng
page: 15-26
publication: Proceedings of the 15th International Conference on Software Technologies,
{ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020
publisher: ScitePress
status: public
title: Consistency Analysis of AUTOSAR Timing Requirements
type: conference
user_id: '29719'
year: '2020'
...
---
_id: '20276'
author:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Beyer D, Wehrheim H. Verification Artifacts in Cooperative Verification: Survey
and Unifying Component Framework. In: Margaria T, Steffen B, eds. Leveraging
Applications of Formal Methods, Verification and Validation: Verification Principles
- 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA
2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}. Vol 12476.
Lecture Notes in Computer Science. Springer; 2020:143-167. doi:10.1007/978-3-030-61362-4\_8'
apa: 'Beyer, D., & Wehrheim, H. (2020). Verification Artifacts in Cooperative
Verification: Survey and Unifying Component Framework. In T. Margaria & B.
Steffen (Eds.), Leveraging Applications of Formal Methods, Verification and
Validation: Verification Principles - 9th International Symposium on Leveraging
Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020,
Proceedings, Part {I} (Vol. 12476, pp. 143–167). Springer. https://doi.org/10.1007/978-3-030-61362-4\_8'
bibtex: '@inproceedings{Beyer_Wehrheim_2020, series={Lecture Notes in Computer Science},
title={Verification Artifacts in Cooperative Verification: Survey and Unifying
Component Framework}, volume={12476}, DOI={10.1007/978-3-030-61362-4\_8},
booktitle={Leveraging Applications of Formal Methods, Verification and Validation:
Verification Principles - 9th International Symposium on Leveraging Applications
of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings,
Part {I}}, publisher={Springer}, author={Beyer, Dirk and Wehrheim, Heike}, editor={Margaria,
Tiziana and Steffen, BernhardEditors}, year={2020}, pages={143–167}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Beyer, Dirk, and Heike Wehrheim. “Verification Artifacts in Cooperative
Verification: Survey and Unifying Component Framework.” In Leveraging Applications
of Formal Methods, Verification and Validation: Verification Principles - 9th
International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020,
Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}, edited by Tiziana
Margaria and Bernhard Steffen, 12476:143–67. Lecture Notes in Computer Science.
Springer, 2020. https://doi.org/10.1007/978-3-030-61362-4\_8.'
ieee: 'D. Beyer and H. Wehrheim, “Verification Artifacts in Cooperative Verification:
Survey and Unifying Component Framework,” in Leveraging Applications of Formal
Methods, Verification and Validation: Verification Principles - 9th International
Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece,
October 20-30, 2020, Proceedings, Part {I}, 2020, vol. 12476, pp. 143–167.'
mla: 'Beyer, Dirk, and Heike Wehrheim. “Verification Artifacts in Cooperative Verification:
Survey and Unifying Component Framework.” Leveraging Applications of Formal
Methods, Verification and Validation: Verification Principles - 9th International
Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece,
October 20-30, 2020, Proceedings, Part {I}, edited by Tiziana Margaria and
Bernhard Steffen, vol. 12476, Springer, 2020, pp. 143–67, doi:10.1007/978-3-030-61362-4\_8.'
short: 'D. Beyer, H. Wehrheim, in: T. Margaria, B. Steffen (Eds.), Leveraging Applications
of Formal Methods, Verification and Validation: Verification Principles - 9th
International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020,
Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}, Springer, 2020, pp.
143–167.'
date_created: 2020-11-04T08:36:22Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '77'
doi: 10.1007/978-3-030-61362-4\_8
editor:
- first_name: Tiziana
full_name: Margaria, Tiziana
last_name: Margaria
- first_name: Bernhard
full_name: Steffen, Bernhard
last_name: Steffen
intvolume: ' 12476'
language:
- iso: eng
page: 143-167
project:
- _id: '85'
name: Kooperative Softwareverifikation
publication: 'Leveraging Applications of Formal Methods, Verification and Validation:
Verification Principles - 9th International Symposium on Leveraging Applications
of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings,
Part {I}'
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Verification Artifacts in Cooperative Verification: Survey and Unifying Component
Framework'
type: conference
user_id: '29719'
volume: 12476
year: '2020'
...
---
_id: '20277'
citation:
ama: Wehrheim H, Cabot J, eds. Fundamental Approaches to Software Engineering
- 23rd International Conference, FASE 2020, Held as Part of the European Joint
Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April
25-30, 2020, Proceedings. Vol 12076. Springer; 2020. doi:10.1007/978-3-030-45234-6
apa: Wehrheim, H., & Cabot, J. (Eds.). (2020). Fundamental Approaches to
Software Engineering - 23rd International Conference, FASE 2020, Held as Part
of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020,
Dublin, Ireland, April 25-30, 2020, Proceedings (Vol. 12076). Springer. https://doi.org/10.1007/978-3-030-45234-6
bibtex: '@book{Wehrheim_Cabot_2020, series={Lecture Notes in Computer Science},
title={Fundamental Approaches to Software Engineering - 23rd International Conference,
FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice
of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings}, volume={12076},
DOI={10.1007/978-3-030-45234-6},
publisher={Springer}, year={2020}, collection={Lecture Notes in Computer Science}
}'
chicago: Wehrheim, Heike, and Jordi Cabot, eds. Fundamental Approaches to Software
Engineering - 23rd International Conference, FASE 2020, Held as Part of the European
Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland,
April 25-30, 2020, Proceedings. Vol. 12076. Lecture Notes in Computer Science.
Springer, 2020. https://doi.org/10.1007/978-3-030-45234-6.
ieee: H. Wehrheim and J. Cabot, Eds., Fundamental Approaches to Software Engineering
- 23rd International Conference, FASE 2020, Held as Part of the European Joint
Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April
25-30, 2020, Proceedings, vol. 12076. Springer, 2020.
mla: Wehrheim, Heike, and Jordi Cabot, editors. Fundamental Approaches to Software
Engineering - 23rd International Conference, FASE 2020, Held as Part of the European
Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland,
April 25-30, 2020, Proceedings. Vol. 12076, Springer, 2020, doi:10.1007/978-3-030-45234-6.
short: H. Wehrheim, J. Cabot, eds., Fundamental Approaches to Software Engineering
- 23rd International Conference, FASE 2020, Held as Part of the European Joint
Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April
25-30, 2020, Proceedings, Springer, 2020.
date_created: 2020-11-04T08:42:19Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '77'
doi: 10.1007/978-3-030-45234-6
editor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Jordi
full_name: Cabot, Jordi
last_name: Cabot
intvolume: ' 12076'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-030-45233-9
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Fundamental Approaches to Software Engineering - 23rd International Conference,
FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice
of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings
type: conference_editor
user_id: '29719'
volume: 12076
year: '2020'
...
---
_id: '20278'
citation:
ama: Ahrendt W, Wehrheim H, eds. Tests and Proofs - 14th International Conference,
TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [Postponed].
Vol 12165. Springer; 2020. doi:10.1007/978-3-030-50995-8
apa: Ahrendt, W., & Wehrheim, H. (Eds.). (2020). Tests and Proofs - 14th
International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings
[postponed] (Vol. 12165). Springer. https://doi.org/10.1007/978-3-030-50995-8
bibtex: '@book{Ahrendt_Wehrheim_2020, series={Lecture Notes in Computer Science},
title={Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen,
Norway, June 22-23, 2020, Proceedings [postponed]}, volume={12165}, DOI={10.1007/978-3-030-50995-8},
publisher={Springer}, year={2020}, collection={Lecture Notes in Computer Science}
}'
chicago: Ahrendt, Wolfgang, and Heike Wehrheim, eds. Tests and Proofs - 14th
International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings
[Postponed]. Vol. 12165. Lecture Notes in Computer Science. Springer, 2020.
https://doi.org/10.1007/978-3-030-50995-8.
ieee: W. Ahrendt and H. Wehrheim, Eds., Tests and Proofs - 14th International
Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed],
vol. 12165. Springer, 2020.
mla: Ahrendt, Wolfgang, and Heike Wehrheim, editors. Tests and Proofs - 14th
International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings
[Postponed]. Vol. 12165, Springer, 2020, doi:10.1007/978-3-030-50995-8.
short: W. Ahrendt, H. Wehrheim, eds., Tests and Proofs - 14th International Conference,
TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [Postponed], Springer,
2020.
date_created: 2020-11-04T08:44:33Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '77'
doi: 10.1007/978-3-030-50995-8
editor:
- first_name: Wolfgang
full_name: Ahrendt, Wolfgang
last_name: Ahrendt
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
intvolume: ' 12165'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-030-50994-1
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway,
June 22-23, 2020, Proceedings [postponed]
type: conference_editor
user_id: '29719'
volume: 12165
year: '2020'
...
---
_id: '20279'
author:
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Sharma A, Wehrheim H. Testing Monotonicity of Machine Learning Models. CoRR.
2020;abs/2002.12278.
apa: Sharma, A., & Wehrheim, H. (2020). Testing Monotonicity of Machine Learning
Models. CoRR, abs/2002.12278.
bibtex: '@article{Sharma_Wehrheim_2020, title={Testing Monotonicity of Machine Learning
Models}, volume={abs/2002.12278}, journal={CoRR}, author={Sharma, Arnab and Wehrheim,
Heike}, year={2020} }'
chicago: Sharma, Arnab, and Heike Wehrheim. “Testing Monotonicity of Machine Learning
Models.” CoRR abs/2002.12278 (2020).
ieee: A. Sharma and H. Wehrheim, “Testing Monotonicity of Machine Learning Models,”
CoRR, vol. abs/2002.12278, 2020.
mla: Sharma, Arnab, and Heike Wehrheim. “Testing Monotonicity of Machine Learning
Models.” CoRR, vol. abs/2002.12278, 2020.
short: A. Sharma, H. Wehrheim, CoRR abs/2002.12278 (2020).
date_created: 2020-11-04T08:48:04Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '77'
language:
- iso: eng
publication: CoRR
status: public
title: Testing Monotonicity of Machine Learning Models
type: journal_article
user_id: '29719'
volume: abs/2002.12278
year: '2020'
...
---
_id: '21016'
author:
- first_name: Sadegh
full_name: Dalvandi, Sadegh
last_name: Dalvandi
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Dalvandi S, Doherty S, Dongol B, Wehrheim H. Owicki-Gries Reasoning for C11
RAR (Artifact). Dagstuhl Artifacts Ser. 2020;6(2):15:1-15:2. doi:10.4230/DARTS.6.2.15
apa: Dalvandi, S., Doherty, S., Dongol, B., & Wehrheim, H. (2020). Owicki-Gries
Reasoning for C11 RAR (Artifact). Dagstuhl Artifacts Ser., 6(2),
15:1-15:2. https://doi.org/10.4230/DARTS.6.2.15
bibtex: '@article{Dalvandi_Doherty_Dongol_Wehrheim_2020, title={Owicki-Gries Reasoning
for C11 RAR (Artifact)}, volume={6}, DOI={10.4230/DARTS.6.2.15},
number={2}, journal={Dagstuhl Artifacts Ser.}, author={Dalvandi, Sadegh and Doherty,
Simon and Dongol, Brijesh and Wehrheim, Heike}, year={2020}, pages={15:1-15:2}
}'
chicago: 'Dalvandi, Sadegh, Simon Doherty, Brijesh Dongol, and Heike Wehrheim. “Owicki-Gries
Reasoning for C11 RAR (Artifact).” Dagstuhl Artifacts Ser. 6, no. 2 (2020):
15:1-15:2. https://doi.org/10.4230/DARTS.6.2.15.'
ieee: S. Dalvandi, S. Doherty, B. Dongol, and H. Wehrheim, “Owicki-Gries Reasoning
for C11 RAR (Artifact),” Dagstuhl Artifacts Ser., vol. 6, no. 2, pp. 15:1-15:2,
2020.
mla: Dalvandi, Sadegh, et al. “Owicki-Gries Reasoning for C11 RAR (Artifact).” Dagstuhl
Artifacts Ser., vol. 6, no. 2, 2020, pp. 15:1-15:2, doi:10.4230/DARTS.6.2.15.
short: S. Dalvandi, S. Doherty, B. Dongol, H. Wehrheim, Dagstuhl Artifacts Ser.
6 (2020) 15:1-15:2.
date_created: 2021-01-19T10:25:27Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '77'
doi: 10.4230/DARTS.6.2.15
intvolume: ' 6'
issue: '2'
language:
- iso: eng
page: 15:1-15:2
publication: Dagstuhl Artifacts Ser.
status: public
title: Owicki-Gries Reasoning for C11 RAR (Artifact)
type: journal_article
user_id: '29719'
volume: 6
year: '2020'
...
---
_id: '21017'
author:
- first_name: Sadegh
full_name: Dalvandi, Sadegh
last_name: Dalvandi
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Dalvandi S, Doherty S, Dongol B, Wehrheim H. Owicki-Gries Reasoning for C11
RAR. In: Hirschfeld R, Pape T, eds. 34th European Conference on Object-Oriented
Programming, {ECOOP} 2020, November 15-17, 2020, Berlin, Germany (Virtual Conference).
Vol 166. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik; 2020:11:1-11:26.
doi:10.4230/LIPIcs.ECOOP.2020.11'
apa: Dalvandi, S., Doherty, S., Dongol, B., & Wehrheim, H. (2020). Owicki-Gries
Reasoning for C11 RAR. In R. Hirschfeld & T. Pape (Eds.), 34th European
Conference on Object-Oriented Programming, {ECOOP} 2020, November 15-17, 2020,
Berlin, Germany (Virtual Conference) (Vol. 166, pp. 11:1-11:26). Schloss Dagstuhl
- Leibniz-Zentrum f{\"{u}}r Informatik. https://doi.org/10.4230/LIPIcs.ECOOP.2020.11
bibtex: '@inproceedings{Dalvandi_Doherty_Dongol_Wehrheim_2020, series={LIPIcs},
title={Owicki-Gries Reasoning for C11 RAR}, volume={166}, DOI={10.4230/LIPIcs.ECOOP.2020.11},
booktitle={34th European Conference on Object-Oriented Programming, {ECOOP} 2020,
November 15-17, 2020, Berlin, Germany (Virtual Conference)}, publisher={Schloss
Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, author={Dalvandi, Sadegh and
Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike}, editor={Hirschfeld, Robert
and Pape, TobiasEditors}, year={2020}, pages={11:1-11:26}, collection={LIPIcs}
}'
chicago: Dalvandi, Sadegh, Simon Doherty, Brijesh Dongol, and Heike Wehrheim. “Owicki-Gries
Reasoning for C11 RAR.” In 34th European Conference on Object-Oriented Programming,
{ECOOP} 2020, November 15-17, 2020, Berlin, Germany (Virtual Conference),
edited by Robert Hirschfeld and Tobias Pape, 166:11:1-11:26. LIPIcs. Schloss Dagstuhl
- Leibniz-Zentrum f{\"{u}}r Informatik, 2020. https://doi.org/10.4230/LIPIcs.ECOOP.2020.11.
ieee: S. Dalvandi, S. Doherty, B. Dongol, and H. Wehrheim, “Owicki-Gries Reasoning
for C11 RAR,” in 34th European Conference on Object-Oriented Programming, {ECOOP}
2020, November 15-17, 2020, Berlin, Germany (Virtual Conference), 2020, vol.
166, pp. 11:1-11:26.
mla: Dalvandi, Sadegh, et al. “Owicki-Gries Reasoning for C11 RAR.” 34th European
Conference on Object-Oriented Programming, {ECOOP} 2020, November 15-17, 2020,
Berlin, Germany (Virtual Conference), edited by Robert Hirschfeld and Tobias
Pape, vol. 166, Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, 2020,
pp. 11:1-11:26, doi:10.4230/LIPIcs.ECOOP.2020.11.
short: 'S. Dalvandi, S. Doherty, B. Dongol, H. Wehrheim, in: R. Hirschfeld, T. Pape
(Eds.), 34th European Conference on Object-Oriented Programming, {ECOOP} 2020,
November 15-17, 2020, Berlin, Germany (Virtual Conference), Schloss Dagstuhl -
Leibniz-Zentrum f{\"{u}}r Informatik, 2020, pp. 11:1-11:26.'
date_created: 2021-01-19T10:29:44Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '77'
doi: 10.4230/LIPIcs.ECOOP.2020.11
editor:
- first_name: Robert
full_name: Hirschfeld, Robert
last_name: Hirschfeld
- first_name: Tobias
full_name: Pape, Tobias
last_name: Pape
intvolume: ' 166'
language:
- iso: eng
page: 11:1-11:26
publication: 34th European Conference on Object-Oriented Programming, {ECOOP} 2020,
November 15-17, 2020, Berlin, Germany (Virtual Conference)
publisher: Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik
series_title: LIPIcs
status: public
title: Owicki-Gries Reasoning for C11 RAR
type: conference
user_id: '29719'
volume: 166
year: '2020'
...
---
_id: '21018'
author:
- first_name: Cedric
full_name: Richter, Cedric
id: '50003'
last_name: Richter
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Richter C, Wehrheim H. Attend and Represent: A Novel View on Algorithm Selection
for Software Verification. In: 35th {IEEE/ACM} International Conference on
Automated Software Engineering, {ASE} 2020, Melbourne, Australia, September 21-25,
2020. {IEEE}; 2020:1016-1028.'
apa: 'Richter, C., & Wehrheim, H. (2020). Attend and Represent: A Novel View
on Algorithm Selection for Software Verification. In 35th {IEEE/ACM} International
Conference on Automated Software Engineering, {ASE} 2020, Melbourne, Australia,
September 21-25, 2020 (pp. 1016–1028). {IEEE}.'
bibtex: '@inproceedings{Richter_Wehrheim_2020, title={Attend and Represent: A Novel
View on Algorithm Selection for Software Verification}, booktitle={35th {IEEE/ACM}
International Conference on Automated Software Engineering, {ASE} 2020, Melbourne,
Australia, September 21-25, 2020}, publisher={{IEEE}}, author={Richter, Cedric
and Wehrheim, Heike}, year={2020}, pages={1016–1028} }'
chicago: 'Richter, Cedric, and Heike Wehrheim. “Attend and Represent: A Novel View
on Algorithm Selection for Software Verification.” In 35th {IEEE/ACM} International
Conference on Automated Software Engineering, {ASE} 2020, Melbourne, Australia,
September 21-25, 2020, 1016–28. {IEEE}, 2020.'
ieee: 'C. Richter and H. Wehrheim, “Attend and Represent: A Novel View on Algorithm
Selection for Software Verification,” in 35th {IEEE/ACM} International Conference
on Automated Software Engineering, {ASE} 2020, Melbourne, Australia, September
21-25, 2020, 2020, pp. 1016–1028.'
mla: 'Richter, Cedric, and Heike Wehrheim. “Attend and Represent: A Novel View on
Algorithm Selection for Software Verification.” 35th {IEEE/ACM} International
Conference on Automated Software Engineering, {ASE} 2020, Melbourne, Australia,
September 21-25, 2020, {IEEE}, 2020, pp. 1016–28.'
short: 'C. Richter, H. Wehrheim, in: 35th {IEEE/ACM} International Conference on
Automated Software Engineering, {ASE} 2020, Melbourne, Australia, September 21-25,
2020, {IEEE}, 2020, pp. 1016–1028.'
date_created: 2021-01-19T10:32:17Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '77'
language:
- iso: eng
page: 1016-1028
publication: 35th {IEEE/ACM} International Conference on Automated Software Engineering,
{ASE} 2020, Melbourne, Australia, September 21-25, 2020
publisher: '{IEEE}'
status: public
title: 'Attend and Represent: A Novel View on Algorithm Selection for Software Verification'
type: conference
user_id: '29719'
year: '2020'
...
---
_id: '21019'
citation:
ama: Ahrendt W, Wehrheim H, eds. Tests and Proofs - 14th International Conference,
TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [Postponed].
Vol 12165. Springer; 2020. doi:10.1007/978-3-030-50995-8
apa: Ahrendt, W., & Wehrheim, H. (Eds.). (2020). Tests and Proofs - 14th
International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings
[postponed] (Vol. 12165). Springer. https://doi.org/10.1007/978-3-030-50995-8
bibtex: '@book{Ahrendt_Wehrheim_2020, series={Lecture Notes in Computer Science},
title={Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen,
Norway, June 22-23, 2020, Proceedings [postponed]}, volume={12165}, DOI={10.1007/978-3-030-50995-8},
publisher={Springer}, year={2020}, collection={Lecture Notes in Computer Science}
}'
chicago: Ahrendt, Wolfgang, and Heike Wehrheim, eds. Tests and Proofs - 14th
International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings
[Postponed]. Vol. 12165. Lecture Notes in Computer Science. Springer, 2020.
https://doi.org/10.1007/978-3-030-50995-8.
ieee: W. Ahrendt and H. Wehrheim, Eds., Tests and Proofs - 14th International
Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed],
vol. 12165. Springer, 2020.
mla: Ahrendt, Wolfgang, and Heike Wehrheim, editors. Tests and Proofs - 14th
International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings
[Postponed]. Vol. 12165, Springer, 2020, doi:10.1007/978-3-030-50995-8.
short: W. Ahrendt, H. Wehrheim, eds., Tests and Proofs - 14th International Conference,
TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [Postponed], Springer,
2020.
date_created: 2021-01-19T10:35:37Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '77'
doi: 10.1007/978-3-030-50995-8
editor:
- first_name: Wolfgang
full_name: Ahrendt, Wolfgang
last_name: Ahrendt
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
intvolume: ' 12165'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-030-50994-1
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway,
June 22-23, 2020, Proceedings [postponed]
type: conference_editor
user_id: '29719'
volume: 12165
year: '2020'
...
---
_id: '17825'
abstract:
- lang: eng
text: "Software verification has recently made enormous progress due to the\r\ndevelopment
of novel verification methods and the speed-up of supporting\r\ntechnologies like
SMT solving. To keep software verification tools up to date\r\nwith these advances,
tool developers keep on integrating newly designed methods\r\ninto their tools,
almost exclusively by re-implementing the method within their\r\nown framework.
While this allows for a conceptual re-use of methods, it\r\nrequires novel implementations
for every new technique.\r\n In this paper, we employ cooperative verification
in order to avoid\r\nreimplementation and enable usage of novel tools as black-box
components in\r\nverification. Specifically, cooperation is employed for the core
ingredient of\r\nsoftware verification which is invariant generation. Finding
an adequate loop\r\ninvariant is key to the success of a verification run. Our
framework named\r\nCoVerCIG allows a master verification tool to delegate the
task of invariant\r\ngeneration to one or several specialized helper invariant
generators. Their\r\nresults are then utilized within the verification run of
the master verifier,\r\nallowing in particular for crosschecking the validity
of the invariant. We\r\nexperimentally evaluate our framework on an instance with
two masters and three\r\ndifferent invariant generators using a number of benchmarks
from SV-COMP 2020.\r\nThe experiments show that the use of CoVerCIG can increase
the number of\r\ncorrectly verified tasks without increasing the used resources"
author:
- first_name: Jan Frederik
full_name: Haltermann, Jan Frederik
id: '44413'
last_name: Haltermann
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Haltermann JF, Wehrheim H. Cooperative Verification via Collective Invariant
Generation. arXiv:200804551. 2020.
apa: Haltermann, J. F., & Wehrheim, H. (2020). Cooperative Verification via
Collective Invariant Generation. ArXiv:2008.04551.
bibtex: '@article{Haltermann_Wehrheim_2020, title={Cooperative Verification via
Collective Invariant Generation}, journal={arXiv:2008.04551}, author={Haltermann,
Jan Frederik and Wehrheim, Heike}, year={2020} }'
chicago: Haltermann, Jan Frederik, and Heike Wehrheim. “Cooperative Verification
via Collective Invariant Generation.” ArXiv:2008.04551, 2020.
ieee: J. F. Haltermann and H. Wehrheim, “Cooperative Verification via Collective
Invariant Generation,” arXiv:2008.04551. 2020.
mla: Haltermann, Jan Frederik, and Heike Wehrheim. “Cooperative Verification via
Collective Invariant Generation.” ArXiv:2008.04551, 2020.
short: J.F. Haltermann, H. Wehrheim, ArXiv:2008.04551 (2020).
date_created: 2020-08-12T06:49:18Z
date_updated: 2022-01-06T06:53:20Z
department:
- _id: '77'
language:
- iso: eng
project:
- _id: '85'
name: Kooperative Softwareverifikation
publication: arXiv:2008.04551
status: public
title: Cooperative Verification via Collective Invariant Generation
type: preprint
user_id: '44413'
year: '2020'
...
---
_id: '16724'
author:
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Sharma A, Wehrheim H. Higher Income, Larger Loan? Monotonicity Testing of
Machine Learning Models. In: Proceedings of the ACM SIGSOFT International Symposium
on Software Testing and Analysis (ISSTA). ACM.'
apa: Sharma, A., & Wehrheim, H. (n.d.). Higher Income, Larger Loan? Monotonicity
Testing of Machine Learning Models. In Proceedings of the ACM SIGSOFT International
Symposium on Software Testing and Analysis (ISSTA). ACM.
bibtex: '@inproceedings{Sharma_Wehrheim, title={Higher Income, Larger Loan? Monotonicity
Testing of Machine Learning Models}, booktitle={Proceedings of the ACM SIGSOFT
International Symposium on Software Testing and Analysis (ISSTA).}, publisher={ACM},
author={Sharma, Arnab and Wehrheim, Heike} }'
chicago: Sharma, Arnab, and Heike Wehrheim. “Higher Income, Larger Loan? Monotonicity
Testing of Machine Learning Models.” In Proceedings of the ACM SIGSOFT International
Symposium on Software Testing and Analysis (ISSTA). ACM, n.d.
ieee: A. Sharma and H. Wehrheim, “Higher Income, Larger Loan? Monotonicity Testing
of Machine Learning Models,” in Proceedings of the ACM SIGSOFT International
Symposium on Software Testing and Analysis (ISSTA).
mla: Sharma, Arnab, and Heike Wehrheim. “Higher Income, Larger Loan? Monotonicity
Testing of Machine Learning Models.” Proceedings of the ACM SIGSOFT International
Symposium on Software Testing and Analysis (ISSTA)., ACM.
short: 'A. Sharma, H. Wehrheim, in: Proceedings of the ACM SIGSOFT International
Symposium on Software Testing and Analysis (ISSTA)., ACM, n.d.'
date_created: 2020-04-19T14:01:53Z
date_updated: 2022-01-06T06:52:55Z
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
publication: Proceedings of the ACM SIGSOFT International Symposium on Software Testing
and Analysis (ISSTA).
publication_status: accepted
publisher: ACM
status: public
title: Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models
type: conference
user_id: '477'
year: '2020'
...
---
_id: '16725'
author:
- first_name: Cedric
full_name: Richter, Cedric
id: '50003'
last_name: Richter
- 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: Richter C, Hüllermeier E, Jakobs M-C, Wehrheim H. Algorithm Selection for Software
Validation Based on Graph Kernels. Journal of Automated Software Engineering.
apa: Richter, C., Hüllermeier, E., Jakobs, M.-C., & Wehrheim, H. (n.d.). Algorithm
Selection for Software Validation Based on Graph Kernels. Journal of Automated
Software Engineering.
bibtex: '@article{Richter_Hüllermeier_Jakobs_Wehrheim, title={Algorithm Selection
for Software Validation Based on Graph Kernels}, journal={Journal of Automated
Software Engineering}, publisher={Springer}, author={Richter, Cedric and Hüllermeier,
Eyke and Jakobs, Marie-Christine and Wehrheim, Heike} }'
chicago: Richter, Cedric, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim.
“Algorithm Selection for Software Validation Based on Graph Kernels.” Journal
of Automated Software Engineering, n.d.
ieee: C. Richter, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Algorithm Selection
for Software Validation Based on Graph Kernels,” Journal of Automated Software
Engineering.
mla: Richter, Cedric, et al. “Algorithm Selection for Software Validation Based
on Graph Kernels.” Journal of Automated Software Engineering, Springer.
short: C. Richter, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Journal of Automated
Software Engineering (n.d.).
date_created: 2020-04-19T14:08:06Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '7'
- _id: '77'
- _id: '355'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '12'
name: SFB 901 - Subproject B4
publication: Journal of Automated Software Engineering
publication_status: accepted
publisher: Springer
status: public
title: Algorithm Selection for Software Validation Based on Graph Kernels
type: journal_article
user_id: '477'
year: '2020'
...
---
_id: '13770'
author:
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Karl H, Kundisch D, Meyer auf der Heide F, Wehrheim H. A Case for a New IT
Ecosystem: On-The-Fly Computing. Business & Information Systems Engineering.
2020;62(6):467-481. doi:10.1007/s12599-019-00627-x'
apa: 'Karl, H., Kundisch, D., Meyer auf der Heide, F., & Wehrheim, H. (2020).
A Case for a New IT Ecosystem: On-The-Fly Computing. Business & Information
Systems Engineering, 62(6), 467–481. https://doi.org/10.1007/s12599-019-00627-x'
bibtex: '@article{Karl_Kundisch_Meyer auf der Heide_Wehrheim_2020, title={A Case
for a New IT Ecosystem: On-The-Fly Computing}, volume={62}, DOI={10.1007/s12599-019-00627-x},
number={6}, journal={Business & Information Systems Engineering}, publisher={Springer},
author={Karl, Holger and Kundisch, Dennis and Meyer auf der Heide, Friedhelm and
Wehrheim, Heike}, year={2020}, pages={467–481} }'
chicago: 'Karl, Holger, Dennis Kundisch, Friedhelm Meyer auf der Heide, and Heike
Wehrheim. “A Case for a New IT Ecosystem: On-The-Fly Computing.” Business &
Information Systems Engineering 62, no. 6 (2020): 467–81. https://doi.org/10.1007/s12599-019-00627-x.'
ieee: 'H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for
a New IT Ecosystem: On-The-Fly Computing,” Business & Information Systems
Engineering, vol. 62, no. 6, pp. 467–481, 2020, doi: 10.1007/s12599-019-00627-x.'
mla: 'Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.”
Business & Information Systems Engineering, vol. 62, no. 6, Springer,
2020, pp. 467–81, doi:10.1007/s12599-019-00627-x.'
short: H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business &
Information Systems Engineering 62 (2020) 467–481.
date_created: 2019-10-10T13:41:06Z
date_updated: 2022-12-02T09:27:17Z
ddc:
- '004'
department:
- _id: '276'
- _id: '75'
- _id: '63'
- _id: '77'
doi: 10.1007/s12599-019-00627-x
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-12-12T10:24:47Z
date_updated: 2019-12-12T10:24:47Z
file_id: '15311'
file_name: Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf
file_size: 454532
relation: main_file
success: 1
file_date_updated: 2019-12-12T10:24:47Z
has_accepted_license: '1'
intvolume: ' 62'
issue: '6'
language:
- iso: eng
page: 467-481
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '3'
name: SFB 901 - Project Area B
- _id: '4'
name: SFB 901 - Project Area C
- _id: '82'
name: SFB 901 - Project Area T
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '6'
name: SFB 901 - Subproject A2
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '8'
name: SFB 901 - Subproject A4
- _id: '9'
name: SFB 901 - Subproject B1
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '15'
name: SFB 901 - Subproject C3
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '17'
name: SFB 901 - Subproject C5
- _id: '83'
name: SFB 901 -Subproject T1
- _id: '84'
name: SFB 901 -Subproject T2
- _id: '107'
name: SFB 901 -Subproject T3
- _id: '158'
name: 'SFB 901 - T4: SFB 901 -Subproject T4'
publication: Business & Information Systems Engineering
publication_status: published
publisher: Springer
status: public
title: 'A Case for a New IT Ecosystem: On-The-Fly Computing'
type: journal_article
user_id: '477'
volume: 62
year: '2020'
...
---
_id: '16214'
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Pauck F, Bodden E, Wehrheim H. Reproducing Taint-Analysis Results with ReproDroid.
In: Felderer M, Hasselbring W, Rabiser R, Jung R, eds. Software Engineering
2020, Fachtagung Des GI-Fachbereichs Softwaretechnik, 24.-28. Februar 2020, Innsbruck,
Austria. {LNI}. Gesellschaft f{\"{u}}r Informatik e.V.; 2020:123-124. doi:10.18420/SE2020_36'
apa: Pauck, F., Bodden, E., & Wehrheim, H. (2020). Reproducing Taint-Analysis
Results with ReproDroid. In M. Felderer, W. Hasselbring, R. Rabiser, & R.
Jung (Eds.), Software Engineering 2020, Fachtagung des GI-Fachbereichs Softwaretechnik,
24.-28. Februar 2020, Innsbruck, Austria (pp. 123–124). Gesellschaft f{\"{u}}r
Informatik e.V. https://doi.org/10.18420/SE2020_36
bibtex: '@inproceedings{Pauck_Bodden_Wehrheim_2020, series={{LNI}}, title={Reproducing
Taint-Analysis Results with ReproDroid}, DOI={10.18420/SE2020_36},
booktitle={Software Engineering 2020, Fachtagung des GI-Fachbereichs Softwaretechnik,
24.-28. Februar 2020, Innsbruck, Austria}, publisher={Gesellschaft f{\"{u}}r Informatik
e.V.}, author={Pauck, Felix and Bodden, Eric and Wehrheim, Heike}, editor={Felderer,
Michael and Hasselbring, Wilhelm and Rabiser, Rick and Jung, Reiner}, year={2020},
pages={123–124}, collection={{LNI}} }'
chicago: Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Reproducing Taint-Analysis
Results with ReproDroid.” In Software Engineering 2020, Fachtagung Des GI-Fachbereichs
Softwaretechnik, 24.-28. Februar 2020, Innsbruck, Austria, edited by Michael
Felderer, Wilhelm Hasselbring, Rick Rabiser, and Reiner Jung, 123–24. {LNI}. Gesellschaft
f{\"{u}}r Informatik e.V., 2020. https://doi.org/10.18420/SE2020_36.
ieee: 'F. Pauck, E. Bodden, and H. Wehrheim, “Reproducing Taint-Analysis Results
with ReproDroid,” in Software Engineering 2020, Fachtagung des GI-Fachbereichs
Softwaretechnik, 24.-28. Februar 2020, Innsbruck, Austria, 2020, pp. 123–124,
doi: 10.18420/SE2020_36.'
mla: Pauck, Felix, et al. “Reproducing Taint-Analysis Results with ReproDroid.”
Software Engineering 2020, Fachtagung Des GI-Fachbereichs Softwaretechnik,
24.-28. Februar 2020, Innsbruck, Austria, edited by Michael Felderer et al.,
Gesellschaft f{\"{u}}r Informatik e.V., 2020, pp. 123–24, doi:10.18420/SE2020_36.
short: 'F. Pauck, E. Bodden, H. Wehrheim, in: M. Felderer, W. Hasselbring, R. Rabiser,
R. Jung (Eds.), Software Engineering 2020, Fachtagung Des GI-Fachbereichs Softwaretechnik,
24.-28. Februar 2020, Innsbruck, Austria, Gesellschaft f{\"{u}}r Informatik e.V.,
2020, pp. 123–124.'
date_created: 2020-03-03T08:10:33Z
date_updated: 2023-01-18T08:39:53Z
department:
- _id: '34'
- _id: '77'
doi: 10.18420/SE2020_36
editor:
- first_name: Michael
full_name: Felderer, Michael
last_name: Felderer
- first_name: Wilhelm
full_name: Hasselbring, Wilhelm
last_name: Hasselbring
- first_name: Rick
full_name: Rabiser, Rick
last_name: Rabiser
- first_name: Reiner
full_name: Jung, Reiner
last_name: Jung
language:
- iso: eng
page: 123-124
publication: Software Engineering 2020, Fachtagung des GI-Fachbereichs Softwaretechnik,
24.-28. Februar 2020, Innsbruck, Austria
publication_status: published
publisher: Gesellschaft f{\"{u}}r Informatik e.V.
series_title: '{LNI}'
status: public
title: Reproducing Taint-Analysis Results with ReproDroid
type: conference
user_id: '22398'
year: '2020'
...
---
_id: '3287'
abstract:
- lang: eng
text: "For optimal placement and orchestration of network services, it is crucial\r\nthat
their structure and semantics are specified clearly and comprehensively\r\nand
are available to an orchestrator. Existing specification approaches are\r\neither
ambiguous or miss important aspects regarding the behavior of virtual\r\nnetwork
functions (VNFs) forming a service. We propose to formally and\r\nunambiguously
specify the behavior of these functions and services using\r\nQueuing Petri Nets
(QPNs). QPNs are an established method that allows to\r\nexpress queuing, synchronization,
stochastically distributed processing delays,\r\nand changing traffic volume and
characteristics at each VNF. With QPNs,\r\nmultiple VNFs can be connected to complete
network services in any structure,\r\neven specifying bidirectional network services
containing loops.\r\n We discuss how management and orchestration systems can
benefit from our\r\nclear and comprehensive specification approach, leading to
better placement of\r\nVNFs and improved Quality of Service. Another benefit of
formally specifying\r\nnetwork services with QPNs are diverse analysis options,
which allow valuable\r\ninsights such as the distribution of end-to-end delay.
We propose a tool-based\r\nworkflow that supports the specification of network
services and the automatic\r\ngeneration of corresponding simulation code to enable
an in-depth analysis of\r\ntheir behavior and performance."
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Schneider SB, Sharma A, Karl H, Wehrheim H. Specifying and Analyzing Virtual
Network Services Using Queuing Petri Nets. In: 2019 IFIP/IEEE International
Symposium on Integrated Network Management (IM). Washington, DC, USA: IFIP;
2019:116--124.'
apa: 'Schneider, S. B., Sharma, A., Karl, H., & Wehrheim, H. (2019). Specifying
and Analyzing Virtual Network Services Using Queuing Petri Nets. In 2019 IFIP/IEEE
International Symposium on Integrated Network Management (IM) (pp. 116--124).
Washington, DC, USA: IFIP.'
bibtex: '@inproceedings{Schneider_Sharma_Karl_Wehrheim_2019, place={Washington,
DC, USA}, title={Specifying and Analyzing Virtual Network Services Using Queuing
Petri Nets}, booktitle={2019 IFIP/IEEE International Symposium on Integrated Network
Management (IM)}, publisher={IFIP}, author={Schneider, Stefan Balthasar and Sharma,
Arnab and Karl, Holger and Wehrheim, Heike}, year={2019}, pages={116--124} }'
chicago: 'Schneider, Stefan Balthasar, Arnab Sharma, Holger Karl, and Heike Wehrheim.
“Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets.”
In 2019 IFIP/IEEE International Symposium on Integrated Network Management
(IM), 116--124. Washington, DC, USA: IFIP, 2019.'
ieee: S. B. Schneider, A. Sharma, H. Karl, and H. Wehrheim, “Specifying and Analyzing
Virtual Network Services Using Queuing Petri Nets,” in 2019 IFIP/IEEE International
Symposium on Integrated Network Management (IM), Washington, DC, USA, 2019,
pp. 116--124.
mla: Schneider, Stefan Balthasar, et al. “Specifying and Analyzing Virtual Network
Services Using Queuing Petri Nets.” 2019 IFIP/IEEE International Symposium
on Integrated Network Management (IM), IFIP, 2019, pp. 116--124.
short: 'S.B. Schneider, A. Sharma, H. Karl, H. Wehrheim, in: 2019 IFIP/IEEE International
Symposium on Integrated Network Management (IM), IFIP, Washington, DC, USA, 2019,
pp. 116--124.'
conference:
end_date: 2019-04-12
location: Washington, DC, USA
name: 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)
start_date: 2019-04-08
date_created: 2018-06-18T15:23:18Z
date_updated: 2022-01-06T06:59:09Z
ddc:
- '040'
department:
- _id: '77'
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2019-01-07T12:38:35Z
date_updated: 2019-01-07T12:38:35Z
file_id: '6504'
file_name: ris_preprint.pdf
file_size: 497528
relation: main_file
file_date_updated: 2019-01-07T12:38:35Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://dl.ifip.org/db/conf/im/im2019/188490.pdf
oa: '1'
page: 116--124
place: Washington, DC, USA
project:
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
- _id: '25'
call_identifier: 5G PPP Phase 1
grant_number: '671517'
name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
Networks'
publication: 2019 IFIP/IEEE International Symposium on Integrated Network Management
(IM)
publisher: IFIP
status: public
title: Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets
type: conference
user_id: '35343'
year: '2019'
...
---
_id: '7752'
author:
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Sharma A, Wehrheim H. Testing Balancedness of ML Algorithms. In: Proceedings
of the Software Engineering Conference (SE). Vol P-292. Lecture Notes in Informatics
(LNI). Stuttgart: Gesellschaft für Informatik e.V. (GI); 2019:157-158.'
apa: 'Sharma, A., & Wehrheim, H. (2019). Testing Balancedness of ML Algorithms.
In Proceedings of the Software Engineering Conference (SE) (Vol. P-292,
pp. 157–158). Stuttgart: Gesellschaft für Informatik e.V. (GI).'
bibtex: '@inproceedings{Sharma_Wehrheim_2019, place={Stuttgart}, series={Lecture
Notes in Informatics (LNI)}, title={Testing Balancedness of ML Algorithms}, volume={P-292},
booktitle={Proceedings of the Software Engineering Conference (SE)}, publisher={Gesellschaft
für Informatik e.V. (GI)}, author={Sharma, Arnab and Wehrheim, Heike}, year={2019},
pages={157–158}, collection={Lecture Notes in Informatics (LNI)} }'
chicago: 'Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.”
In Proceedings of the Software Engineering Conference (SE), P-292:157–58.
Lecture Notes in Informatics (LNI). Stuttgart: Gesellschaft für Informatik e.V.
(GI), 2019.'
ieee: A. Sharma and H. Wehrheim, “Testing Balancedness of ML Algorithms,” in Proceedings
of the Software Engineering Conference (SE), Stuttgart, 2019, vol. P-292,
pp. 157–158.
mla: Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.”
Proceedings of the Software Engineering Conference (SE), vol. P-292, Gesellschaft
für Informatik e.V. (GI), 2019, pp. 157–58.
short: 'A. Sharma, H. Wehrheim, in: Proceedings of the Software Engineering Conference
(SE), Gesellschaft für Informatik e.V. (GI), Stuttgart, 2019, pp. 157–158.'
conference:
end_date: 2019-02-22
location: Stuttgart
name: Software Engineering(SE)
start_date: 2019-02-18
date_created: 2019-02-19T08:28:23Z
date_updated: 2022-01-06T07:03:45Z
department:
- _id: '34'
- _id: '77'
language:
- iso: eng
page: 157 - 158
place: Stuttgart
project:
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '1'
name: SFB 901
publication: Proceedings of the Software Engineering Conference (SE)
publication_identifier:
isbn:
- 978-3-88579-686-2
publication_status: published
publisher: Gesellschaft für Informatik e.V. (GI)
series_title: Lecture Notes in Informatics (LNI)
status: public
title: Testing Balancedness of ML Algorithms
type: conference_abstract
user_id: '477'
volume: P-292
year: '2019'
...
---
_id: '7623'
author:
- first_name: Shikun
full_name: Zhang, Shikun
last_name: Zhang
citation:
ama: Zhang S. Combining Android Apps for Analysis Purposes. Universität Paderborn;
2019.
apa: Zhang, S. (2019). Combining Android Apps for Analysis Purposes. Universität
Paderborn.
bibtex: '@book{Zhang_2019, title={Combining Android Apps for Analysis Purposes},
publisher={Universität Paderborn}, author={Zhang, Shikun}, year={2019} }'
chicago: Zhang, Shikun. Combining Android Apps for Analysis Purposes. Universität
Paderborn, 2019.
ieee: S. Zhang, Combining Android Apps for Analysis Purposes. Universität
Paderborn, 2019.
mla: Zhang, Shikun. Combining Android Apps for Analysis Purposes. Universität
Paderborn, 2019.
short: S. Zhang, Combining Android Apps for Analysis Purposes, Universität Paderborn,
2019.
date_created: 2019-02-12T06:13:43Z
date_updated: 2022-01-06T07:03:41Z
department:
- _id: '77'
language:
- iso: eng
page: '64'
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: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Combining Android Apps for Analysis Purposes
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '7635'
author:
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Sharma A, Wehrheim H. Testing Machine Learning Algorithms for Balanced Data
Usage. In: IEEE International Conference on Software Testing, Verification
and Validation (ICST). Xi’an, China: IEEE; 2019:125--135.'
apa: 'Sharma, A., & Wehrheim, H. (2019). Testing Machine Learning Algorithms
for Balanced Data Usage. In IEEE International Conference on Software Testing,
Verification and Validation (ICST) (pp. 125--135). Xi’an, China: IEEE.'
bibtex: '@inproceedings{Sharma_Wehrheim_2019, place={Xi’an, China}, title={Testing
Machine Learning Algorithms for Balanced Data Usage}, booktitle={IEEE International
Conference on Software Testing, Verification and Validation (ICST)}, publisher={IEEE},
author={Sharma, Arnab and Wehrheim, Heike}, year={2019}, pages={125--135} }'
chicago: 'Sharma, Arnab, and Heike Wehrheim. “Testing Machine Learning Algorithms
for Balanced Data Usage.” In IEEE International Conference on Software Testing,
Verification and Validation (ICST), 125--135. Xi’an, China: IEEE, 2019.'
ieee: A. Sharma and H. Wehrheim, “Testing Machine Learning Algorithms for Balanced
Data Usage,” in IEEE International Conference on Software Testing, Verification
and Validation (ICST), Xi’an, China, April, 2019, 2019, pp. 125--135.
mla: Sharma, Arnab, and Heike Wehrheim. “Testing Machine Learning Algorithms for
Balanced Data Usage.” IEEE International Conference on Software Testing, Verification
and Validation (ICST), IEEE, 2019, pp. 125--135.
short: 'A. Sharma, H. Wehrheim, in: IEEE International Conference on Software Testing,
Verification and Validation (ICST), IEEE, Xi’an, China, 2019, pp. 125--135.'
conference:
end_date: 2019-04-27
location: Xi'an, China, April, 2019
name: IEEE International Conference on Software Testing, Verification and Validation
(ICST)
start_date: 2019-04-22
date_created: 2019-02-12T12:31:57Z
date_updated: 2022-01-06T07:03:42Z
ddc:
- '004'
department:
- _id: '34'
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T10:56:34Z
date_updated: 2019-08-26T10:56:34Z
file_id: '12960'
file_name: 08730187.pdf
file_size: 266375
relation: main_file
success: 1
file_date_updated: 2019-08-26T10:56:34Z
has_accepted_license: '1'
language:
- iso: eng
page: 125--135
place: Xi'an, China
project:
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '1'
name: SFB 901
publication: IEEE International Conference on Software Testing, Verification and Validation
(ICST)
publication_status: published
publisher: IEEE
status: public
title: Testing Machine Learning Algorithms for Balanced Data Usage
type: conference
user_id: '29719'
year: '2019'
...
---
_id: '12885'
author:
- first_name: Jan Frederik
full_name: Haltermann, Jan Frederik
id: '44413'
last_name: Haltermann
citation:
ama: Haltermann JF. Analyzing Data Usage in Array Programs.; 2019.
apa: Haltermann, J. F. (2019). Analyzing Data Usage in Array Programs.
bibtex: '@book{Haltermann_2019, title={Analyzing Data Usage in Array Programs},
author={Haltermann, Jan Frederik}, year={2019} }'
chicago: Haltermann, Jan Frederik. Analyzing Data Usage in Array Programs,
2019.
ieee: J. F. Haltermann, Analyzing Data Usage in Array Programs. 2019.
mla: Haltermann, Jan Frederik. Analyzing Data Usage in Array Programs. 2019.
short: J.F. Haltermann, Analyzing Data Usage in Array Programs, 2019.
date_created: 2019-07-24T08:06:11Z
date_updated: 2022-01-06T06:51:23Z
ddc:
- '000'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: jfh
date_created: 2019-07-24T07:44:29Z
date_updated: 2019-07-24T07:44:29Z
file_id: '12886'
file_name: Thesis_Haltermann.pdf
file_size: 1344093
relation: main_file
success: 1
file_date_updated: 2019-07-24T07:44:29Z
has_accepted_license: '1'
language:
- iso: eng
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Analyzing Data Usage in Array Programs
type: mastersthesis
user_id: '44413'
year: '2019'
...
---
_id: '15838'
abstract:
- lang: eng
text: In the field of software analysis a trade-off between scalability and accuracy
always exists. In this respect, Android app analysis is no exception, in particular,
analyzing large or many apps can be challenging. Dealing with many small apps
is a typical challenge when facing micro-benchmarks such as DROIDBENCH or ICC-BENCH.
These particular benchmarks are not only used for the evaluation of novel tools
but also in continuous integration pipelines of existing mature tools to maintain
and guarantee a certain quality-level. Considering this latter usage it becomes
very important to be able to achieve benchmark results as fast as possible. Hence,
benchmarks have to be optimized for this purpose. One approach to do so is app
merging. We implemented the Android Merge Tool (AMT) following this approach and
show that its novel aspects can be used to produce scaled up and accurate benchmarks.
For such benchmarks Android app analysis tools do not suffer from the scalability-accuracy
trade-off anymore. We show this throughout detailed experiments on DROIDBENCH
employing three different analysis tools (AMANDROID, ICCTA, FLOWDROID). Benchmark
execution times are largely reduced without losing benchmark accuracy. Moreover,
we argue why AMT is an advantageous successor of the state-of-the-art app merging
tool (APKCOMBINER) in analysis lift-up scenarios.
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Shikun
full_name: Zhang, Shikun
last_name: Zhang
citation:
ama: 'Pauck F, Zhang S. Android App Merging for Benchmark Speed-Up and Analysis
Lift-Up. In: 2019 34th IEEE/ACM International Conference on Automated Software
Engineering Workshop (ASEW). ; 2019. doi:10.1109/asew.2019.00019'
apa: Pauck, F., & Zhang, S. (2019). Android App Merging for Benchmark Speed-Up
and Analysis Lift-Up. In 2019 34th IEEE/ACM International Conference on Automated
Software Engineering Workshop (ASEW). https://doi.org/10.1109/asew.2019.00019
bibtex: '@inproceedings{Pauck_Zhang_2019, title={Android App Merging for Benchmark
Speed-Up and Analysis Lift-Up}, DOI={10.1109/asew.2019.00019},
booktitle={2019 34th IEEE/ACM International Conference on Automated Software Engineering
Workshop (ASEW)}, author={Pauck, Felix and Zhang, Shikun}, year={2019} }'
chicago: Pauck, Felix, and Shikun Zhang. “Android App Merging for Benchmark Speed-Up
and Analysis Lift-Up.” In 2019 34th IEEE/ACM International Conference on Automated
Software Engineering Workshop (ASEW), 2019. https://doi.org/10.1109/asew.2019.00019.
ieee: F. Pauck and S. Zhang, “Android App Merging for Benchmark Speed-Up and Analysis
Lift-Up,” in 2019 34th IEEE/ACM International Conference on Automated Software
Engineering Workshop (ASEW), 2019.
mla: Pauck, Felix, and Shikun Zhang. “Android App Merging for Benchmark Speed-Up
and Analysis Lift-Up.” 2019 34th IEEE/ACM International Conference on Automated
Software Engineering Workshop (ASEW), 2019, doi:10.1109/asew.2019.00019.
short: 'F. Pauck, S. Zhang, in: 2019 34th IEEE/ACM International Conference on Automated
Software Engineering Workshop (ASEW), 2019.'
date_created: 2020-02-06T17:06:51Z
date_updated: 2022-01-06T06:52:38Z
ddc:
- '004'
department:
- _id: '77'
doi: 10.1109/asew.2019.00019
file:
- access_level: closed
content_type: application/pdf
creator: fpauck
date_created: 2020-02-06T17:09:45Z
date_updated: 2020-02-06T17:09:45Z
file_id: '15839'
file_name: AMT_final.pdf
file_size: 644517
relation: main_file
file_date_updated: 2020-02-06T17:09:45Z
has_accepted_license: '1'
keyword:
- Program Analysis
- Android App Analysis
- Taint Analysis
- App Merging
- Benchmark
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: 2019 34th IEEE/ACM International Conference on Automated Software Engineering
Workshop (ASEW)
publication_identifier:
isbn:
- '9781728141367'
publication_status: published
status: public
title: Android App Merging for Benchmark Speed-Up and Analysis Lift-Up
type: conference
user_id: '477'
year: '2019'
...
---
_id: '16215'
author:
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Derrick J, Doherty S, Dongol B, Schellhorn G, Wehrheim H. Verifying Correctness
of Persistent Concurrent Data Structures. In: H. ter Beek M, McIver A, N. Oliveira
J, eds. Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019,
Porto, Portugal, October 7-11, 2019, Proceedings. Vol 11800. Lecture Notes
in Computer Science. Springer; 2019:179-195. doi:10.1007/978-3-030-30942-8\_12'
apa: Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., & Wehrheim, H. (2019).
Verifying Correctness of Persistent Concurrent Data Structures. In M. H. ter Beek,
A. McIver, & J. N. Oliveira (Eds.), Formal Methods - The Next 30 Years
- Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings
(Vol. 11800, pp. 179–195). Springer. https://doi.org/10.1007/978-3-030-30942-8\_12
bibtex: '@inproceedings{Derrick_Doherty_Dongol_Schellhorn_Wehrheim_2019, series={Lecture
Notes in Computer Science}, title={Verifying Correctness of Persistent Concurrent
Data Structures}, volume={11800}, DOI={10.1007/978-3-030-30942-8\_12},
booktitle={Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019,
Porto, Portugal, October 7-11, 2019, Proceedings}, publisher={Springer}, author={Derrick,
John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim,
Heike}, editor={H. ter Beek, Maurice and McIver, Annabelle and N. Oliveira, Jos{\’{e}}Editors},
year={2019}, pages={179–195}, collection={Lecture Notes in Computer Science} }'
chicago: Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike
Wehrheim. “Verifying Correctness of Persistent Concurrent Data Structures.” In
Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto,
Portugal, October 7-11, 2019, Proceedings, edited by Maurice H. ter Beek,
Annabelle McIver, and Jos{\’{e}} N. Oliveira, 11800:179–95. Lecture Notes in Computer
Science. Springer, 2019. https://doi.org/10.1007/978-3-030-30942-8\_12.
ieee: J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, and H. Wehrheim, “Verifying
Correctness of Persistent Concurrent Data Structures,” in Formal Methods -
The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October
7-11, 2019, Proceedings, 2019, vol. 11800, pp. 179–195.
mla: Derrick, John, et al. “Verifying Correctness of Persistent Concurrent Data
Structures.” Formal Methods - The Next 30 Years - Third World Congress, {FM}
2019, Porto, Portugal, October 7-11, 2019, Proceedings, edited by Maurice
H. ter Beek et al., vol. 11800, Springer, 2019, pp. 179–95, doi:10.1007/978-3-030-30942-8\_12.
short: 'J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, H. Wehrheim, in: M. H.
ter Beek, A. McIver, J. N. Oliveira (Eds.), Formal Methods - The Next 30 Years
- Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings,
Springer, 2019, pp. 179–195.'
date_created: 2020-03-03T08:15:53Z
date_updated: 2022-01-06T06:52:45Z
department:
- _id: '34'
- _id: '77'
doi: 10.1007/978-3-030-30942-8\_12
editor:
- first_name: Maurice
full_name: H. ter Beek, Maurice
last_name: H. ter Beek
- first_name: Annabelle
full_name: McIver, Annabelle
last_name: McIver
- first_name: Jos{\'{e}}
full_name: N. Oliveira, Jos{\'{e}}
last_name: N. Oliveira
intvolume: ' 11800'
language:
- iso: eng
page: 179-195
publication: Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019,
Porto, Portugal, October 7-11, 2019, Proceedings
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Verifying Correctness of Persistent Concurrent Data Structures
type: conference
user_id: '29719'
volume: 11800
year: '2019'
...
---
_id: '16216'
author:
- first_name: Alessandra
full_name: Russo, Alessandra
last_name: Russo
- first_name: Andy
full_name: Schürr, Andy
last_name: Schürr
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Russo A, Schürr A, Wehrheim H. Editorial. Formal Asp Comput. 2019;31(5):457-458.
doi:10.1007/s00165-019-00495-y
apa: Russo, A., Schürr, A., & Wehrheim, H. (2019). Editorial. Formal Asp.
Comput., 31(5), 457–458. https://doi.org/10.1007/s00165-019-00495-y
bibtex: '@article{Russo_Schürr_Wehrheim_2019, title={Editorial}, volume={31}, DOI={10.1007/s00165-019-00495-y},
number={5}, journal={Formal Asp. Comput.}, author={Russo, Alessandra and Schürr,
Andy and Wehrheim, Heike}, year={2019}, pages={457–458} }'
chicago: 'Russo, Alessandra, Andy Schürr, and Heike Wehrheim. “Editorial.” Formal
Asp. Comput. 31, no. 5 (2019): 457–58. https://doi.org/10.1007/s00165-019-00495-y.'
ieee: A. Russo, A. Schürr, and H. Wehrheim, “Editorial,” Formal Asp. Comput.,
vol. 31, no. 5, pp. 457–458, 2019.
mla: Russo, Alessandra, et al. “Editorial.” Formal Asp. Comput., vol. 31,
no. 5, 2019, pp. 457–58, doi:10.1007/s00165-019-00495-y.
short: A. Russo, A. Schürr, H. Wehrheim, Formal Asp. Comput. 31 (2019) 457–458.
date_created: 2020-03-03T08:17:44Z
date_updated: 2022-01-06T06:52:45Z
department:
- _id: '34'
- _id: '77'
doi: 10.1007/s00165-019-00495-y
intvolume: ' 31'
issue: '5'
language:
- iso: eng
page: 457-458
publication: Formal Asp. Comput.
status: public
title: Editorial
type: journal_article
user_id: '29719'
volume: 31
year: '2019'
...
---
_id: '16217'
author:
- first_name: Martin
full_name: Fränzle, Martin
last_name: Fränzle
- first_name: Deepak
full_name: Kapur, Deepak
last_name: Kapur
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Naijun
full_name: Zhan, Naijun
last_name: Zhan
citation:
ama: Fränzle M, Kapur D, Wehrheim H, Zhan N. Editorial. Formal Asp Comput.
2019;31(1):1. doi:10.1007/s00165-018-00477-6
apa: Fränzle, M., Kapur, D., Wehrheim, H., & Zhan, N. (2019). Editorial. Formal
Asp. Comput., 31(1), 1. https://doi.org/10.1007/s00165-018-00477-6
bibtex: '@article{Fränzle_Kapur_Wehrheim_Zhan_2019, title={Editorial}, volume={31},
DOI={10.1007/s00165-018-00477-6},
number={1}, journal={Formal Asp. Comput.}, author={Fränzle, Martin and Kapur,
Deepak and Wehrheim, Heike and Zhan, Naijun}, year={2019}, pages={1} }'
chicago: 'Fränzle, Martin, Deepak Kapur, Heike Wehrheim, and Naijun Zhan. “Editorial.”
Formal Asp. Comput. 31, no. 1 (2019): 1. https://doi.org/10.1007/s00165-018-00477-6.'
ieee: M. Fränzle, D. Kapur, H. Wehrheim, and N. Zhan, “Editorial,” Formal Asp.
Comput., vol. 31, no. 1, p. 1, 2019.
mla: Fränzle, Martin, et al. “Editorial.” Formal Asp. Comput., vol. 31, no.
1, 2019, p. 1, doi:10.1007/s00165-018-00477-6.
short: M. Fränzle, D. Kapur, H. Wehrheim, N. Zhan, Formal Asp. Comput. 31 (2019)
1.
date_created: 2020-03-03T08:19:35Z
date_updated: 2022-01-06T06:52:45Z
department:
- _id: '34'
- _id: '77'
doi: 10.1007/s00165-018-00477-6
intvolume: ' 31'
issue: '1'
language:
- iso: eng
page: '1'
publication: Formal Asp. Comput.
status: public
title: Editorial
type: journal_article
user_id: '29719'
volume: 31
year: '2019'
...
---
_id: '13872'
author:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
citation:
ama: 'Beyer D, Jakobs M-C. CoVeriTest: Cooperative Verifier-Based Testing. In: Fundamental
Approaches to Software Engineering. Cham; 2019. doi:10.1007/978-3-030-16722-6_23'
apa: 'Beyer, D., & Jakobs, M.-C. (2019). CoVeriTest: Cooperative Verifier-Based
Testing. In Fundamental Approaches to Software Engineering. Cham. https://doi.org/10.1007/978-3-030-16722-6_23'
bibtex: '@inbook{Beyer_Jakobs_2019, place={Cham}, title={CoVeriTest: Cooperative
Verifier-Based Testing}, DOI={10.1007/978-3-030-16722-6_23},
booktitle={Fundamental Approaches to Software Engineering}, author={Beyer, Dirk
and Jakobs, Marie-Christine}, year={2019} }'
chicago: 'Beyer, Dirk, and Marie-Christine Jakobs. “CoVeriTest: Cooperative Verifier-Based
Testing.” In Fundamental Approaches to Software Engineering. Cham, 2019.
https://doi.org/10.1007/978-3-030-16722-6_23.'
ieee: 'D. Beyer and M.-C. Jakobs, “CoVeriTest: Cooperative Verifier-Based Testing,”
in Fundamental Approaches to Software Engineering, Cham, 2019.'
mla: 'Beyer, Dirk, and Marie-Christine Jakobs. “CoVeriTest: Cooperative Verifier-Based
Testing.” Fundamental Approaches to Software Engineering, 2019, doi:10.1007/978-3-030-16722-6_23.'
short: 'D. Beyer, M.-C. Jakobs, in: Fundamental Approaches to Software Engineering,
Cham, 2019.'
date_created: 2019-10-16T06:39:51Z
date_updated: 2022-01-06T06:51:45Z
department:
- _id: '77'
doi: 10.1007/978-3-030-16722-6_23
language:
- iso: eng
place: Cham
project:
- _id: '85'
name: Kooperative Softwareverifikation
publication: Fundamental Approaches to Software Engineering
publication_identifier:
isbn:
- '9783030167219'
- '9783030167226'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'CoVeriTest: Cooperative Verifier-Based Testing'
type: book_chapter
user_id: '44413'
year: '2019'
...
---
_id: '13993'
author:
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Derrick J, Doherty S, Dongol B, Schellhorn G, Wehrheim H. Verifying Correctness
of Persistent Concurrent Data Structures. In: Formal Methods - The Next 30
Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019,
Proceedings. ; 2019:179-195. doi:10.1007/978-3-030-30942-8\_12'
apa: Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., & Wehrheim, H. (2019).
Verifying Correctness of Persistent Concurrent Data Structures. In Formal Methods
- The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October
7-11, 2019, Proceedings (pp. 179–195). https://doi.org/10.1007/978-3-030-30942-8\_12
bibtex: '@inproceedings{Derrick_Doherty_Dongol_Schellhorn_Wehrheim_2019, title={Verifying
Correctness of Persistent Concurrent Data Structures}, DOI={10.1007/978-3-030-30942-8\_12},
booktitle={Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019,
Porto, Portugal, October 7-11, 2019, Proceedings}, author={Derrick, John and Doherty,
Simon and Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike}, year={2019},
pages={179–195} }'
chicago: Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike
Wehrheim. “Verifying Correctness of Persistent Concurrent Data Structures.” In
Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto,
Portugal, October 7-11, 2019, Proceedings, 179–95, 2019. https://doi.org/10.1007/978-3-030-30942-8\_12.
ieee: J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, and H. Wehrheim, “Verifying
Correctness of Persistent Concurrent Data Structures,” in Formal Methods -
The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October
7-11, 2019, Proceedings, 2019, pp. 179–195.
mla: Derrick, John, et al. “Verifying Correctness of Persistent Concurrent Data
Structures.” Formal Methods - The Next 30 Years - Third World Congress, {FM}
2019, Porto, Portugal, October 7-11, 2019, Proceedings, 2019, pp. 179–95,
doi:10.1007/978-3-030-30942-8\_12.
short: 'J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, H. Wehrheim, in: Formal
Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal,
October 7-11, 2019, Proceedings, 2019, pp. 179–195.'
date_created: 2019-10-24T08:20:28Z
date_updated: 2022-01-06T06:51:48Z
department:
- _id: '77'
doi: 10.1007/978-3-030-30942-8\_12
language:
- iso: eng
page: 179-195
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019,
Porto, Portugal, October 7-11, 2019, Proceedings
status: public
title: Verifying Correctness of Persistent Concurrent Data Structures
type: conference
user_id: '29719'
year: '2019'
...
---
_id: '10011'
author:
- first_name: Martin
full_name: Fränzle, Martin
last_name: Fränzle
- first_name: Deepak
full_name: Kapur, Deepak
last_name: Kapur
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Naijun
full_name: Zhan, Naijun
last_name: Zhan
citation:
ama: Fränzle M, Kapur D, Wehrheim H, Zhan N. Editorial. Formal Asp Comput.
2019;31(1):1. doi:10.1007/s00165-018-00477-6
apa: Fränzle, M., Kapur, D., Wehrheim, H., & Zhan, N. (2019). Editorial. Formal
Asp. Comput., 31(1), 1. https://doi.org/10.1007/s00165-018-00477-6
bibtex: '@article{Fränzle_Kapur_Wehrheim_Zhan_2019, title={Editorial}, volume={31},
DOI={10.1007/s00165-018-00477-6},
number={1}, journal={Formal Asp. Comput.}, author={Fränzle, Martin and Kapur,
Deepak and Wehrheim, Heike and Zhan, Naijun}, year={2019}, pages={1} }'
chicago: 'Fränzle, Martin, Deepak Kapur, Heike Wehrheim, and Naijun Zhan. “Editorial.”
Formal Asp. Comput. 31, no. 1 (2019): 1. https://doi.org/10.1007/s00165-018-00477-6.'
ieee: M. Fränzle, D. Kapur, H. Wehrheim, and N. Zhan, “Editorial,” Formal Asp.
Comput., vol. 31, no. 1, p. 1, 2019.
mla: Fränzle, Martin, et al. “Editorial.” Formal Asp. Comput., vol. 31, no.
1, 2019, p. 1, doi:10.1007/s00165-018-00477-6.
short: M. Fränzle, D. Kapur, H. Wehrheim, N. Zhan, Formal Asp. Comput. 31 (2019)
1.
date_created: 2019-05-28T06:32:57Z
date_updated: 2022-01-06T06:50:22Z
department:
- _id: '77'
doi: 10.1007/s00165-018-00477-6
intvolume: ' 31'
issue: '1'
language:
- iso: eng
page: '1'
publication: Formal Asp. Comput.
status: public
title: Editorial
type: journal_article
user_id: '29719'
volume: 31
year: '2019'
...
---
_id: '10091'
author:
- first_name: Jürgen
full_name: König, Jürgen
id: '22358'
last_name: König
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'König J, Wehrheim H. Data Independence for Software Transactional Memory.
In: M. Badger J, Yvonne Rozier K, eds. {NASA} Formal Methods - 11th International
Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings. Vol 11460.
Lecture Notes in Computer Science. Springer; 2019:263-279. doi:10.1007/978-3-030-20652-9\_18'
apa: König, J., & Wehrheim, H. (2019). Data Independence for Software Transactional
Memory. In J. M. Badger & K. Yvonne Rozier (Eds.), {NASA} Formal Methods
- 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings
(Vol. 11460, pp. 263–279). Springer. https://doi.org/10.1007/978-3-030-20652-9\_18
bibtex: '@inproceedings{König_Wehrheim_2019, series={Lecture Notes in Computer Science},
title={Data Independence for Software Transactional Memory}, volume={11460}, DOI={10.1007/978-3-030-20652-9\_18},
booktitle={{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston,
TX, USA, May 7-9, 2019, Proceedings}, publisher={Springer}, author={König, Jürgen
and Wehrheim, Heike}, editor={M. Badger, Julia and Yvonne Rozier, KristinEditors},
year={2019}, pages={263–279}, collection={Lecture Notes in Computer Science} }'
chicago: König, Jürgen, and Heike Wehrheim. “Data Independence for Software Transactional
Memory.” In {NASA} Formal Methods - 11th International Symposium, {NFM} 2019,
Houston, TX, USA, May 7-9, 2019, Proceedings, edited by Julia M. Badger and
Kristin Yvonne Rozier, 11460:263–79. Lecture Notes in Computer Science. Springer,
2019. https://doi.org/10.1007/978-3-030-20652-9\_18.
ieee: J. König and H. Wehrheim, “Data Independence for Software Transactional Memory,”
in {NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston,
TX, USA, May 7-9, 2019, Proceedings, 2019, vol. 11460, pp. 263–279.
mla: König, Jürgen, and Heike Wehrheim. “Data Independence for Software Transactional
Memory.” {NASA} Formal Methods - 11th International Symposium, {NFM} 2019,
Houston, TX, USA, May 7-9, 2019, Proceedings, edited by Julia M. Badger and
Kristin Yvonne Rozier, vol. 11460, Springer, 2019, pp. 263–79, doi:10.1007/978-3-030-20652-9\_18.
short: 'J. König, H. Wehrheim, in: J. M. Badger, K. Yvonne Rozier (Eds.), {NASA}
Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May
7-9, 2019, Proceedings, Springer, 2019, pp. 263–279.'
date_created: 2019-06-03T07:51:26Z
date_updated: 2022-01-06T06:50:28Z
department:
- _id: '77'
doi: 10.1007/978-3-030-20652-9\_18
editor:
- first_name: Julia
full_name: M. Badger, Julia
last_name: M. Badger
- first_name: Kristin
full_name: Yvonne Rozier, Kristin
last_name: Yvonne Rozier
intvolume: ' 11460'
language:
- iso: eng
page: 263-279
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: '{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston,
TX, USA, May 7-9, 2019, Proceedings'
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Data Independence for Software Transactional Memory
type: conference
user_id: '22358'
volume: 11460
year: '2019'
...
---
_id: '10092'
author:
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: John
full_name: Derrick, John
last_name: Derrick
citation:
ama: 'Doherty S, Dongol B, Wehrheim H, Derrick J. Verifying C11 programs operationally.
In: K. Hollingsworth J, Keidar I, eds. Proceedings of the 24th {ACM} {SIGPLAN}
Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington,
DC, USA, February 16-20, 2019. {ACM}; 2019:355-365. doi:10.1145/3293883.3295702'
apa: Doherty, S., Dongol, B., Wehrheim, H., & Derrick, J. (2019). Verifying
C11 programs operationally. In J. K. Hollingsworth & I. Keidar (Eds.), Proceedings
of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming,
PPoPP 2019, Washington, DC, USA, February 16-20, 2019 (pp. 355–365). {ACM}.
https://doi.org/10.1145/3293883.3295702
bibtex: '@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2019, title={Verifying C11
programs operationally}, DOI={10.1145/3293883.3295702},
booktitle={Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and
Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20,
2019}, publisher={{ACM}}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim,
Heike and Derrick, John}, editor={K. Hollingsworth, Jeffrey and Keidar, IditEditors},
year={2019}, pages={355–365} }'
chicago: Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Verifying
C11 Programs Operationally.” In Proceedings of the 24th {ACM} {SIGPLAN} Symposium
on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC,
USA, February 16-20, 2019, edited by Jeffrey K. Hollingsworth and Idit Keidar,
355–65. {ACM}, 2019. https://doi.org/10.1145/3293883.3295702.
ieee: S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Verifying C11 programs
operationally,” in Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles
and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February
16-20, 2019, 2019, pp. 355–365.
mla: Doherty, Simon, et al. “Verifying C11 Programs Operationally.” Proceedings
of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming,
PPoPP 2019, Washington, DC, USA, February 16-20, 2019, edited by Jeffrey K.
Hollingsworth and Idit Keidar, {ACM}, 2019, pp. 355–65, doi:10.1145/3293883.3295702.
short: 'S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: J. K. Hollingsworth,
I. Keidar (Eds.), Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles
and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February
16-20, 2019, {ACM}, 2019, pp. 355–365.'
date_created: 2019-06-03T07:59:36Z
date_updated: 2022-01-06T06:50:28Z
department:
- _id: '77'
doi: 10.1145/3293883.3295702
editor:
- first_name: Jeffrey
full_name: K. Hollingsworth, Jeffrey
last_name: K. Hollingsworth
- first_name: Idit
full_name: Keidar, Idit
last_name: Keidar
language:
- iso: eng
page: 355-365
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice
of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019
publisher: '{ACM}'
status: public
title: Verifying C11 programs operationally
type: conference
user_id: '29719'
year: '2019'
...
---
_id: '10093'
author:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Thomas
full_name: Lemberger, Thomas
last_name: Lemberger
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Beyer D, Jakobs M-C, Lemberger T, Wehrheim H. Combining Verifiers in Conditional
Model Checking via Reducers. In: Becker S, Bogicevic I, Herzwurm G, Wagner S,
eds. Software Engineering and Software Management (SE/SWM 2019), Stuttgart,
Germany, February 18-22, 2019. Vol P-292. LNI. GI; 2019:151--152. doi:10.18420/se2019-46'
apa: Beyer, D., Jakobs, M.-C., Lemberger, T., & Wehrheim, H. (2019). Combining
Verifiers in Conditional Model Checking via Reducers. In S. Becker, I. Bogicevic,
G. Herzwurm, & S. Wagner (Eds.), Software Engineering and Software Management
(SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019 (Vol. P-292, pp. 151--152).
GI. https://doi.org/10.18420/se2019-46
bibtex: '@inproceedings{Beyer_Jakobs_Lemberger_Wehrheim_2019, series={LNI}, title={Combining
Verifiers in Conditional Model Checking via Reducers}, volume={P-292}, DOI={10.18420/se2019-46}, booktitle={Software
Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February
18-22, 2019}, publisher={GI}, author={Beyer, Dirk and Jakobs, Marie-Christine
and Lemberger, Thomas and Wehrheim, Heike}, editor={Becker, Steffen and Bogicevic,
Ivan and Herzwurm, Georg and Wagner, StefanEditors}, year={2019}, pages={151--152},
collection={LNI} }'
chicago: Beyer, Dirk, Marie-Christine Jakobs, Thomas Lemberger, and Heike Wehrheim.
“Combining Verifiers in Conditional Model Checking via Reducers.” In Software
Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February
18-22, 2019, edited by Steffen Becker, Ivan Bogicevic, Georg Herzwurm, and
Stefan Wagner, P-292:151--152. LNI. GI, 2019. https://doi.org/10.18420/se2019-46.
ieee: D. Beyer, M.-C. Jakobs, T. Lemberger, and H. Wehrheim, “Combining Verifiers
in Conditional Model Checking via Reducers,” in Software Engineering and Software
Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019, 2019,
vol. P-292, pp. 151--152.
mla: Beyer, Dirk, et al. “Combining Verifiers in Conditional Model Checking via
Reducers.” Software Engineering and Software Management (SE/SWM 2019), Stuttgart,
Germany, February 18-22, 2019, edited by Steffen Becker et al., vol. P-292,
GI, 2019, pp. 151--152, doi:10.18420/se2019-46.
short: 'D. Beyer, M.-C. Jakobs, T. Lemberger, H. Wehrheim, in: S. Becker, I. Bogicevic,
G. Herzwurm, S. Wagner (Eds.), Software Engineering and Software Management (SE/SWM
2019), Stuttgart, Germany, February 18-22, 2019, GI, 2019, pp. 151--152.'
date_created: 2019-06-03T08:08:39Z
date_updated: 2022-01-06T06:50:28Z
ddc:
- '004'
department:
- _id: '77'
doi: 10.18420/se2019-46
editor:
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
- first_name: Ivan
full_name: Bogicevic, Ivan
last_name: Bogicevic
- first_name: Georg
full_name: Herzwurm, Georg
last_name: Herzwurm
- first_name: Stefan
full_name: Wagner, Stefan
last_name: Wagner
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T09:31:55Z
date_updated: 2019-08-26T09:31:55Z
file_id: '12956'
file_name: 46.pdf
file_size: 472426
relation: main_file
success: 1
file_date_updated: 2019-08-26T09:31:55Z
has_accepted_license: '1'
language:
- iso: eng
page: 151--152
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
publication: Software Engineering and Software Management (SE/SWM 2019), Stuttgart,
Germany, February 18-22, 2019
publisher: GI
series_title: LNI
status: public
title: Combining Verifiers in Conditional Model Checking via Reducers
type: conference
user_id: '477'
volume: P-292
year: '2019'
...
---
_id: '10094'
author:
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Sharma A, Wehrheim H. Testing Balancedness of ML Algorithms. In: Becker S,
Bogicevic I, Herzwurm G, Wagner S, eds. Software Engineering and Software Management,
{SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019. Vol {P-292}. {LNI}.
{GI}; 2019:157-158. doi:10.18420/se2019-48'
apa: Sharma, A., & Wehrheim, H. (2019). Testing Balancedness of ML Algorithms.
In S. Becker, I. Bogicevic, G. Herzwurm, & S. Wagner (Eds.), Software Engineering
and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019
(Vol. {P-292}, pp. 157–158). {GI}. https://doi.org/10.18420/se2019-48
bibtex: '@inproceedings{Sharma_Wehrheim_2019, series={{LNI}}, title={Testing Balancedness
of ML Algorithms}, volume={{P-292}}, DOI={10.18420/se2019-48},
booktitle={Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart,
Germany, February 18-22, 2019}, publisher={{GI}}, author={Sharma, Arnab and Wehrheim,
Heike}, editor={Becker, Steffen and Bogicevic, Ivan and Herzwurm, Georg and Wagner,
StefanEditors}, year={2019}, pages={157–158}, collection={{LNI}} }'
chicago: Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.”
In Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart,
Germany, February 18-22, 2019, edited by Steffen Becker, Ivan Bogicevic, Georg
Herzwurm, and Stefan Wagner, {P-292}:157–58. {LNI}. {GI}, 2019. https://doi.org/10.18420/se2019-48.
ieee: A. Sharma and H. Wehrheim, “Testing Balancedness of ML Algorithms,” in Software
Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February
18-22, 2019, 2019, vol. {P-292}, pp. 157–158.
mla: Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.”
Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany,
February 18-22, 2019, edited by Steffen Becker et al., vol. {P-292}, {GI},
2019, pp. 157–58, doi:10.18420/se2019-48.
short: 'A. Sharma, H. Wehrheim, in: S. Becker, I. Bogicevic, G. Herzwurm, S. Wagner
(Eds.), Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart,
Germany, February 18-22, 2019, {GI}, 2019, pp. 157–158.'
date_created: 2019-06-03T08:10:55Z
date_updated: 2022-01-06T06:50:28Z
department:
- _id: '77'
doi: 10.18420/se2019-48
editor:
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
- first_name: Ivan
full_name: Bogicevic, Ivan
last_name: Bogicevic
- first_name: Georg
full_name: Herzwurm, Georg
last_name: Herzwurm
- first_name: Stefan
full_name: Wagner, Stefan
last_name: Wagner
language:
- iso: eng
page: 157-158
publication: Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart,
Germany, February 18-22, 2019
publisher: '{GI}'
series_title: '{LNI}'
status: public
title: Testing Balancedness of ML Algorithms
type: conference
user_id: '29719'
volume: '{P-292}'
year: '2019'
...
---
_id: '10095'
author:
- first_name: Cedric
full_name: Richter, Cedric
id: '50003'
last_name: Richter
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Richter C, Wehrheim H. PeSCo: Predicting Sequential Combinations of Verifiers
- (Competition Contribution). In: Beyer D, Huisman M, Kordon F, Steffen B, eds.
Tools and Algorithms for the Construction and Analysis of Systems - 25 Years
of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic,
April 6-11, 2019, Proceedings, Part {III}. Vol 11429. Lecture Notes in Computer
Science. Springer; 2019:229-233. doi:10.1007/978-3-030-17502-3_19'
apa: 'Richter, C., & Wehrheim, H. (2019). PeSCo: Predicting Sequential Combinations
of Verifiers - (Competition Contribution). In D. Beyer, M. Huisman, F. Kordon,
& B. Steffen (Eds.), Tools and Algorithms for the Construction and Analysis
of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague,
Czech Republic, April 6-11, 2019, Proceedings, Part {III} (Vol. 11429, pp.
229–233). Springer. https://doi.org/10.1007/978-3-030-17502-3_19'
bibtex: '@inproceedings{Richter_Wehrheim_2019, series={Lecture Notes in Computer
Science}, title={PeSCo: Predicting Sequential Combinations of Verifiers - (Competition
Contribution)}, volume={11429}, DOI={10.1007/978-3-030-17502-3_19},
booktitle={Tools and Algorithms for the Construction and Analysis of Systems -
25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic,
April 6-11, 2019, Proceedings, Part {III}}, publisher={Springer}, author={Richter,
Cedric and Wehrheim, Heike}, editor={Beyer, Dirk and Huisman, Marieke and Kordon,
Fabrice and Steffen, BernhardEditors}, year={2019}, pages={229–233}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations
of Verifiers - (Competition Contribution).” In Tools and Algorithms for the
Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as
Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part
{III}, edited by Dirk Beyer, Marieke Huisman, Fabrice Kordon, and Bernhard
Steffen, 11429:229–33. Lecture Notes in Computer Science. Springer, 2019. https://doi.org/10.1007/978-3-030-17502-3_19.'
ieee: 'C. Richter and H. Wehrheim, “PeSCo: Predicting Sequential Combinations of
Verifiers - (Competition Contribution),” in Tools and Algorithms for the Construction
and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS}
2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}, 2019,
vol. 11429, pp. 229–233.'
mla: 'Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations
of Verifiers - (Competition Contribution).” Tools and Algorithms for the Construction
and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS}
2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}, edited
by Dirk Beyer et al., vol. 11429, Springer, 2019, pp. 229–33, doi:10.1007/978-3-030-17502-3_19.'
short: 'C. Richter, H. Wehrheim, in: D. Beyer, M. Huisman, F. Kordon, B. Steffen
(Eds.), Tools and Algorithms for the Construction and Analysis of Systems - 25
Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic,
April 6-11, 2019, Proceedings, Part {III}, Springer, 2019, pp. 229–233.'
date_created: 2019-06-03T08:12:55Z
date_updated: 2022-01-06T06:50:29Z
ddc:
- '004'
department:
- _id: '77'
doi: 10.1007/978-3-030-17502-3_19
editor:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Marieke
full_name: Huisman, Marieke
last_name: Huisman
- first_name: Fabrice
full_name: Kordon, Fabrice
last_name: Kordon
- first_name: Bernhard
full_name: Steffen, Bernhard
last_name: Steffen
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T11:01:00Z
date_updated: 2019-08-26T11:01:00Z
file_id: '12961'
file_name: PeSCo.pdf
file_size: 254772
relation: main_file
success: 1
file_date_updated: 2019-08-26T11:01:00Z
has_accepted_license: '1'
intvolume: ' 11429'
language:
- iso: eng
page: 229-233
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
publication: Tools and Algorithms for the Construction and Analysis of Systems - 25
Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic,
April 6-11, 2019, Proceedings, Part {III}
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)'
type: conference
user_id: '29719'
volume: 11429
year: '2019'
...
---
_id: '10105'
author:
- first_name: Jan
full_name: Haltermann, Jan
last_name: Haltermann
citation:
ama: Haltermann J. Analyzing Data Usage in Array Programs. Universität Paderborn;
2019.
apa: Haltermann, J. (2019). Analyzing Data Usage in Array Programs. Universität
Paderborn.
bibtex: '@book{Haltermann_2019, title={Analyzing Data Usage in Array Programs},
publisher={Universität Paderborn}, author={Haltermann, Jan}, year={2019} }'
chicago: Haltermann, Jan. Analyzing Data Usage in Array Programs. Universität
Paderborn, 2019.
ieee: J. Haltermann, Analyzing Data Usage in Array Programs. Universität
Paderborn, 2019.
mla: Haltermann, Jan. Analyzing Data Usage in Array Programs. Universität
Paderborn, 2019.
short: J. Haltermann, Analyzing Data Usage in Array Programs, Universität Paderborn,
2019.
date_created: 2019-06-04T10:54:08Z
date_updated: 2022-01-06T06:50:29Z
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: Analyzing Data Usage in Array Programs
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '10108'
abstract:
- lang: eng
text: "Recent years have seen the development of numerous tools for the analysis
of taint flows in Android apps. Taint analyses aim at detecting data leaks, accidentally
or by purpose programmed into apps. Often, such tools specialize in the treatment
of specific features impeding precise taint analysis (like reflection or inter-app
communication). This multitude of tools, their specific applicability and their
various combination options complicate the selection of a tool (or multiple tools)
when faced with an analysis instance, even for knowledgeable users, and hence
hinders the successful adoption of taint analyses.\r\n\r\nIn this work, we thus
present CoDiDroid, a framework for cooperative Android app analysis. CoDiDroid
(1) allows users to ask questions about flows in apps in varying degrees of detail,
(2) automatically generates subtasks for answering such questions, (3) distributes
tasks onto analysis tools (currently DroidRA, FlowDroid, HornDroid, IC3 and two
novel tools) and (4) at the end merges tool answers on subtasks into an overall
answer. Thereby, users are freed from having to learn about the use and functionality
of all these tools while still being able to leverage their capabilities. Moreover,
we experimentally show that cooperation among tools pays off with respect to effectiveness,
precision and scalability."
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Pauck F, Wehrheim H. Together Strong: Cooperative Android App Analysis. In:
Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering
Conference and Symposium on the Foundations of Software Engineering. ; 2019:374-384.
doi:10.1145/3338906.3338915'
apa: 'Pauck, F., & Wehrheim, H. (2019). Together Strong: Cooperative Android
App Analysis. Proceedings of the 2019 27th ACM Joint Meeting on European Software
Engineering Conference and Symposium on the Foundations of Software Engineering,
374–384. https://doi.org/10.1145/3338906.3338915'
bibtex: '@inproceedings{Pauck_Wehrheim_2019, title={Together Strong: Cooperative
Android App Analysis}, DOI={10.1145/3338906.3338915},
booktitle={Proceedings of the 2019 27th ACM Joint Meeting on European Software
Engineering Conference and Symposium on the Foundations of Software Engineering},
author={Pauck, Felix and Wehrheim, Heike}, year={2019}, pages={374–384} }'
chicago: 'Pauck, Felix, and Heike Wehrheim. “Together Strong: Cooperative Android
App Analysis.” In Proceedings of the 2019 27th ACM Joint Meeting on European
Software Engineering Conference and Symposium on the Foundations of Software Engineering,
374–84, 2019. https://doi.org/10.1145/3338906.3338915.'
ieee: 'F. Pauck and H. Wehrheim, “Together Strong: Cooperative Android App Analysis,”
in Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering
Conference and Symposium on the Foundations of Software Engineering, 2019,
pp. 374–384, doi: 10.1145/3338906.3338915.'
mla: 'Pauck, Felix, and Heike Wehrheim. “Together Strong: Cooperative Android App
Analysis.” Proceedings of the 2019 27th ACM Joint Meeting on European Software
Engineering Conference and Symposium on the Foundations of Software Engineering,
2019, pp. 374–84, doi:10.1145/3338906.3338915.'
short: 'F. Pauck, H. Wehrheim, in: Proceedings of the 2019 27th ACM Joint Meeting
on European Software Engineering Conference and Symposium on the Foundations of
Software Engineering, 2019, pp. 374–384.'
date_created: 2019-06-04T11:15:25Z
date_updated: 2023-01-18T08:32:47Z
ddc:
- '004'
department:
- _id: '77'
doi: 10.1145/3338906.3338915
file:
- access_level: closed
content_type: application/pdf
creator: fpauck
date_created: 2019-08-20T08:47:20Z
date_updated: 2019-08-20T08:47:20Z
file_id: '12947'
file_name: fse19main-id44-p-ef9ce42-41855-final.pdf
file_size: 442603
relation: main_file
file_date_updated: 2019-08-20T08:47:20Z
has_accepted_license: '1'
keyword:
- Android Taint Analysis
- Cooperation
- Precision
- Tools
language:
- iso: eng
page: 374-384
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering
Conference and Symposium on the Foundations of Software Engineering
publication_identifier:
isbn:
- 978-1-4503-5572-8
publication_status: published
status: public
title: 'Together Strong: Cooperative Android App Analysis'
type: conference
user_id: '22398'
year: '2019'
...
---
_id: '13874'
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
id: '22398'
last_name: Pauck
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Isenberg T, Jakobs M-C, Pauck F, Wehrheim H. When Are Software Verification
Results Valid for Approximate Hardware? In: Tests and Proofs - 13th International
Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods
2019, Porto, Portugal, October 9-11, 2019, Proceedings. ; 2019:3-20. doi:10.1007/978-3-030-31157-5_1'
apa: Isenberg, T., Jakobs, M.-C., Pauck, F., & Wehrheim, H. (2019). When Are
Software Verification Results Valid for Approximate Hardware? Tests and Proofs
- 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress
on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings,
3–20. https://doi.org/10.1007/978-3-030-31157-5_1
bibtex: '@inproceedings{Isenberg_Jakobs_Pauck_Wehrheim_2019, title={When Are Software
Verification Results Valid for Approximate Hardware?}, DOI={10.1007/978-3-030-31157-5_1},
booktitle={Tests and Proofs - 13th International Conference, {TAP} 2019, Held
as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October
9-11, 2019, Proceedings}, author={Isenberg, Tobias and Jakobs, Marie-Christine
and Pauck, Felix and Wehrheim, Heike}, year={2019}, pages={3–20} }'
chicago: Isenberg, Tobias, Marie-Christine Jakobs, Felix Pauck, and Heike Wehrheim.
“When Are Software Verification Results Valid for Approximate Hardware?” In Tests
and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third
World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings,
3–20, 2019. https://doi.org/10.1007/978-3-030-31157-5_1.
ieee: 'T. Isenberg, M.-C. Jakobs, F. Pauck, and H. Wehrheim, “When Are Software
Verification Results Valid for Approximate Hardware?,” in Tests and Proofs
- 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress
on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings,
2019, pp. 3–20, doi: 10.1007/978-3-030-31157-5_1.'
mla: Isenberg, Tobias, et al. “When Are Software Verification Results Valid for
Approximate Hardware?” Tests and Proofs - 13th International Conference, {TAP}
2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto,
Portugal, October 9-11, 2019, Proceedings, 2019, pp. 3–20, doi:10.1007/978-3-030-31157-5_1.
short: 'T. Isenberg, M.-C. Jakobs, F. Pauck, H. Wehrheim, in: Tests and Proofs -
13th International Conference, {TAP} 2019, Held as Part of the Third World Congress
on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings, 2019,
pp. 3–20.'
date_created: 2019-10-16T09:40:20Z
date_updated: 2023-01-18T08:41:17Z
department:
- _id: '77'
doi: 10.1007/978-3-030-31157-5_1
language:
- iso: eng
page: 3-20
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publication: Tests and Proofs - 13th International Conference, {TAP} 2019, Held as
Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October
9-11, 2019, Proceedings
publication_status: published
status: public
title: When Are Software Verification Results Valid for Approximate Hardware?
type: conference
user_id: '22398'
year: '2019'
...
---
_id: '3320'
author:
- first_name: Kai
full_name: Rautenberg, Kai
last_name: Rautenberg
citation:
ama: Rautenberg K. Korrektheitsbeweise für Muster von Servicekompositionen.
Universität Paderborn; 2018.
apa: Rautenberg, K. (2018). Korrektheitsbeweise für Muster von Servicekompositionen.
Universität Paderborn.
bibtex: '@book{Rautenberg_2018, title={Korrektheitsbeweise für Muster von Servicekompositionen},
publisher={Universität Paderborn}, author={Rautenberg, Kai}, year={2018} }'
chicago: Rautenberg, Kai. Korrektheitsbeweise für Muster von Servicekompositionen.
Universität Paderborn, 2018.
ieee: K. Rautenberg, Korrektheitsbeweise für Muster von Servicekompositionen.
Universität Paderborn, 2018.
mla: Rautenberg, Kai. Korrektheitsbeweise für Muster von Servicekompositionen.
Universität Paderborn, 2018.
short: K. Rautenberg, Korrektheitsbeweise für Muster von Servicekompositionen, Universität
Paderborn, 2018.
date_created: 2018-06-25T07:53:32Z
date_updated: 2022-01-06T06:59:10Z
department:
- _id: '7'
- _id: '77'
language:
- iso: ger
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: Korrektheitsbeweise für Muster von Servicekompositionen
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '3414'
abstract:
- lang: eng
text: "Over the years, Design by Contract (DbC) has evolved as a\r\npowerful concept
for program documentation, testing, and verification.\r\nContracts formally specify
assertions on (mostly) object-oriented programs:\r\npre- and postconditions of
methods, class invariants, allowed call\r\norders, etc. Missing in the long list
of properties specifiable by contracts\r\nare, however, method correlations: DbC
languages fall short on stating\r\nassertions relating methods.\r\nIn this paper,
we propose the novel concept of inter-method contract,\r\nallowing precisely for
expressing method correlations.We present JMC as\r\na language for specifying
and JMCTest as a tool for dynamically checking\r\ninter-method contracts on Java
programs. JMCTest fully automatically\r\ngenerates objects on which the contracted
methods are called and\r\nthe validity of the contract is checked. Using JMCTest,
we detected\r\nthat large Java code bases (e.g. JBoss, Java RT) frequently violate
standard\r\ninter-method contracts. In comparison to other verification tools\r\ninspecting
(some) inter-method contracts, JMCTest can find bugs that\r\nremain undetected
by those tools."
author:
- first_name: Paul
full_name: Börding, Paul
last_name: Börding
- first_name: Jan Frederik
full_name: Haltermann, Jan Frederik
id: '44413'
last_name: Haltermann
- 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: 'Börding P, Haltermann JF, Jakobs M-C, Wehrheim H. JMCTest: Automatically Testing
Inter-Method Contracts in Java. In: Proceedings of the IFIP International Conference
on Testing Software and Systems (ICTSS 2018). Vol 11146. Lecture Notes in
Computer Science. Springer; 2018:39--55.'
apa: 'Börding, P., Haltermann, J. F., Jakobs, M.-C., & Wehrheim, H. (2018).
JMCTest: Automatically Testing Inter-Method Contracts in Java. In Proceedings
of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)
(Vol. 11146, pp. 39--55). Cádiz, Spain: Springer.'
bibtex: '@inproceedings{Börding_Haltermann_Jakobs_Wehrheim_2018, series={Lecture
Notes in Computer Science}, title={JMCTest: Automatically Testing Inter-Method
Contracts in Java}, volume={11146}, booktitle={Proceedings of the IFIP International
Conference on Testing Software and Systems (ICTSS 2018)}, publisher={Springer},
author={Börding, Paul and Haltermann, Jan Frederik and Jakobs, Marie-Christine
and Wehrheim, Heike}, year={2018}, pages={39--55}, collection={Lecture Notes in
Computer Science} }'
chicago: 'Börding, Paul, Jan Frederik Haltermann, Marie-Christine Jakobs, and Heike
Wehrheim. “JMCTest: Automatically Testing Inter-Method Contracts in Java.” In
Proceedings of the IFIP International Conference on Testing Software and Systems
(ICTSS 2018), 11146:39--55. Lecture Notes in Computer Science. Springer, 2018.'
ieee: 'P. Börding, J. F. Haltermann, M.-C. Jakobs, and H. Wehrheim, “JMCTest: Automatically
Testing Inter-Method Contracts in Java,” in Proceedings of the IFIP International
Conference on Testing Software and Systems (ICTSS 2018), Cádiz, Spain, 2018,
vol. 11146, pp. 39--55.'
mla: 'Börding, Paul, et al. “JMCTest: Automatically Testing Inter-Method Contracts
in Java.” Proceedings of the IFIP International Conference on Testing Software
and Systems (ICTSS 2018), vol. 11146, Springer, 2018, pp. 39--55.'
short: 'P. Börding, J.F. Haltermann, M.-C. Jakobs, H. Wehrheim, in: Proceedings
of the IFIP International Conference on Testing Software and Systems (ICTSS 2018),
Springer, 2018, pp. 39--55.'
conference:
end_date: 2018-10-03
location: Cádiz, Spain
name: IFIP International Conference on Testing Software and Systems
start_date: 2018-10-01
date_created: 2018-07-02T09:06:56Z
date_updated: 2022-01-06T06:59:15Z
ddc:
- '006'
department:
- _id: '7'
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: schlatt
date_created: 2018-11-21T09:35:35Z
date_updated: 2018-11-21T09:35:35Z
file_id: '5770'
file_name: Börding2018_Chapter_JMCTestAutomaticallyTestingInt.pdf
file_size: 574386
relation: main_file
success: 1
file_date_updated: 2018-11-21T09:35:35Z
has_accepted_license: '1'
intvolume: ' 11146'
language:
- iso: eng
page: 39--55
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
publication: Proceedings of the IFIP International Conference on Testing Software
and Systems (ICTSS 2018)
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'JMCTest: Automatically Testing Inter-Method Contracts in Java'
type: conference
user_id: '29719'
volume: 11146
year: '2018'
...
---
_id: '3536'
author:
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Monika
full_name: Wedel, Monika
last_name: Wedel
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: Jürgen
full_name: König, Jürgen
id: '22358'
last_name: König
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Schellhorn G, Wedel M, Travkin O, König J, Wehrheim H. FastLane Is Opaque
– a Case Study in Mechanized Proofs of Opacity. In: Software Engineering and
Formal Methods. Cham: Springer International Publishing; 2018:105-120. doi:10.1007/978-3-319-92970-5_7'
apa: 'Schellhorn, G., Wedel, M., Travkin, O., König, J., & Wehrheim, H. (2018).
FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In Software
Engineering and Formal Methods (pp. 105–120). Cham: Springer International
Publishing. https://doi.org/10.1007/978-3-319-92970-5_7'
bibtex: '@inbook{Schellhorn_Wedel_Travkin_König_Wehrheim_2018, place={Cham}, title={FastLane
Is Opaque – a Case Study in Mechanized Proofs of Opacity}, DOI={10.1007/978-3-319-92970-5_7},
booktitle={Software Engineering and Formal Methods}, publisher={Springer International
Publishing}, author={Schellhorn, Gerhard and Wedel, Monika and Travkin, Oleg and
König, Jürgen and Wehrheim, Heike}, year={2018}, pages={105–120} }'
chicago: 'Schellhorn, Gerhard, Monika Wedel, Oleg Travkin, Jürgen König, and Heike
Wehrheim. “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity.”
In Software Engineering and Formal Methods, 105–20. Cham: Springer International
Publishing, 2018. https://doi.org/10.1007/978-3-319-92970-5_7.'
ieee: 'G. Schellhorn, M. Wedel, O. Travkin, J. König, and H. Wehrheim, “FastLane
Is Opaque – a Case Study in Mechanized Proofs of Opacity,” in Software Engineering
and Formal Methods, Cham: Springer International Publishing, 2018, pp. 105–120.'
mla: Schellhorn, Gerhard, et al. “FastLane Is Opaque – a Case Study in Mechanized
Proofs of Opacity.” Software Engineering and Formal Methods, Springer International
Publishing, 2018, pp. 105–20, doi:10.1007/978-3-319-92970-5_7.
short: 'G. Schellhorn, M. Wedel, O. Travkin, J. König, H. Wehrheim, in: Software
Engineering and Formal Methods, Springer International Publishing, Cham, 2018,
pp. 105–120.'
date_created: 2018-07-11T06:19:58Z
date_updated: 2022-01-06T06:59:22Z
department:
- _id: '77'
doi: 10.1007/978-3-319-92970-5_7
page: 105-120
place: Cham
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: Software Engineering and Formal Methods
publication_identifier:
isbn:
- '9783319929699'
- '9783319929705'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity
type: book_chapter
user_id: '29719'
year: '2018'
...
---
_id: '3153'
author:
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Doherty S, Derrick J, Dongol B, Wehrheim H. Causal Linearizability: Compositionality
for Partially Ordered Executions. CoRR. 2018.'
apa: 'Doherty, S., Derrick, J., Dongol, B., & Wehrheim, H. (2018). Causal Linearizability:
Compositionality for Partially Ordered Executions. CoRR.'
bibtex: '@article{Doherty_Derrick_Dongol_Wehrheim_2018, title={Causal Linearizability:
Compositionality for Partially Ordered Executions}, journal={CoRR}, author={Doherty,
Simon and Derrick, John and Dongol, Brijesh and Wehrheim, Heike}, year={2018}
}'
chicago: 'Doherty, Simon, John Derrick, Brijesh Dongol, and Heike Wehrheim. “Causal
Linearizability: Compositionality for Partially Ordered Executions.” CoRR,
2018.'
ieee: 'S. Doherty, J. Derrick, B. Dongol, and H. Wehrheim, “Causal Linearizability:
Compositionality for Partially Ordered Executions,” CoRR, 2018.'
mla: 'Doherty, Simon, et al. “Causal Linearizability: Compositionality for Partially
Ordered Executions.” CoRR, 2018.'
short: S. Doherty, J. Derrick, B. Dongol, H. Wehrheim, CoRR (2018).
date_created: 2018-06-13T07:26:35Z
date_updated: 2022-01-06T06:59:00Z
department:
- _id: '77'
publication: CoRR
status: public
title: 'Causal Linearizability: Compositionality for Partially Ordered Executions'
type: journal_article
user_id: '29719'
year: '2018'
...
---
_id: '2711'
abstract:
- lang: eng
text: "In recent years, researchers have developed a number of tools to conduct\r\ntaint
analysis of Android applications. While all the respective papers aim at\r\nproviding
a thorough empirical evaluation, comparability is hindered by varying\r\nor unclear
evaluation targets. Sometimes, the apps used for evaluation are not\r\nprecisely
described. In other cases, authors use an established benchmark but\r\ncover it
only partially. In yet other cases, the evaluations differ in terms of\r\nthe
data leaks searched for, or lack a ground truth to compare against. All\r\nthose
limitations make it impossible to truly compare the tools based on those\r\npublished
evaluations.\r\n We thus present ReproDroid, a framework allowing the accurate
comparison of\r\nAndroid taint analysis tools. ReproDroid supports researchers
in inferring the\r\nground truth for data leaks in apps, in automatically applying
tools to\r\nbenchmarks, and in evaluating the obtained results. We use ReproDroid
to\r\ncomparatively evaluate on equal grounds the six prominent taint analysis
tools\r\nAmandroid, DIALDroid, DidFail, DroidSafe, FlowDroid and IccTA. The results
are\r\nlargely positive although four tools violate some promises concerning features\r\nand
accuracy. Finally, we contribute to the area of unbiased benchmarking with\r\na
new and improved version of the open test suite DroidBench."
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Pauck F, Bodden E, Wehrheim H. Do Android Taint Analysis Tools Keep their Promises?
arXiv:180402903. 2018.
apa: Pauck, F., Bodden, E., & Wehrheim, H. (2018). Do Android Taint Analysis
Tools Keep their Promises? ArXiv:1804.02903.
bibtex: '@article{Pauck_Bodden_Wehrheim_2018, title={Do Android Taint Analysis Tools
Keep their Promises?}, journal={arXiv:1804.02903}, author={Pauck, Felix and Bodden,
Eric and Wehrheim, Heike}, year={2018} }'
chicago: Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis
Tools Keep Their Promises?” ArXiv:1804.02903, 2018.
ieee: F. Pauck, E. Bodden, and H. Wehrheim, “Do Android Taint Analysis Tools Keep
their Promises?,” arXiv:1804.02903. 2018.
mla: Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?”
ArXiv:1804.02903, 2018.
short: F. Pauck, E. Bodden, H. Wehrheim, ArXiv:1804.02903 (2018).
date_created: 2018-05-09T08:27:11Z
date_updated: 2022-01-06T06:57:35Z
ddc:
- '000'
department:
- _id: '77'
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-11-21T10:49:23Z
date_updated: 2018-11-21T10:49:23Z
file_id: '5781'
file_name: Do Android Taint Analysis Tools Keep their Promises.pdf
file_size: 1045861
relation: main_file
success: 1
file_date_updated: 2018-11-21T10:49:23Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: arXiv:1804.02903
status: public
title: Do Android Taint Analysis Tools Keep their Promises?
type: preprint
user_id: '477'
year: '2018'
...
---
_id: '5774'
abstract:
- lang: eng
text: Information flow analysis investigates the flow of data in applications, checking
in particular for flows from private sources to public sinks. Flow- and path-sensitive
analyses are, however, often too costly to be performed every time a security-critical
application is run. In this paper, we propose a variant of proof carrying code
for information flow security. To this end, we develop information flow (IF) certificates
which get attached to programs as well as a method for IF certificate validation.
We prove soundness of our technique, i.e., show it to be tamper-free. The technique
is implemented within the program analysis tool CPAchecker. Our experiments confirm
that the use of certificates pays off for costly analysis runs.
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. Information Flow Certificates. In: Theoretical Aspects
of Computing – ICTAC 2018. Cham: Springer International Publishing; 2018:435-454.
doi:10.1007/978-3-030-02508-3_23'
apa: 'Töws, M., & Wehrheim, H. (2018). Information Flow Certificates. In Theoretical
Aspects of Computing – ICTAC 2018 (pp. 435–454). Cham: Springer International
Publishing. https://doi.org/10.1007/978-3-030-02508-3_23'
bibtex: '@inproceedings{Töws_Wehrheim_2018, place={Cham}, title={Information Flow
Certificates}, DOI={10.1007/978-3-030-02508-3_23},
booktitle={Theoretical Aspects of Computing – ICTAC 2018}, publisher={Springer
International Publishing}, author={Töws, Manuel and Wehrheim, Heike}, year={2018},
pages={435–454} }'
chicago: 'Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” In
Theoretical Aspects of Computing – ICTAC 2018, 435–54. Cham: Springer International
Publishing, 2018. https://doi.org/10.1007/978-3-030-02508-3_23.'
ieee: M. Töws and H. Wehrheim, “Information Flow Certificates,” in Theoretical
Aspects of Computing – ICTAC 2018, 2018, pp. 435–454.
mla: Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” Theoretical
Aspects of Computing – ICTAC 2018, Springer International Publishing, 2018,
pp. 435–54, doi:10.1007/978-3-030-02508-3_23.
short: 'M. Töws, H. Wehrheim, in: Theoretical Aspects of Computing – ICTAC 2018,
Springer International Publishing, Cham, 2018, pp. 435–454.'
date_created: 2018-11-21T09:51:37Z
date_updated: 2022-01-06T07:02:40Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1007/978-3-030-02508-3_23
file:
- access_level: closed
content_type: application/pdf
creator: mtoews
date_created: 2018-11-26T15:11:32Z
date_updated: 2018-11-26T15:11:32Z
file_id: '5837'
file_name: Töws-Wehrheim2018_Chapter_InformationFlowCertificates.pdf
file_size: 518016
relation: main_file
success: 1
file_date_updated: 2018-11-26T15:11:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 435-454
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: Theoretical Aspects of Computing – ICTAC 2018
publication_identifier:
isbn:
- '9783030025076'
- '9783030025083'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Information Flow Certificates
type: conference
user_id: '477'
year: '2018'
...
---
_id: '4999'
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Pauck F, Bodden E, Wehrheim H. Do Android taint analysis tools keep their
promises? In: Proceedings of the 2018 26th ACM Joint Meeting on European Software
Engineering Conference and Symposium on the Foundations of Software Engineering
- ESEC/FSE 2018. ACM Press; 2018. doi:10.1145/3236024.3236029'
apa: Pauck, F., Bodden, E., & Wehrheim, H. (2018). Do Android taint analysis
tools keep their promises? In Proceedings of the 2018 26th ACM Joint Meeting
on European Software Engineering Conference and Symposium on the Foundations of
Software Engineering - ESEC/FSE 2018. ACM Press. https://doi.org/10.1145/3236024.3236029
bibtex: '@inproceedings{Pauck_Bodden_Wehrheim_2018, title={Do Android taint analysis
tools keep their promises?}, DOI={10.1145/3236024.3236029},
booktitle={Proceedings of the 2018 26th ACM Joint Meeting on European Software
Engineering Conference and Symposium on the Foundations of Software Engineering
- ESEC/FSE 2018}, publisher={ACM Press}, author={Pauck, Felix and Bodden, Eric
and Wehrheim, Heike}, year={2018} }'
chicago: Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis
Tools Keep Their Promises?” In Proceedings of the 2018 26th ACM Joint Meeting
on European Software Engineering Conference and Symposium on the Foundations of
Software Engineering - ESEC/FSE 2018. ACM Press, 2018. https://doi.org/10.1145/3236024.3236029.
ieee: F. Pauck, E. Bodden, and H. Wehrheim, “Do Android taint analysis tools keep
their promises?,” in Proceedings of the 2018 26th ACM Joint Meeting on European
Software Engineering Conference and Symposium on the Foundations of Software Engineering
- ESEC/FSE 2018, 2018.
mla: Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?”
Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering
Conference and Symposium on the Foundations of Software Engineering - ESEC/FSE
2018, ACM Press, 2018, doi:10.1145/3236024.3236029.
short: 'F. Pauck, E. Bodden, H. Wehrheim, in: Proceedings of the 2018 26th ACM Joint
Meeting on European Software Engineering Conference and Symposium on the Foundations
of Software Engineering - ESEC/FSE 2018, ACM Press, 2018.'
date_created: 2018-10-30T08:03:17Z
date_updated: 2022-01-06T07:01:34Z
ddc:
- '004'
department:
- _id: '77'
- _id: '76'
doi: 10.1145/3236024.3236029
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:37:38Z
date_updated: 2018-11-02T13:37:38Z
file_id: '5251'
file_name: fse18main-id76-p.pdf
file_size: 524169
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:37:38Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
publication: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering
Conference and Symposium on the Foundations of Software Engineering - ESEC/FSE
2018
publication_identifier:
isbn:
- '9781450355735'
publication_status: published
publisher: ACM Press
status: public
title: Do Android taint analysis tools keep their promises?
type: conference
user_id: '477'
year: '2018'
...
---
_id: '6828'
author:
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- 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: 'Derrick J, Doherty S, Dongol B, Schellhorn G, Travkin O, Wehrheim H. Mechanized
proofs of opacity: a comparison of two techniques. Formal Asp Comput. 2018;30(5):597-625.
doi:10.1007/s00165-017-0433-3'
apa: 'Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., Travkin, O., & Wehrheim,
H. (2018). Mechanized proofs of opacity: a comparison of two techniques. Formal
Asp. Comput., 30(5), 597–625. https://doi.org/10.1007/s00165-017-0433-3'
bibtex: '@article{Derrick_Doherty_Dongol_Schellhorn_Travkin_Wehrheim_2018, title={Mechanized
proofs of opacity: a comparison of two techniques}, volume={30}, DOI={10.1007/s00165-017-0433-3},
number={5}, journal={Formal Asp. Comput.}, author={Derrick, John and Doherty,
Simon and Dongol, Brijesh and Schellhorn, Gerhard and Travkin, Oleg and Wehrheim,
Heike}, year={2018}, pages={597–625} }'
chicago: 'Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Oleg
Travkin, and Heike Wehrheim. “Mechanized Proofs of Opacity: A Comparison of Two
Techniques.” Formal Asp. Comput. 30, no. 5 (2018): 597–625. https://doi.org/10.1007/s00165-017-0433-3.'
ieee: 'J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, O. Travkin, and H. Wehrheim,
“Mechanized proofs of opacity: a comparison of two techniques,” Formal Asp.
Comput., vol. 30, no. 5, pp. 597–625, 2018.'
mla: 'Derrick, John, et al. “Mechanized Proofs of Opacity: A Comparison of Two Techniques.”
Formal Asp. Comput., vol. 30, no. 5, 2018, pp. 597–625, doi:10.1007/s00165-017-0433-3.'
short: J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, O. Travkin, H. Wehrheim,
Formal Asp. Comput. 30 (2018) 597–625.
date_created: 2019-01-17T08:28:33Z
date_updated: 2022-01-06T07:03:21Z
department:
- _id: '77'
doi: 10.1007/s00165-017-0433-3
intvolume: ' 30'
issue: '5'
language:
- iso: eng
page: 597-625
publication: Formal Asp. Comput.
status: public
title: 'Mechanized proofs of opacity: a comparison of two techniques'
type: journal_article
user_id: '29719'
volume: 30
year: '2018'
...
---
_id: '6836'
author:
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: John
full_name: Derrick, John
last_name: Derrick
citation:
ama: 'Doherty S, Dongol B, Wehrheim H, Derrick J. Making Linearizability Compositional
for Partially Ordered Executions. In: Integrated Formal Methods - 14th International
Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings.
; 2018:110-129. doi:10.1007/978-3-319-98938-9\_7'
apa: Doherty, S., Dongol, B., Wehrheim, H., & Derrick, J. (2018). Making Linearizability
Compositional for Partially Ordered Executions. In Integrated Formal Methods
- 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7,
2018, Proceedings (pp. 110–129). https://doi.org/10.1007/978-3-319-98938-9\_7
bibtex: '@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2018, title={Making Linearizability
Compositional for Partially Ordered Executions}, DOI={10.1007/978-3-319-98938-9\_7},
booktitle={Integrated Formal Methods - 14th International Conference, {IFM} 2018,
Maynooth, Ireland, September 5-7, 2018, Proceedings}, author={Doherty, Simon and
Dongol, Brijesh and Wehrheim, Heike and Derrick, John}, year={2018}, pages={110–129}
}'
chicago: Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Making
Linearizability Compositional for Partially Ordered Executions.” In Integrated
Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland,
September 5-7, 2018, Proceedings, 110–29, 2018. https://doi.org/10.1007/978-3-319-98938-9\_7.
ieee: S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Making Linearizability
Compositional for Partially Ordered Executions,” in Integrated Formal Methods
- 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7,
2018, Proceedings, 2018, pp. 110–129.
mla: Doherty, Simon, et al. “Making Linearizability Compositional for Partially
Ordered Executions.” Integrated Formal Methods - 14th International Conference,
{IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 2018, pp.
110–29, doi:10.1007/978-3-319-98938-9\_7.
short: 'S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: Integrated Formal Methods
- 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7,
2018, Proceedings, 2018, pp. 110–129.'
date_created: 2019-01-17T08:44:13Z
date_updated: 2022-01-06T07:03:21Z
department:
- _id: '77'
doi: 10.1007/978-3-319-98938-9\_7
language:
- iso: eng
page: 110-129
publication: Integrated Formal Methods - 14th International Conference, {IFM} 2018,
Maynooth, Ireland, September 5-7, 2018, Proceedings
status: public
title: Making Linearizability Compositional for Partially Ordered Executions
type: conference
user_id: '29719'
year: '2018'
...
---
_id: '6838'
author:
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: John
full_name: Derrick, John
last_name: Derrick
citation:
ama: 'Doherty S, Dongol B, Wehrheim H, Derrick J. Making Linearizability Compositional
for Partially Ordered Executions. In: Integrated Formal Methods - 14th International
Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings.
; 2018:110-129. doi:10.1007/978-3-319-98938-9\_7'
apa: Doherty, S., Dongol, B., Wehrheim, H., & Derrick, J. (2018). Making Linearizability
Compositional for Partially Ordered Executions. In Integrated Formal Methods
- 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7,
2018, Proceedings (pp. 110–129). https://doi.org/10.1007/978-3-319-98938-9\_7
bibtex: '@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2018, title={Making Linearizability
Compositional for Partially Ordered Executions}, DOI={10.1007/978-3-319-98938-9\_7},
booktitle={Integrated Formal Methods - 14th International Conference, {IFM} 2018,
Maynooth, Ireland, September 5-7, 2018, Proceedings}, author={Doherty, Simon and
Dongol, Brijesh and Wehrheim, Heike and Derrick, John}, year={2018}, pages={110–129}
}'
chicago: Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Making
Linearizability Compositional for Partially Ordered Executions.” In Integrated
Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland,
September 5-7, 2018, Proceedings, 110–29, 2018. https://doi.org/10.1007/978-3-319-98938-9\_7.
ieee: S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Making Linearizability
Compositional for Partially Ordered Executions,” in Integrated Formal Methods
- 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7,
2018, Proceedings, 2018, pp. 110–129.
mla: Doherty, Simon, et al. “Making Linearizability Compositional for Partially
Ordered Executions.” Integrated Formal Methods - 14th International Conference,
{IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 2018, pp.
110–29, doi:10.1007/978-3-319-98938-9\_7.
short: 'S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: Integrated Formal Methods
- 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7,
2018, Proceedings, 2018, pp. 110–129.'
date_created: 2019-01-17T08:46:30Z
date_updated: 2022-01-06T07:03:21Z
department:
- _id: '77'
doi: 10.1007/978-3-319-98938-9\_7
language:
- iso: eng
page: 110-129
publication: Integrated Formal Methods - 14th International Conference, {IFM} 2018,
Maynooth, Ireland, September 5-7, 2018, Proceedings
status: public
title: Making Linearizability Compositional for Partially Ordered Executions
type: conference
user_id: '29719'
year: '2018'
...
---
_id: '6839'
author:
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: John
full_name: Derrick, John
last_name: Derrick
citation:
ama: 'Doherty S, Dongol B, Wehrheim H, Derrick J. Brief Announcement: Generalising
Concurrent Correctness to Weak Memory. In: 32nd International Symposium on
Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018.
; 2018:45:1-45:3. doi:10.4230/LIPIcs.DISC.2018.45'
apa: 'Doherty, S., Dongol, B., Wehrheim, H., & Derrick, J. (2018). Brief Announcement:
Generalising Concurrent Correctness to Weak Memory. In 32nd International Symposium
on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018
(pp. 45:1-45:3). https://doi.org/10.4230/LIPIcs.DISC.2018.45'
bibtex: '@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2018, title={Brief Announcement:
Generalising Concurrent Correctness to Weak Memory}, DOI={10.4230/LIPIcs.DISC.2018.45},
booktitle={32nd International Symposium on Distributed Computing, {DISC} 2018,
New Orleans, LA, USA, October 15-19, 2018}, author={Doherty, Simon and Dongol,
Brijesh and Wehrheim, Heike and Derrick, John}, year={2018}, pages={45:1-45:3}
}'
chicago: 'Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Brief
Announcement: Generalising Concurrent Correctness to Weak Memory.” In 32nd
International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA,
USA, October 15-19, 2018, 45:1-45:3, 2018. https://doi.org/10.4230/LIPIcs.DISC.2018.45.'
ieee: 'S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Brief Announcement:
Generalising Concurrent Correctness to Weak Memory,” in 32nd International
Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October
15-19, 2018, 2018, pp. 45:1-45:3.'
mla: 'Doherty, Simon, et al. “Brief Announcement: Generalising Concurrent Correctness
to Weak Memory.” 32nd International Symposium on Distributed Computing, {DISC}
2018, New Orleans, LA, USA, October 15-19, 2018, 2018, pp. 45:1-45:3, doi:10.4230/LIPIcs.DISC.2018.45.'
short: 'S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: 32nd International Symposium
on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018,
2018, pp. 45:1-45:3.'
date_created: 2019-01-17T08:54:03Z
date_updated: 2022-01-06T07:03:21Z
department:
- _id: '77'
doi: 10.4230/LIPIcs.DISC.2018.45
language:
- iso: eng
page: 45:1-45:3
publication: 32nd International Symposium on Distributed Computing, {DISC} 2018, New
Orleans, LA, USA, October 15-19, 2018
status: public
title: 'Brief Announcement: Generalising Concurrent Correctness to Weak Memory'
type: conference
user_id: '29719'
year: '2018'
...
---
_id: '1043'
abstract:
- lang: eng
text: 'Approximate computing (AC) is an emerging paradigm for energy-efficient computation.
The basic idea of AC is to sacrifice high precision for low energy by allowing
hardware to carry out “approximately correct” calculations. This provides a major
challenge for software quality assurance: programs successfully verified to be
correct might be erroneous on approximate hardware. In this letter, we present
a novel approach for determining under what conditions a software verification
result is valid for approximate hardware. To this end, we compute the allowed
tolerances for AC hardware from successful verification runs. More precisely,
we derive a set of constraints which—when met by the AC hardware—guarantees the
verification result to carry over to AC. On the practical side, we furthermore:
1) show how to extract tolerances from verification runs employing predicate abstraction
as verification technology and 2) show how to check such constraints on hardware
designs. We have implemented all techniques, and exemplify them on example C programs
and a number of recently proposed approximate adders.'
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
id: '22398'
last_name: Pauck
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Isenberg T, Jakobs M-C, Pauck F, Wehrheim H. Validity of Software Verification
Results on Approximate Hardware. IEEE Embedded Systems Letters. 2018:22-25.
doi:10.1109/LES.2017.2758200
apa: Isenberg, T., Jakobs, M.-C., Pauck, F., & Wehrheim, H. (2018). Validity
of Software Verification Results on Approximate Hardware. IEEE Embedded Systems
Letters, 22–25. https://doi.org/10.1109/LES.2017.2758200
bibtex: '@article{Isenberg_Jakobs_Pauck_Wehrheim_2018, title={Validity of Software
Verification Results on Approximate Hardware}, DOI={10.1109/LES.2017.2758200},
journal={IEEE Embedded Systems Letters}, publisher={Institute of Electrical and
Electronics Engineers (IEEE)}, author={Isenberg, Tobias and Jakobs, Marie-Christine
and Pauck, Felix and Wehrheim, Heike}, year={2018}, pages={22–25} }'
chicago: Isenberg, Tobias, Marie-Christine Jakobs, Felix Pauck, and Heike Wehrheim.
“Validity of Software Verification Results on Approximate Hardware.” IEEE Embedded
Systems Letters, 2018, 22–25. https://doi.org/10.1109/LES.2017.2758200.
ieee: T. Isenberg, M.-C. Jakobs, F. Pauck, and H. Wehrheim, “Validity of Software
Verification Results on Approximate Hardware,” IEEE Embedded Systems Letters,
pp. 22–25, 2018.
mla: Isenberg, Tobias, et al. “Validity of Software Verification Results on Approximate
Hardware.” IEEE Embedded Systems Letters, Institute of Electrical and Electronics
Engineers (IEEE), 2018, pp. 22–25, doi:10.1109/LES.2017.2758200.
short: T. Isenberg, M.-C. Jakobs, F. Pauck, H. Wehrheim, IEEE Embedded Systems Letters
(2018) 22–25.
date_created: 2017-12-11T16:11:00Z
date_updated: 2022-01-06T06:50:39Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1109/LES.2017.2758200
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:27:04Z
date_updated: 2018-11-02T15:27:04Z
file_id: '5303'
file_name: 08053741.pdf
file_size: 523362
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:27:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 22-25
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: IEEE Embedded Systems Letters
publication_identifier:
issn:
- 1943-0663
- 1943-0671
publication_status: published
publisher: Institute of Electrical and Electronics Engineers (IEEE)
status: public
title: Validity of Software Verification Results on Approximate Hardware
type: journal_article
user_id: '477'
year: '2018'
...
---
_id: '1096'
abstract:
- lang: eng
text: to appear
author:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Thomas
full_name: Lemberger, Thomas
last_name: Lemberger
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Beyer D, Jakobs M-C, Lemberger T, Wehrheim H. Reducer-Based Construction of
Conditional Verifiers. In: Proceedings of the 40th International Conference
on Software Engineering (ICSE). ACM; 2018:1182--1193.'
apa: 'Beyer, D., Jakobs, M.-C., Lemberger, T., & Wehrheim, H. (2018). Reducer-Based
Construction of Conditional Verifiers. In Proceedings of the 40th International
Conference on Software Engineering (ICSE) (pp. 1182--1193). Gothenburg, Sweden:
ACM.'
bibtex: '@inproceedings{Beyer_Jakobs_Lemberger_Wehrheim_2018, title={Reducer-Based
Construction of Conditional Verifiers}, booktitle={Proceedings of the 40th International
Conference on Software Engineering (ICSE)}, publisher={ACM}, author={Beyer, Dirk
and Jakobs, Marie-Christine and Lemberger, Thomas and Wehrheim, Heike}, year={2018},
pages={1182--1193} }'
chicago: Beyer, Dirk, Marie-Christine Jakobs, Thomas Lemberger, and Heike Wehrheim.
“Reducer-Based Construction of Conditional Verifiers.” In Proceedings of the
40th International Conference on Software Engineering (ICSE), 1182--1193.
ACM, 2018.
ieee: D. Beyer, M.-C. Jakobs, T. Lemberger, and H. Wehrheim, “Reducer-Based Construction
of Conditional Verifiers,” in Proceedings of the 40th International Conference
on Software Engineering (ICSE), Gothenburg, Sweden, 2018, pp. 1182--1193.
mla: Beyer, Dirk, et al. “Reducer-Based Construction of Conditional Verifiers.”
Proceedings of the 40th International Conference on Software Engineering (ICSE),
ACM, 2018, pp. 1182--1193.
short: 'D. Beyer, M.-C. Jakobs, T. Lemberger, H. Wehrheim, in: Proceedings of the
40th International Conference on Software Engineering (ICSE), ACM, 2018, pp. 1182--1193.'
conference:
end_date: 2018-06-03
location: Gothenburg, Sweden
name: 40th International Conference on Software Engineering
start_date: 2018-05-27
date_created: 2018-01-08T10:52:51Z
date_updated: 2022-01-06T06:50:54Z
ddc:
- '000'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-11-21T10:50:51Z
date_updated: 2018-11-21T10:50:51Z
file_id: '5783'
file_name: Reducer-Based Construction of Conditional Verifiers.pdf
file_size: 826719
relation: main_file
success: 1
file_date_updated: 2018-11-21T10:50:51Z
has_accepted_license: '1'
language:
- iso: eng
page: 1182--1193
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '85'
name: Kooperative Softwareverifikation
publication: Proceedings of the 40th International Conference on Software Engineering
(ICSE)
publisher: ACM
status: public
title: Reducer-Based Construction of Conditional Verifiers
type: conference
user_id: '29719'
year: '2018'
...
---
_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: '3155'
author:
- first_name: Manuel
full_name: Töws, Manuel
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: Duan Z, Ong L, eds. Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November
13-17, 2017, Proceedings. Lecture Notes in Computer Science. ; 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 Z. Duan & L. Ong (Eds.), Formal Methods and Software
Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM}
2017, Xi’an, China, November 13-17, 2017, Proceedings (pp. 362--378). https://doi.org/10.1007/978-3-319-68690-5_22
bibtex: '@inproceedings{Töws_Wehrheim_2017, series={Lecture Notes in Computer Science},
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, Xi’an, China, November 13-17, 2017,
Proceedings}, author={Töws, Manuel and Wehrheim, Heike}, editor={Duan, Zhenhua
and Ong, LukeEditors}, year={2017}, pages={362--378}, collection={Lecture Notes
in Computer Science} }'
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, Xi’an, China, November
13-17, 2017, Proceedings, edited by Zhenhua Duan and Luke Ong, 362--378. Lecture
Notes in Computer Science, 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, Xi’an, China, November
13-17, 2017, Proceedings, 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, Xi’an, China, November
13-17, 2017, Proceedings, edited by Zhenhua Duan and Luke Ong, 2017, pp. 362--378,
doi:10.1007/978-3-319-68690-5_22.
short: 'M. Töws, H. Wehrheim, in: Z. Duan, L. Ong (Eds.), Formal Methods and Software
Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM}
2017, Xi’an, China, November 13-17, 2017, Proceedings, 2017, pp. 362--378.'
date_created: 2018-06-13T07:35:49Z
date_updated: 2022-01-06T06:59:00Z
department:
- _id: '77'
doi: 10.1007/978-3-319-68690-5_22
editor:
- first_name: Zhenhua
full_name: Duan, Zhenhua
last_name: Duan
- first_name: Luke
full_name: Ong, Luke
last_name: Ong
page: 362--378
publication: Formal Methods and Software Engineering - 19th International Conference
on Formal Engineering Methods, {ICFEM} 2017, Xi'an, China, November 13-17, 2017,
Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Policy Dependent and Independent Information Flow Analyses
type: conference
user_id: '29719'
year: '2017'
...
---
_id: '3156'
author:
- first_name: Jürgen
full_name: König, Jürgen
last_name: König
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'König J, Wehrheim H. Value-Based or Conflict-Based? Opacity Definitions for
STMs. In: Van Hung D, Kapur D, eds. Theoretical Aspects of Computing - {ICTAC}
2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings.
Lecture Notes in Computer Science. ; 2017:118--135. doi:10.1007/978-3-319-67729-3_8'
apa: König, J., & Wehrheim, H. (2017). Value-Based or Conflict-Based? Opacity
Definitions for STMs. In D. Van Hung & D. Kapur (Eds.), Theoretical Aspects
of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October
23-27, 2017, Proceedings (pp. 118--135). https://doi.org/10.1007/978-3-319-67729-3_8
bibtex: '@inproceedings{König_Wehrheim_2017, series={Lecture Notes in Computer Science},
title={Value-Based or Conflict-Based? Opacity Definitions for STMs}, DOI={10.1007/978-3-319-67729-3_8},
booktitle={Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International
Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings}, author={König,
Jürgen and Wehrheim, Heike}, editor={Van Hung, Dang and Kapur, DeepakEditors},
year={2017}, pages={118--135}, collection={Lecture Notes in Computer Science}
}'
chicago: König, Jürgen, and Heike Wehrheim. “Value-Based or Conflict-Based? Opacity
Definitions for STMs.” In Theoretical Aspects of Computing - {ICTAC} 2017 -
14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings,
edited by Dang Van Hung and Deepak Kapur, 118--135. Lecture Notes in Computer
Science, 2017. https://doi.org/10.1007/978-3-319-67729-3_8.
ieee: J. König and H. Wehrheim, “Value-Based or Conflict-Based? Opacity Definitions
for STMs,” in Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International
Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings, 2017, pp. 118--135.
mla: König, Jürgen, and Heike Wehrheim. “Value-Based or Conflict-Based? Opacity
Definitions for STMs.” Theoretical Aspects of Computing - {ICTAC} 2017 - 14th
International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings,
edited by Dang Van Hung and Deepak Kapur, 2017, pp. 118--135, doi:10.1007/978-3-319-67729-3_8.
short: 'J. König, H. Wehrheim, in: D. Van Hung, D. Kapur (Eds.), Theoretical Aspects
of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October
23-27, 2017, Proceedings, 2017, pp. 118--135.'
date_created: 2018-06-13T07:37:18Z
date_updated: 2022-01-06T06:59:00Z
department:
- _id: '77'
doi: 10.1007/978-3-319-67729-3_8
editor:
- first_name: Dang
full_name: Van Hung, Dang
last_name: Van Hung
- first_name: Deepak
full_name: Kapur, Deepak
last_name: Kapur
page: 118--135
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International
Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Value-Based or Conflict-Based? Opacity Definitions for STMs
type: conference
user_id: '29719'
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: '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: '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: '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'
...
---
_id: '162'
author:
- first_name: Guangli
full_name: Zhang, Guangli
last_name: Zhang
citation:
ama: 'Zhang G. Program Slicing: A Way of Separating WHILE Programs into Precise
and Approximate Portions. Universität Paderborn; 2016.'
apa: 'Zhang, G. (2016). Program Slicing: A Way of Separating WHILE Programs into
Precise and Approximate Portions. Universität Paderborn.'
bibtex: '@book{Zhang_2016, title={Program Slicing: A Way of Separating WHILE Programs
into Precise and Approximate Portions}, publisher={Universität Paderborn}, author={Zhang,
Guangli}, year={2016} }'
chicago: 'Zhang, Guangli. Program Slicing: A Way of Separating WHILE Programs
into Precise and Approximate Portions. Universität Paderborn, 2016.'
ieee: 'G. Zhang, Program Slicing: A Way of Separating WHILE Programs into Precise
and Approximate Portions. Universität Paderborn, 2016.'
mla: 'Zhang, Guangli. Program Slicing: A Way of Separating WHILE Programs into
Precise and Approximate Portions. Universität Paderborn, 2016.'
short: 'G. Zhang, Program Slicing: A Way of Separating WHILE Programs into Precise
and Approximate Portions, Universität Paderborn, 2016.'
date_created: 2017-10-17T12:41:23Z
date_updated: 2022-01-06T06:52:45Z
department:
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: 'Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate
Portions'
type: mastersthesis
user_id: '15504'
year: '2016'
...
---
_id: '164'
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
citation:
ama: Czech M. Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data. Universität Paderborn; 2016.
apa: Czech, M. (2016). Predicting Rankings of Software Verification Tools Using
Kernels for Structured Data. Universität Paderborn.
bibtex: '@book{Czech_2016, title={Predicting Rankings of Software Verification Tools
Using Kernels for Structured Data}, publisher={Universität Paderborn}, author={Czech,
Mike}, year={2016} }'
chicago: Czech, Mike. Predicting Rankings of Software Verification Tools Using
Kernels for Structured Data. Universität Paderborn, 2016.
ieee: M. Czech, Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data. Universität Paderborn, 2016.
mla: Czech, Mike. Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data. Universität Paderborn, 2016.
short: M. Czech, Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:24Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: Predicting Rankings of Software Verification Tools Using Kernels for Structured
Data
type: mastersthesis
user_id: '15504'
year: '2016'
...
---
_id: '133'
abstract:
- lang: eng
text: .
author:
- first_name: Markus
full_name: Dewender, Markus
last_name: Dewender
citation:
ama: Dewender M. Verifikation von Service Kompositionen mit Spin. Universität
Paderborn; 2016.
apa: Dewender, M. (2016). Verifikation von Service Kompositionen mit Spin.
Universität Paderborn.
bibtex: '@book{Dewender_2016, title={Verifikation von Service Kompositionen mit
Spin}, publisher={Universität Paderborn}, author={Dewender, Markus}, year={2016}
}'
chicago: Dewender, Markus. Verifikation von Service Kompositionen mit Spin.
Universität Paderborn, 2016.
ieee: M. Dewender, Verifikation von Service Kompositionen mit Spin. Universität
Paderborn, 2016.
mla: Dewender, Markus. Verifikation von Service Kompositionen mit Spin. Universität
Paderborn, 2016.
short: M. Dewender, Verifikation von Service Kompositionen mit Spin, Universität
Paderborn, 2016.
date_created: 2017-10-17T12:41:17Z
date_updated: 2022-01-06T06:51:32Z
department:
- _id: '77'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: Verifikation von Service Kompositionen mit Spin
type: bachelorsthesis
user_id: '15504'
year: '2016'
...
---
_id: '134'
abstract:
- lang: eng
text: .
author:
- first_name: Philipp
full_name: Heinisch, Philipp
last_name: Heinisch
citation:
ama: Heinisch P. Verifikation von Service Kompositionen mit Prolog. Universität
Paderborn; 2016.
apa: Heinisch, P. (2016). Verifikation von Service Kompositionen mit Prolog.
Universität Paderborn.
bibtex: '@book{Heinisch_2016, title={Verifikation von Service Kompositionen mit
Prolog}, publisher={Universität Paderborn}, author={Heinisch, Philipp}, year={2016}
}'
chicago: Heinisch, Philipp. Verifikation von Service Kompositionen mit Prolog.
Universität Paderborn, 2016.
ieee: P. Heinisch, Verifikation von Service Kompositionen mit Prolog. Universität
Paderborn, 2016.
mla: Heinisch, Philipp. Verifikation von Service Kompositionen mit Prolog.
Universität Paderborn, 2016.
short: P. Heinisch, Verifikation von Service Kompositionen mit Prolog, Universität
Paderborn, 2016.
date_created: 2017-10-17T12:41:17Z
date_updated: 2022-01-06T06:51:34Z
department:
- _id: '77'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: Verifikation von Service Kompositionen mit Prolog
type: bachelorsthesis
user_id: '15504'
year: '2016'
...
---
_id: '250'
abstract:
- lang: eng
text: Before execution, users should formally validate the correctness of software
received from untrusted providers. To accelerate this validation, in the proof
carrying code (PCC) paradigm the provider delivers the software together with
a certificate, a formal proof of the software’s correctness. Thus, the user only
checks if the attached certificate shows correctness of the delivered software.Recently,
we introduced configurable program certification, a generic, PCC based framework
supporting various software analyses and safety properties. Evaluation of our
framework revealed that validation suffers from certificate reading. In this paper,
we present two orthogonal approaches which improve certificate validation, both
reducing the impact of certificate reading. The first approach reduces the certificate
size, storing information only if it cannot easily be recomputed. The second approach
partitions the certificate into independently checkable parts. The trick is to
read parts of the certificate while already checking read parts. Our experiments
show that validation highly benefits from our improvements.
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
citation:
ama: 'Jakobs M-C. Speed Up Configurable Certificate Validation by Certificate Reduction
and Partitioning. In: Proceedings of the 13th International Conference on Software
Engineering and Formal Methods (SEFM). LNCS. ; 2015:159--174. doi:10.1007/978-3-319-22969-0_12'
apa: Jakobs, M.-C. (2015). Speed Up Configurable Certificate Validation by Certificate
Reduction and Partitioning. In Proceedings of the 13th International Conference
on Software Engineering and Formal Methods (SEFM) (pp. 159--174). https://doi.org/10.1007/978-3-319-22969-0_12
bibtex: '@inproceedings{Jakobs_2015, series={LNCS}, title={Speed Up Configurable
Certificate Validation by Certificate Reduction and Partitioning}, DOI={10.1007/978-3-319-22969-0_12},
booktitle={Proceedings of the 13th International Conference on Software Engineering
and Formal Methods (SEFM)}, author={Jakobs, Marie-Christine}, year={2015}, pages={159--174},
collection={LNCS} }'
chicago: Jakobs, Marie-Christine. “Speed Up Configurable Certificate Validation
by Certificate Reduction and Partitioning.” In Proceedings of the 13th International
Conference on Software Engineering and Formal Methods (SEFM), 159--174. LNCS,
2015. https://doi.org/10.1007/978-3-319-22969-0_12.
ieee: M.-C. Jakobs, “Speed Up Configurable Certificate Validation by Certificate
Reduction and Partitioning,” in Proceedings of the 13th International Conference
on Software Engineering and Formal Methods (SEFM), 2015, pp. 159--174.
mla: Jakobs, Marie-Christine. “Speed Up Configurable Certificate Validation by Certificate
Reduction and Partitioning.” Proceedings of the 13th International Conference
on Software Engineering and Formal Methods (SEFM), 2015, pp. 159--174, doi:10.1007/978-3-319-22969-0_12.
short: 'M.-C. Jakobs, in: Proceedings of the 13th International Conference on Software
Engineering and Formal Methods (SEFM), 2015, pp. 159--174.'
date_created: 2017-10-17T12:41:40Z
date_updated: 2022-01-06T06:56:43Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-22969-0_12
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:45:15Z
date_updated: 2018-03-21T09:45:15Z
file_id: '1489'
file_name: 250-Jakobs2015.pdf
file_size: 724308
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:45:15Z
has_accepted_license: '1'
language:
- iso: eng
page: 159--174
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 13th International Conference on Software Engineering
and Formal Methods (SEFM)
series_title: LNCS
status: public
title: Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning
type: conference
user_id: '477'
year: '2015'
...
---
_id: '283'
abstract:
- lang: eng
text: Today, software verification is an established analysis method which can provide
high guarantees for software safety. However, the resources (time and/or memory)
for an exhaustive verification are not always available, and analysis then has
to resort to other techniques, like testing. Most often, the already achieved
partial verification results arediscarded in this case, and testing has to start
from scratch.In this paper, we propose a method for combining verification and
testing in which testing only needs to check the residual fraction of an uncompleted
verification. To this end, the partial results of a verification run are used
to construct a residual program (and residual assertions to be checked on it).
The residual program can afterwards be fed into standardtesting tools. The proposed
technique is sound modulo the soundness of the testing procedure. Experimental
results show that this combinedusage of verification and testing can significantly
reduce the effort for the subsequent testing.
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Czech M, Jakobs M-C, Wehrheim H. Just test what you cannot verify! In: Egyed
A, Schaefer I, eds. Fundamental Approaches to Software Engineering. Lecture
Notes in Computer Science. ; 2015:100-114. doi:10.1007/978-3-662-46675-9_7'
apa: Czech, M., Jakobs, M.-C., & Wehrheim, H. (2015). Just test what you cannot
verify! In A. Egyed & I. Schaefer (Eds.), Fundamental Approaches to Software
Engineering (pp. 100–114). https://doi.org/10.1007/978-3-662-46675-9_7
bibtex: '@inproceedings{Czech_Jakobs_Wehrheim_2015, series={Lecture Notes in Computer
Science}, title={Just test what you cannot verify!}, DOI={10.1007/978-3-662-46675-9_7},
booktitle={Fundamental Approaches to Software Engineering}, author={Czech, Mike
and Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Egyed, Alexander and
Schaefer, InaEditors}, year={2015}, pages={100–114}, collection={Lecture Notes
in Computer Science} }'
chicago: Czech, Mike, Marie-Christine Jakobs, and Heike Wehrheim. “Just Test What
You Cannot Verify!” In Fundamental Approaches to Software Engineering,
edited by Alexander Egyed and Ina Schaefer, 100–114. Lecture Notes in Computer
Science, 2015. https://doi.org/10.1007/978-3-662-46675-9_7.
ieee: M. Czech, M.-C. Jakobs, and H. Wehrheim, “Just test what you cannot verify!,”
in Fundamental Approaches to Software Engineering, 2015, pp. 100–114.
mla: Czech, Mike, et al. “Just Test What You Cannot Verify!” Fundamental Approaches
to Software Engineering, edited by Alexander Egyed and Ina Schaefer, 2015,
pp. 100–14, doi:10.1007/978-3-662-46675-9_7.
short: 'M. Czech, M.-C. Jakobs, H. Wehrheim, in: A. Egyed, I. Schaefer (Eds.), Fundamental
Approaches to Software Engineering, 2015, pp. 100–114.'
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:00Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-662-46675-9_7
editor:
- first_name: Alexander
full_name: Egyed, Alexander
last_name: Egyed
- first_name: Ina
full_name: Schaefer, Ina
last_name: Schaefer
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:25:36Z
date_updated: 2018-03-21T09:25:36Z
file_id: '1469'
file_name: 283-FASEsubmission38_01.pdf
file_size: 391253
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:25:36Z
has_accepted_license: '1'
language:
- iso: eng
page: 100-114
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Fundamental Approaches to Software Engineering
series_title: Lecture Notes in Computer Science
status: public
title: Just test what you cannot verify!
type: conference
user_id: '477'
year: '2015'
...
---
_id: '285'
abstract:
- lang: eng
text: We propose an incremental workflow for the verification of parameterized systems
modeled as symmetric networks of timed automata. Starting with a small number
of timed automata in the network, a safety property is verified using IC3, a state-of-the-art
algorithm based on induction.The result of the verification, an inductive strengthening,
is reused proposing a candidate inductive strengthening for a larger network.If
the candidate is valid, our main theorem states that the safety property holds
for all sizes of the network of timed automata. Otherwise the number of automata
is increased and the next iteration is started with a new run of IC3.We propose
and thoroughly examine optimizations to our workflow, e.g. Feedback mechanisms
to speed up the run of IC3.
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
citation:
ama: 'Isenberg T. Incremental Inductive Verification of Parameterized Timed Systems.
In: Proceedings of the 15th International Conference on Application of Concurrency
to System Design (ACSD). ; 2015:1-9. doi:10.1109/ACSD.2015.13'
apa: Isenberg, T. (2015). Incremental Inductive Verification of Parameterized Timed
Systems. In Proceedings of the 15th International Conference on Application
of Concurrency to System Design (ACSD) (pp. 1–9). https://doi.org/10.1109/ACSD.2015.13
bibtex: '@inproceedings{Isenberg_2015, title={Incremental Inductive Verification
of Parameterized Timed Systems}, DOI={10.1109/ACSD.2015.13},
booktitle={Proceedings of the 15th International Conference on Application of
Concurrency to System Design (ACSD)}, author={Isenberg, Tobias}, year={2015},
pages={1–9} }'
chicago: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized
Timed Systems.” In Proceedings of the 15th International Conference on Application
of Concurrency to System Design (ACSD), 1–9, 2015. https://doi.org/10.1109/ACSD.2015.13.
ieee: T. Isenberg, “Incremental Inductive Verification of Parameterized Timed Systems,”
in Proceedings of the 15th International Conference on Application of Concurrency
to System Design (ACSD), 2015, pp. 1–9.
mla: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed
Systems.” Proceedings of the 15th International Conference on Application of
Concurrency to System Design (ACSD), 2015, pp. 1–9, doi:10.1109/ACSD.2015.13.
short: 'T. Isenberg, in: Proceedings of the 15th International Conference on Application
of Concurrency to System Design (ACSD), 2015, pp. 1–9.'
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:07Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1109/ACSD.2015.13
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:23:45Z
date_updated: 2018-03-21T09:23:45Z
file_id: '1466'
file_name: 285-07352419.pdf
file_size: 479808
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:23:45Z
has_accepted_license: '1'
language:
- iso: eng
page: '1-9 '
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 15th International Conference on Application of Concurrency
to System Design (ACSD)
status: public
title: Incremental Inductive Verification of Parameterized Timed Systems
type: conference
user_id: '477'
year: '2015'
...
---
_id: '246'
author:
- first_name: Galina
full_name: Besova, Galina
last_name: Besova
citation:
ama: Besova G. Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn; 2015.
apa: Besova, G. (2015). Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn.
bibtex: '@book{Besova_2015, title={Systematic Development and Re-Use of Model Tranformations},
publisher={Universität Paderborn}, author={Besova, Galina}, year={2015} }'
chicago: Besova, Galina. Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn, 2015.
ieee: G. Besova, Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn, 2015.
mla: Besova, Galina. Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn, 2015.
short: G. Besova, Systematic Development and Re-Use of Model Tranformations, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:40Z
date_updated: 2022-01-06T06:56:30Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:47:14Z
date_updated: 2018-03-21T09:47:14Z
file_id: '1492'
file_name: 246-Dissertation_-_Besova.pdf
file_size: 10091866
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:47:14Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/hsx/content/titleinfo/1705899
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Systematic Development and Re-Use of Model Tranformations
type: dissertation
user_id: '477'
year: '2015'
...
---
_id: '262'
abstract:
- lang: eng
text: Programs from Proofs" is a generic method which generates new programs out
of correctness proofs of given programs. The technique ensures that the new and
given program are behaviorally equivalent and that the new program is easily verifiable,
thus serving as an alternative to proof-carrying code concepts. So far, this generic
method has one instantiation that verifies type-state properties of programs.
In this paper, we present a whole range of new instantiations, all based on data
ow analyses. More precisely, we show how an imprecise but fast data ow analysis
can be enhanced with a predicate analysis as to yield a precise but expensive
analysis. Out of the safety proofs of this analysis, we generate new programs,
again behaviorally equivalent to the given ones, which are easily verifiable"
in the sense that now the data ow analysis alone can yield precise results. An
experimental evaluation practically supports our claim of easy verification.
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 of Predicated Dataflow Analyses.
In: Proceedings of the 30th Annual ACM Symposium on Applied Computing.
SAC ’15. ; 2015:1729-1736. doi:10.1145/2695664.2695690'
apa: Jakobs, M.-C., & Wehrheim, H. (2015). Programs from Proofs of Predicated
Dataflow Analyses. In Proceedings of the 30th Annual ACM Symposium on Applied
Computing (pp. 1729–1736). https://doi.org/10.1145/2695664.2695690
bibtex: '@inproceedings{Jakobs_Wehrheim_2015, series={SAC ’15}, title={Programs
from Proofs of Predicated Dataflow Analyses}, DOI={10.1145/2695664.2695690},
booktitle={Proceedings of the 30th Annual ACM Symposium on Applied Computing},
author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2015}, pages={1729–1736},
collection={SAC ’15} }'
chicago: Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated
Dataflow Analyses.” In Proceedings of the 30th Annual ACM Symposium on Applied
Computing, 1729–36. SAC ’15, 2015. https://doi.org/10.1145/2695664.2695690.
ieee: M.-C. Jakobs and H. Wehrheim, “Programs from Proofs of Predicated Dataflow
Analyses,” in Proceedings of the 30th Annual ACM Symposium on Applied Computing,
2015, pp. 1729–1736.
mla: Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated
Dataflow Analyses.” Proceedings of the 30th Annual ACM Symposium on Applied
Computing, 2015, pp. 1729–36, doi:10.1145/2695664.2695690.
short: 'M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 30th Annual ACM Symposium
on Applied Computing, 2015, pp. 1729–1736.'
date_created: 2017-10-17T12:41:43Z
date_updated: 2022-01-06T06:57:18Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1145/2695664.2695690
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:35:34Z
date_updated: 2018-03-21T09:35:34Z
file_id: '1483'
file_name: 262-mainSACfinal.pdf
file_size: 554583
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:35:34Z
has_accepted_license: '1'
language:
- iso: eng
page: 1729-1736
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 30th Annual ACM Symposium on Applied Computing
series_title: SAC '15
status: public
title: Programs from Proofs of Predicated Dataflow Analyses
type: conference
user_id: '477'
year: '2015'
...
---
_id: '290'
abstract:
- lang: eng
text: 'Model transformation is a key concept in model-driven software engineering.
The definition of model transformations is usually based on meta-models describing
the abstract syntax of languages. While meta-models are thereby able to abstract
from uperfluous details of concrete syntax, they often loose structural information
inherent in languages, like information on model elements always occurring together
in particular shapes. As a consequence, model transformations cannot naturally
re-use language structures, thus leading to unnecessary complexity in their development
as well as in quality assurance.In this paper, we propose a new approach to model
transformation development which allows to simplify the developed transformations
and improve their quality via the exploitation of the languages׳ structures. The
approach is based on context-free graph grammars and transformations defined by
pairing productions of source and target grammars. We show that such transformations
have important properties: they terminate and are sound, complete, and deterministic.'
author:
- first_name: Galina
full_name: Besova, Galina
last_name: Besova
- first_name: Dominik
full_name: Steenken, Dominik
last_name: Steenken
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Besova G, Steenken D, Wehrheim H. Grammar-based model transformations: Definition,
execution, and quality properties. Computer Languages, Systems & Structures.
2015:116-138. doi:10.1016/j.cl.2015.05.003'
apa: 'Besova, G., Steenken, D., & Wehrheim, H. (2015). Grammar-based model transformations:
Definition, execution, and quality properties. Computer Languages, Systems
& Structures, 116–138. https://doi.org/10.1016/j.cl.2015.05.003'
bibtex: '@article{Besova_Steenken_Wehrheim_2015, title={Grammar-based model transformations:
Definition, execution, and quality properties}, DOI={10.1016/j.cl.2015.05.003},
journal={Computer Languages, Systems & Structures}, publisher={Elsevier},
author={Besova, Galina and Steenken, Dominik and Wehrheim, Heike}, year={2015},
pages={116–138} }'
chicago: 'Besova, Galina, Dominik Steenken, and Heike Wehrheim. “Grammar-Based Model
Transformations: Definition, Execution, and Quality Properties.” Computer Languages,
Systems & Structures, 2015, 116–38. https://doi.org/10.1016/j.cl.2015.05.003.'
ieee: 'G. Besova, D. Steenken, and H. Wehrheim, “Grammar-based model transformations:
Definition, execution, and quality properties,” Computer Languages, Systems
& Structures, pp. 116–138, 2015.'
mla: 'Besova, Galina, et al. “Grammar-Based Model Transformations: Definition, Execution,
and Quality Properties.” Computer Languages, Systems & Structures,
Elsevier, 2015, pp. 116–38, doi:10.1016/j.cl.2015.05.003.'
short: G. Besova, D. Steenken, H. Wehrheim, Computer Languages, Systems & Structures
(2015) 116–138.
date_created: 2017-10-17T12:41:48Z
date_updated: 2022-01-06T06:58:43Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.cl.2015.05.003
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:22:03Z
date_updated: 2018-03-21T09:22:03Z
file_id: '1464'
file_name: 290-BSW15-main.pdf
file_size: 1329478
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:22:03Z
has_accepted_license: '1'
language:
- iso: eng
page: 116-138
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Computer Languages, Systems & Structures
publisher: Elsevier
status: public
title: 'Grammar-based model transformations: Definition, execution, and quality properties'
type: journal_article
user_id: '477'
year: '2015'
...