---
_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'
...