---
_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: '10096'
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. CoRR. 2019;abs/1905.08505.'
apa: 'Beyer, D., & Wehrheim, H. (2019). Verification Artifacts in Cooperative
Verification: Survey and Unifying Component Framework. CoRR, abs/1905.08505.'
bibtex: '@article{Beyer_Wehrheim_2019, title={Verification Artifacts in Cooperative
Verification: Survey and Unifying Component Framework}, volume={abs/1905.08505},
journal={CoRR}, author={Beyer, Dirk and Wehrheim, Heike}, year={2019} }'
chicago: 'Beyer, Dirk, and Heike Wehrheim. “Verification Artifacts in Cooperative
Verification: Survey and Unifying Component Framework.” CoRR abs/1905.08505
(2019).'
ieee: 'D. Beyer and H. Wehrheim, “Verification Artifacts in Cooperative Verification:
Survey and Unifying Component Framework,” CoRR, vol. abs/1905.08505, 2019.'
mla: 'Beyer, Dirk, and Heike Wehrheim. “Verification Artifacts in Cooperative Verification:
Survey and Unifying Component Framework.” CoRR, vol. abs/1905.08505, 2019.'
short: D. Beyer, H. Wehrheim, CoRR abs/1905.08505 (2019).
date_created: 2019-06-03T08:17:07Z
date_updated: 2022-01-06T06:50:29Z
department:
- _id: '34'
language:
- iso: eng
publication: CoRR
status: public
title: 'Verification Artifacts in Cooperative Verification: Survey and Unifying Component
Framework'
type: journal_article
user_id: '29719'
volume: abs/1905.08505
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: '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: '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'
...