---
_id: '6839'
author:
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: John
full_name: Derrick, John
last_name: Derrick
citation:
ama: 'Doherty S, Dongol B, Wehrheim H, Derrick J. Brief Announcement: Generalising
Concurrent Correctness to Weak Memory. In: 32nd International Symposium on
Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018.
; 2018:45:1-45:3. doi:10.4230/LIPIcs.DISC.2018.45'
apa: 'Doherty, S., Dongol, B., Wehrheim, H., & Derrick, J. (2018). Brief Announcement:
Generalising Concurrent Correctness to Weak Memory. In 32nd International Symposium
on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018
(pp. 45:1-45:3). https://doi.org/10.4230/LIPIcs.DISC.2018.45'
bibtex: '@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2018, title={Brief Announcement:
Generalising Concurrent Correctness to Weak Memory}, DOI={10.4230/LIPIcs.DISC.2018.45},
booktitle={32nd International Symposium on Distributed Computing, {DISC} 2018,
New Orleans, LA, USA, October 15-19, 2018}, author={Doherty, Simon and Dongol,
Brijesh and Wehrheim, Heike and Derrick, John}, year={2018}, pages={45:1-45:3}
}'
chicago: 'Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Brief
Announcement: Generalising Concurrent Correctness to Weak Memory.” In 32nd
International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA,
USA, October 15-19, 2018, 45:1-45:3, 2018. https://doi.org/10.4230/LIPIcs.DISC.2018.45.'
ieee: 'S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Brief Announcement:
Generalising Concurrent Correctness to Weak Memory,” in 32nd International
Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October
15-19, 2018, 2018, pp. 45:1-45:3.'
mla: 'Doherty, Simon, et al. “Brief Announcement: Generalising Concurrent Correctness
to Weak Memory.” 32nd International Symposium on Distributed Computing, {DISC}
2018, New Orleans, LA, USA, October 15-19, 2018, 2018, pp. 45:1-45:3, doi:10.4230/LIPIcs.DISC.2018.45.'
short: 'S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: 32nd International Symposium
on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018,
2018, pp. 45:1-45:3.'
date_created: 2019-01-17T08:54:03Z
date_updated: 2022-01-06T07:03:21Z
department:
- _id: '77'
doi: 10.4230/LIPIcs.DISC.2018.45
language:
- iso: eng
page: 45:1-45:3
publication: 32nd International Symposium on Distributed Computing, {DISC} 2018, New
Orleans, LA, USA, October 15-19, 2018
status: public
title: 'Brief Announcement: Generalising Concurrent Correctness to Weak Memory'
type: conference
user_id: '29719'
year: '2018'
...
---
_id: '1043'
abstract:
- lang: eng
text: 'Approximate computing (AC) is an emerging paradigm for energy-efficient computation.
The basic idea of AC is to sacrifice high precision for low energy by allowing
hardware to carry out “approximately correct” calculations. This provides a major
challenge for software quality assurance: programs successfully verified to be
correct might be erroneous on approximate hardware. In this letter, we present
a novel approach for determining under what conditions a software verification
result is valid for approximate hardware. To this end, we compute the allowed
tolerances for AC hardware from successful verification runs. More precisely,
we derive a set of constraints which—when met by the AC hardware—guarantees the
verification result to carry over to AC. On the practical side, we furthermore:
1) show how to extract tolerances from verification runs employing predicate abstraction
as verification technology and 2) show how to check such constraints on hardware
designs. We have implemented all techniques, and exemplify them on example C programs
and a number of recently proposed approximate adders.'
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Isenberg T, Jakobs M-C, Pauck F, Wehrheim H. Validity of Software Verification
Results on Approximate Hardware. IEEE Embedded Systems Letters. 2018:22-25.
doi:10.1109/LES.2017.2758200
apa: Isenberg, T., Jakobs, M.-C., Pauck, F., & Wehrheim, H. (2018). Validity
of Software Verification Results on Approximate Hardware. IEEE Embedded Systems
Letters, 22–25. https://doi.org/10.1109/LES.2017.2758200
bibtex: '@article{Isenberg_Jakobs_Pauck_Wehrheim_2018, title={Validity of Software
Verification Results on Approximate Hardware}, DOI={10.1109/LES.2017.2758200},
journal={IEEE Embedded Systems Letters}, publisher={Institute of Electrical and
Electronics Engineers (IEEE)}, author={Isenberg, Tobias and Jakobs, Marie-Christine
and Pauck, Felix and Wehrheim, Heike}, year={2018}, pages={22–25} }'
chicago: Isenberg, Tobias, Marie-Christine Jakobs, Felix Pauck, and Heike Wehrheim.
“Validity of Software Verification Results on Approximate Hardware.” IEEE Embedded
Systems Letters, 2018, 22–25. https://doi.org/10.1109/LES.2017.2758200.
ieee: T. Isenberg, M.-C. Jakobs, F. Pauck, and H. Wehrheim, “Validity of Software
Verification Results on Approximate Hardware,” IEEE Embedded Systems Letters,
pp. 22–25, 2018.
mla: Isenberg, Tobias, et al. “Validity of Software Verification Results on Approximate
Hardware.” IEEE Embedded Systems Letters, Institute of Electrical and Electronics
Engineers (IEEE), 2018, pp. 22–25, doi:10.1109/LES.2017.2758200.
short: T. Isenberg, M.-C. Jakobs, F. Pauck, H. Wehrheim, IEEE Embedded Systems Letters
(2018) 22–25.
date_created: 2017-12-11T16:11:00Z
date_updated: 2022-01-06T06:50:39Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1109/LES.2017.2758200
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:27:04Z
date_updated: 2018-11-02T15:27:04Z
file_id: '5303'
file_name: 08053741.pdf
file_size: 523362
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:27:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 22-25
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: IEEE Embedded Systems Letters
publication_identifier:
issn:
- 1943-0663
- 1943-0671
publication_status: published
publisher: Institute of Electrical and Electronics Engineers (IEEE)
status: public
title: Validity of Software Verification Results on Approximate Hardware
type: journal_article
user_id: '477'
year: '2018'
...
---
_id: '1096'
abstract:
- lang: eng
text: to appear
author:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Thomas
full_name: Lemberger, Thomas
last_name: Lemberger
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Beyer D, Jakobs M-C, Lemberger T, Wehrheim H. Reducer-Based Construction of
Conditional Verifiers. In: Proceedings of the 40th International Conference
on Software Engineering (ICSE). ACM; 2018:1182--1193.'
apa: 'Beyer, D., Jakobs, M.-C., Lemberger, T., & Wehrheim, H. (2018). Reducer-Based
Construction of Conditional Verifiers. In Proceedings of the 40th International
Conference on Software Engineering (ICSE) (pp. 1182--1193). Gothenburg, Sweden:
ACM.'
bibtex: '@inproceedings{Beyer_Jakobs_Lemberger_Wehrheim_2018, title={Reducer-Based
Construction of Conditional Verifiers}, booktitle={Proceedings of the 40th International
Conference on Software Engineering (ICSE)}, publisher={ACM}, author={Beyer, Dirk
and Jakobs, Marie-Christine and Lemberger, Thomas and Wehrheim, Heike}, year={2018},
pages={1182--1193} }'
chicago: Beyer, Dirk, Marie-Christine Jakobs, Thomas Lemberger, and Heike Wehrheim.
“Reducer-Based Construction of Conditional Verifiers.” In Proceedings of the
40th International Conference on Software Engineering (ICSE), 1182--1193.
ACM, 2018.
ieee: D. Beyer, M.-C. Jakobs, T. Lemberger, and H. Wehrheim, “Reducer-Based Construction
of Conditional Verifiers,” in Proceedings of the 40th International Conference
on Software Engineering (ICSE), Gothenburg, Sweden, 2018, pp. 1182--1193.
mla: Beyer, Dirk, et al. “Reducer-Based Construction of Conditional Verifiers.”
Proceedings of the 40th International Conference on Software Engineering (ICSE),
ACM, 2018, pp. 1182--1193.
short: 'D. Beyer, M.-C. Jakobs, T. Lemberger, H. Wehrheim, in: Proceedings of the
40th International Conference on Software Engineering (ICSE), ACM, 2018, pp. 1182--1193.'
conference:
end_date: 2018-06-03
location: Gothenburg, Sweden
name: 40th International Conference on Software Engineering
start_date: 2018-05-27
date_created: 2018-01-08T10:52:51Z
date_updated: 2022-01-06T06:50:54Z
ddc:
- '000'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-11-21T10:50:51Z
date_updated: 2018-11-21T10:50:51Z
file_id: '5783'
file_name: Reducer-Based Construction of Conditional Verifiers.pdf
file_size: 826719
relation: main_file
success: 1
file_date_updated: 2018-11-21T10:50:51Z
has_accepted_license: '1'
language:
- iso: eng
page: 1182--1193
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '85'
name: Kooperative Softwareverifikation
publication: Proceedings of the 40th International Conference on Software Engineering
(ICSE)
publisher: ACM
status: public
title: Reducer-Based Construction of Conditional Verifiers
type: conference
user_id: '29719'
year: '2018'
...
---
_id: '3512'
author:
- first_name: Paul
full_name: Börding, Paul
last_name: Börding
citation:
ama: Börding P. Testing Java Method Contracts. Universität Paderborn; 2017.
apa: Börding, P. (2017). Testing Java Method Contracts. Universität Paderborn.
bibtex: '@book{Börding_2017, title={Testing Java Method Contracts}, publisher={Universität
Paderborn}, author={Börding, Paul}, year={2017} }'
chicago: Börding, Paul. Testing Java Method Contracts. Universität Paderborn,
2017.
ieee: P. Börding, Testing Java Method Contracts. Universität Paderborn, 2017.
mla: Börding, Paul. Testing Java Method Contracts. Universität Paderborn,
2017.
short: P. Börding, Testing Java Method Contracts, Universität Paderborn, 2017.
date_created: 2018-07-09T09:32:41Z
date_updated: 2022-01-06T06:59:21Z
department:
- _id: '7'
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Testing Java Method Contracts
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '3155'
author:
- first_name: Manuel
full_name: Töws, Manuel
last_name: Töws
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Töws M, Wehrheim H. Policy Dependent and Independent Information Flow Analyses.
In: Duan Z, Ong L, eds. Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November
13-17, 2017, Proceedings. Lecture Notes in Computer Science. ; 2017:362--378.
doi:10.1007/978-3-319-68690-5_22'
apa: Töws, M., & Wehrheim, H. (2017). Policy Dependent and Independent Information
Flow Analyses. In Z. Duan & L. Ong (Eds.), Formal Methods and Software
Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM}
2017, Xi’an, China, November 13-17, 2017, Proceedings (pp. 362--378). https://doi.org/10.1007/978-3-319-68690-5_22
bibtex: '@inproceedings{Töws_Wehrheim_2017, series={Lecture Notes in Computer Science},
title={Policy Dependent and Independent Information Flow Analyses}, DOI={10.1007/978-3-319-68690-5_22},
booktitle={Formal Methods and Software Engineering - 19th International Conference
on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017,
Proceedings}, author={Töws, Manuel and Wehrheim, Heike}, editor={Duan, Zhenhua
and Ong, LukeEditors}, year={2017}, pages={362--378}, collection={Lecture Notes
in Computer Science} }'
chicago: Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information
Flow Analyses.” In Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November
13-17, 2017, Proceedings, edited by Zhenhua Duan and Luke Ong, 362--378. Lecture
Notes in Computer Science, 2017. https://doi.org/10.1007/978-3-319-68690-5_22.
ieee: M. Töws and H. Wehrheim, “Policy Dependent and Independent Information Flow
Analyses,” in Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November
13-17, 2017, Proceedings, 2017, pp. 362--378.
mla: Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information
Flow Analyses.” Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November
13-17, 2017, Proceedings, edited by Zhenhua Duan and Luke Ong, 2017, pp. 362--378,
doi:10.1007/978-3-319-68690-5_22.
short: 'M. Töws, H. Wehrheim, in: Z. Duan, L. Ong (Eds.), Formal Methods and Software
Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM}
2017, Xi’an, China, November 13-17, 2017, Proceedings, 2017, pp. 362--378.'
date_created: 2018-06-13T07:35:49Z
date_updated: 2022-01-06T06:59:00Z
department:
- _id: '77'
doi: 10.1007/978-3-319-68690-5_22
editor:
- first_name: Zhenhua
full_name: Duan, Zhenhua
last_name: Duan
- first_name: Luke
full_name: Ong, Luke
last_name: Ong
page: 362--378
publication: Formal Methods and Software Engineering - 19th International Conference
on Formal Engineering Methods, {ICFEM} 2017, Xi'an, China, November 13-17, 2017,
Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Policy Dependent and Independent Information Flow Analyses
type: conference
user_id: '29719'
year: '2017'
...
---
_id: '3156'
author:
- first_name: Jürgen
full_name: König, Jürgen
last_name: König
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'König J, Wehrheim H. Value-Based or Conflict-Based? Opacity Definitions for
STMs. In: Van Hung D, Kapur D, eds. Theoretical Aspects of Computing - {ICTAC}
2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings.
Lecture Notes in Computer Science. ; 2017:118--135. doi:10.1007/978-3-319-67729-3_8'
apa: König, J., & Wehrheim, H. (2017). Value-Based or Conflict-Based? Opacity
Definitions for STMs. In D. Van Hung & D. Kapur (Eds.), Theoretical Aspects
of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October
23-27, 2017, Proceedings (pp. 118--135). https://doi.org/10.1007/978-3-319-67729-3_8
bibtex: '@inproceedings{König_Wehrheim_2017, series={Lecture Notes in Computer Science},
title={Value-Based or Conflict-Based? Opacity Definitions for STMs}, DOI={10.1007/978-3-319-67729-3_8},
booktitle={Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International
Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings}, author={König,
Jürgen and Wehrheim, Heike}, editor={Van Hung, Dang and Kapur, DeepakEditors},
year={2017}, pages={118--135}, collection={Lecture Notes in Computer Science}
}'
chicago: König, Jürgen, and Heike Wehrheim. “Value-Based or Conflict-Based? Opacity
Definitions for STMs.” In Theoretical Aspects of Computing - {ICTAC} 2017 -
14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings,
edited by Dang Van Hung and Deepak Kapur, 118--135. Lecture Notes in Computer
Science, 2017. https://doi.org/10.1007/978-3-319-67729-3_8.
ieee: J. König and H. Wehrheim, “Value-Based or Conflict-Based? Opacity Definitions
for STMs,” in Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International
Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings, 2017, pp. 118--135.
mla: König, Jürgen, and Heike Wehrheim. “Value-Based or Conflict-Based? Opacity
Definitions for STMs.” Theoretical Aspects of Computing - {ICTAC} 2017 - 14th
International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings,
edited by Dang Van Hung and Deepak Kapur, 2017, pp. 118--135, doi:10.1007/978-3-319-67729-3_8.
short: 'J. König, H. Wehrheim, in: D. Van Hung, D. Kapur (Eds.), Theoretical Aspects
of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October
23-27, 2017, Proceedings, 2017, pp. 118--135.'
date_created: 2018-06-13T07:37:18Z
date_updated: 2022-01-06T06:59:00Z
department:
- _id: '77'
doi: 10.1007/978-3-319-67729-3_8
editor:
- first_name: Dang
full_name: Van Hung, Dang
last_name: Van Hung
- first_name: Deepak
full_name: Kapur, Deepak
last_name: Kapur
page: 118--135
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International
Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Value-Based or Conflict-Based? Opacity Definitions for STMs
type: conference
user_id: '29719'
year: '2017'
...
---
_id: '114'
abstract:
- lang: eng
text: Proof witnesses are proof artifacts showing correctness of programs wrt. safety
properties. The recent past has seen a rising interest in witnesses as (a) proofs
in a proof-carrying-code context, (b) certificates for the correct functioning
of verification tools, or simply (c) exchange formats for (partial) verification
results. As witnesses in all theses scenarios need to be stored and processed,
witnesses are required to be as small as possible. However, software verification
tools – the prime suppliers of witnesses – do not necessarily construct small
witnesses. In this paper, we present a formal account of proof witnesses. We introduce
the concept of weakenings, reducing the complexity of proof witnesses while preserving
the ability of witnessing safety. We develop aweakening technique for a specific
class of program analyses, and prove it to be sound. Finally, we experimentally
demonstrate our weakening technique to indeed achieve a size reduction of proof
witnesses.
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Jakobs M-C, Wehrheim H. Compact Proof Witnesses. In: Barrett C, Davies M,
Kahsai T, eds. NASA Formal Methods: 9th International Symposium. Lecture
Notes in Computer Science. ; 2017:389-403. doi:10.1007/978-3-319-57288-8_28'
apa: 'Jakobs, M.-C., & Wehrheim, H. (2017). Compact Proof Witnesses. In C. Barrett,
M. Davies, & T. Kahsai (Eds.), NASA Formal Methods: 9th International Symposium
(pp. 389–403). https://doi.org/10.1007/978-3-319-57288-8_28'
bibtex: '@inproceedings{Jakobs_Wehrheim_2017, series={Lecture Notes in Computer
Science}, title={Compact Proof Witnesses}, DOI={10.1007/978-3-319-57288-8_28},
booktitle={NASA Formal Methods: 9th International Symposium}, author={Jakobs,
Marie-Christine and Wehrheim, Heike}, editor={Barrett, Clark and Davies, Misty
and Kahsai, TemesghenEditors}, year={2017}, pages={389–403}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Compact Proof Witnesses.”
In NASA Formal Methods: 9th International Symposium, edited by Clark Barrett,
Misty Davies, and Temesghen Kahsai, 389–403. Lecture Notes in Computer Science,
2017. https://doi.org/10.1007/978-3-319-57288-8_28.'
ieee: 'M.-C. Jakobs and H. Wehrheim, “Compact Proof Witnesses,” in NASA Formal
Methods: 9th International Symposium, 2017, pp. 389–403.'
mla: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Compact Proof Witnesses.” NASA
Formal Methods: 9th International Symposium, edited by Clark Barrett et al.,
2017, pp. 389–403, doi:10.1007/978-3-319-57288-8_28.'
short: 'M.-C. Jakobs, H. Wehrheim, in: C. Barrett, M. Davies, T. Kahsai (Eds.),
NASA Formal Methods: 9th International Symposium, 2017, pp. 389–403.'
date_created: 2017-10-17T12:41:13Z
date_updated: 2022-01-06T06:51:00Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-57288-8_28
editor:
- first_name: Clark
full_name: Barrett, Clark
last_name: Barrett
- first_name: Misty
full_name: Davies, Misty
last_name: Davies
- first_name: Temesghen
full_name: Kahsai, Temesghen
last_name: Kahsai
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:05:02Z
date_updated: 2018-03-21T13:05:02Z
file_id: '1565'
file_name: 114-chp_3A10.1007_2F978-3-319-57288-8_28.pdf
file_size: 492800
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:05:02Z
has_accepted_license: '1'
language:
- iso: eng
page: 389-403
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: 'NASA Formal Methods: 9th International Symposium'
series_title: Lecture Notes in Computer Science
status: public
title: Compact Proof Witnesses
type: conference
user_id: '477'
year: '2017'
...
---
_id: '115'
abstract:
- lang: eng
text: 'Whenever customers have to decide between different instances of the same
product, they are interested in buying the best product. In contrast, companies
are interested in reducing the construction effort (and usually as a consequence
thereof, the quality) to gain profit. The described setting is widely known as
opposed preferences in quality of the product and also applies to the context
of service-oriented computing. In general, service-oriented computing emphasizes
the construction of large software systems out of existing services, where services
are small and self-contained pieces of software that adhere to a specified interface.
Several implementations of the same interface are considered as several instances
of the same service. Thereby, customers are interested in buying the best service
implementation for their service composition wrt. to metrics, such as costs, energy,
memory consumption, or execution time. One way to ensure the service quality is
to employ certificates, which can come in different kinds: Technical certificates
proving correctness can be automatically constructed by the service provider and
again be automatically checked by the user. Digital certificates allow proof of
the integrity of a product. Other certificates might be rolled out if service
providers follow a good software construction principle, which is checked in annual
audits. Whereas all of these certificates are handled differently in service markets,
what they have in common is that they influence the buying decisions of customers.
In this paper, we review state-of-the-art developments in certification with respect
to service-oriented computing. We not only discuss how certificates are constructed
and handled in service-oriented computing but also review the effects of certificates
on the market from an economic perspective.'
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Julia
full_name: Krämer, Julia
last_name: Krämer
- first_name: Dirk
full_name: van Straaten, Dirk
id: '10311'
last_name: van Straaten
- first_name: Theodor
full_name: Lettmann, Theodor
id: '315'
last_name: Lettmann
orcid: 0000-0001-5859-2457
citation:
ama: 'Jakobs M-C, Krämer J, van Straaten D, Lettmann T. Certification Matters for
Service Markets. In: Marcelo De Barros, Janusz Klink,Tadeus Uhl TP, ed. The
Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION).
; 2017:7-12.'
apa: Jakobs, M.-C., Krämer, J., van Straaten, D., & Lettmann, T. (2017). Certification
Matters for Service Markets. In T. P. Marcelo De Barros, Janusz Klink,Tadeus Uhl
(Ed.), The Ninth International Conferences on Advanced Service Computing (SERVICE
COMPUTATION) (pp. 7–12).
bibtex: '@inproceedings{Jakobs_Krämer_van Straaten_Lettmann_2017, title={Certification
Matters for Service Markets}, booktitle={The Ninth International Conferences on
Advanced Service Computing (SERVICE COMPUTATION)}, author={Jakobs, Marie-Christine
and Krämer, Julia and van Straaten, Dirk and Lettmann, Theodor}, editor={Marcelo
De Barros, Janusz Klink,Tadeus Uhl, Thomas PrinzEditor}, year={2017}, pages={7–12}
}'
chicago: Jakobs, Marie-Christine, Julia Krämer, Dirk van Straaten, and Theodor Lettmann.
“Certification Matters for Service Markets.” In The Ninth International Conferences
on Advanced Service Computing (SERVICE COMPUTATION), edited by Thomas Prinz
Marcelo De Barros, Janusz Klink,Tadeus Uhl, 7–12, 2017.
ieee: M.-C. Jakobs, J. Krämer, D. van Straaten, and T. Lettmann, “Certification Matters
for Service Markets,” in The Ninth International Conferences on Advanced Service
Computing (SERVICE COMPUTATION), 2017, pp. 7–12.
mla: Jakobs, Marie-Christine, et al. “Certification Matters for Service Markets.”
The Ninth International Conferences on Advanced Service Computing (SERVICE
COMPUTATION), edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus
Uhl, 2017, pp. 7–12.
short: 'M.-C. Jakobs, J. Krämer, D. van Straaten, T. Lettmann, in: T.P. Marcelo
De Barros, Janusz Klink,Tadeus Uhl (Ed.), The Ninth International Conferences
on Advanced Service Computing (SERVICE COMPUTATION), 2017, pp. 7–12.'
date_created: 2017-10-17T12:41:14Z
date_updated: 2022-01-06T06:51:02Z
ddc:
- '040'
department:
- _id: '77'
- _id: '355'
- _id: '179'
editor:
- first_name: Thomas Prinz
full_name: Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas Prinz
last_name: Marcelo De Barros, Janusz Klink,Tadeus Uhl
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:04:12Z
date_updated: 2018-03-21T13:04:12Z
file_id: '1564'
file_name: 115-JakobsKraemerVanStraatenLettmann2017.pdf
file_size: 133531
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:04:12Z
has_accepted_license: '1'
language:
- iso: eng
page: 7-12
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '8'
name: SFB 901 - Subproject A4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '3'
name: SFB 901 - Project Area B
publication: The Ninth International Conferences on Advanced Service Computing (SERVICE
COMPUTATION)
status: public
title: Certification Matters for Service Markets
type: conference
user_id: '477'
year: '2017'
...
---
_id: '90'
abstract:
- lang: eng
text: We propose and extend an approach for the verification of safety properties
for parameterized timed systems modeled as networks of timed automata. For this
task, we introduce an incremental workflow that is based on our algorithm IC3
with Zones. It proceeds in a cycle in which single models of the system are verified,
and the verification results are employed for the reasoning about the entire system.
Starting with the smallest instances, the verification of the safety property
is carried out fast and efficient. On successful verification, the algorithm produces
an inductive strengthening of the safety property. We reuse this result and try
to reason about the entire parameterized timed system. To this end, we extrapolate
the inductive strengthening into a candidate for the next-larger model. In case
this candidate is a valid inductive strengthening for the next larger model, our
main theorem reasons about all models of the parameterized timed system, stating
that the safety property holds true for all models. Otherwise, the main cycle
starts over with the verification of the next larger model. This workflow is iterated
indefinitely, until able to reason about the entire parameterized timed system,
until a counterexample trace is found, or until the single models become too large
to be handled in the verification. We reuse the intermediate results in a Feedback-loop
in order to accelerate the verification runs for the single models. Furthermore,
we consider an extended formalism in comparison to our previous publications.
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
citation:
ama: Isenberg T. Incremental Inductive Verification of Parameterized Timed Systems.
ACM Transactions on Embedded Computing Systems. 2017;(2):47:1-47:24. doi:10.1145/2984640
apa: Isenberg, T. (2017). Incremental Inductive Verification of Parameterized Timed
Systems. ACM Transactions on Embedded Computing Systems, (2), 47:1-47:24.
https://doi.org/10.1145/2984640
bibtex: '@article{Isenberg_2017, title={Incremental Inductive Verification of Parameterized
Timed Systems}, DOI={10.1145/2984640},
number={2}, journal={ACM Transactions on Embedded Computing Systems}, publisher={ACM},
author={Isenberg, Tobias}, year={2017}, pages={47:1-47:24} }'
chicago: 'Isenberg, Tobias. “Incremental Inductive Verification of Parameterized
Timed Systems.” ACM Transactions on Embedded Computing Systems, no. 2 (2017):
47:1-47:24. https://doi.org/10.1145/2984640.'
ieee: T. Isenberg, “Incremental Inductive Verification of Parameterized Timed Systems,”
ACM Transactions on Embedded Computing Systems, no. 2, pp. 47:1-47:24,
2017.
mla: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed
Systems.” ACM Transactions on Embedded Computing Systems, no. 2, ACM, 2017,
pp. 47:1-47:24, doi:10.1145/2984640.
short: T. Isenberg, ACM Transactions on Embedded Computing Systems (2017) 47:1-47:24.
date_created: 2017-10-17T12:41:09Z
date_updated: 2022-01-06T07:04:06Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1145/2984640
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:13:04Z
date_updated: 2018-03-21T13:13:04Z
file_id: '1572'
file_name: 90-a47-isenberg.pdf
file_size: 584870
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:13:04Z
has_accepted_license: '1'
issue: '2'
language:
- iso: eng
page: 47:1-47:24
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: ACM Transactions on Embedded Computing Systems
publisher: ACM
status: public
title: Incremental Inductive Verification of Parameterized Timed Systems
type: journal_article
user_id: '477'
year: '2017'
...
---
_id: '5769'
abstract:
- lang: eng
text: "Information Flow Analysis (IFA) aims at detecting illegal flows of information
between program entities. “Legality” is therein specified in terms of various
security policies. For the analysis, this opens up two possibilities: building
generic, policy independent and building specific, policy dependent IFAs. While
the former needs to track all dependencies between program entities, the latter
allows for a reduced and thus more efficient analysis.\r\n\r\nIn this paper, we
start out by formally defining a policy independent information flow analysis.
Next, we show how to specialize this IFA via policy specific variable tracking,
and prove soundness of the specialization. We furthermore investigate refinement
relationships between policies, allowing an IFA for one policy to be employed
for its refinements. As policy refinement depends on concrete program entities,
we additionally propose a precomputation of policy refinement conditions, enabling
an efficient refinement check for concrete programs."
author:
- first_name: Manuel
full_name: Töws, Manuel
id: '11315'
last_name: Töws
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Töws M, Wehrheim H. Policy Dependent and Independent Information Flow Analyses.
In: Formal Methods and Software Engineering - 19th International Conference
on Formal Engineering Methods (ICFEM 2017). Springer International Publishing;
2017:362-378. doi:10.1007/978-3-319-68690-5_22'
apa: Töws, M., & Wehrheim, H. (2017). Policy Dependent and Independent Information
Flow Analyses. In Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods (ICFEM 2017) (pp. 362–378). Springer
International Publishing. https://doi.org/10.1007/978-3-319-68690-5_22
bibtex: '@inproceedings{Töws_Wehrheim_2017, title={Policy Dependent and Independent
Information Flow Analyses}, DOI={10.1007/978-3-319-68690-5_22},
booktitle={Formal Methods and Software Engineering - 19th International Conference
on Formal Engineering Methods (ICFEM 2017)}, publisher={Springer International
Publishing}, author={Töws, Manuel and Wehrheim, Heike}, year={2017}, pages={362–378}
}'
chicago: Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information
Flow Analyses.” In Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods (ICFEM 2017), 362–78. Springer International
Publishing, 2017. https://doi.org/10.1007/978-3-319-68690-5_22.
ieee: M. Töws and H. Wehrheim, “Policy Dependent and Independent Information Flow
Analyses,” in Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods (ICFEM 2017), 2017, pp. 362–378.
mla: Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information
Flow Analyses.” Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods (ICFEM 2017), Springer International
Publishing, 2017, pp. 362–78, doi:10.1007/978-3-319-68690-5_22.
short: 'M. Töws, H. Wehrheim, in: Formal Methods and Software Engineering - 19th
International Conference on Formal Engineering Methods (ICFEM 2017), Springer
International Publishing, 2017, pp. 362–378.'
date_created: 2018-11-21T09:38:43Z
date_updated: 2022-01-06T07:02:39Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1007/978-3-319-68690-5_22
file:
- access_level: closed
content_type: application/pdf
creator: mtoews
date_created: 2018-11-26T15:07:42Z
date_updated: 2018-11-26T15:07:42Z
file_id: '5836'
file_name: Töws-Wehrheim2017_Chapter_PolicyDependentAndIndependentI.pdf
file_size: 424031
relation: main_file
success: 1
file_date_updated: 2018-11-26T15:07:42Z
has_accepted_license: '1'
language:
- iso: eng
page: 362-378
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publication: Formal Methods and Software Engineering - 19th International Conference on
Formal Engineering Methods (ICFEM 2017)
publication_identifier:
isbn:
- '9783319686899'
- '9783319686905'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Policy Dependent and Independent Information Flow Analyses
type: conference
user_id: '477'
year: '2017'
...
---
_id: '707'
author:
- first_name: Sven
full_name: Walther, Sven
last_name: Walther
citation:
ama: Walther S. Knowledge-Based Verification of Service Compositions. Universität
Paderborn; 2017. doi:10.17619/UNIPB/1-307
apa: Walther, S. (2017). Knowledge-based Verification of Service Compositions.
Universität Paderborn. https://doi.org/10.17619/UNIPB/1-307
bibtex: '@book{Walther_2017, title={Knowledge-based Verification of Service Compositions},
DOI={10.17619/UNIPB/1-307},
publisher={Universität Paderborn}, author={Walther, Sven}, year={2017} }'
chicago: Walther, Sven. Knowledge-Based Verification of Service Compositions.
Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-307.
ieee: S. Walther, Knowledge-based Verification of Service Compositions. Universität
Paderborn, 2017.
mla: Walther, Sven. Knowledge-Based Verification of Service Compositions.
Universität Paderborn, 2017, doi:10.17619/UNIPB/1-307.
short: S. Walther, Knowledge-Based Verification of Service Compositions, Universität
Paderborn, 2017.
date_created: 2017-11-20T07:59:31Z
date_updated: 2022-01-06T07:03:27Z
department:
- _id: '77'
doi: 10.17619/UNIPB/1-307
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Knowledge-based Verification of Service Compositions
type: dissertation
user_id: '477'
year: '2017'
...
---
_id: '71'
abstract:
- lang: eng
text: Today, software verification tools have reached the maturity to be used for
large scale programs. Different tools perform differently well on varying code.
A software developer is hence faced with the problem of choosing a tool appropriate
for her program at hand. A ranking of tools on programs could facilitate the choice.
Such rankings can, however, so far only be obtained by running all considered
tools on the program.In this paper, we present a machine learning approach to
predicting rankings of tools on programs. The method builds upon so-called label
ranking algorithms, which we complement with appropriate kernels providing a similarity
measure for programs. Our kernels employ a graph representation for software source
code that mixes elements of control flow and program dependence graphs with abstract
syntax trees. Using data sets from the software verification competition SV-COMP,
we demonstrate our rank prediction technique to generalize well and achieve a
rather high predictive accuracy (rank correlation > 0.6).
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. Predicting Rankings of Software
Verification Tools. In: Proceedings of the 3rd International Workshop on Software
Analytics. SWAN’17. ; 2017:23-26. doi:10.1145/3121257.3121262'
apa: Czech, M., Hüllermeier, E., Jakobs, M.-C., & Wehrheim, H. (2017). Predicting
Rankings of Software Verification Tools. In Proceedings of the 3rd International
Workshop on Software Analytics (pp. 23–26). https://doi.org/10.1145/3121257.3121262
bibtex: '@inproceedings{Czech_Hüllermeier_Jakobs_Wehrheim_2017, series={SWAN’17},
title={Predicting Rankings of Software Verification Tools}, DOI={10.1145/3121257.3121262},
booktitle={Proceedings of the 3rd International Workshop on Software Analytics},
author={Czech, Mike and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim,
Heike}, year={2017}, pages={23–26}, collection={SWAN’17} }'
chicago: Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim.
“Predicting Rankings of Software Verification Tools.” In Proceedings of the
3rd International Workshop on Software Analytics, 23–26. SWAN’17, 2017. https://doi.org/10.1145/3121257.3121262.
ieee: M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Predicting Rankings
of Software Verification Tools,” in Proceedings of the 3rd International Workshop
on Software Analytics, 2017, pp. 23–26.
mla: Czech, Mike, et al. “Predicting Rankings of Software Verification Tools.” Proceedings
of the 3rd International Workshop on Software Analytics, 2017, pp. 23–26,
doi:10.1145/3121257.3121262.
short: 'M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, in: Proceedings of
the 3rd International Workshop on Software Analytics, 2017, pp. 23–26.'
date_created: 2017-10-17T12:41:05Z
date_updated: 2022-01-06T07:03:28Z
ddc:
- '000'
department:
- _id: '355'
- _id: '77'
doi: 10.1145/3121257.3121262
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:24:29Z
date_updated: 2018-11-02T14:24:29Z
file_id: '5271'
file_name: fsews17swan-swanmain1.pdf
file_size: 822383
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:24:29Z
has_accepted_license: '1'
language:
- iso: eng
page: 23-26
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
publication: Proceedings of the 3rd International Workshop on Software Analytics
series_title: SWAN'17
status: public
title: Predicting Rankings of Software Verification Tools
type: conference
user_id: '15504'
year: '2017'
...
---
_id: '72'
abstract:
- lang: eng
text: 'Software verification competitions, such as the annual SV-COMP, evaluate
software verification tools with respect to their effectivity and efficiency.
Typically, the outcome of a competition is a (possibly category-specific) ranking
of the tools. For many applications, such as building portfolio solvers, it would
be desirable to have an idea of the (relative) performance of verification tools
on a given verification task beforehand, i.e., prior to actually running all tools
on the task.In this paper, we present a machine learning approach to predicting
rankings of tools on verification tasks. The method builds upon so-called label
ranking algorithms, which we complement with appropriate kernels providing a similarity
measure for verification tasks. Our kernels employ a graph representation for
software source code that mixes elements of control flow and program dependence
graphs with abstract syntax trees. Using data sets from SV-COMP, we demonstrate
our rank prediction technique to generalize well and achieve a rather high predictive
accuracy. In particular, our method outperforms a recently proposed feature-based
approach of Demyanova et al. (when applied to rank predictions). '
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. Predicting Rankings of Software
Verification Competitions.; 2017.
apa: Czech, M., Hüllermeier, E., Jakobs, M.-C., & Wehrheim, H. (2017). Predicting
Rankings of Software Verification Competitions.
bibtex: '@book{Czech_Hüllermeier_Jakobs_Wehrheim_2017, title={Predicting Rankings
of Software Verification Competitions}, author={Czech, Mike and Hüllermeier, Eyke
and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017} }'
chicago: Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim.
Predicting Rankings of Software Verification Competitions, 2017.
ieee: M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, Predicting Rankings
of Software Verification Competitions. 2017.
mla: Czech, Mike, et al. Predicting Rankings of Software Verification Competitions.
2017.
short: M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Predicting Rankings
of Software Verification Competitions, 2017.
date_created: 2017-10-17T12:41:05Z
date_updated: 2022-01-06T07:03:29Z
ddc:
- '000'
department:
- _id: '77'
- _id: '355'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-11-21T10:50:11Z
date_updated: 2018-11-21T10:50:11Z
file_id: '5782'
file_name: "Predicting Rankings of So\x81ware Verification Competitions.pdf"
file_size: 869984
relation: main_file
success: 1
file_date_updated: 2018-11-21T10:50:11Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
status: public
title: Predicting Rankings of Software Verification Competitions
type: report
user_id: '15504'
year: '2017'
...
---
_id: '68'
abstract:
- lang: eng
text: Proof-carrying hardware (PCH) is a principle for achieving safety for dynamically
reconfigurable hardware systems. The producer of a hardware module spends huge
effort when creating a proof for a safety policy. The proof is then transferred
as a certificate together with the configuration bitstream to the consumer of
the hardware module, who can quickly verify the given proof. Previous work utilized
SAT solvers and resolution traces to set up a PCH technology and corresponding
tool flows. In this article, we present a novel technology for PCH based on inductive
invariants. For sequential circuits, our approach is fundamentally stronger than
the previous SAT-based one since we avoid the limitations of bounded unrolling.
We contrast our technology to existing ones and show that it fits into previously
proposed tool flows. We conduct experiments with four categories of benchmark
circuits and report consumer and producer runtime and peak memory consumption,
as well as the size of the certificates and the distribution of the workload between
producer and consumer. Experiments clearly show that our new induction-based technology
is superior for sequential circuits, whereas the previous SAT-based technology
is the better choice for combinational circuits.
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
citation:
ama: Isenberg T, Platzner M, Wehrheim H, Wiersema T. Proof-Carrying Hardware via
Inductive Invariants. ACM Transactions on Design Automation of Electronic Systems.
2017;(4):61:1--61:23. doi:10.1145/3054743
apa: Isenberg, T., Platzner, M., Wehrheim, H., & Wiersema, T. (2017). Proof-Carrying
Hardware via Inductive Invariants. ACM Transactions on Design Automation of
Electronic Systems, (4), 61:1--61:23. https://doi.org/10.1145/3054743
bibtex: '@article{Isenberg_Platzner_Wehrheim_Wiersema_2017, title={Proof-Carrying
Hardware via Inductive Invariants}, DOI={10.1145/3054743},
number={4}, journal={ACM Transactions on Design Automation of Electronic Systems},
publisher={ACM}, author={Isenberg, Tobias and Platzner, Marco and Wehrheim, Heike
and Wiersema, Tobias}, year={2017}, pages={61:1--61:23} }'
chicago: 'Isenberg, Tobias, Marco Platzner, Heike Wehrheim, and Tobias Wiersema.
“Proof-Carrying Hardware via Inductive Invariants.” ACM Transactions on Design
Automation of Electronic Systems, no. 4 (2017): 61:1--61:23. https://doi.org/10.1145/3054743.'
ieee: T. Isenberg, M. Platzner, H. Wehrheim, and T. Wiersema, “Proof-Carrying Hardware
via Inductive Invariants,” ACM Transactions on Design Automation of Electronic
Systems, no. 4, pp. 61:1--61:23, 2017.
mla: Isenberg, Tobias, et al. “Proof-Carrying Hardware via Inductive Invariants.”
ACM Transactions on Design Automation of Electronic Systems, no. 4, ACM,
2017, pp. 61:1--61:23, doi:10.1145/3054743.
short: T. Isenberg, M. Platzner, H. Wehrheim, T. Wiersema, ACM Transactions on Design
Automation of Electronic Systems (2017) 61:1--61:23.
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:20Z
ddc:
- '000'
department:
- _id: '77'
- _id: '78'
doi: 10.1145/3054743
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T16:08:17Z
date_updated: 2018-11-02T16:08:17Z
file_id: '5324'
file_name: a61-isenberg.pdf
file_size: 806356
relation: main_file
success: 1
file_date_updated: 2018-11-02T16:08:17Z
has_accepted_license: '1'
issue: '4'
language:
- iso: eng
page: 61:1--61:23
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: ACM Transactions on Design Automation of Electronic Systems
publisher: ACM
status: public
title: Proof-Carrying Hardware via Inductive Invariants
type: journal_article
user_id: '3118'
year: '2017'
...
---
_id: '685'
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
citation:
ama: Jakobs M-C. On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-104
apa: Jakobs, M.-C. (2017). On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-104
bibtex: '@book{Jakobs_2017, title={On-The-Fly Safety Checking - Customizing Program
Certification and Program Restructuring}, DOI={10.17619/UNIPB/1-104},
publisher={Universität Paderborn}, author={Jakobs, Marie-Christine}, year={2017}
}'
chicago: Jakobs, Marie-Christine. On-The-Fly Safety Checking - Customizing Program
Certification and Program Restructuring. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-104.
ieee: M.-C. Jakobs, On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring. Universität Paderborn, 2017.
mla: Jakobs, Marie-Christine. On-The-Fly Safety Checking - Customizing Program
Certification and Program Restructuring. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-104.
short: M.-C. Jakobs, On-The-Fly Safety Checking - Customizing Program Certification
and Program Restructuring, Universität Paderborn, 2017.
date_created: 2017-11-13T08:13:29Z
date_updated: 2022-01-06T07:03:22Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.17619/UNIPB/1-104
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T12:26:52Z
date_updated: 2018-03-14T12:26:52Z
file_id: '1211'
file_name: 685-Dissertation-Jakobs.pdf
file_size: 11828624
relation: main_file
success: 1
file_date_updated: 2018-03-14T12:26:52Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: On-The-Fly Safety Checking - Customizing Program Certification and Program
Restructuring
type: dissertation
user_id: '477'
year: '2017'
...
---
_id: '69'
abstract:
- lang: eng
text: 'Today, software is traded worldwide on global markets, with apps being downloaded
to smartphones within minutes or seconds. This poses, more than ever, the challenge
of ensuring safety of software in the face of (1) unknown or untrusted software
providers together with (2) resource-limited software consumers. The concept of
Proof-Carrying Code (PCC), years ago suggested by Necula, provides one framework
for securing the execution of untrusted code. PCC techniques attach safety proofs,
constructed by software producers, to code. Based on the assumption that checking
proofs is usually much simpler than constructing proofs, software consumers should
thus be able to quickly check the safety of software. However, PCC techniques
often suffer from the size of certificates (i.e., the attached proofs), making
PCC techniques inefficient in practice.In this article, we introduce a new framework
for the safe execution of untrusted code called Programs from Proofs (PfP). The
basic assumption underlying the PfP technique is the fact that the structure of
programs significantly influences the complexity of checking a specific safety
property. Instead of attaching proofs to program code, the PfP technique transforms
the program into an efficiently checkable form, thus guaranteeing quick safety
checks for software consumers. For this transformation, the technique also uses
a producer-side automatic proof of safety. More specifically, safety proving for
the software producer proceeds via the construction of an abstract reachability
graph (ARG) unfolding the control-flow automaton (CFA) up to the degree necessary
for simple checking. To this end, we combine different sorts of software analysis:
expensive analyses incrementally determining the degree of unfolding, and cheap
analyses responsible for safety checking. Out of the abstract reachability graph
we generate the new program. In its CFA structure, it is isomorphic to the graph
and hence another, this time consumer-side, cheap analysis can quickly determine
its safety.Like PCC, Programs from Proofs is a general framework instantiable
with different sorts of (expensive and cheap) analysis. Here, we present the general
framework and exemplify it by some concrete examples. We have implemented different
instantiations on top of the configurable program analysis tool CPAchecker and
report on experiments, in particular on comparisons with PCC techniques.'
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Jakobs M-C, Wehrheim H. Programs from Proofs: A Framework for the Safe Execution
of Untrusted Software. ACM Transactions on Programming Languages and Systems.
2017;(2):7:1-7:56. doi:10.1145/3014427'
apa: 'Jakobs, M.-C., & Wehrheim, H. (2017). Programs from Proofs: A Framework
for the Safe Execution of Untrusted Software. ACM Transactions on Programming
Languages and Systems, (2), 7:1-7:56. https://doi.org/10.1145/3014427'
bibtex: '@article{Jakobs_Wehrheim_2017, title={Programs from Proofs: A Framework
for the Safe Execution of Untrusted Software}, DOI={10.1145/3014427},
number={2}, journal={ACM Transactions on Programming Languages and Systems}, publisher={ACM},
author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017}, pages={7:1-7:56}
}'
chicago: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs: A
Framework for the Safe Execution of Untrusted Software.” ACM Transactions on
Programming Languages and Systems, no. 2 (2017): 7:1-7:56. https://doi.org/10.1145/3014427.'
ieee: 'M.-C. Jakobs and H. Wehrheim, “Programs from Proofs: A Framework for the
Safe Execution of Untrusted Software,” ACM Transactions on Programming Languages
and Systems, no. 2, pp. 7:1-7:56, 2017.'
mla: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs: A Framework
for the Safe Execution of Untrusted Software.” ACM Transactions on Programming
Languages and Systems, no. 2, ACM, 2017, pp. 7:1-7:56, doi:10.1145/3014427.'
short: M.-C. Jakobs, H. Wehrheim, ACM Transactions on Programming Languages and
Systems (2017) 7:1-7:56.
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:23Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1145/3014427
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:15:09Z
date_updated: 2018-03-21T13:15:09Z
file_id: '1575'
file_name: 69-a7-jakobs.pdf
file_size: 1215139
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:15:09Z
has_accepted_license: '1'
issue: '2'
language:
- iso: eng
page: 7:1-7:56
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: ACM Transactions on Programming Languages and Systems
publisher: ACM
status: public
title: 'Programs from Proofs: A Framework for the Safe Execution of Untrusted Software'
type: journal_article
user_id: '477'
year: '2017'
...
---
_id: '109'
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
citation:
ama: Pauck F. Cooperative Static Analysis of Android Applications. Universität
Paderborn; 2017.
apa: Pauck, F. (2017). Cooperative static analysis of Android applications.
Universität Paderborn.
bibtex: '@book{Pauck_2017, title={Cooperative static analysis of Android applications},
publisher={Universität Paderborn}, author={Pauck, Felix}, year={2017} }'
chicago: Pauck, Felix. Cooperative Static Analysis of Android Applications.
Universität Paderborn, 2017.
ieee: F. Pauck, Cooperative static analysis of Android applications. Universität
Paderborn, 2017.
mla: Pauck, Felix. Cooperative Static Analysis of Android Applications. Universität
Paderborn, 2017.
short: F. Pauck, Cooperative Static Analysis of Android Applications, Universität
Paderborn, 2017.
date_created: 2017-10-17T12:41:12Z
date_updated: 2022-01-06T06:50:52Z
ddc:
- '000'
department:
- _id: '77'
file:
- access_level: open_access
content_type: application/pdf
creator: fpauck
date_created: 2019-08-07T08:55:58Z
date_updated: 2019-08-07T09:03:48Z
file_id: '12905'
file_name: fpauck_2017.pdf
file_size: 5093611
relation: main_file
title: Master's Thesis
file_date_updated: 2019-08-07T09:03:48Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Cooperative static analysis of Android applications
type: mastersthesis
user_id: '22398'
year: '2017'
...
---
_id: '201'
author:
- first_name: Henrik
full_name: Bröcher, Henrik
last_name: Bröcher
citation:
ama: Bröcher H. Evaluation von Graphpartitionierungsalgorithmen im Kontext von
Konfigurierbarer Softwarezertifizierung. Universität Paderborn; 2016.
apa: Bröcher, H. (2016). Evaluation von Graphpartitionierungsalgorithmen im Kontext
von Konfigurierbarer Softwarezertifizierung. Universität Paderborn.
bibtex: '@book{Bröcher_2016, title={Evaluation von Graphpartitionierungsalgorithmen
im Kontext von Konfigurierbarer Softwarezertifizierung}, publisher={Universität
Paderborn}, author={Bröcher, Henrik}, year={2016} }'
chicago: Bröcher, Henrik. Evaluation von Graphpartitionierungsalgorithmen im
Kontext von Konfigurierbarer Softwarezertifizierung. Universität Paderborn,
2016.
ieee: H. Bröcher, Evaluation von Graphpartitionierungsalgorithmen im Kontext
von Konfigurierbarer Softwarezertifizierung. Universität Paderborn, 2016.
mla: Bröcher, Henrik. Evaluation von Graphpartitionierungsalgorithmen im Kontext
von Konfigurierbarer Softwarezertifizierung. Universität Paderborn, 2016.
short: H. Bröcher, Evaluation von Graphpartitionierungsalgorithmen im Kontext von
Konfigurierbarer Softwarezertifizierung, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:31Z
date_updated: 2022-01-06T06:54:18Z
department:
- _id: '77'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer
Softwarezertifizierung
type: bachelorsthesis
user_id: '15504'
year: '2016'
...
---
_id: '3157'
author:
- first_name: Steffen
full_name: Beringer, Steffen
last_name: Beringer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Beringer S, Wehrheim H. Verification of AUTOSAR Software Architectures with
Timed Automata. In: H. ter Beek M, Gnesi S, Knapp A, eds. Critical Systems:
Formal Methods and Automated Verification - Joint 21st International Workshop
on Formal Methods for Industrial Critical Systems and 16th International Workshop
on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy,
September 26-28, 2016, Proceedings. Lecture Notes in Computer Science. ; 2016:189--204.
doi:10.1007/978-3-319-45943-1_13'
apa: 'Beringer, S., & Wehrheim, H. (2016). Verification of AUTOSAR Software
Architectures with Timed Automata. In M. H. ter Beek, S. Gnesi, & A. Knapp
(Eds.), Critical Systems: Formal Methods and Automated Verification - Joint
21st International Workshop on Formal Methods for Industrial Critical Systems
and 16th International Workshop on Automated Verification of Critical Systems,
FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings (pp. 189--204).
https://doi.org/10.1007/978-3-319-45943-1_13'
bibtex: '@inproceedings{Beringer_Wehrheim_2016, series={Lecture Notes in Computer
Science}, title={Verification of AUTOSAR Software Architectures with Timed Automata},
DOI={10.1007/978-3-319-45943-1_13},
booktitle={Critical Systems: Formal Methods and Automated Verification - Joint
21st International Workshop on Formal Methods for Industrial Critical Systems
and 16th International Workshop on Automated Verification of Critical Systems,
FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings}, author={Beringer,
Steffen and Wehrheim, Heike}, editor={H. ter Beek, Maurice and Gnesi, Stefania
and Knapp, AlexanderEditors}, year={2016}, pages={189--204}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software
Architectures with Timed Automata.” In Critical Systems: Formal Methods and
Automated Verification - Joint 21st International Workshop on Formal Methods for
Industrial Critical Systems and 16th International Workshop on Automated Verification
of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings,
edited by Maurice H. ter Beek, Stefania Gnesi, and Alexander Knapp, 189--204.
Lecture Notes in Computer Science, 2016. https://doi.org/10.1007/978-3-319-45943-1_13.'
ieee: 'S. Beringer and H. Wehrheim, “Verification of AUTOSAR Software Architectures
with Timed Automata,” in Critical Systems: Formal Methods and Automated Verification
- Joint 21st International Workshop on Formal Methods for Industrial Critical
Systems and 16th International Workshop on Automated Verification of Critical
Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings,
2016, pp. 189--204.'
mla: 'Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures
with Timed Automata.” Critical Systems: Formal Methods and Automated Verification
- Joint 21st International Workshop on Formal Methods for Industrial Critical
Systems and 16th International Workshop on Automated Verification of Critical
Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings,
edited by Maurice H. ter Beek et al., 2016, pp. 189--204, doi:10.1007/978-3-319-45943-1_13.'
short: 'S. Beringer, H. Wehrheim, in: M. H. ter Beek, S. Gnesi, A. Knapp (Eds.),
Critical Systems: Formal Methods and Automated Verification - Joint 21st International
Workshop on Formal Methods for Industrial Critical Systems and 16th International
Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa,
Italy, September 26-28, 2016, Proceedings, 2016, pp. 189--204.'
date_created: 2018-06-13T07:39:35Z
date_updated: 2022-01-06T06:59:01Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1007/978-3-319-45943-1_13
editor:
- first_name: Maurice
full_name: H. ter Beek, Maurice
last_name: H. ter Beek
- first_name: Stefania
full_name: Gnesi, Stefania
last_name: Gnesi
- first_name: Alexander
full_name: Knapp, Alexander
last_name: Knapp
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:17:13Z
date_updated: 2018-11-02T14:17:13Z
file_id: '5267'
file_name: VerificationOfAUTOSARSoftwareA.pdf
file_size: 2640695
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:17:13Z
has_accepted_license: '1'
language:
- iso: eng
page: 189--204
project:
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subproject B3
publication: 'Critical Systems: Formal Methods and Automated Verification - Joint
21st International Workshop on Formal Methods for Industrial Critical Systems and
16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS
2016, Pisa, Italy, September 26-28, 2016, Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: Verification of AUTOSAR Software Architectures with Timed Automata
type: conference
user_id: '477'
year: '2016'
...
---
_id: '3158'
author:
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Travkin O, Wehrheim H. Verification of Concurrent Programs on Weak Memory
Models. In: Sampaio A, Wang F, eds. Theoretical Aspects of Computing - {ICTAC}
2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016,
Proceedings. Lecture Notes in Computer Science. ; 2016:3--24. doi:10.1007/978-3-319-46750-4_1'
apa: Travkin, O., & Wehrheim, H. (2016). Verification of Concurrent Programs
on Weak Memory Models. In A. Sampaio & F. Wang (Eds.), Theoretical Aspects
of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC,
October 24-31, 2016, Proceedings (pp. 3--24). https://doi.org/10.1007/978-3-319-46750-4_1
bibtex: '@inproceedings{Travkin_Wehrheim_2016, series={Lecture Notes in Computer
Science}, title={Verification of Concurrent Programs on Weak Memory Models}, DOI={10.1007/978-3-319-46750-4_1},
booktitle={Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International
Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings}, author={Travkin,
Oleg and Wehrheim, Heike}, editor={Sampaio, Augusto and Wang, FarnEditors}, year={2016},
pages={3--24}, collection={Lecture Notes in Computer Science} }'
chicago: Travkin, Oleg, and Heike Wehrheim. “Verification of Concurrent Programs
on Weak Memory Models.” In Theoretical Aspects of Computing - {ICTAC} 2016
- 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings,
edited by Augusto Sampaio and Farn Wang, 3--24. Lecture Notes in Computer Science,
2016. https://doi.org/10.1007/978-3-319-46750-4_1.
ieee: O. Travkin and H. Wehrheim, “Verification of Concurrent Programs on Weak Memory
Models,” in Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International
Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings, 2016, pp.
3--24.
mla: Travkin, Oleg, and Heike Wehrheim. “Verification of Concurrent Programs on
Weak Memory Models.” Theoretical Aspects of Computing - {ICTAC} 2016 - 13th
International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings,
edited by Augusto Sampaio and Farn Wang, 2016, pp. 3--24, doi:10.1007/978-3-319-46750-4_1.
short: 'O. Travkin, H. Wehrheim, in: A. Sampaio, F. Wang (Eds.), Theoretical Aspects
of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC,
October 24-31, 2016, Proceedings, 2016, pp. 3--24.'
date_created: 2018-06-13T07:41:07Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-46750-4_1
editor:
- first_name: Augusto
full_name: Sampaio, Augusto
last_name: Sampaio
- first_name: Farn
full_name: Wang, Farn
last_name: Wang
page: 3--24
publication: Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International
Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Verification of Concurrent Programs on Weak Memory Models
type: conference
user_id: '29719'
year: '2016'
...
---
_id: '3159'
author:
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Schellhorn G, Travkin O, Wehrheim H. Towards a Thread-Local Proof Technique
for Starvation Freedom. In: Huisman M, ed. Integrated Formal Methods - 12th
International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings.
Lecture Notes in Computer Science. ; 2016:193--209. doi:10.1007/978-3-319-33693-0_13'
apa: Schellhorn, G., Travkin, O., & Wehrheim, H. (2016). Towards a Thread-Local
Proof Technique for Starvation Freedom. In M. Huisman (Ed.), Integrated Formal
Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June
1-5, 2016, Proceedings (pp. 193--209). https://doi.org/10.1007/978-3-319-33693-0_13
bibtex: '@inproceedings{Schellhorn_Travkin_Wehrheim_2016, series={Lecture Notes
in Computer Science}, title={Towards a Thread-Local Proof Technique for Starvation
Freedom}, DOI={10.1007/978-3-319-33693-0_13},
booktitle={Integrated Formal Methods - 12th International Conference, {IFM} 2016,
Reykjavik, Iceland, June 1-5, 2016, Proceedings}, author={Schellhorn, Gerhard
and Travkin, Oleg and Wehrheim, Heike}, editor={Huisman, MariekeEditor}, year={2016},
pages={193--209}, collection={Lecture Notes in Computer Science} }'
chicago: Schellhorn, Gerhard, Oleg Travkin, and Heike Wehrheim. “Towards a Thread-Local
Proof Technique for Starvation Freedom.” In Integrated Formal Methods - 12th
International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings,
edited by Marieke Huisman, 193--209. Lecture Notes in Computer Science, 2016.
https://doi.org/10.1007/978-3-319-33693-0_13.
ieee: G. Schellhorn, O. Travkin, and H. Wehrheim, “Towards a Thread-Local Proof
Technique for Starvation Freedom,” in Integrated Formal Methods - 12th International
Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings, 2016,
pp. 193--209.
mla: Schellhorn, Gerhard, et al. “Towards a Thread-Local Proof Technique for Starvation
Freedom.” Integrated Formal Methods - 12th International Conference, {IFM}
2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings, edited by Marieke Huisman,
2016, pp. 193--209, doi:10.1007/978-3-319-33693-0_13.
short: 'G. Schellhorn, O. Travkin, H. Wehrheim, in: M. Huisman (Ed.), Integrated
Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland,
June 1-5, 2016, Proceedings, 2016, pp. 193--209.'
date_created: 2018-06-13T07:42:34Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-33693-0_13
editor:
- first_name: Marieke
full_name: Huisman, Marieke
last_name: Huisman
page: 193--209
publication: Integrated Formal Methods - 12th International Conference, {IFM} 2016,
Reykjavik, Iceland, June 1-5, 2016, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Towards a Thread-Local Proof Technique for Starvation Freedom
type: conference
user_id: '29719'
year: '2016'
...
---
_id: '3160'
author:
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Doherty S, Dongol B, Derrick J, Schellhorn G, Wehrheim H. Proving Opacity
of a Pessimistic {STM}. In: Fatourou P, Jim{\’{e}}nez E, Pedone F, eds. 20th
International Conference on Principles of Distributed Systems, {OPODIS} 2016,
December 13-16, 2016, Madrid, Spain. LIPIcs. ; 2016:35:1--35:17. doi:10.4230/LIPIcs.OPODIS.2016.35'
apa: Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., & Wehrheim, H. (2016).
Proving Opacity of a Pessimistic {STM}. In P. Fatourou, E. Jim{\’{e}}nez, &
F. Pedone (Eds.), 20th International Conference on Principles of Distributed
Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain (pp. 35:1--35:17).
https://doi.org/10.4230/LIPIcs.OPODIS.2016.35
bibtex: '@inproceedings{Doherty_Dongol_Derrick_Schellhorn_Wehrheim_2016, series={LIPIcs},
title={Proving Opacity of a Pessimistic {STM}}, DOI={10.4230/LIPIcs.OPODIS.2016.35},
booktitle={20th International Conference on Principles of Distributed Systems,
{OPODIS} 2016, December 13-16, 2016, Madrid, Spain}, author={Doherty, Simon and
Dongol, Brijesh and Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike},
editor={Fatourou, Panagiota and Jim{\’{e}}nez, Ernesto and Pedone, FernandoEditors},
year={2016}, pages={35:1--35:17}, collection={LIPIcs} }'
chicago: Doherty, Simon, Brijesh Dongol, John Derrick, Gerhard Schellhorn, and Heike
Wehrheim. “Proving Opacity of a Pessimistic {STM}.” In 20th International Conference
on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid,
Spain, edited by Panagiota Fatourou, Ernesto Jim{\’{e}}nez, and Fernando Pedone,
35:1--35:17. LIPIcs, 2016. https://doi.org/10.4230/LIPIcs.OPODIS.2016.35.
ieee: S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, and H. Wehrheim, “Proving
Opacity of a Pessimistic {STM},” in 20th International Conference on Principles
of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain,
2016, pp. 35:1--35:17.
mla: Doherty, Simon, et al. “Proving Opacity of a Pessimistic {STM}.” 20th International
Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16,
2016, Madrid, Spain, edited by Panagiota Fatourou et al., 2016, pp. 35:1--35:17,
doi:10.4230/LIPIcs.OPODIS.2016.35.
short: 'S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, H. Wehrheim, in: P. Fatourou,
E. Jim{\’{e}}nez, F. Pedone (Eds.), 20th International Conference on Principles
of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain, 2016,
pp. 35:1--35:17.'
date_created: 2018-06-13T07:44:15Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.4230/LIPIcs.OPODIS.2016.35
editor:
- first_name: Panagiota
full_name: Fatourou, Panagiota
last_name: Fatourou
- first_name: Ernesto
full_name: Jim{\'{e}}nez, Ernesto
last_name: Jim{\'{e}}nez
- first_name: Fernando
full_name: Pedone, Fernando
last_name: Pedone
page: 35:1--35:17
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: 20th International Conference on Principles of Distributed Systems, {OPODIS}
2016, December 13-16, 2016, Madrid, Spain
series_title: LIPIcs
status: public
title: Proving Opacity of a Pessimistic {STM}
type: conference
user_id: '29719'
year: '2016'
...
---
_id: '3161'
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
- first_name: Marie{-}Christine
full_name: Jakobs, Marie{-}Christine
last_name: Jakobs
- first_name: Felix
full_name: Pauck, Felix
last_name: Pauck
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Isenberg T, Jakobs M-}Christine, Pauck F, Wehrheim H. Deriving approximation
tolerance constraints from verification runs. CoRR. 2016.
apa: Isenberg, T., Jakobs, M.-}Christine, Pauck, F., & Wehrheim, H. (2016).
Deriving approximation tolerance constraints from verification runs. CoRR.
bibtex: '@article{Isenberg_Jakobs_Pauck_Wehrheim_2016, title={Deriving approximation
tolerance constraints from verification runs}, journal={CoRR}, author={Isenberg,
Tobias and Jakobs, Marie{-}Christine and Pauck, Felix and Wehrheim, Heike}, year={2016}
}'
chicago: Isenberg, Tobias, Marie{-}Christine Jakobs, Felix Pauck, and Heike Wehrheim.
“Deriving Approximation Tolerance Constraints from Verification Runs.” CoRR,
2016.
ieee: T. Isenberg, M.-}Christine Jakobs, F. Pauck, and H. Wehrheim, “Deriving approximation
tolerance constraints from verification runs,” CoRR, 2016.
mla: Isenberg, Tobias, et al. “Deriving Approximation Tolerance Constraints from
Verification Runs.” CoRR, 2016.
short: T. Isenberg, M.-}Christine Jakobs, F. Pauck, H. Wehrheim, CoRR (2016).
date_created: 2018-06-13T07:45:27Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
publication: CoRR
status: public
title: Deriving approximation tolerance constraints from verification runs
type: journal_article
user_id: '29719'
year: '2016'
...
---
_id: '175'
abstract:
- lang: eng
text: Today, service compositions often need to be assembled or changed on-the-fly,
which leaves only little time for quality assurance. Moreover, quality assurance
is complicated by service providers only giving information on their services
in terms of domain specific concepts with only limited semantic meaning.In this
paper, we propose a method for constructing service compositions based on pre-verified
templates. Templates, given as workflow descriptions, are typed over a (domain-independent)
template ontology defining concepts and predicates. Their meaning is defined by
an abstract semantics, leaving the specific meaning of ontology concepts open,
however, only up to given ontology rules. Templates are proven correct using a
Hoare-style proof calculus, extended by a specific rule for service calls. Construction
of service compositions amounts to instantiation of templates with domain-specific
services. Correctness of an instantiation can then simply be checked by verifying
that the domain ontology (a) adheres to the rules of the template ontology, and
(b) fulfills the constraints of the employed template.
author:
- first_name: Sven
full_name: Walther, Sven
last_name: Walther
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Walther S, Wehrheim H. On-The-Fly Construction of Provably Correct Service
Compositions - Templates and Proofs. Science of Computer Programming. 2016:2--23.
doi:10.1016/j.scico.2016.04.002
apa: Walther, S., & Wehrheim, H. (2016). On-The-Fly Construction of Provably
Correct Service Compositions - Templates and Proofs. Science of Computer Programming,
2--23. https://doi.org/10.1016/j.scico.2016.04.002
bibtex: '@article{Walther_Wehrheim_2016, title={On-The-Fly Construction of Provably
Correct Service Compositions - Templates and Proofs}, DOI={10.1016/j.scico.2016.04.002},
journal={Science of Computer Programming}, publisher={Elsevier}, author={Walther,
Sven and Wehrheim, Heike}, year={2016}, pages={2--23} }'
chicago: Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably
Correct Service Compositions - Templates and Proofs.” Science of Computer Programming,
2016, 2--23. https://doi.org/10.1016/j.scico.2016.04.002.
ieee: S. Walther and H. Wehrheim, “On-The-Fly Construction of Provably Correct Service
Compositions - Templates and Proofs,” Science of Computer Programming,
pp. 2--23, 2016.
mla: Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably Correct
Service Compositions - Templates and Proofs.” Science of Computer Programming,
Elsevier, 2016, pp. 2--23, doi:10.1016/j.scico.2016.04.002.
short: S. Walther, H. Wehrheim, Science of Computer Programming (2016) 2--23.
date_created: 2017-10-17T12:41:26Z
date_updated: 2022-01-06T06:53:13Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.scico.2016.04.002
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:38:40Z
date_updated: 2018-03-21T12:38:40Z
file_id: '1536'
file_name: 175-1-s2.0-S0167642316300028-main.pdf
file_size: 630739
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:38:40Z
has_accepted_license: '1'
language:
- iso: eng
page: 2--23
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Science of Computer Programming
publisher: Elsevier
status: public
title: On-The-Fly Construction of Provably Correct Service Compositions - Templates
and Proofs
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '186'
abstract:
- lang: eng
text: Software verification is an established method to ensure software safety.
Nevertheless, verification still often fails, either because it consumes too much
resources, e.g., time or memory, or the technique is not mature enough to verify
the property. Often then discarding the partial verification, the validation process
proceeds with techniques like testing.To enable standard testing to profit from
previous, partial verification, we use a summary of the verification effort to
simplify the program for subsequent testing. Our techniques use this summary to
construct a residual program which only contains program paths with unproven assertions.
Afterwards, the residual program can be used with standard testing tools.Our first
experiments show that testing profits from the partial verification.The test effort
is reduced and combined verification and testing is faster than a complete verification.
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Czech M, Jakobs M-C, Wehrheim H. Just test what you cannot verify! In: Jens
Knoop UZ, ed. Software Engineering 2016. Lecture Notes in Informatics.
; 2016:17-18.'
apa: Czech, M., Jakobs, M.-C., & Wehrheim, H. (2016). Just test what you cannot
verify! In U. Z. Jens Knoop (Ed.), Software Engineering 2016 (pp. 17–18).
bibtex: '@inproceedings{Czech_Jakobs_Wehrheim_2016, series={Lecture Notes in Informatics},
title={Just test what you cannot verify!}, booktitle={Software Engineering 2016},
author={Czech, Mike and Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Jens
Knoop, Uwe ZdunEditor}, year={2016}, pages={17–18}, collection={Lecture Notes
in Informatics} }'
chicago: Czech, Mike, Marie-Christine Jakobs, and Heike Wehrheim. “Just Test What
You Cannot Verify!” In Software Engineering 2016, edited by Uwe Zdun Jens
Knoop, 17–18. Lecture Notes in Informatics, 2016.
ieee: M. Czech, M.-C. Jakobs, and H. Wehrheim, “Just test what you cannot verify!,”
in Software Engineering 2016, 2016, pp. 17–18.
mla: Czech, Mike, et al. “Just Test What You Cannot Verify!” Software Engineering
2016, edited by Uwe Zdun Jens Knoop, 2016, pp. 17–18.
short: 'M. Czech, M.-C. Jakobs, H. Wehrheim, in: U.Z. Jens Knoop (Ed.), Software
Engineering 2016, 2016, pp. 17–18.'
date_created: 2017-10-17T12:41:28Z
date_updated: 2022-01-06T06:53:43Z
ddc:
- '040'
department:
- _id: '77'
editor:
- first_name: Uwe Zdun
full_name: Jens Knoop, Uwe Zdun
last_name: Jens Knoop
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:32:11Z
date_updated: 2018-03-21T12:32:11Z
file_id: '1532'
file_name: 186-SEsubmission8.pdf
file_size: 55775
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:32:11Z
has_accepted_license: '1'
language:
- iso: eng
page: 17-18
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Software Engineering 2016
series_title: Lecture Notes in Informatics
status: public
title: Just test what you cannot verify!
type: conference
user_id: '477'
year: '2016'
...
---
_id: '224'
abstract:
- lang: eng
text: In modern software development, paradigms like component-based software engineering
(CBSE) and service-oriented architectures (SOA) emphasize the construction of
large software systems out of existing components or services. Therein, a service
is a self-contained piece of software, which adheres to a specified interface.
In a model-based software design, this interface constitutes our sole knowledge
of the service at design time, while service implementations are not available.
Therefore, correctness checks or detection of potential errors in service compositions
has to be carried out without the possibility of executing services. This challenges
the usage of standard software error localization techniques for service compositions.
In this paper, we review state-of-the-art approaches for error localization of
software and discuss their applicability to service compositions.
author:
- first_name: Julia
full_name: Krämer, Julia
last_name: Krämer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Krämer J, Wehrheim H. A short survey on using software error localization
for service compositions. In: Proceedings of the 5th European Conference on
Service-Oriented and Cloud Computing (ESOCC 2016). LNCS. ; 2016:248--262.
doi:10.1007/978-3-319-44482-6_16'
apa: Krämer, J., & Wehrheim, H. (2016). A short survey on using software error
localization for service compositions. In Proceedings of the 5th European Conference
on Service-Oriented and Cloud Computing (ESOCC 2016) (pp. 248--262). https://doi.org/10.1007/978-3-319-44482-6_16
bibtex: '@inproceedings{Krämer_Wehrheim_2016, series={LNCS}, title={A short survey
on using software error localization for service compositions}, DOI={10.1007/978-3-319-44482-6_16},
booktitle={Proceedings of the 5th European Conference on Service-Oriented and
Cloud Computing (ESOCC 2016)}, author={Krämer, Julia and Wehrheim, Heike}, year={2016},
pages={248--262}, collection={LNCS} }'
chicago: Krämer, Julia, and Heike Wehrheim. “A Short Survey on Using Software Error
Localization for Service Compositions.” In Proceedings of the 5th European
Conference on Service-Oriented and Cloud Computing (ESOCC 2016), 248--262.
LNCS, 2016. https://doi.org/10.1007/978-3-319-44482-6_16.
ieee: J. Krämer and H. Wehrheim, “A short survey on using software error localization
for service compositions,” in Proceedings of the 5th European Conference on
Service-Oriented and Cloud Computing (ESOCC 2016), 2016, pp. 248--262.
mla: Krämer, Julia, and Heike Wehrheim. “A Short Survey on Using Software Error
Localization for Service Compositions.” Proceedings of the 5th European Conference
on Service-Oriented and Cloud Computing (ESOCC 2016), 2016, pp. 248--262,
doi:10.1007/978-3-319-44482-6_16.
short: 'J. Krämer, H. Wehrheim, in: Proceedings of the 5th European Conference on
Service-Oriented and Cloud Computing (ESOCC 2016), 2016, pp. 248--262.'
date_created: 2017-10-17T12:41:35Z
date_updated: 2022-01-06T06:55:32Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-44482-6_16
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:35:04Z
date_updated: 2018-03-21T10:35:04Z
file_id: '1509'
file_name: 224-chp_3A10.1007_2F978-3-319-44482-6_16.pdf
file_size: 389042
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:35:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 248--262
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 5th European Conference on Service-Oriented and Cloud
Computing (ESOCC 2016)
series_title: LNCS
status: public
title: A short survey on using software error localization for service compositions
type: conference
user_id: '477'
year: '2016'
...
---
_id: '226'
abstract:
- lang: eng
text: Error detection, localization and correction are time-intensive tasks in software
development, but crucial to deliver functionally correct products. Thus, automated
approaches to these tasks have been intensively studied for standard software
systems. For model-based software systems, the situation is different. While error
detection is still well-studied, error localization and correction is a less-studied
domain. In this paper, we examine error localization and correction for models
of service compositions. Based on formal definitions of error and correction in
this context, we show that the classical approach of error localization and correction,
i.e. first determining a set of suspicious statements and then proposing changes
to these statements, is ineffective in our context. In fact, it lessens the chance
to succeed in finding a correction at all.In this paper, we introduce correction
proposal as a novel approach on error correction in service compositions integrating
error localization and correction in one combined step. In addition, we provide
an algorithm to compute such correction proposals automatically.
author:
- first_name: Julia
full_name: Krämer, Julia
last_name: Krämer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Krämer J, Wehrheim H. A Formal Approach to Error Localization and Correction
in Service Compositions. In: Proceedings of the 1st International Workshop
on Formal to Practical Software Verification and Composition (VeryComp 2016).
LNCS. ; 2016:445--457. doi:10.1007/978-3-319-50230-4_35'
apa: Krämer, J., & Wehrheim, H. (2016). A Formal Approach to Error Localization
and Correction in Service Compositions. In Proceedings of the 1st International
Workshop on Formal to Practical Software Verification and Composition (VeryComp
2016) (pp. 445--457). https://doi.org/10.1007/978-3-319-50230-4_35
bibtex: '@inproceedings{Krämer_Wehrheim_2016, series={LNCS}, title={A Formal Approach
to Error Localization and Correction in Service Compositions}, DOI={10.1007/978-3-319-50230-4_35},
booktitle={Proceedings of the 1st International Workshop on Formal to Practical
Software Verification and Composition (VeryComp 2016)}, author={Krämer, Julia
and Wehrheim, Heike}, year={2016}, pages={445--457}, collection={LNCS} }'
chicago: Krämer, Julia, and Heike Wehrheim. “A Formal Approach to Error Localization
and Correction in Service Compositions.” In Proceedings of the 1st International
Workshop on Formal to Practical Software Verification and Composition (VeryComp
2016), 445--457. LNCS, 2016. https://doi.org/10.1007/978-3-319-50230-4_35.
ieee: J. Krämer and H. Wehrheim, “A Formal Approach to Error Localization and Correction
in Service Compositions,” in Proceedings of the 1st International Workshop
on Formal to Practical Software Verification and Composition (VeryComp 2016),
2016, pp. 445--457.
mla: Krämer, Julia, and Heike Wehrheim. “A Formal Approach to Error Localization
and Correction in Service Compositions.” Proceedings of the 1st International
Workshop on Formal to Practical Software Verification and Composition (VeryComp
2016), 2016, pp. 445--457, doi:10.1007/978-3-319-50230-4_35.
short: 'J. Krämer, H. Wehrheim, in: Proceedings of the 1st International Workshop
on Formal to Practical Software Verification and Composition (VeryComp 2016),
2016, pp. 445--457.'
date_created: 2017-10-17T12:41:36Z
date_updated: 2022-01-06T06:55:37Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-50230-4_35
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:34:08Z
date_updated: 2018-03-21T10:34:08Z
file_id: '1507'
file_name: 226-chp_3A10.1007_2F978-3-319-50230-4_35.pdf
file_size: 492018
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:34:08Z
has_accepted_license: '1'
language:
- iso: eng
page: 445--457
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 1st International Workshop on Formal to Practical
Software Verification and Composition (VeryComp 2016)
series_title: LNCS
status: public
title: A Formal Approach to Error Localization and Correction in Service Compositions
type: conference
user_id: '477'
year: '2016'
...
---
_id: '227'
abstract:
- lang: eng
text: Information flow analysis studies the flow of data between program entities
(e.g. variables), where the allowed flow is specified via security policies. Typical
information flow analyses compute a conservative (over-)approximation of the flows
in a program. Such an analysis may thus signal non-existing violations of the
security policy.In this paper, we propose a new technique for inspecting the reported
violations (counterexamples) for spuriousity. Similar to counterexample-guided-abstraction-refinement
(CEGAR) in software verification, we use the result of this inspection to improve
the next round of the analysis. We prove soundness of this scheme.
author:
- first_name: Manuel
full_name: Töws, Manuel
id: '11315'
last_name: Töws
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Töws M, Wehrheim H. A CEGAR Scheme for Information Flow Analysis. In: Proceedings
of the 18th International Conference on Formal Engineering Methods (ICFEM 2016).
LNCS. ; 2016:466--483. doi:10.1007/978-3-319-47846-3_29'
apa: Töws, M., & Wehrheim, H. (2016). A CEGAR Scheme for Information Flow Analysis.
In Proceedings of the 18th International Conference on Formal Engineering Methods
(ICFEM 2016) (pp. 466--483). https://doi.org/10.1007/978-3-319-47846-3_29
bibtex: '@inproceedings{Töws_Wehrheim_2016, series={LNCS}, title={A CEGAR Scheme
for Information Flow Analysis}, DOI={10.1007/978-3-319-47846-3_29},
booktitle={Proceedings of the 18th International Conference on Formal Engineering
Methods (ICFEM 2016)}, author={Töws, Manuel and Wehrheim, Heike}, year={2016},
pages={466--483}, collection={LNCS} }'
chicago: Töws, Manuel, and Heike Wehrheim. “A CEGAR Scheme for Information Flow
Analysis.” In Proceedings of the 18th International Conference on Formal Engineering
Methods (ICFEM 2016), 466--483. LNCS, 2016. https://doi.org/10.1007/978-3-319-47846-3_29.
ieee: M. Töws and H. Wehrheim, “A CEGAR Scheme for Information Flow Analysis,” in
Proceedings of the 18th International Conference on Formal Engineering Methods
(ICFEM 2016), 2016, pp. 466--483.
mla: Töws, Manuel, and Heike Wehrheim. “A CEGAR Scheme for Information Flow Analysis.”
Proceedings of the 18th International Conference on Formal Engineering Methods
(ICFEM 2016), 2016, pp. 466--483, doi:10.1007/978-3-319-47846-3_29.
short: 'M. Töws, H. Wehrheim, in: Proceedings of the 18th International Conference
on Formal Engineering Methods (ICFEM 2016), 2016, pp. 466--483.'
date_created: 2017-10-17T12:41:36Z
date_updated: 2022-01-06T06:55:39Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-47846-3_29
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:33:38Z
date_updated: 2018-03-21T10:33:38Z
file_id: '1506'
file_name: 227-chp_3A10.1007_2F978-3-319-47846-3_29.pdf
file_size: 682849
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:33:38Z
has_accepted_license: '1'
language:
- iso: eng
page: 466--483
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 18th International Conference on Formal Engineering
Methods (ICFEM 2016)
series_title: LNCS
status: public
title: A CEGAR Scheme for Information Flow Analysis
type: conference
user_id: '477'
year: '2016'
...
---
_id: '170'
abstract:
- lang: eng
text: We present PAndA2, an extendable, static analysis tool for Android apps which examines permission related
security threats like overprivilege, existence of permission redelegation and
permission flows. PAndA2 comes along with a textual and graphical visualization
of the analysis result and even supports the comparison of analysis results for
different android app versions.
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Manuel
full_name: Töws, Manuel
id: '11315'
last_name: Töws
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
citation:
ama: 'Jakobs M-C, Töws M, Pauck F. PAndA 2 : Analyzing Permission Use and Interplay
in Android Apps (Tool Paper). In: Ishikawa F, Romanovsky A TE, ed. Workshop
on Formal and Model-Driven Techniques for Developing Trustworthy Systems.
School of Computing Science Technical Report Series. ; 2016.'
apa: 'Jakobs, M.-C., Töws, M., & Pauck, F. (2016). PAndA 2 : Analyzing Permission
Use and Interplay in Android Apps (Tool Paper). In T. E. Ishikawa F, Romanovsky
A (Ed.), Workshop on Formal and Model-Driven Techniques for Developing Trustworthy
Systems.'
bibtex: '@inproceedings{Jakobs_Töws_Pauck_2016, series={School of Computing Science
Technical Report Series}, title={PAndA 2 : Analyzing Permission Use and Interplay
in Android Apps (Tool Paper)}, booktitle={Workshop on Formal and Model-Driven
Techniques for Developing Trustworthy Systems}, author={Jakobs, Marie-Christine
and Töws, Manuel and Pauck, Felix}, editor={Ishikawa F, Romanovsky A, Troubitsyna
EEditor}, year={2016}, collection={School of Computing Science Technical Report
Series} }'
chicago: 'Jakobs, Marie-Christine, Manuel Töws, and Felix Pauck. “PAndA 2 : Analyzing
Permission Use and Interplay in Android Apps (Tool Paper).” In Workshop on
Formal and Model-Driven Techniques for Developing Trustworthy Systems, edited
by Troubitsyna E Ishikawa F, Romanovsky A. School of Computing Science Technical
Report Series, 2016.'
ieee: 'M.-C. Jakobs, M. Töws, and F. Pauck, “PAndA 2 : Analyzing Permission Use
and Interplay in Android Apps (Tool Paper),” in Workshop on Formal and Model-Driven
Techniques for Developing Trustworthy Systems, 2016.'
mla: 'Jakobs, Marie-Christine, et al. “PAndA 2 : Analyzing Permission Use and Interplay
in Android Apps (Tool Paper).” Workshop on Formal and Model-Driven Techniques
for Developing Trustworthy Systems, edited by Troubitsyna E Ishikawa F, Romanovsky
A, 2016.'
short: 'M.-C. Jakobs, M. Töws, F. Pauck, in: T.E. Ishikawa F, Romanovsky A (Ed.),
Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems,
2016.'
date_created: 2017-10-17T12:41:25Z
date_updated: 2022-01-06T06:53:01Z
ddc:
- '040'
department:
- _id: '77'
editor:
- first_name: Troubitsyna E
full_name: Ishikawa F, Romanovsky A, Troubitsyna E
last_name: Ishikawa F, Romanovsky A
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:40:27Z
date_updated: 2018-03-21T12:40:27Z
file_id: '1539'
file_name: 170-main_04.pdf
file_size: 285299
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:40:27Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Workshop on Formal and Model-Driven Techniques for Developing Trustworthy
Systems
related_material:
link:
- relation: contains
url: https://pdfs.semanticscholar.org/58cd/94c8b2335d16aa2558f711cf81b3f7746696.pdf
series_title: School of Computing Science Technical Report Series
status: public
title: 'PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper)'
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '1190'
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
citation:
ama: Isenberg T. Induction-Based Verification of Timed Systems. Universität
Paderborn; 2016.
apa: Isenberg, T. (2016). Induction-based Verification of Timed Systems.
Universität Paderborn.
bibtex: '@book{Isenberg_2016, title={Induction-based Verification of Timed Systems},
publisher={Universität Paderborn}, author={Isenberg, Tobias}, year={2016} }'
chicago: Isenberg, Tobias. Induction-Based Verification of Timed Systems.
Universität Paderborn, 2016.
ieee: T. Isenberg, Induction-based Verification of Timed Systems. Universität
Paderborn, 2016.
mla: Isenberg, Tobias. Induction-Based Verification of Timed Systems. Universität
Paderborn, 2016.
short: T. Isenberg, Induction-Based Verification of Timed Systems, Universität Paderborn,
2016.
date_created: 2018-03-05T10:11:48Z
date_updated: 2022-01-06T06:51:12Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-08T06:23:21Z
date_updated: 2018-03-08T09:14:11Z
file_id: '1195'
file_name: 1190-thesis_abgabeversion.pdf
file_size: 3354335
relation: main_file
file_date_updated: 2018-03-08T09:14:11Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Induction-based Verification of Timed Systems
type: dissertation
user_id: '477'
year: '2016'
...
---
_id: '162'
author:
- first_name: Guangli
full_name: Zhang, Guangli
last_name: Zhang
citation:
ama: 'Zhang G. Program Slicing: A Way of Separating WHILE Programs into Precise
and Approximate Portions. Universität Paderborn; 2016.'
apa: 'Zhang, G. (2016). Program Slicing: A Way of Separating WHILE Programs into
Precise and Approximate Portions. Universität Paderborn.'
bibtex: '@book{Zhang_2016, title={Program Slicing: A Way of Separating WHILE Programs
into Precise and Approximate Portions}, publisher={Universität Paderborn}, author={Zhang,
Guangli}, year={2016} }'
chicago: 'Zhang, Guangli. Program Slicing: A Way of Separating WHILE Programs
into Precise and Approximate Portions. Universität Paderborn, 2016.'
ieee: 'G. Zhang, Program Slicing: A Way of Separating WHILE Programs into Precise
and Approximate Portions. Universität Paderborn, 2016.'
mla: 'Zhang, Guangli. Program Slicing: A Way of Separating WHILE Programs into
Precise and Approximate Portions. Universität Paderborn, 2016.'
short: 'G. Zhang, Program Slicing: A Way of Separating WHILE Programs into Precise
and Approximate Portions, Universität Paderborn, 2016.'
date_created: 2017-10-17T12:41:23Z
date_updated: 2022-01-06T06:52:45Z
department:
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: 'Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate
Portions'
type: mastersthesis
user_id: '15504'
year: '2016'
...
---
_id: '164'
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
citation:
ama: Czech M. Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data. Universität Paderborn; 2016.
apa: Czech, M. (2016). Predicting Rankings of Software Verification Tools Using
Kernels for Structured Data. Universität Paderborn.
bibtex: '@book{Czech_2016, title={Predicting Rankings of Software Verification Tools
Using Kernels for Structured Data}, publisher={Universität Paderborn}, author={Czech,
Mike}, year={2016} }'
chicago: Czech, Mike. Predicting Rankings of Software Verification Tools Using
Kernels for Structured Data. Universität Paderborn, 2016.
ieee: M. Czech, Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data. Universität Paderborn, 2016.
mla: Czech, Mike. Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data. Universität Paderborn, 2016.
short: M. Czech, Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:24Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: Predicting Rankings of Software Verification Tools Using Kernels for Structured
Data
type: mastersthesis
user_id: '15504'
year: '2016'
...
---
_id: '133'
abstract:
- lang: eng
text: .
author:
- first_name: Markus
full_name: Dewender, Markus
last_name: Dewender
citation:
ama: Dewender M. Verifikation von Service Kompositionen mit Spin. Universität
Paderborn; 2016.
apa: Dewender, M. (2016). Verifikation von Service Kompositionen mit Spin.
Universität Paderborn.
bibtex: '@book{Dewender_2016, title={Verifikation von Service Kompositionen mit
Spin}, publisher={Universität Paderborn}, author={Dewender, Markus}, year={2016}
}'
chicago: Dewender, Markus. Verifikation von Service Kompositionen mit Spin.
Universität Paderborn, 2016.
ieee: M. Dewender, Verifikation von Service Kompositionen mit Spin. Universität
Paderborn, 2016.
mla: Dewender, Markus. Verifikation von Service Kompositionen mit Spin. Universität
Paderborn, 2016.
short: M. Dewender, Verifikation von Service Kompositionen mit Spin, Universität
Paderborn, 2016.
date_created: 2017-10-17T12:41:17Z
date_updated: 2022-01-06T06:51:32Z
department:
- _id: '77'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: Verifikation von Service Kompositionen mit Spin
type: bachelorsthesis
user_id: '15504'
year: '2016'
...
---
_id: '134'
abstract:
- lang: eng
text: .
author:
- first_name: Philipp
full_name: Heinisch, Philipp
last_name: Heinisch
citation:
ama: Heinisch P. Verifikation von Service Kompositionen mit Prolog. Universität
Paderborn; 2016.
apa: Heinisch, P. (2016). Verifikation von Service Kompositionen mit Prolog.
Universität Paderborn.
bibtex: '@book{Heinisch_2016, title={Verifikation von Service Kompositionen mit
Prolog}, publisher={Universität Paderborn}, author={Heinisch, Philipp}, year={2016}
}'
chicago: Heinisch, Philipp. Verifikation von Service Kompositionen mit Prolog.
Universität Paderborn, 2016.
ieee: P. Heinisch, Verifikation von Service Kompositionen mit Prolog. Universität
Paderborn, 2016.
mla: Heinisch, Philipp. Verifikation von Service Kompositionen mit Prolog.
Universität Paderborn, 2016.
short: P. Heinisch, Verifikation von Service Kompositionen mit Prolog, Universität
Paderborn, 2016.
date_created: 2017-10-17T12:41:17Z
date_updated: 2022-01-06T06:51:34Z
department:
- _id: '77'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: Verifikation von Service Kompositionen mit Prolog
type: bachelorsthesis
user_id: '15504'
year: '2016'
...
---
_id: '250'
abstract:
- lang: eng
text: Before execution, users should formally validate the correctness of software
received from untrusted providers. To accelerate this validation, in the proof
carrying code (PCC) paradigm the provider delivers the software together with
a certificate, a formal proof of the software’s correctness. Thus, the user only
checks if the attached certificate shows correctness of the delivered software.Recently,
we introduced configurable program certification, a generic, PCC based framework
supporting various software analyses and safety properties. Evaluation of our
framework revealed that validation suffers from certificate reading. In this paper,
we present two orthogonal approaches which improve certificate validation, both
reducing the impact of certificate reading. The first approach reduces the certificate
size, storing information only if it cannot easily be recomputed. The second approach
partitions the certificate into independently checkable parts. The trick is to
read parts of the certificate while already checking read parts. Our experiments
show that validation highly benefits from our improvements.
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
citation:
ama: 'Jakobs M-C. Speed Up Configurable Certificate Validation by Certificate Reduction
and Partitioning. In: Proceedings of the 13th International Conference on Software
Engineering and Formal Methods (SEFM). LNCS. ; 2015:159--174. doi:10.1007/978-3-319-22969-0_12'
apa: Jakobs, M.-C. (2015). Speed Up Configurable Certificate Validation by Certificate
Reduction and Partitioning. In Proceedings of the 13th International Conference
on Software Engineering and Formal Methods (SEFM) (pp. 159--174). https://doi.org/10.1007/978-3-319-22969-0_12
bibtex: '@inproceedings{Jakobs_2015, series={LNCS}, title={Speed Up Configurable
Certificate Validation by Certificate Reduction and Partitioning}, DOI={10.1007/978-3-319-22969-0_12},
booktitle={Proceedings of the 13th International Conference on Software Engineering
and Formal Methods (SEFM)}, author={Jakobs, Marie-Christine}, year={2015}, pages={159--174},
collection={LNCS} }'
chicago: Jakobs, Marie-Christine. “Speed Up Configurable Certificate Validation
by Certificate Reduction and Partitioning.” In Proceedings of the 13th International
Conference on Software Engineering and Formal Methods (SEFM), 159--174. LNCS,
2015. https://doi.org/10.1007/978-3-319-22969-0_12.
ieee: M.-C. Jakobs, “Speed Up Configurable Certificate Validation by Certificate
Reduction and Partitioning,” in Proceedings of the 13th International Conference
on Software Engineering and Formal Methods (SEFM), 2015, pp. 159--174.
mla: Jakobs, Marie-Christine. “Speed Up Configurable Certificate Validation by Certificate
Reduction and Partitioning.” Proceedings of the 13th International Conference
on Software Engineering and Formal Methods (SEFM), 2015, pp. 159--174, doi:10.1007/978-3-319-22969-0_12.
short: 'M.-C. Jakobs, in: Proceedings of the 13th International Conference on Software
Engineering and Formal Methods (SEFM), 2015, pp. 159--174.'
date_created: 2017-10-17T12:41:40Z
date_updated: 2022-01-06T06:56:43Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-22969-0_12
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:45:15Z
date_updated: 2018-03-21T09:45:15Z
file_id: '1489'
file_name: 250-Jakobs2015.pdf
file_size: 724308
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:45:15Z
has_accepted_license: '1'
language:
- iso: eng
page: 159--174
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 13th International Conference on Software Engineering
and Formal Methods (SEFM)
series_title: LNCS
status: public
title: Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning
type: conference
user_id: '477'
year: '2015'
...
---
_id: '283'
abstract:
- lang: eng
text: Today, software verification is an established analysis method which can provide
high guarantees for software safety. However, the resources (time and/or memory)
for an exhaustive verification are not always available, and analysis then has
to resort to other techniques, like testing. Most often, the already achieved
partial verification results arediscarded in this case, and testing has to start
from scratch.In this paper, we propose a method for combining verification and
testing in which testing only needs to check the residual fraction of an uncompleted
verification. To this end, the partial results of a verification run are used
to construct a residual program (and residual assertions to be checked on it).
The residual program can afterwards be fed into standardtesting tools. The proposed
technique is sound modulo the soundness of the testing procedure. Experimental
results show that this combinedusage of verification and testing can significantly
reduce the effort for the subsequent testing.
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Czech M, Jakobs M-C, Wehrheim H. Just test what you cannot verify! In: Egyed
A, Schaefer I, eds. Fundamental Approaches to Software Engineering. Lecture
Notes in Computer Science. ; 2015:100-114. doi:10.1007/978-3-662-46675-9_7'
apa: Czech, M., Jakobs, M.-C., & Wehrheim, H. (2015). Just test what you cannot
verify! In A. Egyed & I. Schaefer (Eds.), Fundamental Approaches to Software
Engineering (pp. 100–114). https://doi.org/10.1007/978-3-662-46675-9_7
bibtex: '@inproceedings{Czech_Jakobs_Wehrheim_2015, series={Lecture Notes in Computer
Science}, title={Just test what you cannot verify!}, DOI={10.1007/978-3-662-46675-9_7},
booktitle={Fundamental Approaches to Software Engineering}, author={Czech, Mike
and Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Egyed, Alexander and
Schaefer, InaEditors}, year={2015}, pages={100–114}, collection={Lecture Notes
in Computer Science} }'
chicago: Czech, Mike, Marie-Christine Jakobs, and Heike Wehrheim. “Just Test What
You Cannot Verify!” In Fundamental Approaches to Software Engineering,
edited by Alexander Egyed and Ina Schaefer, 100–114. Lecture Notes in Computer
Science, 2015. https://doi.org/10.1007/978-3-662-46675-9_7.
ieee: M. Czech, M.-C. Jakobs, and H. Wehrheim, “Just test what you cannot verify!,”
in Fundamental Approaches to Software Engineering, 2015, pp. 100–114.
mla: Czech, Mike, et al. “Just Test What You Cannot Verify!” Fundamental Approaches
to Software Engineering, edited by Alexander Egyed and Ina Schaefer, 2015,
pp. 100–14, doi:10.1007/978-3-662-46675-9_7.
short: 'M. Czech, M.-C. Jakobs, H. Wehrheim, in: A. Egyed, I. Schaefer (Eds.), Fundamental
Approaches to Software Engineering, 2015, pp. 100–114.'
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:00Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-662-46675-9_7
editor:
- first_name: Alexander
full_name: Egyed, Alexander
last_name: Egyed
- first_name: Ina
full_name: Schaefer, Ina
last_name: Schaefer
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:25:36Z
date_updated: 2018-03-21T09:25:36Z
file_id: '1469'
file_name: 283-FASEsubmission38_01.pdf
file_size: 391253
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:25:36Z
has_accepted_license: '1'
language:
- iso: eng
page: 100-114
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Fundamental Approaches to Software Engineering
series_title: Lecture Notes in Computer Science
status: public
title: Just test what you cannot verify!
type: conference
user_id: '477'
year: '2015'
...
---
_id: '285'
abstract:
- lang: eng
text: We propose an incremental workflow for the verification of parameterized systems
modeled as symmetric networks of timed automata. Starting with a small number
of timed automata in the network, a safety property is verified using IC3, a state-of-the-art
algorithm based on induction.The result of the verification, an inductive strengthening,
is reused proposing a candidate inductive strengthening for a larger network.If
the candidate is valid, our main theorem states that the safety property holds
for all sizes of the network of timed automata. Otherwise the number of automata
is increased and the next iteration is started with a new run of IC3.We propose
and thoroughly examine optimizations to our workflow, e.g. Feedback mechanisms
to speed up the run of IC3.
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
citation:
ama: 'Isenberg T. Incremental Inductive Verification of Parameterized Timed Systems.
In: Proceedings of the 15th International Conference on Application of Concurrency
to System Design (ACSD). ; 2015:1-9. doi:10.1109/ACSD.2015.13'
apa: Isenberg, T. (2015). Incremental Inductive Verification of Parameterized Timed
Systems. In Proceedings of the 15th International Conference on Application
of Concurrency to System Design (ACSD) (pp. 1–9). https://doi.org/10.1109/ACSD.2015.13
bibtex: '@inproceedings{Isenberg_2015, title={Incremental Inductive Verification
of Parameterized Timed Systems}, DOI={10.1109/ACSD.2015.13},
booktitle={Proceedings of the 15th International Conference on Application of
Concurrency to System Design (ACSD)}, author={Isenberg, Tobias}, year={2015},
pages={1–9} }'
chicago: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized
Timed Systems.” In Proceedings of the 15th International Conference on Application
of Concurrency to System Design (ACSD), 1–9, 2015. https://doi.org/10.1109/ACSD.2015.13.
ieee: T. Isenberg, “Incremental Inductive Verification of Parameterized Timed Systems,”
in Proceedings of the 15th International Conference on Application of Concurrency
to System Design (ACSD), 2015, pp. 1–9.
mla: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed
Systems.” Proceedings of the 15th International Conference on Application of
Concurrency to System Design (ACSD), 2015, pp. 1–9, doi:10.1109/ACSD.2015.13.
short: 'T. Isenberg, in: Proceedings of the 15th International Conference on Application
of Concurrency to System Design (ACSD), 2015, pp. 1–9.'
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:07Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1109/ACSD.2015.13
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:23:45Z
date_updated: 2018-03-21T09:23:45Z
file_id: '1466'
file_name: 285-07352419.pdf
file_size: 479808
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:23:45Z
has_accepted_license: '1'
language:
- iso: eng
page: '1-9 '
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 15th International Conference on Application of Concurrency
to System Design (ACSD)
status: public
title: Incremental Inductive Verification of Parameterized Timed Systems
type: conference
user_id: '477'
year: '2015'
...
---
_id: '246'
author:
- first_name: Galina
full_name: Besova, Galina
last_name: Besova
citation:
ama: Besova G. Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn; 2015.
apa: Besova, G. (2015). Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn.
bibtex: '@book{Besova_2015, title={Systematic Development and Re-Use of Model Tranformations},
publisher={Universität Paderborn}, author={Besova, Galina}, year={2015} }'
chicago: Besova, Galina. Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn, 2015.
ieee: G. Besova, Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn, 2015.
mla: Besova, Galina. Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn, 2015.
short: G. Besova, Systematic Development and Re-Use of Model Tranformations, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:40Z
date_updated: 2022-01-06T06:56:30Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:47:14Z
date_updated: 2018-03-21T09:47:14Z
file_id: '1492'
file_name: 246-Dissertation_-_Besova.pdf
file_size: 10091866
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:47:14Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/hsx/content/titleinfo/1705899
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Systematic Development and Re-Use of Model Tranformations
type: dissertation
user_id: '477'
year: '2015'
...
---
_id: '262'
abstract:
- lang: eng
text: Programs from Proofs" is a generic method which generates new programs out
of correctness proofs of given programs. The technique ensures that the new and
given program are behaviorally equivalent and that the new program is easily verifiable,
thus serving as an alternative to proof-carrying code concepts. So far, this generic
method has one instantiation that verifies type-state properties of programs.
In this paper, we present a whole range of new instantiations, all based on data
ow analyses. More precisely, we show how an imprecise but fast data ow analysis
can be enhanced with a predicate analysis as to yield a precise but expensive
analysis. Out of the safety proofs of this analysis, we generate new programs,
again behaviorally equivalent to the given ones, which are easily verifiable"
in the sense that now the data ow analysis alone can yield precise results. An
experimental evaluation practically supports our claim of easy verification.
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Jakobs M-C, Wehrheim H. Programs from Proofs of Predicated Dataflow Analyses.
In: Proceedings of the 30th Annual ACM Symposium on Applied Computing.
SAC ’15. ; 2015:1729-1736. doi:10.1145/2695664.2695690'
apa: Jakobs, M.-C., & Wehrheim, H. (2015). Programs from Proofs of Predicated
Dataflow Analyses. In Proceedings of the 30th Annual ACM Symposium on Applied
Computing (pp. 1729–1736). https://doi.org/10.1145/2695664.2695690
bibtex: '@inproceedings{Jakobs_Wehrheim_2015, series={SAC ’15}, title={Programs
from Proofs of Predicated Dataflow Analyses}, DOI={10.1145/2695664.2695690},
booktitle={Proceedings of the 30th Annual ACM Symposium on Applied Computing},
author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2015}, pages={1729–1736},
collection={SAC ’15} }'
chicago: Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated
Dataflow Analyses.” In Proceedings of the 30th Annual ACM Symposium on Applied
Computing, 1729–36. SAC ’15, 2015. https://doi.org/10.1145/2695664.2695690.
ieee: M.-C. Jakobs and H. Wehrheim, “Programs from Proofs of Predicated Dataflow
Analyses,” in Proceedings of the 30th Annual ACM Symposium on Applied Computing,
2015, pp. 1729–1736.
mla: Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated
Dataflow Analyses.” Proceedings of the 30th Annual ACM Symposium on Applied
Computing, 2015, pp. 1729–36, doi:10.1145/2695664.2695690.
short: 'M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 30th Annual ACM Symposium
on Applied Computing, 2015, pp. 1729–1736.'
date_created: 2017-10-17T12:41:43Z
date_updated: 2022-01-06T06:57:18Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1145/2695664.2695690
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:35:34Z
date_updated: 2018-03-21T09:35:34Z
file_id: '1483'
file_name: 262-mainSACfinal.pdf
file_size: 554583
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:35:34Z
has_accepted_license: '1'
language:
- iso: eng
page: 1729-1736
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 30th Annual ACM Symposium on Applied Computing
series_title: SAC '15
status: public
title: Programs from Proofs of Predicated Dataflow Analyses
type: conference
user_id: '477'
year: '2015'
...
---
_id: '290'
abstract:
- lang: eng
text: 'Model transformation is a key concept in model-driven software engineering.
The definition of model transformations is usually based on meta-models describing
the abstract syntax of languages. While meta-models are thereby able to abstract
from uperfluous details of concrete syntax, they often loose structural information
inherent in languages, like information on model elements always occurring together
in particular shapes. As a consequence, model transformations cannot naturally
re-use language structures, thus leading to unnecessary complexity in their development
as well as in quality assurance.In this paper, we propose a new approach to model
transformation development which allows to simplify the developed transformations
and improve their quality via the exploitation of the languages׳ structures. The
approach is based on context-free graph grammars and transformations defined by
pairing productions of source and target grammars. We show that such transformations
have important properties: they terminate and are sound, complete, and deterministic.'
author:
- first_name: Galina
full_name: Besova, Galina
last_name: Besova
- first_name: Dominik
full_name: Steenken, Dominik
last_name: Steenken
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Besova G, Steenken D, Wehrheim H. Grammar-based model transformations: Definition,
execution, and quality properties. Computer Languages, Systems & Structures.
2015:116-138. doi:10.1016/j.cl.2015.05.003'
apa: 'Besova, G., Steenken, D., & Wehrheim, H. (2015). Grammar-based model transformations:
Definition, execution, and quality properties. Computer Languages, Systems
& Structures, 116–138. https://doi.org/10.1016/j.cl.2015.05.003'
bibtex: '@article{Besova_Steenken_Wehrheim_2015, title={Grammar-based model transformations:
Definition, execution, and quality properties}, DOI={10.1016/j.cl.2015.05.003},
journal={Computer Languages, Systems & Structures}, publisher={Elsevier},
author={Besova, Galina and Steenken, Dominik and Wehrheim, Heike}, year={2015},
pages={116–138} }'
chicago: 'Besova, Galina, Dominik Steenken, and Heike Wehrheim. “Grammar-Based Model
Transformations: Definition, Execution, and Quality Properties.” Computer Languages,
Systems & Structures, 2015, 116–38. https://doi.org/10.1016/j.cl.2015.05.003.'
ieee: 'G. Besova, D. Steenken, and H. Wehrheim, “Grammar-based model transformations:
Definition, execution, and quality properties,” Computer Languages, Systems
& Structures, pp. 116–138, 2015.'
mla: 'Besova, Galina, et al. “Grammar-Based Model Transformations: Definition, Execution,
and Quality Properties.” Computer Languages, Systems & Structures,
Elsevier, 2015, pp. 116–38, doi:10.1016/j.cl.2015.05.003.'
short: G. Besova, D. Steenken, H. Wehrheim, Computer Languages, Systems & Structures
(2015) 116–138.
date_created: 2017-10-17T12:41:48Z
date_updated: 2022-01-06T06:58:43Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.cl.2015.05.003
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:22:03Z
date_updated: 2018-03-21T09:22:03Z
file_id: '1464'
file_name: 290-BSW15-main.pdf
file_size: 1329478
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:22:03Z
has_accepted_license: '1'
language:
- iso: eng
page: 116-138
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Computer Languages, Systems & Structures
publisher: Elsevier
status: public
title: 'Grammar-based model transformations: Definition, execution, and quality properties'
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '3162'
author:
- first_name: Steffen
full_name: Ziegert, Steffen
last_name: Ziegert
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Ziegert S, Wehrheim H. Temporal plans for software architecture reconfiguration.
Computer Science - R & D. 2015;(3-4):303--320. doi:10.1007/s00450-014-0259-7
apa: Ziegert, S., & Wehrheim, H. (2015). Temporal plans for software architecture
reconfiguration. Computer Science - R & D, (3–4), 303--320. https://doi.org/10.1007/s00450-014-0259-7
bibtex: '@article{Ziegert_Wehrheim_2015, title={Temporal plans for software architecture
reconfiguration}, DOI={10.1007/s00450-014-0259-7},
number={3–4}, journal={Computer Science - R & D}, author={Ziegert, Steffen
and Wehrheim, Heike}, year={2015}, pages={303--320} }'
chicago: 'Ziegert, Steffen, and Heike Wehrheim. “Temporal Plans for Software Architecture
Reconfiguration.” Computer Science - R & D, no. 3–4 (2015): 303--320.
https://doi.org/10.1007/s00450-014-0259-7.'
ieee: S. Ziegert and H. Wehrheim, “Temporal plans for software architecture reconfiguration,”
Computer Science - R & D, no. 3–4, pp. 303--320, 2015.
mla: Ziegert, Steffen, and Heike Wehrheim. “Temporal Plans for Software Architecture
Reconfiguration.” Computer Science - R & D, no. 3–4, 2015, pp. 303--320,
doi:10.1007/s00450-014-0259-7.
short: S. Ziegert, H. Wehrheim, Computer Science - R & D (2015) 303--320.
date_created: 2018-06-13T07:47:56Z
date_updated: 2022-01-06T06:59:01Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1007/s00450-014-0259-7
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:52:13Z
date_updated: 2018-11-02T15:52:13Z
file_id: '5315'
file_name: TemporalPlansForSoftwareArchit.pdf
file_size: 2136451
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:52:13Z
has_accepted_license: '1'
issue: 3-4
language:
- iso: eng
page: 303--320
project:
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subproject B3
publication: Computer Science - R & D
status: public
title: Temporal plans for software architecture reconfiguration
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '3163'
author:
- first_name: Roland
full_name: Meyer, Roland
last_name: Meyer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Meyer R, Wehrheim H. From Program Verification to Time and Space: The Scientific
Life of Ernst-R{\"{u}}diger Olderog. In: Meyer R, Platzer A, Wehrheim H, eds.
Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on
the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings.
Lecture Notes in Computer Science. ; 2015:3--4. doi:10.1007/978-3-319-23506-6_1'
apa: 'Meyer, R., & Wehrheim, H. (2015). From Program Verification to Time and
Space: The Scientific Life of Ernst-R{\"{u}}diger Olderog. In R. Meyer, A. Platzer,
& H. Wehrheim (Eds.), Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger
Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9,
2015. Proceedings (pp. 3--4). https://doi.org/10.1007/978-3-319-23506-6_1'
bibtex: '@inproceedings{Meyer_Wehrheim_2015, series={Lecture Notes in Computer Science},
title={From Program Verification to Time and Space: The Scientific Life of Ernst-R{\"{u}}diger
Olderog}, DOI={10.1007/978-3-319-23506-6_1},
booktitle={Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog
on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015.
Proceedings}, author={Meyer, Roland and Wehrheim, Heike}, editor={Meyer, Roland
and Platzer, Andr{\’{e}} and Wehrheim, HeikeEditors}, year={2015}, pages={3--4},
collection={Lecture Notes in Computer Science} }'
chicago: 'Meyer, Roland, and Heike Wehrheim. “From Program Verification to Time
and Space: The Scientific Life of Ernst-R{\"{u}}diger Olderog.” In Correct
System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion
of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings,
edited by Roland Meyer, Andr{\’{e}} Platzer, and Heike Wehrheim, 3--4. Lecture
Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-23506-6_1.'
ieee: 'R. Meyer and H. Wehrheim, “From Program Verification to Time and Space: The
Scientific Life of Ernst-R{\"{u}}diger Olderog,” in Correct System Design -
Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th
Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings, 2015, pp.
3--4.'
mla: 'Meyer, Roland, and Heike Wehrheim. “From Program Verification to Time and
Space: The Scientific Life of Ernst-R{\"{u}}diger Olderog.” Correct System
Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of
His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings, edited
by Roland Meyer et al., 2015, pp. 3--4, doi:10.1007/978-3-319-23506-6_1.'
short: 'R. Meyer, H. Wehrheim, in: R. Meyer, A. Platzer, H. Wehrheim (Eds.), Correct
System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion
of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings, 2015,
pp. 3--4.'
date_created: 2018-06-13T07:49:28Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-23506-6_1
editor:
- first_name: Roland
full_name: Meyer, Roland
last_name: Meyer
- first_name: Andr{\'{e}}
full_name: Platzer, Andr{\'{e}}
last_name: Platzer
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
page: 3--4
publication: Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog
on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: 'From Program Verification to Time and Space: The Scientific Life of Ernst-R{\"{u}}diger
Olderog'
type: conference
user_id: '29719'
year: '2015'
...
---
_id: '3164'
author:
- first_name: John
full_name: Derrick, John
last_name: Derrick
- 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, Dongol B, Schellhorn G, Travkin O, Wehrheim H. Verifying Opacity
of a Transactional Mutex Lock. In: Bj{\o}rner N, S. de Boer F, eds. {FM} 2015:
Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015,
Proceedings. Lecture Notes in Computer Science. ; 2015:161--177. doi:10.1007/978-3-319-19249-9_11'
apa: 'Derrick, J., Dongol, B., Schellhorn, G., Travkin, O., & Wehrheim, H. (2015).
Verifying Opacity of a Transactional Mutex Lock. In N. Bj{\o}rner & F. S.
de Boer (Eds.), {FM} 2015: Formal Methods - 20th International Symposium, Oslo,
Norway, June 24-26, 2015, Proceedings (pp. 161--177). https://doi.org/10.1007/978-3-319-19249-9_11'
bibtex: '@inproceedings{Derrick_Dongol_Schellhorn_Travkin_Wehrheim_2015, series={Lecture
Notes in Computer Science}, title={Verifying Opacity of a Transactional Mutex
Lock}, DOI={10.1007/978-3-319-19249-9_11},
booktitle={{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway,
June 24-26, 2015, Proceedings}, author={Derrick, John and Dongol, Brijesh and
Schellhorn, Gerhard and Travkin, Oleg and Wehrheim, Heike}, editor={Bj{\o}rner,
Nikolaj and S. de Boer, FrankEditors}, year={2015}, pages={161--177}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Derrick, John, Brijesh Dongol, Gerhard Schellhorn, Oleg Travkin, and Heike
Wehrheim. “Verifying Opacity of a Transactional Mutex Lock.” In {FM} 2015:
Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015,
Proceedings, edited by Nikolaj Bj{\o}rner and Frank S. de Boer, 161--177.
Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-19249-9_11.'
ieee: 'J. Derrick, B. Dongol, G. Schellhorn, O. Travkin, and H. Wehrheim, “Verifying
Opacity of a Transactional Mutex Lock,” in {FM} 2015: Formal Methods - 20th
International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings, 2015,
pp. 161--177.'
mla: 'Derrick, John, et al. “Verifying Opacity of a Transactional Mutex Lock.” {FM}
2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26,
2015, Proceedings, edited by Nikolaj Bj{\o}rner and Frank S. de Boer, 2015,
pp. 161--177, doi:10.1007/978-3-319-19249-9_11.'
short: 'J. Derrick, B. Dongol, G. Schellhorn, O. Travkin, H. Wehrheim, in: N. Bj{\o}rner,
F. S. de Boer (Eds.), {FM} 2015: Formal Methods - 20th International Symposium,
Oslo, Norway, June 24-26, 2015, Proceedings, 2015, pp. 161--177.'
date_created: 2018-06-13T07:50:43Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-19249-9_11
editor:
- first_name: Nikolaj
full_name: Bj{\o}rner, Nikolaj
last_name: Bj{\o}rner
- first_name: Frank
full_name: S. de Boer, Frank
last_name: S. de Boer
page: 161--177
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: '{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway,
June 24-26, 2015, Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: Verifying Opacity of a Transactional Mutex Lock
type: conference
user_id: '29719'
year: '2015'
...
---
_id: '3165'
author:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
citation:
ama: 'Wehrheim H, Travkin O. {TSO} to {SC} via Symbolic Execution. In: Piterman
N, ed. Hardware and Software: Verification and Testing - 11th International
Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015,
Proceedings. Lecture Notes in Computer Science. ; 2015:104--119. doi:10.1007/978-3-319-26287-1_7'
apa: 'Wehrheim, H., & Travkin, O. (2015). {TSO} to {SC} via Symbolic Execution.
In N. Piterman (Ed.), Hardware and Software: Verification and Testing - 11th
International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November
17-19, 2015, Proceedings (pp. 104--119). https://doi.org/10.1007/978-3-319-26287-1_7'
bibtex: '@inproceedings{Wehrheim_Travkin_2015, series={Lecture Notes in Computer
Science}, title={{TSO} to {SC} via Symbolic Execution}, DOI={10.1007/978-3-319-26287-1_7},
booktitle={Hardware and Software: Verification and Testing - 11th International
Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015,
Proceedings}, author={Wehrheim, Heike and Travkin, Oleg}, editor={Piterman, NirEditor},
year={2015}, pages={104--119}, collection={Lecture Notes in Computer Science}
}'
chicago: 'Wehrheim, Heike, and Oleg Travkin. “{TSO} to {SC} via Symbolic Execution.”
In Hardware and Software: Verification and Testing - 11th International Haifa
Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings,
edited by Nir Piterman, 104--119. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-26287-1_7.'
ieee: 'H. Wehrheim and O. Travkin, “{TSO} to {SC} via Symbolic Execution,” in Hardware
and Software: Verification and Testing - 11th International Haifa Verification
Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings,
2015, pp. 104--119.'
mla: 'Wehrheim, Heike, and Oleg Travkin. “{TSO} to {SC} via Symbolic Execution.”
Hardware and Software: Verification and Testing - 11th International Haifa
Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings,
edited by Nir Piterman, 2015, pp. 104--119, doi:10.1007/978-3-319-26287-1_7.'
short: 'H. Wehrheim, O. Travkin, in: N. Piterman (Ed.), Hardware and Software: Verification
and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa,
Israel, November 17-19, 2015, Proceedings, 2015, pp. 104--119.'
date_created: 2018-06-13T07:52:44Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-26287-1_7
editor:
- first_name: Nir
full_name: Piterman, Nir
last_name: Piterman
page: 104--119
publication: 'Hardware and Software: Verification and Testing - 11th International
Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015,
Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: '{TSO} to {SC} via Symbolic Execution'
type: conference
user_id: '29719'
year: '2015'
...
---
_id: '3166'
citation:
ama: Meyer R, Platzer A, Wehrheim H, eds. Correct System Design - Symposium in
Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg,
Germany, September 8-9, 2015. Proceedings.; 2015. doi:10.1007/978-3-319-23506-6
apa: Meyer, R., Platzer, A., & Wehrheim, H. (Eds.). (2015). Correct System
Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of
His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings. https://doi.org/10.1007/978-3-319-23506-6
bibtex: '@book{Meyer_Platzer_Wehrheim_2015, series={Lecture Notes in Computer Science},
title={Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog
on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015.
Proceedings}, DOI={10.1007/978-3-319-23506-6},
year={2015}, collection={Lecture Notes in Computer Science} }'
chicago: Meyer, Roland, Andr{\’{e}} Platzer, and Heike Wehrheim, eds. Correct
System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion
of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings.
Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-23506-6.
ieee: R. Meyer, A. Platzer, and H. Wehrheim, Eds., Correct System Design - Symposium
in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th Birthday,
Oldenburg, Germany, September 8-9, 2015. Proceedings. 2015.
mla: Meyer, Roland, et al., editors. Correct System Design - Symposium in Honor
of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg,
Germany, September 8-9, 2015. Proceedings. 2015, doi:10.1007/978-3-319-23506-6.
short: R. Meyer, A. Platzer, H. Wehrheim, eds., Correct System Design - Symposium
in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th Birthday,
Oldenburg, Germany, September 8-9, 2015. Proceedings, 2015.
date_created: 2018-06-13T07:54:06Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-23506-6
editor:
- first_name: Roland
full_name: Meyer, Roland
last_name: Meyer
- first_name: Andr{\'{e}}
full_name: Platzer, Andr{\'{e}}
last_name: Platzer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
publication_identifier:
isbn:
- 978-3-319-23505-9
series_title: Lecture Notes in Computer Science
status: public
title: Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on
the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings
type: conference_editor
user_id: '29719'
year: '2015'
...
---
_id: '336'
abstract:
- lang: eng
text: Today, service compositions often need to be assembled or changed on-the-fly,
which leaves only little time for quality assurance. Moreover, quality assurance
is complicated by service providers only giving information on their services
in terms of domain specific concepts with only limited semantic meaning. In this
paper, we propose a method to construct service compositions based on pre-verifiedtemplates.
Templates, given as workflow descriptions, are typed over a (domain-independent)
template ontology defining concepts and predicates. Templates are proven correct
using an abstract semantics, leaving the specific meaning of ontology concepts
open, however, only up to given ontology rules. Construction of service compositions
amounts to instantiation of templates with domain-specific services.Correctness
of an instantiation can then simply be checked by verifying that the domain ontology(a)
adheres to the rules of the template ontology, and (b) fulfills the constraints
of the employed template.
author:
- first_name: Sven
full_name: Walther, Sven
last_name: Walther
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Walther S, Wehrheim H. Verified Service Compositions by Template-Based Construction.
In: Lanese I, Madelaine E, eds. Proceedings of the 11th International Symposium
on Formal Aspects of Component Software (FACS). LNCS. ; 2014:31-48. doi:10.1007/978-3-319-15317-9_3'
apa: Walther, S., & Wehrheim, H. (2014). Verified Service Compositions by Template-Based
Construction. In I. Lanese & E. Madelaine (Eds.), Proceedings of the 11th
International Symposium on Formal Aspects of Component Software (FACS) (pp.
31–48). https://doi.org/10.1007/978-3-319-15317-9_3
bibtex: '@inproceedings{Walther_Wehrheim_2014, series={LNCS}, title={Verified Service
Compositions by Template-Based Construction}, DOI={10.1007/978-3-319-15317-9_3},
booktitle={Proceedings of the 11th International Symposium on Formal Aspects of
Component Software (FACS)}, author={Walther, Sven and Wehrheim, Heike}, editor={Lanese,
Ivan and Madelaine, EricEditors}, year={2014}, pages={31–48}, collection={LNCS}
}'
chicago: Walther, Sven, and Heike Wehrheim. “Verified Service Compositions by Template-Based
Construction.” In Proceedings of the 11th International Symposium on Formal
Aspects of Component Software (FACS), edited by Ivan Lanese and Eric Madelaine,
31–48. LNCS, 2014. https://doi.org/10.1007/978-3-319-15317-9_3.
ieee: S. Walther and H. Wehrheim, “Verified Service Compositions by Template-Based
Construction,” in Proceedings of the 11th International Symposium on Formal
Aspects of Component Software (FACS), 2014, pp. 31–48.
mla: Walther, Sven, and Heike Wehrheim. “Verified Service Compositions by Template-Based
Construction.” Proceedings of the 11th International Symposium on Formal Aspects
of Component Software (FACS), edited by Ivan Lanese and Eric Madelaine, 2014,
pp. 31–48, doi:10.1007/978-3-319-15317-9_3.
short: 'S. Walther, H. Wehrheim, in: I. Lanese, E. Madelaine (Eds.), Proceedings
of the 11th International Symposium on Formal Aspects of Component Software (FACS),
2014, pp. 31–48.'
date_created: 2017-10-17T12:41:57Z
date_updated: 2022-01-06T06:59:13Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-15317-9_3
editor:
- first_name: Ivan
full_name: Lanese, Ivan
last_name: Lanese
- first_name: Eric
full_name: Madelaine, Eric
last_name: Madelaine
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:29:29Z
date_updated: 2018-03-20T07:29:29Z
file_id: '1423'
file_name: 336-facs2014_walther.pdf
file_size: 484422
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:29:29Z
has_accepted_license: '1'
language:
- iso: eng
page: 31-48
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 11th International Symposium on Formal Aspects of
Component Software (FACS)
series_title: LNCS
status: public
title: Verified Service Compositions by Template-Based Construction
type: conference
user_id: '477'
year: '2014'
...
---
_id: '340'
author:
- first_name: Philipp
full_name: Korth, Philipp
last_name: Korth
citation:
ama: Korth P. Untersuchung transitiver Eigenschaften der Technik “Programs from
Proofs.” Universität Paderborn; 2014.
apa: Korth, P. (2014). Untersuchung transitiver Eigenschaften der Technik “Programs
from Proofs.” Universität Paderborn.
bibtex: '@book{Korth_2014, title={Untersuchung transitiver Eigenschaften der Technik
“Programs from Proofs”}, publisher={Universität Paderborn}, author={Korth, Philipp},
year={2014} }'
chicago: Korth, Philipp. Untersuchung transitiver Eigenschaften der Technik “Programs
from Proofs.” Universität Paderborn, 2014.
ieee: P. Korth, Untersuchung transitiver Eigenschaften der Technik “Programs
from Proofs.” Universität Paderborn, 2014.
mla: Korth, Philipp. Untersuchung transitiver Eigenschaften der Technik “Programs
from Proofs.” Universität Paderborn, 2014.
short: P. Korth, Untersuchung transitiver Eigenschaften der Technik “Programs from
Proofs,” Universität Paderborn, 2014.
date_created: 2017-10-17T12:41:58Z
date_updated: 2022-01-06T06:59:14Z
department:
- _id: '77'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: Untersuchung transitiver Eigenschaften der Technik "Programs from Proofs"
type: bachelorsthesis
user_id: '15504'
year: '2014'
...
---
_id: '344'
author:
- first_name: Matthias
full_name: Becker, Matthias
last_name: Becker
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
- first_name: Galina
full_name: Besova, Galina
last_name: Besova
- first_name: Sven
full_name: Walther, Sven
last_name: Walther
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Becker M, Becker S, Besova G, Walther S, Wehrheim H. Towards Systematic Configuration
for Architecture Validation. In: Proceedings of the 40th Euromicro Conference
on Software Engineering and Advanced Applications (Work in Progress Session).
; 2014.'
apa: Becker, M., Becker, S., Besova, G., Walther, S., & Wehrheim, H. (2014).
Towards Systematic Configuration for Architecture Validation. In Proceedings
of the 40th Euromicro Conference on Software Engineering and Advanced Applications
(Work in Progress Session).
bibtex: '@inproceedings{Becker_Becker_Besova_Walther_Wehrheim_2014, title={Towards
Systematic Configuration for Architecture Validation}, booktitle={Proceedings
of the 40th Euromicro Conference on Software Engineering and Advanced Applications
(Work in Progress Session)}, author={Becker, Matthias and Becker, Steffen and
Besova, Galina and Walther, Sven and Wehrheim, Heike}, year={2014} }'
chicago: Becker, Matthias, Steffen Becker, Galina Besova, Sven Walther, and Heike
Wehrheim. “Towards Systematic Configuration for Architecture Validation.” In Proceedings
of the 40th Euromicro Conference on Software Engineering and Advanced Applications
(Work in Progress Session), 2014.
ieee: M. Becker, S. Becker, G. Besova, S. Walther, and H. Wehrheim, “Towards Systematic
Configuration for Architecture Validation,” in Proceedings of the 40th Euromicro
Conference on Software Engineering and Advanced Applications (Work in Progress
Session), 2014.
mla: Becker, Matthias, et al. “Towards Systematic Configuration for Architecture
Validation.” Proceedings of the 40th Euromicro Conference on Software Engineering
and Advanced Applications (Work in Progress Session), 2014.
short: 'M. Becker, S. Becker, G. Besova, S. Walther, H. Wehrheim, in: Proceedings
of the 40th Euromicro Conference on Software Engineering and Advanced Applications
(Work in Progress Session), 2014.'
date_created: 2017-10-17T12:41:59Z
date_updated: 2022-01-06T06:59:17Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:27:54Z
date_updated: 2018-03-20T07:27:54Z
file_id: '1420'
file_name: 344-paper_CAMERA_READY.pdf
file_size: 80674
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:27:54Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 40th Euromicro Conference on Software Engineering
and Advanced Applications (Work in Progress Session)
status: public
title: Towards Systematic Configuration for Architecture Validation
type: conference
user_id: '477'
year: '2014'
...
---
_id: '353'
abstract:
- lang: eng
text: 'There are many technologies for the automation of processesthat deal with
services; examples are service discovery and composition.Automation of these processes
requires that the services are described semantically. However, semantically described
services are currently not oronly rarely available, which limits the applicability
of discovery and composition approaches. The systematic support for creating new
semanticservices usable by automated technologies is an open problem.We tackle
this problem with a template based approach: Domain independent templates are
instantiated with domain specific services andboolean expressions. The obtained
services have semantic descriptionswhose correctness directly follows from the
correctness of the template.Besides the theory, we present experimental results
for a service repository in which 85% of the services were generated automatically.'
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Sven
full_name: Walther, Sven
last_name: Walther
citation:
ama: 'Mohr F, Walther S. Template-based Generation of Semantic Services. In: Proceedings
of the 14th International Conference on Software Reuse (ICSR). LNCS. ; 2014:188-203.
doi:10.1007/978-3-319-14130-5_14'
apa: Mohr, F., & Walther, S. (2014). Template-based Generation of Semantic Services.
In Proceedings of the 14th International Conference on Software Reuse (ICSR)
(pp. 188–203). https://doi.org/10.1007/978-3-319-14130-5_14
bibtex: '@inproceedings{Mohr_Walther_2014, series={LNCS}, title={Template-based
Generation of Semantic Services}, DOI={10.1007/978-3-319-14130-5_14},
booktitle={Proceedings of the 14th International Conference on Software Reuse
(ICSR)}, author={Mohr, Felix and Walther, Sven}, year={2014}, pages={188–203},
collection={LNCS} }'
chicago: Mohr, Felix, and Sven Walther. “Template-Based Generation of Semantic Services.”
In Proceedings of the 14th International Conference on Software Reuse (ICSR),
188–203. LNCS, 2014. https://doi.org/10.1007/978-3-319-14130-5_14.
ieee: F. Mohr and S. Walther, “Template-based Generation of Semantic Services,”
in Proceedings of the 14th International Conference on Software Reuse (ICSR),
2014, pp. 188–203.
mla: Mohr, Felix, and Sven Walther. “Template-Based Generation of Semantic Services.”
Proceedings of the 14th International Conference on Software Reuse (ICSR),
2014, pp. 188–203, doi:10.1007/978-3-319-14130-5_14.
short: 'F. Mohr, S. Walther, in: Proceedings of the 14th International Conference
on Software Reuse (ICSR), 2014, pp. 188–203.'
date_created: 2017-10-17T12:42:00Z
date_updated: 2022-01-06T06:59:22Z
ddc:
- '040'
department:
- _id: '77'
- _id: '355'
doi: 10.1007/978-3-319-14130-5_14
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:23:32Z
date_updated: 2018-03-20T07:23:32Z
file_id: '1414'
file_name: 353-icsr2015_submission_17.pdf
file_size: 431778
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:23:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 188-203
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publication: Proceedings of the 14th International Conference on Software Reuse (ICSR)
series_title: LNCS
status: public
title: Template-based Generation of Semantic Services
type: conference
user_id: '477'
year: '2014'
...
---
_id: '383'
abstract:
- lang: eng
text: Proof-carrying code approaches aim at safe execution of untrusted code by
having the code producer attach a safety proof to the code which the code consumer
only has to validate. Depending on the type of safety property, proofs can however
become quite large and their validation - though faster than their construction
- still time consuming. In this paper we introduce a new concept for safe execution
of untrusted code. It keeps the idea of putting the time consuming part of proving
on the side of the code producer, however, attaches no proofs to code anymore
but instead uses the proof to transform the program into an equivalent but more
efficiently verifiable program. Code consumers thus still do proving themselves,
however, on a computationally inexpensive level only. Experimental results show
that the proof effort can be reduced by several orders of magnitude, both with
respect to time and space.
author:
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
- first_name: Alexander
full_name: Schremmer, Alexander
last_name: Schremmer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs -- Approach and Applications.
In: Proceedings of the Software Engineering Conference (SE). Lecture Notes
in Informatics (LNI). ; 2014:67-68.'
apa: Wonisch, D., Schremmer, A., & Wehrheim, H. (2014). Programs from Proofs
-- Approach and Applications. In Proceedings of the Software Engineering Conference
(SE) (pp. 67–68).
bibtex: '@inproceedings{Wonisch_Schremmer_Wehrheim_2014, series={Lecture Notes in
Informatics (LNI)}, title={Programs from Proofs -- Approach and Applications},
booktitle={Proceedings of the Software Engineering Conference (SE)}, author={Wonisch,
Daniel and Schremmer, Alexander and Wehrheim, Heike}, year={2014}, pages={67–68},
collection={Lecture Notes in Informatics (LNI)} }'
chicago: Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Programs from
Proofs -- Approach and Applications.” In Proceedings of the Software Engineering
Conference (SE), 67–68. Lecture Notes in Informatics (LNI), 2014.
ieee: D. Wonisch, A. Schremmer, and H. Wehrheim, “Programs from Proofs -- Approach
and Applications,” in Proceedings of the Software Engineering Conference (SE),
2014, pp. 67–68.
mla: Wonisch, Daniel, et al. “Programs from Proofs -- Approach and Applications.”
Proceedings of the Software Engineering Conference (SE), 2014, pp. 67–68.
short: 'D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the Software Engineering
Conference (SE), 2014, pp. 67–68.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:38Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:04:52Z
date_updated: 2018-03-20T07:04:52Z
file_id: '1392'
file_name: 383-programmsFromProofsSE.pdf
file_size: 66474
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:04:52Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://eprints.uni-kiel.de/23752/
page: 67-68
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the Software Engineering Conference (SE)
series_title: Lecture Notes in Informatics (LNI)
status: public
title: Programs from Proofs -- Approach and Applications
type: conference
user_id: '477'
year: '2014'
...
---
_id: '3167'
author:
- first_name: Steve
full_name: Schneider, Steve
last_name: Schneider
- first_name: Helen
full_name: Treharne, Helen
last_name: Treharne
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Schneider S, Treharne H, Wehrheim H. The behavioural semantics of Event-B refinement.
Formal Asp Comput. 2014;(2):251--280. doi:10.1007/s00165-012-0265-0
apa: Schneider, S., Treharne, H., & Wehrheim, H. (2014). The behavioural semantics
of Event-B refinement. Formal Asp. Comput., (2), 251--280. https://doi.org/10.1007/s00165-012-0265-0
bibtex: '@article{Schneider_Treharne_Wehrheim_2014, title={The behavioural semantics
of Event-B refinement}, DOI={10.1007/s00165-012-0265-0},
number={2}, journal={Formal Asp. Comput.}, author={Schneider, Steve and Treharne,
Helen and Wehrheim, Heike}, year={2014}, pages={251--280} }'
chicago: 'Schneider, Steve, Helen Treharne, and Heike Wehrheim. “The Behavioural
Semantics of Event-B Refinement.” Formal Asp. Comput., no. 2 (2014): 251--280.
https://doi.org/10.1007/s00165-012-0265-0.'
ieee: S. Schneider, H. Treharne, and H. Wehrheim, “The behavioural semantics of
Event-B refinement,” Formal Asp. Comput., no. 2, pp. 251--280, 2014.
mla: Schneider, Steve, et al. “The Behavioural Semantics of Event-B Refinement.”
Formal Asp. Comput., no. 2, 2014, pp. 251--280, doi:10.1007/s00165-012-0265-0.
short: S. Schneider, H. Treharne, H. Wehrheim, Formal Asp. Comput. (2014) 251--280.
date_created: 2018-06-13T07:55:10Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/s00165-012-0265-0
issue: '2'
page: 251--280
publication: Formal Asp. Comput.
status: public
title: The behavioural semantics of Event-B refinement
type: journal_article
user_id: '29719'
year: '2014'
...
---
_id: '3168'
author:
- first_name: Bogdan
full_name: Tofan, Bogdan
last_name: Tofan
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Tofan B, Travkin O, Schellhorn G, Wehrheim H. Two approaches for proving linearizability
of multiset. Sci Comput Program. 2014:297--314. doi:10.1016/j.scico.2014.04.001
apa: Tofan, B., Travkin, O., Schellhorn, G., & Wehrheim, H. (2014). Two approaches
for proving linearizability of multiset. Sci. Comput. Program., 297--314.
https://doi.org/10.1016/j.scico.2014.04.001
bibtex: '@article{Tofan_Travkin_Schellhorn_Wehrheim_2014, title={Two approaches
for proving linearizability of multiset}, DOI={10.1016/j.scico.2014.04.001},
journal={Sci. Comput. Program.}, author={Tofan, Bogdan and Travkin, Oleg and Schellhorn,
Gerhard and Wehrheim, Heike}, year={2014}, pages={297--314} }'
chicago: Tofan, Bogdan, Oleg Travkin, Gerhard Schellhorn, and Heike Wehrheim. “Two
Approaches for Proving Linearizability of Multiset.” Sci. Comput. Program.,
2014, 297--314. https://doi.org/10.1016/j.scico.2014.04.001.
ieee: B. Tofan, O. Travkin, G. Schellhorn, and H. Wehrheim, “Two approaches for
proving linearizability of multiset,” Sci. Comput. Program., pp. 297--314,
2014.
mla: Tofan, Bogdan, et al. “Two Approaches for Proving Linearizability of Multiset.”
Sci. Comput. Program., 2014, pp. 297--314, doi:10.1016/j.scico.2014.04.001.
short: B. Tofan, O. Travkin, G. Schellhorn, H. Wehrheim, Sci. Comput. Program. (2014)
297--314.
date_created: 2018-06-13T07:56:12Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1016/j.scico.2014.04.001
page: 297--314
publication: Sci. Comput. Program.
status: public
title: Two approaches for proving linearizability of multiset
type: journal_article
user_id: '29719'
year: '2014'
...
---
_id: '3169'
author:
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Schellhorn G, Derrick J, Wehrheim H. A Sound and Complete Proof Technique for
Linearizability of Concurrent Data Structures. {ACM} Trans Comput Log.
2014;(4):31:1--31:37. doi:10.1145/2629496
apa: Schellhorn, G., Derrick, J., & Wehrheim, H. (2014). A Sound and Complete
Proof Technique for Linearizability of Concurrent Data Structures. {ACM} Trans.
Comput. Log., (4), 31:1--31:37. https://doi.org/10.1145/2629496
bibtex: '@article{Schellhorn_Derrick_Wehrheim_2014, title={A Sound and Complete
Proof Technique for Linearizability of Concurrent Data Structures}, DOI={10.1145/2629496},
number={4}, journal={{ACM} Trans. Comput. Log.}, author={Schellhorn, Gerhard and
Derrick, John and Wehrheim, Heike}, year={2014}, pages={31:1--31:37} }'
chicago: 'Schellhorn, Gerhard, John Derrick, and Heike Wehrheim. “A Sound and Complete
Proof Technique for Linearizability of Concurrent Data Structures.” {ACM} Trans.
Comput. Log., no. 4 (2014): 31:1--31:37. https://doi.org/10.1145/2629496.'
ieee: G. Schellhorn, J. Derrick, and H. Wehrheim, “A Sound and Complete Proof Technique
for Linearizability of Concurrent Data Structures,” {ACM} Trans. Comput. Log.,
no. 4, pp. 31:1--31:37, 2014.
mla: Schellhorn, Gerhard, et al. “A Sound and Complete Proof Technique for Linearizability
of Concurrent Data Structures.” {ACM} Trans. Comput. Log., no. 4, 2014,
pp. 31:1--31:37, doi:10.1145/2629496.
short: G. Schellhorn, J. Derrick, H. Wehrheim, {ACM} Trans. Comput. Log. (2014)
31:1--31:37.
date_created: 2018-06-13T07:57:31Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1145/2629496
issue: '4'
page: 31:1--31:37
publication: '{ACM} Trans. Comput. Log.'
status: public
title: A Sound and Complete Proof Technique for Linearizability of Concurrent Data
Structures
type: journal_article
user_id: '29719'
year: '2014'
...
---
_id: '3170'
author:
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Bogdan
full_name: Tofan, Bogdan
last_name: Tofan
- 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, Dongol B, Schellhorn G, Tofan B, Travkin O, Wehrheim H. Quiescent
Consistency: Defining and Verifying Relaxed Linearizability. In: B. Jones C, Pihlajasaari
P, Sun J, eds. {FM} 2014: Formal Methods - 19th International Symposium, Singapore,
May 12-16, 2014. Proceedings. Lecture Notes in Computer Science. ; 2014:200--214.
doi:10.1007/978-3-319-06410-9_15'
apa: 'Derrick, J., Dongol, B., Schellhorn, G., Tofan, B., Travkin, O., & Wehrheim,
H. (2014). Quiescent Consistency: Defining and Verifying Relaxed Linearizability.
In C. B. Jones, P. Pihlajasaari, & J. Sun (Eds.), {FM} 2014: Formal Methods
- 19th International Symposium, Singapore, May 12-16, 2014. Proceedings (pp.
200--214). https://doi.org/10.1007/978-3-319-06410-9_15'
bibtex: '@inproceedings{Derrick_Dongol_Schellhorn_Tofan_Travkin_Wehrheim_2014, series={Lecture
Notes in Computer Science}, title={Quiescent Consistency: Defining and Verifying
Relaxed Linearizability}, DOI={10.1007/978-3-319-06410-9_15},
booktitle={{FM} 2014: Formal Methods - 19th International Symposium, Singapore,
May 12-16, 2014. Proceedings}, author={Derrick, John and Dongol, Brijesh and Schellhorn,
Gerhard and Tofan, Bogdan and Travkin, Oleg and Wehrheim, Heike}, editor={B. Jones,
Cliff and Pihlajasaari, Pekka and Sun, JunEditors}, year={2014}, pages={200--214},
collection={Lecture Notes in Computer Science} }'
chicago: 'Derrick, John, Brijesh Dongol, Gerhard Schellhorn, Bogdan Tofan, Oleg
Travkin, and Heike Wehrheim. “Quiescent Consistency: Defining and Verifying Relaxed
Linearizability.” In {FM} 2014: Formal Methods - 19th International Symposium,
Singapore, May 12-16, 2014. Proceedings, edited by Cliff B. Jones, Pekka Pihlajasaari,
and Jun Sun, 200--214. Lecture Notes in Computer Science, 2014. https://doi.org/10.1007/978-3-319-06410-9_15.'
ieee: 'J. Derrick, B. Dongol, G. Schellhorn, B. Tofan, O. Travkin, and H. Wehrheim,
“Quiescent Consistency: Defining and Verifying Relaxed Linearizability,” in {FM}
2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014.
Proceedings, 2014, pp. 200--214.'
mla: 'Derrick, John, et al. “Quiescent Consistency: Defining and Verifying Relaxed
Linearizability.” {FM} 2014: Formal Methods - 19th International Symposium,
Singapore, May 12-16, 2014. Proceedings, edited by Cliff B. Jones et al.,
2014, pp. 200--214, doi:10.1007/978-3-319-06410-9_15.'
short: 'J. Derrick, B. Dongol, G. Schellhorn, B. Tofan, O. Travkin, H. Wehrheim,
in: C. B. Jones, P. Pihlajasaari, J. Sun (Eds.), {FM} 2014: Formal Methods - 19th
International Symposium, Singapore, May 12-16, 2014. Proceedings, 2014, pp. 200--214.'
date_created: 2018-06-13T07:58:40Z
date_updated: 2022-01-06T06:59:02Z
department:
- _id: '77'
doi: 10.1007/978-3-319-06410-9_15
editor:
- first_name: Cliff
full_name: B. Jones, Cliff
last_name: B. Jones
- first_name: Pekka
full_name: Pihlajasaari, Pekka
last_name: Pihlajasaari
- first_name: Jun
full_name: Sun, Jun
last_name: Sun
page: 200--214
publication: '{FM} 2014: Formal Methods - 19th International Symposium, Singapore,
May 12-16, 2014. Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: 'Quiescent Consistency: Defining and Verifying Relaxed Linearizability'
type: conference
user_id: '29719'
year: '2014'
...
---
_id: '3171'
author:
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Travkin O, Wehrheim H. Handling {TSO} in Mechanized Linearizability Proofs.
In: Yahav E, ed. Hardware and Software: Verification and Testing - 10th International
Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014.
Proceedings. Lecture Notes in Computer Science. ; 2014:132--147. doi:10.1007/978-3-319-13338-6_11'
apa: 'Travkin, O., & Wehrheim, H. (2014). Handling {TSO} in Mechanized Linearizability
Proofs. In E. Yahav (Ed.), Hardware and Software: Verification and Testing
- 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel,
November 18-20, 2014. Proceedings (pp. 132--147). https://doi.org/10.1007/978-3-319-13338-6_11'
bibtex: '@inproceedings{Travkin_Wehrheim_2014, series={Lecture Notes in Computer
Science}, title={Handling {TSO} in Mechanized Linearizability Proofs}, DOI={10.1007/978-3-319-13338-6_11},
booktitle={Hardware and Software: Verification and Testing - 10th International
Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014.
Proceedings}, author={Travkin, Oleg and Wehrheim, Heike}, editor={Yahav, EranEditor},
year={2014}, pages={132--147}, collection={Lecture Notes in Computer Science}
}'
chicago: 'Travkin, Oleg, and Heike Wehrheim. “Handling {TSO} in Mechanized Linearizability
Proofs.” In Hardware and Software: Verification and Testing - 10th International
Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014.
Proceedings, edited by Eran Yahav, 132--147. Lecture Notes in Computer Science,
2014. https://doi.org/10.1007/978-3-319-13338-6_11.'
ieee: 'O. Travkin and H. Wehrheim, “Handling {TSO} in Mechanized Linearizability
Proofs,” in Hardware and Software: Verification and Testing - 10th International
Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014.
Proceedings, 2014, pp. 132--147.'
mla: 'Travkin, Oleg, and Heike Wehrheim. “Handling {TSO} in Mechanized Linearizability
Proofs.” Hardware and Software: Verification and Testing - 10th International
Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014.
Proceedings, edited by Eran Yahav, 2014, pp. 132--147, doi:10.1007/978-3-319-13338-6_11.'
short: 'O. Travkin, H. Wehrheim, in: E. Yahav (Ed.), Hardware and Software: Verification
and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa,
Israel, November 18-20, 2014. Proceedings, 2014, pp. 132--147.'
date_created: 2018-06-13T07:59:46Z
date_updated: 2022-01-06T06:59:02Z
department:
- _id: '77'
doi: 10.1007/978-3-319-13338-6_11
editor:
- first_name: Eran
full_name: Yahav, Eran
last_name: Yahav
page: 132--147
publication: 'Hardware and Software: Verification and Testing - 10th International
Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014.
Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: Handling {TSO} in Mechanized Linearizability Proofs
type: conference
user_id: '29719'
year: '2014'
...
---
_id: '3172'
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Isenberg T, Wehrheim H. Timed Automata Verification via {IC3} with Zones.
In: Merz S, Pang J, eds. Formal Methods and Software Engineering - 16th International
Conference on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg,
November 3-5, 2014. Proceedings. Lecture Notes in Computer Science. ; 2014:203--218.
doi:10.1007/978-3-319-11737-9_14'
apa: Isenberg, T., & Wehrheim, H. (2014). Timed Automata Verification via {IC3}
with Zones. In S. Merz & J. Pang (Eds.), Formal Methods and Software Engineering
- 16th International Conference on Formal Engineering Methods, {ICFEM} 2014, Luxembourg,
Luxembourg, November 3-5, 2014. Proceedings (pp. 203--218). https://doi.org/10.1007/978-3-319-11737-9_14
bibtex: '@inproceedings{Isenberg_Wehrheim_2014, series={Lecture Notes in Computer
Science}, title={Timed Automata Verification via {IC3} with Zones}, DOI={10.1007/978-3-319-11737-9_14},
booktitle={Formal Methods and Software Engineering - 16th International Conference
on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg, November
3-5, 2014. Proceedings}, author={Isenberg, Tobias and Wehrheim, Heike}, editor={Merz,
Stephan and Pang, JunEditors}, year={2014}, pages={203--218}, collection={Lecture
Notes in Computer Science} }'
chicago: Isenberg, Tobias, and Heike Wehrheim. “Timed Automata Verification via
{IC3} with Zones.” In Formal Methods and Software Engineering - 16th International
Conference on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg,
November 3-5, 2014. Proceedings, edited by Stephan Merz and Jun Pang, 203--218.
Lecture Notes in Computer Science, 2014. https://doi.org/10.1007/978-3-319-11737-9_14.
ieee: T. Isenberg and H. Wehrheim, “Timed Automata Verification via {IC3} with Zones,”
in Formal Methods and Software Engineering - 16th International Conference
on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg, November
3-5, 2014. Proceedings, 2014, pp. 203--218.
mla: Isenberg, Tobias, and Heike Wehrheim. “Timed Automata Verification via {IC3}
with Zones.” Formal Methods and Software Engineering - 16th International Conference
on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg, November
3-5, 2014. Proceedings, edited by Stephan Merz and Jun Pang, 2014, pp. 203--218,
doi:10.1007/978-3-319-11737-9_14.
short: 'T. Isenberg, H. Wehrheim, in: S. Merz, J. Pang (Eds.), Formal Methods and
Software Engineering - 16th International Conference on Formal Engineering Methods,
{ICFEM} 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings, 2014, pp.
203--218.'
date_created: 2018-06-13T08:01:04Z
date_updated: 2022-01-06T06:59:02Z
department:
- _id: '77'
doi: 10.1007/978-3-319-11737-9_14
editor:
- first_name: Stephan
full_name: Merz, Stephan
last_name: Merz
- first_name: Jun
full_name: Pang, Jun
last_name: Pang
page: 203--218
publication: Formal Methods and Software Engineering - 16th International Conference
on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg, November 3-5,
2014. Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Timed Automata Verification via {IC3} with Zones
type: conference
user_id: '29719'
year: '2014'
...
---
_id: '3173'
author:
- first_name: Steve
full_name: A. Schneider, Steve
last_name: A. Schneider
- first_name: Helen
full_name: Treharne, Helen
last_name: Treharne
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: David
full_name: M. Williams, David
last_name: M. Williams
citation:
ama: 'A. Schneider S, Treharne H, Wehrheim H, M. Williams D. Managing {LTL} Properties
in Event-B Refinement. In: Albert E, Sekerinski E, eds. Integrated Formal Methods
- 11th International Conference, {IFM} 2014, Bertinoro, Italy, September 9-11,
2014, Proceedings. Lecture Notes in Computer Science. ; 2014:221--237. doi:10.1007/978-3-319-10181-1_14'
apa: A. Schneider, S., Treharne, H., Wehrheim, H., & M. Williams, D. (2014).
Managing {LTL} Properties in Event-B Refinement. In E. Albert & E. Sekerinski
(Eds.), Integrated Formal Methods - 11th International Conference, {IFM} 2014,
Bertinoro, Italy, September 9-11, 2014, Proceedings (pp. 221--237). https://doi.org/10.1007/978-3-319-10181-1_14
bibtex: '@inproceedings{A. Schneider_Treharne_Wehrheim_M. Williams_2014, series={Lecture
Notes in Computer Science}, title={Managing {LTL} Properties in Event-B Refinement},
DOI={10.1007/978-3-319-10181-1_14},
booktitle={Integrated Formal Methods - 11th International Conference, {IFM} 2014,
Bertinoro, Italy, September 9-11, 2014, Proceedings}, author={A. Schneider, Steve
and Treharne, Helen and Wehrheim, Heike and M. Williams, David}, editor={Albert,
Elvira and Sekerinski, EmilEditors}, year={2014}, pages={221--237}, collection={Lecture
Notes in Computer Science} }'
chicago: A. Schneider, Steve, Helen Treharne, Heike Wehrheim, and David M. Williams.
“Managing {LTL} Properties in Event-B Refinement.” In Integrated Formal Methods
- 11th International Conference, {IFM} 2014, Bertinoro, Italy, September 9-11,
2014, Proceedings, edited by Elvira Albert and Emil Sekerinski, 221--237.
Lecture Notes in Computer Science, 2014. https://doi.org/10.1007/978-3-319-10181-1_14.
ieee: S. A. Schneider, H. Treharne, H. Wehrheim, and D. M. Williams, “Managing {LTL}
Properties in Event-B Refinement,” in Integrated Formal Methods - 11th International
Conference, {IFM} 2014, Bertinoro, Italy, September 9-11, 2014, Proceedings,
2014, pp. 221--237.
mla: A. Schneider, Steve, et al. “Managing {LTL} Properties in Event-B Refinement.”
Integrated Formal Methods - 11th International Conference, {IFM} 2014, Bertinoro,
Italy, September 9-11, 2014, Proceedings, edited by Elvira Albert and Emil
Sekerinski, 2014, pp. 221--237, doi:10.1007/978-3-319-10181-1_14.
short: 'S. A. Schneider, H. Treharne, H. Wehrheim, D. M. Williams, in: E. Albert,
E. Sekerinski (Eds.), Integrated Formal Methods - 11th International Conference,
{IFM} 2014, Bertinoro, Italy, September 9-11, 2014, Proceedings, 2014, pp. 221--237.'
date_created: 2018-06-13T08:04:33Z
date_updated: 2022-01-06T06:59:02Z
department:
- _id: '77'
doi: 10.1007/978-3-319-10181-1_14
editor:
- first_name: Elvira
full_name: Albert, Elvira
last_name: Albert
- first_name: Emil
full_name: Sekerinski, Emil
last_name: Sekerinski
page: 221--237
publication: Integrated Formal Methods - 11th International Conference, {IFM} 2014,
Bertinoro, Italy, September 9-11, 2014, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Managing {LTL} Properties in Event-B Refinement
type: conference
user_id: '29719'
year: '2014'
...
---
_id: '3174'
author:
- first_name: Steve
full_name: Schneider, Steve
last_name: Schneider
- first_name: Helen
full_name: Treharne, Helen
last_name: Treharne
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: David
full_name: M. Williams, David
last_name: M. Williams
citation:
ama: Schneider S, Treharne H, Wehrheim H, M. Williams D. Managing {LTL} properties
in Event-B refinement. CoRR. 2014.
apa: Schneider, S., Treharne, H., Wehrheim, H., & M. Williams, D. (2014). Managing
{LTL} properties in Event-B refinement. CoRR.
bibtex: '@article{Schneider_Treharne_Wehrheim_M. Williams_2014, title={Managing
{LTL} properties in Event-B refinement}, journal={CoRR}, author={Schneider, Steve
and Treharne, Helen and Wehrheim, Heike and M. Williams, David}, year={2014} }'
chicago: Schneider, Steve, Helen Treharne, Heike Wehrheim, and David M. Williams.
“Managing {LTL} Properties in Event-B Refinement.” CoRR, 2014.
ieee: S. Schneider, H. Treharne, H. Wehrheim, and D. M. Williams, “Managing {LTL}
properties in Event-B refinement,” CoRR, 2014.
mla: Schneider, Steve, et al. “Managing {LTL} Properties in Event-B Refinement.”
CoRR, 2014.
short: S. Schneider, H. Treharne, H. Wehrheim, D. M. Williams, CoRR (2014).
date_created: 2018-06-13T08:05:39Z
date_updated: 2022-01-06T06:59:02Z
department:
- _id: '77'
publication: CoRR
status: public
title: Managing {LTL} properties in Event-B refinement
type: journal_article
user_id: '29719'
year: '2014'
...
---
_id: '3175'
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Isenberg T, Wehrheim H. Proof-Carrying Hardware via {IC3}. CoRR. 2014.
apa: Isenberg, T., & Wehrheim, H. (2014). Proof-Carrying Hardware via {IC3}.
CoRR.
bibtex: '@article{Isenberg_Wehrheim_2014, title={Proof-Carrying Hardware via {IC3}},
journal={CoRR}, author={Isenberg, Tobias and Wehrheim, Heike}, year={2014} }'
chicago: Isenberg, Tobias, and Heike Wehrheim. “Proof-Carrying Hardware via {IC3}.”
CoRR, 2014.
ieee: T. Isenberg and H. Wehrheim, “Proof-Carrying Hardware via {IC3},” CoRR,
2014.
mla: Isenberg, Tobias, and Heike Wehrheim. “Proof-Carrying Hardware via {IC3}.”
CoRR, 2014.
short: T. Isenberg, H. Wehrheim, CoRR (2014).
date_created: 2018-06-13T08:07:24Z
date_updated: 2022-01-06T06:59:02Z
department:
- _id: '77'
publication: CoRR
status: public
title: Proof-Carrying Hardware via {IC3}
type: journal_article
user_id: '29719'
year: '2014'
...
---
_id: '450'
abstract:
- lang: eng
text: 'Configurable program analysis (CPA) is a generic concept for the formalization
of different software analysis techniques in a single framework. With the tool
CPAchecker, this framework allows for an easy configuration and subsequent automatic
execution of analysis procedures ranging from data-flow analysis to model checking.
The focus of the tool CPAchecker is thus on analysis. In this paper, we study
configurability from the point of view of software certification. Certification
aims at providing (via a prior analysis) a certificate of correctness for a program
which is (a) tamper-proof and (b) more efficient to check for validity than a
full analysis. Here, we will show how, given an analysis instance of a CPA, to
construct a corresponding sound certification instance, thereby arriving at configurable
program certification. We report on experiments with certification based on different
analysis techniques, and in particular explain which characteristics of an underlying
analysis allow us to design an efficient (in the above (b) sense) certification
procedure. '
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. Certification for Configurable Program Analysis. In:
Proceedings of the 21st International Symposium on Model Checking of Software
(SPIN). SPIN 2014. ; 2014:30-39. doi:10.1145/2632362.2632372'
apa: Jakobs, M.-C., & Wehrheim, H. (2014). Certification for Configurable Program
Analysis. In Proceedings of the 21st International Symposium on Model Checking
of Software (SPIN) (pp. 30–39). https://doi.org/10.1145/2632362.2632372
bibtex: '@inproceedings{Jakobs_Wehrheim_2014, series={SPIN 2014}, title={Certification
for Configurable Program Analysis}, DOI={10.1145/2632362.2632372},
booktitle={Proceedings of the 21st International Symposium on Model Checking of
Software (SPIN)}, author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2014},
pages={30–39}, collection={SPIN 2014} }'
chicago: Jakobs, Marie-Christine, and Heike Wehrheim. “Certification for Configurable
Program Analysis.” In Proceedings of the 21st International Symposium on Model
Checking of Software (SPIN), 30–39. SPIN 2014, 2014. https://doi.org/10.1145/2632362.2632372.
ieee: M.-C. Jakobs and H. Wehrheim, “Certification for Configurable Program Analysis,”
in Proceedings of the 21st International Symposium on Model Checking of Software
(SPIN), 2014, pp. 30–39.
mla: Jakobs, Marie-Christine, and Heike Wehrheim. “Certification for Configurable
Program Analysis.” Proceedings of the 21st International Symposium on Model
Checking of Software (SPIN), 2014, pp. 30–39, doi:10.1145/2632362.2632372.
short: 'M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 21st International Symposium
on Model Checking of Software (SPIN), 2014, pp. 30–39.'
date_created: 2017-10-17T12:42:19Z
date_updated: 2022-01-06T07:01:07Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1145/2632362.2632372
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:25:35Z
date_updated: 2018-03-16T11:25:35Z
file_id: '1345'
file_name: 450-p30-jakobs.pdf
file_size: 487366
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:25:35Z
has_accepted_license: '1'
language:
- iso: eng
page: 30-39
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 21st International Symposium on Model Checking of
Software (SPIN)
series_title: SPIN 2014
status: public
title: Certification for Configurable Program Analysis
type: conference
user_id: '477'
year: '2014'
...
---
_id: '408'
abstract:
- lang: eng
text: Verification of hardware and software usually proceeds separately, software
analysis relying on the correctness of processors executing instructions. This
assumption is valid as long as the software runs on standard CPUs that have been
extensively validated and are in wide use. However, for processors exploiting
custom instruction set extensions to meet performance and energy constraints the
validation might be less extensive, challenging the correctness assumption.In
this paper we present an approach for integrating software analyses with hardware
verification, specifically targeting custom instruction set extensions. We propose
three different techniques for deriving the properties to be proven for the hardware
implementation of a custom instruction in order to support software analyses.
The techniques are designed to explore the trade-off between generality and efficiency
and span from proving functional equivalence over checking the rules of a particular
analysis domain to verifying actual pre and post conditions resulting from program
analysis. We demonstrate and compare the three techniques on example programs
with custom instructions, using stateof-the-art software and hardware verification
techniques.
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Jakobs M-C, Platzner M, Wiersema T, Wehrheim H. Integrating Software and Hardware
Verification. In: Albert E, Sekerinski E, eds. Proceedings of the 11th International
Conference on Integrated Formal Methods (IFM). LNCS. ; 2014:307-322. doi:10.1007/978-3-319-10181-1_19'
apa: Jakobs, M.-C., Platzner, M., Wiersema, T., & Wehrheim, H. (2014). Integrating
Software and Hardware Verification. In E. Albert & E. Sekerinski (Eds.), Proceedings
of the 11th International Conference on Integrated Formal Methods (iFM) (pp.
307–322). https://doi.org/10.1007/978-3-319-10181-1_19
bibtex: '@inproceedings{Jakobs_Platzner_Wiersema_Wehrheim_2014, series={LNCS}, title={Integrating
Software and Hardware Verification}, DOI={10.1007/978-3-319-10181-1_19},
booktitle={Proceedings of the 11th International Conference on Integrated Formal
Methods (iFM)}, author={Jakobs, Marie-Christine and Platzner, Marco and Wiersema,
Tobias and Wehrheim, Heike}, editor={Albert, Elvira and Sekerinski, EmilEditors},
year={2014}, pages={307–322}, collection={LNCS} }'
chicago: Jakobs, Marie-Christine, Marco Platzner, Tobias Wiersema, and Heike Wehrheim.
“Integrating Software and Hardware Verification.” In Proceedings of the 11th
International Conference on Integrated Formal Methods (IFM), edited by Elvira
Albert and Emil Sekerinski, 307–22. LNCS, 2014. https://doi.org/10.1007/978-3-319-10181-1_19.
ieee: M.-C. Jakobs, M. Platzner, T. Wiersema, and H. Wehrheim, “Integrating Software
and Hardware Verification,” in Proceedings of the 11th International Conference
on Integrated Formal Methods (iFM), 2014, pp. 307–322.
mla: Jakobs, Marie-Christine, et al. “Integrating Software and Hardware Verification.”
Proceedings of the 11th International Conference on Integrated Formal Methods
(IFM), edited by Elvira Albert and Emil Sekerinski, 2014, pp. 307–22, doi:10.1007/978-3-319-10181-1_19.
short: 'M.-C. Jakobs, M. Platzner, T. Wiersema, H. Wehrheim, in: E. Albert, E. Sekerinski
(Eds.), Proceedings of the 11th International Conference on Integrated Formal
Methods (IFM), 2014, pp. 307–322.'
date_created: 2017-10-17T12:42:11Z
date_updated: 2022-01-06T07:00:14Z
ddc:
- '040'
department:
- _id: '77'
- _id: '78'
doi: 10.1007/978-3-319-10181-1_19
editor:
- first_name: Elvira
full_name: Albert, Elvira
last_name: Albert
- first_name: Emil
full_name: Sekerinski, Emil
last_name: Sekerinski
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:35:28Z
date_updated: 2018-03-16T11:35:28Z
file_id: '1364'
file_name: 408-jakobs14_ifm.pdf
file_size: 561325
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:35:28Z
has_accepted_license: '1'
language:
- iso: eng
page: 307-322
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 11th International Conference on Integrated Formal
Methods (iFM)
series_title: LNCS
status: public
title: Integrating Software and Hardware Verification
type: conference
user_id: '477'
year: '2014'
...
---
_id: '417'
abstract:
- lang: eng
text: 'Model transformation is a key concept in modeldrivensoftware engineering.
The definition of model transformationsis usually based on meta-models describing
the abstractsyntax of languages. While meta-models are thereby able to abstractfrom
superfluous details of concrete syntax, they often loosestructural information
inherent in languages, like information onmodel elements always occurring together
in particular shapes.As a consequence, model transformations cannot naturally
re-uselanguage structures, thus leading to unnecessary complexity intheir development
as well as analysis.In this paper, we propose a new approach to model transformationdevelopment
which allows to simplify and improve thequality of the developed transformations
via the exploitation ofthe languages’ structures. The approach is based on context-freegrammars
and transformations defined by pairing productions ofsource and target grammars.
We show that such transformationsexhibit three important characteristics: they
are sound, completeand deterministic.'
author:
- first_name: Galina
full_name: Besova, Galina
last_name: Besova
- first_name: Dominik
full_name: Steenke, Dominik
last_name: Steenke
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Besova G, Steenke D, Wehrheim H. Grammar-based model transformations. In:
Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD).
; 2014:1601-1610. doi:10.1016/j.cl.2015.05.003'
apa: Besova, G., Steenke, D., & Wehrheim, H. (2014). Grammar-based model transformations.
In Proceedings 3rd Workshop on Model Driven Approaches in System Development
(MDASD) (pp. 1601–1610). https://doi.org/10.1016/j.cl.2015.05.003
bibtex: '@inproceedings{Besova_Steenke_Wehrheim_2014, title={Grammar-based model
transformations}, DOI={10.1016/j.cl.2015.05.003},
booktitle={Proceedings 3rd Workshop on Model Driven Approaches in System Development
(MDASD)}, author={Besova, Galina and Steenke, Dominik and Wehrheim, Heike}, year={2014},
pages={1601–1610} }'
chicago: Besova, Galina, Dominik Steenke, and Heike Wehrheim. “Grammar-Based Model
Transformations.” In Proceedings 3rd Workshop on Model Driven Approaches in
System Development (MDASD), 1601–10, 2014. https://doi.org/10.1016/j.cl.2015.05.003.
ieee: G. Besova, D. Steenke, and H. Wehrheim, “Grammar-based model transformations,”
in Proceedings 3rd Workshop on Model Driven Approaches in System Development
(MDASD), 2014, pp. 1601–1610.
mla: Besova, Galina, et al. “Grammar-Based Model Transformations.” Proceedings
3rd Workshop on Model Driven Approaches in System Development (MDASD), 2014,
pp. 1601–10, doi:10.1016/j.cl.2015.05.003.
short: 'G. Besova, D. Steenke, H. Wehrheim, in: Proceedings 3rd Workshop on Model
Driven Approaches in System Development (MDASD), 2014, pp. 1601–1610.'
date_created: 2017-10-17T12:42:13Z
date_updated: 2022-01-06T07:00:28Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.cl.2015.05.003
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:33:33Z
date_updated: 2018-03-16T11:33:33Z
file_id: '1360'
file_name: 417-main.pdf
file_size: 643382
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:33:33Z
has_accepted_license: '1'
language:
- iso: eng
page: 1601-1610
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings 3rd Workshop on Model Driven Approaches in System Development
(MDASD)
status: public
title: Grammar-based model transformations
type: conference
user_id: '477'
year: '2014'
...
---
_id: '418'
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
citation:
ama: Pauck F. Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren.
Universität Paderborn; 2014.
apa: Pauck, F. (2014). Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren.
Universität Paderborn.
bibtex: '@book{Pauck_2014, title={Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren},
publisher={Universität Paderborn}, author={Pauck, Felix}, year={2014} }'
chicago: Pauck, Felix. Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren.
Universität Paderborn, 2014.
ieee: F. Pauck, Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren.
Universität Paderborn, 2014.
mla: Pauck, Felix. Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren.
Universität Paderborn, 2014.
short: F. Pauck, Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren,
Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:13Z
date_updated: 2022-01-06T07:00:30Z
ddc:
- '000'
department:
- _id: '77'
file:
- access_level: open_access
content_type: application/pdf
creator: fpauck
date_created: 2019-08-07T09:00:20Z
date_updated: 2019-08-07T09:05:38Z
file_id: '12906'
file_name: fpauck_2014.pdf
file_size: 3191756
relation: main_file
title: Bachelorarbeit
file_date_updated: 2019-08-07T09:05:38Z
has_accepted_license: '1'
language:
- iso: ger
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren
type: bachelorsthesis
user_id: '22398'
year: '2014'
...
---
_id: '3176'
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
- first_name: Dominik
full_name: Steenken, Dominik
last_name: Steenken
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Isenberg T, Steenken D, Wehrheim H. Bounded Model Checking of Graph Transformation
Systems via {SMT} Solving. In: Beyer D, Boreale M, eds. Formal Techniques for
Distributed Systems - Joint {IFIP} {WG} 6.1 International Conference, {FMOODS/FORTE}
2013, Held as Part of the 8th International Federated Conference on Distributed
Computing Techniques, DisCoTec 2013, Florence, Italy, June 3-5, 2013. Proceedings.
Lecture Notes in Computer Science. ; 2013:178--192. doi:10.1007/978-3-642-38592-6_13'
apa: Isenberg, T., Steenken, D., & Wehrheim, H. (2013). Bounded Model Checking
of Graph Transformation Systems via {SMT} Solving. In D. Beyer & M. Boreale
(Eds.), Formal Techniques for Distributed Systems - Joint {IFIP} {WG} 6.1 International
Conference, {FMOODS/FORTE} 2013, Held as Part of the 8th International Federated
Conference on Distributed Computing Techniques, DisCoTec 2013, Florence, Italy,
June 3-5, 2013. Proceedings (pp. 178--192). https://doi.org/10.1007/978-3-642-38592-6_13
bibtex: '@inproceedings{Isenberg_Steenken_Wehrheim_2013, series={Lecture Notes in
Computer Science}, title={Bounded Model Checking of Graph Transformation Systems
via {SMT} Solving}, DOI={10.1007/978-3-642-38592-6_13},
booktitle={Formal Techniques for Distributed Systems - Joint {IFIP} {WG} 6.1 International
Conference, {FMOODS/FORTE} 2013, Held as Part of the 8th International Federated
Conference on Distributed Computing Techniques, DisCoTec 2013, Florence, Italy,
June 3-5, 2013. Proceedings}, author={Isenberg, Tobias and Steenken, Dominik and
Wehrheim, Heike}, editor={Beyer, Dirk and Boreale, MicheleEditors}, year={2013},
pages={178--192}, collection={Lecture Notes in Computer Science} }'
chicago: Isenberg, Tobias, Dominik Steenken, and Heike Wehrheim. “Bounded Model
Checking of Graph Transformation Systems via {SMT} Solving.” In Formal Techniques
for Distributed Systems - Joint {IFIP} {WG} 6.1 International Conference, {FMOODS/FORTE}
2013, Held as Part of the 8th International Federated Conference on Distributed
Computing Techniques, DisCoTec 2013, Florence, Italy, June 3-5, 2013. Proceedings,
edited by Dirk Beyer and Michele Boreale, 178--192. Lecture Notes in Computer
Science, 2013. https://doi.org/10.1007/978-3-642-38592-6_13.
ieee: T. Isenberg, D. Steenken, and H. Wehrheim, “Bounded Model Checking of Graph
Transformation Systems via {SMT} Solving,” in Formal Techniques for Distributed
Systems - Joint {IFIP} {WG} 6.1 International Conference, {FMOODS/FORTE} 2013,
Held as Part of the 8th International Federated Conference on Distributed Computing
Techniques, DisCoTec 2013, Florence, Italy, June 3-5, 2013. Proceedings, 2013,
pp. 178--192.
mla: Isenberg, Tobias, et al. “Bounded Model Checking of Graph Transformation Systems
via {SMT} Solving.” Formal Techniques for Distributed Systems - Joint {IFIP}
{WG} 6.1 International Conference, {FMOODS/FORTE} 2013, Held as Part of the 8th
International Federated Conference on Distributed Computing Techniques, DisCoTec
2013, Florence, Italy, June 3-5, 2013. Proceedings, edited by Dirk Beyer and
Michele Boreale, 2013, pp. 178--192, doi:10.1007/978-3-642-38592-6_13.
short: 'T. Isenberg, D. Steenken, H. Wehrheim, in: D. Beyer, M. Boreale (Eds.),
Formal Techniques for Distributed Systems - Joint {IFIP} {WG} 6.1 International
Conference, {FMOODS/FORTE} 2013, Held as Part of the 8th International Federated
Conference on Distributed Computing Techniques, DisCoTec 2013, Florence, Italy,
June 3-5, 2013. Proceedings, 2013, pp. 178--192.'
date_created: 2018-06-13T08:08:39Z
date_updated: 2022-01-06T06:59:02Z
department:
- _id: '77'
doi: 10.1007/978-3-642-38592-6_13
editor:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Michele
full_name: Boreale, Michele
last_name: Boreale
page: 178--192
publication: Formal Techniques for Distributed Systems - Joint {IFIP} {WG} 6.1 International
Conference, {FMOODS/FORTE} 2013, Held as Part of the 8th International Federated
Conference on Distributed Computing Techniques, DisCoTec 2013, Florence, Italy,
June 3-5, 2013. Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Bounded Model Checking of Graph Transformation Systems via {SMT} Solving
type: conference
user_id: '29719'
year: '2013'
...
---
_id: '3177'
author:
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: Annika
full_name: Mütze, Annika
last_name: Mütze
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Travkin O, Mütze A, Wehrheim H. {SPIN} as a Linearizability Checker under
Weak Memory Models. In: Bertacco V, Legay A, eds. Hardware and Software: Verification
and Testing - 9th International Haifa Verification Conference, {HVC} 2013, Haifa,
Israel, November 5-7, 2013, Proceedings. Lecture Notes in Computer Science.
; 2013:311--326. doi:10.1007/978-3-319-03077-7_21'
apa: 'Travkin, O., Mütze, A., & Wehrheim, H. (2013). {SPIN} as a Linearizability
Checker under Weak Memory Models. In V. Bertacco & A. Legay (Eds.), Hardware
and Software: Verification and Testing - 9th International Haifa Verification
Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013, Proceedings (pp.
311--326). https://doi.org/10.1007/978-3-319-03077-7_21'
bibtex: '@inproceedings{Travkin_Mütze_Wehrheim_2013, series={Lecture Notes in Computer
Science}, title={{SPIN} as a Linearizability Checker under Weak Memory Models},
DOI={10.1007/978-3-319-03077-7_21},
booktitle={Hardware and Software: Verification and Testing - 9th International
Haifa Verification Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013,
Proceedings}, author={Travkin, Oleg and Mütze, Annika and Wehrheim, Heike}, editor={Bertacco,
Valeria and Legay, AxelEditors}, year={2013}, pages={311--326}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Travkin, Oleg, Annika Mütze, and Heike Wehrheim. “{SPIN} as a Linearizability
Checker under Weak Memory Models.” In Hardware and Software: Verification and
Testing - 9th International Haifa Verification Conference, {HVC} 2013, Haifa,
Israel, November 5-7, 2013, Proceedings, edited by Valeria Bertacco and Axel
Legay, 311--326. Lecture Notes in Computer Science, 2013. https://doi.org/10.1007/978-3-319-03077-7_21.'
ieee: 'O. Travkin, A. Mütze, and H. Wehrheim, “{SPIN} as a Linearizability Checker
under Weak Memory Models,” in Hardware and Software: Verification and Testing
- 9th International Haifa Verification Conference, {HVC} 2013, Haifa, Israel,
November 5-7, 2013, Proceedings, 2013, pp. 311--326.'
mla: 'Travkin, Oleg, et al. “{SPIN} as a Linearizability Checker under Weak Memory
Models.” Hardware and Software: Verification and Testing - 9th International
Haifa Verification Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013,
Proceedings, edited by Valeria Bertacco and Axel Legay, 2013, pp. 311--326,
doi:10.1007/978-3-319-03077-7_21.'
short: 'O. Travkin, A. Mütze, H. Wehrheim, in: V. Bertacco, A. Legay (Eds.), Hardware
and Software: Verification and Testing - 9th International Haifa Verification
Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013, Proceedings, 2013,
pp. 311--326.'
date_created: 2018-06-13T08:09:44Z
date_updated: 2022-01-06T06:59:02Z
department:
- _id: '77'
doi: 10.1007/978-3-319-03077-7_21
editor:
- first_name: Valeria
full_name: Bertacco, Valeria
last_name: Bertacco
- first_name: Axel
full_name: Legay, Axel
last_name: Legay
page: 311--326
publication: 'Hardware and Software: Verification and Testing - 9th International
Haifa Verification Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013, Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: '{SPIN} as a Linearizability Checker under Weak Memory Models'
type: conference
user_id: '29719'
year: '2013'
...
---
_id: '3178'
author:
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Dongol B, Travkin O, Derrick J, Wehrheim H. A High-Level Semantics for Program
Execution under Total Store Order Memory. In: Liu Z, Woodcock J, Zhu H, eds. Theoretical
Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai,
China, September 4-6, 2013. Proceedings. Lecture Notes in Computer Science.
; 2013:177--194. doi:10.1007/978-3-642-39718-9_11'
apa: Dongol, B., Travkin, O., Derrick, J., & Wehrheim, H. (2013). A High-Level
Semantics for Program Execution under Total Store Order Memory. In Z. Liu, J.
Woodcock, & H. Zhu (Eds.), Theoretical Aspects of Computing - {ICTAC} 2013
- 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings
(pp. 177--194). https://doi.org/10.1007/978-3-642-39718-9_11
bibtex: '@inproceedings{Dongol_Travkin_Derrick_Wehrheim_2013, series={Lecture Notes
in Computer Science}, title={A High-Level Semantics for Program Execution under
Total Store Order Memory}, DOI={10.1007/978-3-642-39718-9_11},
booktitle={Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International
Colloquium, Shanghai, China, September 4-6, 2013. Proceedings}, author={Dongol,
Brijesh and Travkin, Oleg and Derrick, John and Wehrheim, Heike}, editor={Liu,
Zhiming and Woodcock, Jim and Zhu, HuibiaoEditors}, year={2013}, pages={177--194},
collection={Lecture Notes in Computer Science} }'
chicago: Dongol, Brijesh, Oleg Travkin, John Derrick, and Heike Wehrheim. “A High-Level
Semantics for Program Execution under Total Store Order Memory.” In Theoretical
Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai,
China, September 4-6, 2013. Proceedings, edited by Zhiming Liu, Jim Woodcock,
and Huibiao Zhu, 177--194. Lecture Notes in Computer Science, 2013. https://doi.org/10.1007/978-3-642-39718-9_11.
ieee: B. Dongol, O. Travkin, J. Derrick, and H. Wehrheim, “A High-Level Semantics
for Program Execution under Total Store Order Memory,” in Theoretical Aspects
of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai, China,
September 4-6, 2013. Proceedings, 2013, pp. 177--194.
mla: Dongol, Brijesh, et al. “A High-Level Semantics for Program Execution under
Total Store Order Memory.” Theoretical Aspects of Computing - {ICTAC} 2013
- 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings,
edited by Zhiming Liu et al., 2013, pp. 177--194, doi:10.1007/978-3-642-39718-9_11.
short: 'B. Dongol, O. Travkin, J. Derrick, H. Wehrheim, in: Z. Liu, J. Woodcock,
H. Zhu (Eds.), Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International
Colloquium, Shanghai, China, September 4-6, 2013. Proceedings, 2013, pp. 177--194.'
date_created: 2018-06-13T08:13:31Z
date_updated: 2022-01-06T06:59:02Z
department:
- _id: '77'
doi: 10.1007/978-3-642-39718-9_11
editor:
- first_name: Zhiming
full_name: Liu, Zhiming
last_name: Liu
- first_name: Jim
full_name: Woodcock, Jim
last_name: Woodcock
- first_name: Huibiao
full_name: Zhu, Huibiao
last_name: Zhu
page: 177--194
publication: Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International
Colloquium, Shanghai, China, September 4-6, 2013. Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: A High-Level Semantics for Program Execution under Total Store Order Memory
type: conference
user_id: '29719'
year: '2013'
...
---
_id: '3179'
author:
- first_name: Steffen
full_name: Ziegert, Steffen
last_name: Ziegert
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Ziegert S, Wehrheim H. Temporal Reconfiguration Plans for Self-Adaptive Systems.
In: Kowalewski S, Rumpe B, eds. Software Engineering 2013: Fachtagung Des GI-Fachbereichs
Softwaretechnik, 26. Februar - 2. M{\"{a}}rz 2013 in Aachen. {LNI}. ; 2013:271--284.'
apa: 'Ziegert, S., & Wehrheim, H. (2013). Temporal Reconfiguration Plans for
Self-Adaptive Systems. In S. Kowalewski & B. Rumpe (Eds.), Software Engineering
2013: Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\"{a}}rz
2013 in Aachen (pp. 271--284).'
bibtex: '@inproceedings{Ziegert_Wehrheim_2013, series={{LNI}}, title={Temporal Reconfiguration
Plans for Self-Adaptive Systems}, booktitle={Software Engineering 2013: Fachtagung
des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\"{a}}rz 2013 in Aachen},
author={Ziegert, Steffen and Wehrheim, Heike}, editor={Kowalewski, Stefan and
Rumpe, BernhardEditors}, year={2013}, pages={271--284}, collection={{LNI}} }'
chicago: 'Ziegert, Steffen, and Heike Wehrheim. “Temporal Reconfiguration Plans
for Self-Adaptive Systems.” In Software Engineering 2013: Fachtagung Des GI-Fachbereichs
Softwaretechnik, 26. Februar - 2. M{\"{a}}rz 2013 in Aachen, edited by Stefan
Kowalewski and Bernhard Rumpe, 271--284. {LNI}, 2013.'
ieee: 'S. Ziegert and H. Wehrheim, “Temporal Reconfiguration Plans for Self-Adaptive
Systems,” in Software Engineering 2013: Fachtagung des GI-Fachbereichs Softwaretechnik,
26. Februar - 2. M{\"{a}}rz 2013 in Aachen, 2013, pp. 271--284.'
mla: 'Ziegert, Steffen, and Heike Wehrheim. “Temporal Reconfiguration Plans for
Self-Adaptive Systems.” Software Engineering 2013: Fachtagung Des GI-Fachbereichs
Softwaretechnik, 26. Februar - 2. M{\"{a}}rz 2013 in Aachen, edited by Stefan
Kowalewski and Bernhard Rumpe, 2013, pp. 271--284.'
short: 'S. Ziegert, H. Wehrheim, in: S. Kowalewski, B. Rumpe (Eds.), Software Engineering
2013: Fachtagung Des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\"{a}}rz
2013 in Aachen, 2013, pp. 271--284.'
date_created: 2018-06-13T08:15:08Z
date_updated: 2022-01-06T06:59:02Z
department:
- _id: '77'
editor:
- first_name: Stefan
full_name: Kowalewski, Stefan
last_name: Kowalewski
- first_name: Bernhard
full_name: Rumpe, Bernhard
last_name: Rumpe
page: 271--284
publication: 'Software Engineering 2013: Fachtagung des GI-Fachbereichs Softwaretechnik,
26. Februar - 2. M{\"{a}}rz 2013 in Aachen'
series_title: '{LNI}'
status: public
title: Temporal Reconfiguration Plans for Self-Adaptive Systems
type: conference
user_id: '29719'
year: '2013'
...
---
_id: '469'
abstract:
- lang: eng
text: Runtime monitoring aims at ensuring program safety by monitoring the program's
behaviour during execution and taking appropriate action before a program violates
some property.Runtime monitoring is in particular important when an exhaustive
formal verification fails. While the approach allows for a safe execution of programs,
it may impose a significant runtime overhead.In this paper, we propose a novel
technique combining verification and monitoring which incurs no overhead during
runtime at all. The technique proceeds by using the inconclusive result of a verification
run as the basis for transforming the program into one where all potential points
of failure are replaced by HALT statements. The new program is safe by construction,
behaviourally equivalent to the original program (except for unsafe behaviour),and
has the same performance characteristics.
author:
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
- first_name: Alexander
full_name: Schremmer, Alexander
last_name: Schremmer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wonisch D, Schremmer A, Wehrheim H. Zero Overhead Runtime Monitoring. In:
Proceedings of the 11th International Conference on Software Engineering and
Formal Methods (SEFM). LNCS. ; 2013:244-258. doi:10.1007/978-3-642-40561-7_17'
apa: Wonisch, D., Schremmer, A., & Wehrheim, H. (2013). Zero Overhead Runtime
Monitoring. In Proceedings of the 11th International Conference on Software
Engineering and Formal Methods (SEFM) (pp. 244–258). https://doi.org/10.1007/978-3-642-40561-7_17
bibtex: '@inproceedings{Wonisch_Schremmer_Wehrheim_2013, series={LNCS}, title={Zero
Overhead Runtime Monitoring}, DOI={10.1007/978-3-642-40561-7_17},
booktitle={Proceedings of the 11th International Conference on Software Engineering
and Formal Methods (SEFM)}, author={Wonisch, Daniel and Schremmer, Alexander and
Wehrheim, Heike}, year={2013}, pages={244–258}, collection={LNCS} }'
chicago: Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Zero Overhead
Runtime Monitoring.” In Proceedings of the 11th International Conference on
Software Engineering and Formal Methods (SEFM), 244–58. LNCS, 2013. https://doi.org/10.1007/978-3-642-40561-7_17.
ieee: D. Wonisch, A. Schremmer, and H. Wehrheim, “Zero Overhead Runtime Monitoring,”
in Proceedings of the 11th International Conference on Software Engineering
and Formal Methods (SEFM), 2013, pp. 244–258.
mla: Wonisch, Daniel, et al. “Zero Overhead Runtime Monitoring.” Proceedings
of the 11th International Conference on Software Engineering and Formal Methods
(SEFM), 2013, pp. 244–58, doi:10.1007/978-3-642-40561-7_17.
short: 'D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the 11th International
Conference on Software Engineering and Formal Methods (SEFM), 2013, pp. 244–258.'
date_created: 2017-10-17T12:42:23Z
date_updated: 2022-01-06T07:01:18Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-40561-7_17
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:18:41Z
date_updated: 2018-03-16T11:18:41Z
file_id: '1332'
file_name: 469-WSW2013-2.pdf
file_size: 394804
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:18:41Z
has_accepted_license: '1'
language:
- iso: eng
page: 244-258
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 11th International Conference on Software Engineering
and Formal Methods (SEFM)
series_title: LNCS
status: public
title: Zero Overhead Runtime Monitoring
type: conference
user_id: '477'
year: '2013'
...
---
_id: '478'
abstract:
- lang: eng
text: 'Software systems are playing an increasing role in our everyday life, and
as the amount of software applications grows, so does their complexity and the
relevance of their computations. Software components can be found in many systems
that are charged with safety-critical tasks, such as control systems for aviation
or power plants. Hence, software verification techniques that are capable of proving
the absence of critical errors are becoming more and more important in the field
software engineering. A well-established approach to software verification is
model checking. Applying this technique involves an exhaustive exploration of
a state space model corresponding to the system under consideration. The major
challenge in model checking is the so-called state explosion problem: The state
space of a software system grows exponentially with its size. Thus, the straightforward
modelling of real-life systems practically impossible. A common approach to this
problem is the application of abstraction techniques, which reduce the original
state space by mapping it on a significantly smaller abstract one. Abstraction
inherently involves a loss of information, and thus, the resulting abstract model
may be too imprecise for a definite result in verification. Therefore, abstraction
is typically combined with abstraction refinement: An initially very coarse abstract
model is iteratively refined, i.e. enriched with new details about the original
system, until a level of abstraction is reached that is precise enough for a definite
outcome. Abstraction refinement-based model checking is fully automatable and
it is considered as one of the most promising approaches to the state explosion
problem in verification. However, it is still faced with a number of challenges.
There exist several types of abstraction techniques and not every type is equally
well-suited for all kinds of systems and verification tasks. Moreover, the selection
of adequate refinement steps is nontrivial and typically the most crucial part
of the overall approach: Unfavourable refinement decisions can compromise the
state space-reducing effect of abstraction, and as a consequence, can easily lead
to the failure of verification. It is, however, hard to predict which refinement
steps will eventually be expedient for verification – and which not.'
author:
- first_name: Nils
full_name: Timm, Nils
last_name: Timm
citation:
ama: Timm N. Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying
Concurrent Systems. Universität Paderborn; 2013.
apa: Timm, N. (2013). Three-Valued Abstraction and Heuristic-Guided Refinement
for Verifying Concurrent Systems. Universität Paderborn.
bibtex: '@book{Timm_2013, title={Three-Valued Abstraction and Heuristic-Guided Refinement
for Verifying Concurrent Systems}, publisher={Universität Paderborn}, author={Timm,
Nils}, year={2013} }'
chicago: Timm, Nils. Three-Valued Abstraction and Heuristic-Guided Refinement
for Verifying Concurrent Systems. Universität Paderborn, 2013.
ieee: N. Timm, Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying
Concurrent Systems. Universität Paderborn, 2013.
mla: Timm, Nils. Three-Valued Abstraction and Heuristic-Guided Refinement for
Verifying Concurrent Systems. Universität Paderborn, 2013.
short: N. Timm, Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying
Concurrent Systems, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:25Z
date_updated: 2022-01-06T07:01:22Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:06:05Z
date_updated: 2018-03-15T14:06:05Z
file_id: '1324'
file_name: 478-Dissertation-Timm.pdf
file_size: 931458
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:06:05Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent
Systems
type: dissertation
user_id: '477'
year: '2013'
...
---
_id: '498'
abstract:
- lang: eng
text: Proof-carrying code approaches aim at safe execution of untrusted code by
having the code producer attach a safety proof to the code which the code consumer
only has to validate. Depending on the type of safety property, proofs can however
become quite large and their validation - though faster than their construction
- still time consuming. In this paper we introduce a new concept for safe execution
of untrusted code. It keeps the idea of putting the time consuming part of proving
on the side of the code producer, however, attaches no proofs to code anymore
but instead uses the proof to transform the program into an equivalent but more
efficiently verifiable program. Code consumers thus still do proving themselves,
however, on a computationally inexpensive level only. Experimental results show
that the proof effort can be reduced by several orders of magnitude, both with
respect to time and space.
author:
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
- first_name: Alexander
full_name: Schremmer, Alexander
last_name: Schremmer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs – A PCC Alternative.
In: Proceedings of the 25th International Conference on Computer Aided Verification
(CAV). LNCS. ; 2013:912-927. doi:10.1007/978-3-642-39799-8_65'
apa: Wonisch, D., Schremmer, A., & Wehrheim, H. (2013). Programs from Proofs
– A PCC Alternative. In Proceedings of the 25th International Conference on
Computer Aided Verification (CAV) (pp. 912–927). https://doi.org/10.1007/978-3-642-39799-8_65
bibtex: '@inproceedings{Wonisch_Schremmer_Wehrheim_2013, series={LNCS}, title={Programs
from Proofs – A PCC Alternative}, DOI={10.1007/978-3-642-39799-8_65},
booktitle={Proceedings of the 25th International Conference on Computer Aided
Verification (CAV)}, author={Wonisch, Daniel and Schremmer, Alexander and Wehrheim,
Heike}, year={2013}, pages={912–927}, collection={LNCS} }'
chicago: Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Programs from
Proofs – A PCC Alternative.” In Proceedings of the 25th International Conference
on Computer Aided Verification (CAV), 912–27. LNCS, 2013. https://doi.org/10.1007/978-3-642-39799-8_65.
ieee: D. Wonisch, A. Schremmer, and H. Wehrheim, “Programs from Proofs – A PCC Alternative,”
in Proceedings of the 25th International Conference on Computer Aided Verification
(CAV), 2013, pp. 912–927.
mla: Wonisch, Daniel, et al. “Programs from Proofs – A PCC Alternative.” Proceedings
of the 25th International Conference on Computer Aided Verification (CAV),
2013, pp. 912–27, doi:10.1007/978-3-642-39799-8_65.
short: 'D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the 25th International
Conference on Computer Aided Verification (CAV), 2013, pp. 912–927.'
date_created: 2017-10-17T12:42:29Z
date_updated: 2022-01-06T07:01:32Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-39799-8_65
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:42:30Z
date_updated: 2018-03-15T13:42:30Z
file_id: '1313'
file_name: 498-WonischSchremmerWehrheim2013.pdf
file_size: 487617
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:42:30Z
has_accepted_license: '1'
language:
- iso: eng
page: 912-927
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 25th International Conference on Computer Aided Verification
(CAV)
series_title: LNCS
status: public
title: Programs from Proofs – A PCC Alternative
type: conference
user_id: '477'
year: '2013'
...
---
_id: '517'
abstract:
- lang: eng
text: In the Semantic (Web) Services area, services are considered black boxes with
a semantic description of their interfaces as to allow for precise service selection
and configuration. The semantic description is usually grounded on domain-specific
concepts as modeled in ontologies. This accounts for types used in service signatures,
but also predicates occurring in preconditions and effects of services. Ontologies,
in particular those enhanced with rules, capture the knowledge of domain experts
on properties of and relations between domain concepts. In this paper, we present
a verification technique for service compositions which makes use of this domain
knowledge. We consider a service composition to be an assembly of services of
which we just know signatures, preconditions, and effects. We aim at proving that
a composition satisfies a (user-defined) requirement, specified in terms of guaranteed
preconditions and required postconditions. As an underlying verification engine
we use an SMT solver. To take advantage of the domain knowledge (and often, to
enable verification at all), the knowledge is fed into the solver in the form of
sorts, uninterpreted functions and in particular assertions as to enhance the
solver’s reasoning capabilities. Thereby, we allow for deductions within a domain
previously unknown to the solver. We exemplify our technique on a case study from
the area of water network optimization software.
author:
- first_name: Sven
full_name: Walther, Sven
last_name: Walther
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Walther S, Wehrheim H. Knowledge-Based Verification of Service Compositions
- An SMT approach. In: Proceedings of the 18th IEEE International Conference
on Engineering of Complex Computer Systems (ICECCS). ; 2013:24-32. doi:10.1109/ICECCS.2013.14'
apa: Walther, S., & Wehrheim, H. (2013). Knowledge-Based Verification of Service
Compositions - An SMT approach. In Proceedings of the 18th IEEE International
Conference on Engineering of Complex Computer Systems (ICECCS) (pp. 24–32).
https://doi.org/10.1109/ICECCS.2013.14
bibtex: '@inproceedings{Walther_Wehrheim_2013, title={Knowledge-Based Verification
of Service Compositions - An SMT approach}, DOI={10.1109/ICECCS.2013.14},
booktitle={Proceedings of the 18th IEEE International Conference on Engineering
of Complex Computer Systems (ICECCS)}, author={Walther, Sven and Wehrheim, Heike},
year={2013}, pages={24–32} }'
chicago: Walther, Sven, and Heike Wehrheim. “Knowledge-Based Verification of Service
Compositions - An SMT Approach.” In Proceedings of the 18th IEEE International
Conference on Engineering of Complex Computer Systems (ICECCS), 24–32, 2013.
https://doi.org/10.1109/ICECCS.2013.14.
ieee: S. Walther and H. Wehrheim, “Knowledge-Based Verification of Service Compositions
- An SMT approach,” in Proceedings of the 18th IEEE International Conference
on Engineering of Complex Computer Systems (ICECCS), 2013, pp. 24–32.
mla: Walther, Sven, and Heike Wehrheim. “Knowledge-Based Verification of Service
Compositions - An SMT Approach.” Proceedings of the 18th IEEE International
Conference on Engineering of Complex Computer Systems (ICECCS), 2013, pp.
24–32, doi:10.1109/ICECCS.2013.14.
short: 'S. Walther, H. Wehrheim, in: Proceedings of the 18th IEEE International
Conference on Engineering of Complex Computer Systems (ICECCS), 2013, pp. 24–32.'
date_created: 2017-10-17T12:42:33Z
date_updated: 2022-01-06T07:01:41Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1109/ICECCS.2013.14
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:26:08Z
date_updated: 2018-11-02T13:26:08Z
file_id: '5248'
file_name: 06601801.pdf
file_size: 217085
relation: main_file
file_date_updated: 2018-11-02T13:26:08Z
has_accepted_license: '1'
language:
- iso: eng
page: '24 - 32 '
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 18th IEEE International Conference on Engineering
of Complex Computer Systems (ICECCS)
status: public
title: Knowledge-Based Verification of Service Compositions - An SMT approach
type: conference
user_id: '477'
year: '2013'
...
---
_id: '3180'
author:
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
citation:
ama: Travkin O, Wehrheim H, Schellhorn G. Proving Linearizability of Multiset with
Local Proof Obligations. {ECEASST}. 2012.
apa: Travkin, O., Wehrheim, H., & Schellhorn, G. (2012). Proving Linearizability
of Multiset with Local Proof Obligations. {ECEASST}.
bibtex: '@article{Travkin_Wehrheim_Schellhorn_2012, title={Proving Linearizability
of Multiset with Local Proof Obligations}, journal={{ECEASST}}, author={Travkin,
Oleg and Wehrheim, Heike and Schellhorn, Gerhard}, year={2012} }'
chicago: Travkin, Oleg, Heike Wehrheim, and Gerhard Schellhorn. “Proving Linearizability
of Multiset with Local Proof Obligations.” {ECEASST}, 2012.
ieee: O. Travkin, H. Wehrheim, and G. Schellhorn, “Proving Linearizability of Multiset
with Local Proof Obligations,” {ECEASST}, 2012.
mla: Travkin, Oleg, et al. “Proving Linearizability of Multiset with Local Proof
Obligations.” {ECEASST}, 2012.
short: O. Travkin, H. Wehrheim, G. Schellhorn, {ECEASST} (2012).
date_created: 2018-06-13T08:16:49Z
date_updated: 2022-01-06T06:59:03Z
department:
- _id: '77'
publication: '{ECEASST}'
status: public
title: Proving Linearizability of Multiset with Local Proof Obligations
type: journal_article
user_id: '29719'
year: '2012'
...
---
_id: '3181'
author:
- first_name: Thomas
full_name: Ruhroth, Thomas
last_name: Ruhroth
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Ruhroth T, Wehrheim H. Model evolution and refinement. Sci Comput Program.
2012;(3):270--289. doi:10.1016/j.scico.2011.04.007
apa: Ruhroth, T., & Wehrheim, H. (2012). Model evolution and refinement. Sci.
Comput. Program., (3), 270--289. https://doi.org/10.1016/j.scico.2011.04.007
bibtex: '@article{Ruhroth_Wehrheim_2012, title={Model evolution and refinement},
DOI={10.1016/j.scico.2011.04.007},
number={3}, journal={Sci. Comput. Program.}, author={Ruhroth, Thomas and Wehrheim,
Heike}, year={2012}, pages={270--289} }'
chicago: 'Ruhroth, Thomas, and Heike Wehrheim. “Model Evolution and Refinement.”
Sci. Comput. Program., no. 3 (2012): 270--289. https://doi.org/10.1016/j.scico.2011.04.007.'
ieee: T. Ruhroth and H. Wehrheim, “Model evolution and refinement,” Sci. Comput.
Program., no. 3, pp. 270--289, 2012.
mla: Ruhroth, Thomas, and Heike Wehrheim. “Model Evolution and Refinement.” Sci.
Comput. Program., no. 3, 2012, pp. 270--289, doi:10.1016/j.scico.2011.04.007.
short: T. Ruhroth, H. Wehrheim, Sci. Comput. Program. (2012) 270--289.
date_created: 2018-06-13T08:17:58Z
date_updated: 2022-01-06T06:59:03Z
department:
- _id: '77'
doi: 10.1016/j.scico.2011.04.007
issue: '3'
page: 270--289
publication: Sci. Comput. Program.
status: public
title: Model evolution and refinement
type: journal_article
user_id: '29719'
year: '2012'
...
---
_id: '3182'
author:
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: John
full_name: Derrick, John
last_name: Derrick
citation:
ama: 'Schellhorn G, Wehrheim H, Derrick J. How to Prove Algorithms Linearisable.
In: Madhusudan P, A. Seshia S, eds. Computer Aided Verification - 24th International
Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings. Lecture
Notes in Computer Science. ; 2012:243--259. doi:10.1007/978-3-642-31424-7_21'
apa: Schellhorn, G., Wehrheim, H., & Derrick, J. (2012). How to Prove Algorithms
Linearisable. In P. Madhusudan & S. A. Seshia (Eds.), Computer Aided Verification
- 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012
Proceedings (pp. 243--259). https://doi.org/10.1007/978-3-642-31424-7_21
bibtex: '@inproceedings{Schellhorn_Wehrheim_Derrick_2012, series={Lecture Notes
in Computer Science}, title={How to Prove Algorithms Linearisable}, DOI={10.1007/978-3-642-31424-7_21},
booktitle={Computer Aided Verification - 24th International Conference, {CAV}
2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings}, author={Schellhorn, Gerhard
and Wehrheim, Heike and Derrick, John}, editor={Madhusudan, P. and A. Seshia,
SanjitEditors}, year={2012}, pages={243--259}, collection={Lecture Notes in Computer
Science} }'
chicago: Schellhorn, Gerhard, Heike Wehrheim, and John Derrick. “How to Prove Algorithms
Linearisable.” In Computer Aided Verification - 24th International Conference,
{CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings, edited by P. Madhusudan
and Sanjit A. Seshia, 243--259. Lecture Notes in Computer Science, 2012. https://doi.org/10.1007/978-3-642-31424-7_21.
ieee: G. Schellhorn, H. Wehrheim, and J. Derrick, “How to Prove Algorithms Linearisable,”
in Computer Aided Verification - 24th International Conference, {CAV} 2012,
Berkeley, CA, USA, July 7-13, 2012 Proceedings, 2012, pp. 243--259.
mla: Schellhorn, Gerhard, et al. “How to Prove Algorithms Linearisable.” Computer
Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA,
USA, July 7-13, 2012 Proceedings, edited by P. Madhusudan and Sanjit A. Seshia,
2012, pp. 243--259, doi:10.1007/978-3-642-31424-7_21.
short: 'G. Schellhorn, H. Wehrheim, J. Derrick, in: P. Madhusudan, S. A. Seshia
(Eds.), Computer Aided Verification - 24th International Conference, {CAV} 2012,
Berkeley, CA, USA, July 7-13, 2012 Proceedings, 2012, pp. 243--259.'
date_created: 2018-06-13T08:19:33Z
date_updated: 2022-01-06T06:59:03Z
department:
- _id: '77'
doi: 10.1007/978-3-642-31424-7_21
editor:
- first_name: P.
full_name: Madhusudan, P.
last_name: Madhusudan
- first_name: Sanjit
full_name: A. Seshia, Sanjit
last_name: A. Seshia
page: 243--259
publication: Computer Aided Verification - 24th International Conference, {CAV} 2012,
Berkeley, CA, USA, July 7-13, 2012 Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: How to Prove Algorithms Linearisable
type: conference
user_id: '29719'
year: '2012'
...
---
_id: '590'
abstract:
- lang: eng
text: 'Predicate abstraction is an established technique for reducing the size of
the state space during verification. In this paper, we extend predication abstraction
with block-abstraction memoization (BAM), which exploits the fact that blocks
are often executed several times in a program. The verification can thus benefit
from caching the values of previous block analyses and reusing them upon next
entry into a block. In addition to function bodies, BAM also performs well for
nested loops. To further increase effectiveness, block memoization has been integrated
with lazy abstraction adopting a lazy strategy for cache refinement. Together,
this achieves significant performance increases: our tool (an implementation within
the configurable program analysis framework CPAchecker) has won the Competition
on Software Verification 2012 in the category “Overall”.'
author:
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wonisch D, Wehrheim H. Predicate Analysis with Block-Abstraction Memoization.
In: Proceedings of the 14th International Conference on Formal Engineering
Methods (ICFEM). LNCS. ; 2012:332-347. doi:10.1007/978-3-642-34281-3_24'
apa: Wonisch, D., & Wehrheim, H. (2012). Predicate Analysis with Block-Abstraction
Memoization. In Proceedings of the 14th International Conference on Formal
Engineering Methods (ICFEM) (pp. 332–347). https://doi.org/10.1007/978-3-642-34281-3_24
bibtex: '@inproceedings{Wonisch_Wehrheim_2012, series={LNCS}, title={Predicate Analysis
with Block-Abstraction Memoization}, DOI={10.1007/978-3-642-34281-3_24},
booktitle={Proceedings of the 14th International Conference on Formal Engineering
Methods (ICFEM)}, author={Wonisch, Daniel and Wehrheim, Heike}, year={2012}, pages={332–347},
collection={LNCS} }'
chicago: Wonisch, Daniel, and Heike Wehrheim. “Predicate Analysis with Block-Abstraction
Memoization.” In Proceedings of the 14th International Conference on Formal
Engineering Methods (ICFEM), 332–47. LNCS, 2012. https://doi.org/10.1007/978-3-642-34281-3_24.
ieee: D. Wonisch and H. Wehrheim, “Predicate Analysis with Block-Abstraction Memoization,”
in Proceedings of the 14th International Conference on Formal Engineering Methods
(ICFEM), 2012, pp. 332–347.
mla: Wonisch, Daniel, and Heike Wehrheim. “Predicate Analysis with Block-Abstraction
Memoization.” Proceedings of the 14th International Conference on Formal Engineering
Methods (ICFEM), 2012, pp. 332–47, doi:10.1007/978-3-642-34281-3_24.
short: 'D. Wonisch, H. Wehrheim, in: Proceedings of the 14th International Conference
on Formal Engineering Methods (ICFEM), 2012, pp. 332–347.'
date_created: 2017-10-17T12:42:47Z
date_updated: 2022-01-06T07:02:46Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-34281-3_24
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:33:56Z
date_updated: 2018-03-15T08:33:56Z
file_id: '1258'
file_name: 590-WonischWehrheim2012.pdf
file_size: 320901
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:33:56Z
has_accepted_license: '1'
language:
- iso: eng
page: 332-347
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 14th International Conference on Formal Engineering
Methods (ICFEM)
series_title: LNCS
status: public
title: Predicate Analysis with Block-Abstraction Memoization
type: conference
user_id: '477'
year: '2012'
...
---
_id: '608'
abstract:
- lang: eng
text: 'Predicate abstraction is an established technique in software verification.
It inherently includes an abstraction refinement loop successively adding predicates
until the right level of abstraction is found. For concurrent systems, predicate
abstraction can be combined with spotlight abstraction, further reducing the state
space by abstracting away certain processes. Refinement then has to decide whether
to add a new predicate or a new process. Selecting the right predicates and processes
is a crucial task: The positive effect of abstraction may be compromised by unfavourable
refinement decisions. Here we present a heuristic approach to abstraction refinement.
The basis for a decision is a set of refinement candidates, derived by multiple
counterexample-generation. Candidates are evaluated with respect to their influence
on other components in the system. Experimental results show that our technique
can significantly speed up verification as compared to a naive abstraction refinement.'
author:
- first_name: Nils
full_name: Timm, Nils
last_name: Timm
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
citation:
ama: 'Timm N, Wehrheim H, Czech M. Heuristic-Guided Abstraction Refinement for Concurrent
Systems. In: Proceedings of the 14th International Conference on Formal Engineering
Methods (ICFEM). LNCS. ; 2012:348-363. doi:10.1007/978-3-642-34281-3_25'
apa: Timm, N., Wehrheim, H., & Czech, M. (2012). Heuristic-Guided Abstraction
Refinement for Concurrent Systems. In Proceedings of the 14th International
Conference on Formal Engineering Methods (ICFEM) (pp. 348–363). https://doi.org/10.1007/978-3-642-34281-3_25
bibtex: '@inproceedings{Timm_Wehrheim_Czech_2012, series={LNCS}, title={Heuristic-Guided
Abstraction Refinement for Concurrent Systems}, DOI={10.1007/978-3-642-34281-3_25},
booktitle={Proceedings of the 14th International Conference on Formal Engineering
Methods (ICFEM)}, author={Timm, Nils and Wehrheim, Heike and Czech, Mike}, year={2012},
pages={348–363}, collection={LNCS} }'
chicago: Timm, Nils, Heike Wehrheim, and Mike Czech. “Heuristic-Guided Abstraction
Refinement for Concurrent Systems.” In Proceedings of the 14th International
Conference on Formal Engineering Methods (ICFEM), 348–63. LNCS, 2012. https://doi.org/10.1007/978-3-642-34281-3_25.
ieee: N. Timm, H. Wehrheim, and M. Czech, “Heuristic-Guided Abstraction Refinement
for Concurrent Systems,” in Proceedings of the 14th International Conference
on Formal Engineering Methods (ICFEM), 2012, pp. 348–363.
mla: Timm, Nils, et al. “Heuristic-Guided Abstraction Refinement for Concurrent
Systems.” Proceedings of the 14th International Conference on Formal Engineering
Methods (ICFEM), 2012, pp. 348–63, doi:10.1007/978-3-642-34281-3_25.
short: 'N. Timm, H. Wehrheim, M. Czech, in: Proceedings of the 14th International
Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–363.'
date_created: 2017-10-17T12:42:50Z
date_updated: 2022-01-06T07:02:52Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-34281-3_25
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:15:33Z
date_updated: 2018-03-15T08:15:33Z
file_id: '1250'
file_name: 608-Timm2013-0main.pdf
file_size: 396337
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:15:33Z
has_accepted_license: '1'
language:
- iso: eng
page: 348-363
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 14th International Conference on Formal Engineering
Methods (ICFEM)
series_title: LNCS
status: public
title: Heuristic-Guided Abstraction Refinement for Concurrent Systems
type: conference
user_id: '477'
year: '2012'
...
---
_id: '627'
abstract:
- lang: eng
text: Block Abstraction Memoization (ABM) is a technique in software model checking
that exploits the modularity of programs during verification by caching. To this
end, ABM records the results of block analyses and reuses them if possible when
revisiting the same block again. In this paper we present an implementation of
ABM into the predicate-analysis component of the software-verification framework
CPAchecker. With our participation at the Competition on Software Verification
we aim at providing evidence that ABM can not only substantially increase the
efficiency of predicate analysis but also enables verification of a wider range
of programs.
author:
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: 'Wonisch D. Block Abstraction Memoization for CPAchecker. In: Proceedings
of the 18th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems (TACAS). LNCS. ; 2012:531-533. doi:10.1007/978-3-642-28756-5_41'
apa: Wonisch, D. (2012). Block Abstraction Memoization for CPAchecker. In Proceedings
of the 18th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems (TACAS) (pp. 531–533). https://doi.org/10.1007/978-3-642-28756-5_41
bibtex: '@inproceedings{Wonisch_2012, series={LNCS}, title={Block Abstraction Memoization
for CPAchecker}, DOI={10.1007/978-3-642-28756-5_41},
booktitle={Proceedings of the 18th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems (TACAS)}, author={Wonisch, Daniel},
year={2012}, pages={531–533}, collection={LNCS} }'
chicago: Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” In Proceedings
of the 18th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems (TACAS), 531–33. LNCS, 2012. https://doi.org/10.1007/978-3-642-28756-5_41.
ieee: D. Wonisch, “Block Abstraction Memoization for CPAchecker,” in Proceedings
of the 18th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems (TACAS), 2012, pp. 531–533.
mla: Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” Proceedings
of the 18th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems (TACAS), 2012, pp. 531–33, doi:10.1007/978-3-642-28756-5_41.
short: 'D. Wonisch, in: Proceedings of the 18th International Conference on Tools
and Algorithms for the Construction and Analysis of Systems (TACAS), 2012, pp.
531–533.'
date_created: 2017-10-17T12:42:54Z
date_updated: 2022-01-06T07:02:59Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-28756-5_41
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:46:05Z
date_updated: 2018-03-15T06:46:05Z
file_id: '1242'
file_name: 627-WonischSV-Comp2012_01.pdf
file_size: 184000
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:46:05Z
has_accepted_license: '1'
language:
- iso: eng
page: 531-533
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 18th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems (TACAS)
series_title: LNCS
status: public
title: Block Abstraction Memoization for CPAchecker
type: conference
user_id: '477'
year: '2012'
...
---
_id: '565'
abstract:
- lang: eng
text: 'In model-driven development of multi-layer systems (e.g. application, platform
and infrastructure), each layer is usually described by separate models. When
generating analysis models or code, these separate models rst of all need to be
linked. Hence, existing model transformations for single layers cannot be simply
re-used. In this paper, we present a modular approach to the transformation of
multi-layer systems. It employs model weaving to dene the interconnections between
models of dierent layers. The weaving models themselves are subject to model transformations:
The result of transforming a weaving model constitutes a conguration for the models
obtained by transforming single layers, thereby allowing for a re-use of existing
model transformations. We exemplify our approach by the generation of analysis
models for component-based software.'
author:
- first_name: Galina
full_name: Besova, Galina
last_name: Besova
- first_name: Sven
full_name: Walther, Sven
last_name: Walther
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
citation:
ama: 'Besova G, Walther S, Wehrheim H, Becker S. Weaving-based configuration and
modular transformation of multi-layer systems. In: Proceedings of the 15th
International Conference on Model Driven Engineering Languages & Systems (MoDELS).
LNCS. ; 2012:776-792. doi:10.1007/978-3-642-33666-9_49'
apa: Besova, G., Walther, S., Wehrheim, H., & Becker, S. (2012). Weaving-based
configuration and modular transformation of multi-layer systems. In Proceedings
of the 15th International Conference on Model Driven Engineering Languages &
Systems (MoDELS) (pp. 776–792). https://doi.org/10.1007/978-3-642-33666-9_49
bibtex: '@inproceedings{Besova_Walther_Wehrheim_Becker_2012, series={LNCS}, title={Weaving-based
configuration and modular transformation of multi-layer systems}, DOI={10.1007/978-3-642-33666-9_49},
booktitle={Proceedings of the 15th International Conference on Model Driven Engineering
Languages & Systems (MoDELS)}, author={Besova, Galina and Walther, Sven and
Wehrheim, Heike and Becker, Steffen}, year={2012}, pages={776–792}, collection={LNCS}
}'
chicago: Besova, Galina, Sven Walther, Heike Wehrheim, and Steffen Becker. “Weaving-Based
Configuration and Modular Transformation of Multi-Layer Systems.” In Proceedings
of the 15th International Conference on Model Driven Engineering Languages &
Systems (MoDELS), 776–92. LNCS, 2012. https://doi.org/10.1007/978-3-642-33666-9_49.
ieee: G. Besova, S. Walther, H. Wehrheim, and S. Becker, “Weaving-based configuration
and modular transformation of multi-layer systems,” in Proceedings of the 15th
International Conference on Model Driven Engineering Languages & Systems (MoDELS),
2012, pp. 776–792.
mla: Besova, Galina, et al. “Weaving-Based Configuration and Modular Transformation
of Multi-Layer Systems.” Proceedings of the 15th International Conference on
Model Driven Engineering Languages & Systems (MoDELS), 2012, pp. 776–92,
doi:10.1007/978-3-642-33666-9_49.
short: 'G. Besova, S. Walther, H. Wehrheim, S. Becker, in: Proceedings of the 15th
International Conference on Model Driven Engineering Languages & Systems (MoDELS),
2012, pp. 776–792.'
date_created: 2017-10-17T12:42:42Z
date_updated: 2022-01-06T07:02:20Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-33666-9_49
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:24:06Z
date_updated: 2018-03-15T10:24:06Z
file_id: '1276'
file_name: 565-Besova_et_al._-_2012_-_Weaving-Based_Configuration_and_Modular_Transformation_of_Multi-layer_Systems_01.pdf
file_size: 589972
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:24:06Z
has_accepted_license: '1'
language:
- iso: eng
page: 776-792
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 15th International Conference on Model Driven Engineering
Languages & Systems (MoDELS)
series_title: LNCS
status: public
title: Weaving-based configuration and modular transformation of multi-layer systems
type: conference
user_id: '477'
year: '2012'
...
---
_id: '3183'
author:
- first_name: Steve
full_name: Schneider, Steve
last_name: Schneider
- first_name: Helen
full_name: Treharne, Helen
last_name: Treharne
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Schneider S, Treharne H, Wehrheim H. Bounded Retransmission in Event-B{\(\parallel\)}CSP:
a Case Study. Electr Notes Theor Comput Sci. 2011:69--80. doi:10.1016/j.entcs.2011.11.019'
apa: 'Schneider, S., Treharne, H., & Wehrheim, H. (2011). Bounded Retransmission
in Event-B{\(\parallel\)}CSP: a Case Study. Electr. Notes Theor. Comput. Sci.,
69--80. https://doi.org/10.1016/j.entcs.2011.11.019'
bibtex: '@article{Schneider_Treharne_Wehrheim_2011, title={Bounded Retransmission
in Event-B{\(\parallel\)}CSP: a Case Study}, DOI={10.1016/j.entcs.2011.11.019},
journal={Electr. Notes Theor. Comput. Sci.}, author={Schneider, Steve and Treharne,
Helen and Wehrheim, Heike}, year={2011}, pages={69--80} }'
chicago: 'Schneider, Steve, Helen Treharne, and Heike Wehrheim. “Bounded Retransmission
in Event-B{\(\parallel\)}CSP: A Case Study.” Electr. Notes Theor. Comput. Sci.,
2011, 69--80. https://doi.org/10.1016/j.entcs.2011.11.019.'
ieee: 'S. Schneider, H. Treharne, and H. Wehrheim, “Bounded Retransmission in Event-B{\(\parallel\)}CSP:
a Case Study,” Electr. Notes Theor. Comput. Sci., pp. 69--80, 2011.'
mla: 'Schneider, Steve, et al. “Bounded Retransmission in Event-B{\(\parallel\)}CSP:
A Case Study.” Electr. Notes Theor. Comput. Sci., 2011, pp. 69--80, doi:10.1016/j.entcs.2011.11.019.'
short: S. Schneider, H. Treharne, H. Wehrheim, Electr. Notes Theor. Comput. Sci.
(2011) 69--80.
date_created: 2018-06-13T08:20:47Z
date_updated: 2022-01-06T06:59:03Z
department:
- _id: '77'
doi: 10.1016/j.entcs.2011.11.019
page: 69--80
publication: Electr. Notes Theor. Comput. Sci.
status: public
title: 'Bounded Retransmission in Event-B{\(\parallel\)}CSP: a Case Study'
type: journal_article
user_id: '29719'
year: '2011'
...
---
_id: '3184'
author:
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Derrick J, Schellhorn G, Wehrheim H. Mechanically verified proof obligations
for linearizability. {ACM} Trans Program Lang Syst. 2011;(1):4:1--4:43.
doi:10.1145/1889997.1890001
apa: Derrick, J., Schellhorn, G., & Wehrheim, H. (2011). Mechanically verified
proof obligations for linearizability. {ACM} Trans. Program. Lang. Syst.,
(1), 4:1--4:43. https://doi.org/10.1145/1889997.1890001
bibtex: '@article{Derrick_Schellhorn_Wehrheim_2011, title={Mechanically verified
proof obligations for linearizability}, DOI={10.1145/1889997.1890001},
number={1}, journal={{ACM} Trans. Program. Lang. Syst.}, author={Derrick, John
and Schellhorn, Gerhard and Wehrheim, Heike}, year={2011}, pages={4:1--4:43} }'
chicago: 'Derrick, John, Gerhard Schellhorn, and Heike Wehrheim. “Mechanically Verified
Proof Obligations for Linearizability.” {ACM} Trans. Program. Lang. Syst.,
no. 1 (2011): 4:1--4:43. https://doi.org/10.1145/1889997.1890001.'
ieee: J. Derrick, G. Schellhorn, and H. Wehrheim, “Mechanically verified proof obligations
for linearizability,” {ACM} Trans. Program. Lang. Syst., no. 1, pp. 4:1--4:43,
2011.
mla: Derrick, John, et al. “Mechanically Verified Proof Obligations for Linearizability.”
{ACM} Trans. Program. Lang. Syst., no. 1, 2011, pp. 4:1--4:43, doi:10.1145/1889997.1890001.
short: J. Derrick, G. Schellhorn, H. Wehrheim, {ACM} Trans. Program. Lang. Syst.
(2011) 4:1--4:43.
date_created: 2018-06-13T08:22:02Z
date_updated: 2022-01-06T06:59:03Z
department:
- _id: '77'
doi: 10.1145/1889997.1890001
issue: '1'
page: 4:1--4:43
publication: '{ACM} Trans. Program. Lang. Syst.'
status: public
title: Mechanically verified proof obligations for linearizability
type: journal_article
user_id: '29719'
year: '2011'
...
---
_id: '3185'
author:
- first_name: Thomas
full_name: Ruhroth, Thomas
last_name: Ruhroth
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Steffen
full_name: Ziegert, Steffen
last_name: Ziegert
citation:
ama: 'Ruhroth T, Wehrheim H, Ziegert S. ReL: {A} Generic Refactoring Language for
Specification and Execution. In: 37th {EUROMICRO} Conference on Software Engineering
and Advanced Applications, {SEAA} 2011, Oulu, Finland, August 30 - September 2,
2011. ; 2011:83--90. doi:10.1109/SEAA.2011.22'
apa: 'Ruhroth, T., Wehrheim, H., & Ziegert, S. (2011). ReL: {A} Generic Refactoring
Language for Specification and Execution. In 37th {EUROMICRO} Conference on
Software Engineering and Advanced Applications, {SEAA} 2011, Oulu, Finland, August
30 - September 2, 2011 (pp. 83--90). https://doi.org/10.1109/SEAA.2011.22'
bibtex: '@inproceedings{Ruhroth_Wehrheim_Ziegert_2011, title={ReL: {A} Generic Refactoring
Language for Specification and Execution}, DOI={10.1109/SEAA.2011.22},
booktitle={37th {EUROMICRO} Conference on Software Engineering and Advanced Applications,
{SEAA} 2011, Oulu, Finland, August 30 - September 2, 2011}, author={Ruhroth, Thomas
and Wehrheim, Heike and Ziegert, Steffen}, year={2011}, pages={83--90} }'
chicago: 'Ruhroth, Thomas, Heike Wehrheim, and Steffen Ziegert. “ReL: {A} Generic
Refactoring Language for Specification and Execution.” In 37th {EUROMICRO}
Conference on Software Engineering and Advanced Applications, {SEAA} 2011, Oulu,
Finland, August 30 - September 2, 2011, 83--90, 2011. https://doi.org/10.1109/SEAA.2011.22.'
ieee: 'T. Ruhroth, H. Wehrheim, and S. Ziegert, “ReL: {A} Generic Refactoring Language
for Specification and Execution,” in 37th {EUROMICRO} Conference on Software
Engineering and Advanced Applications, {SEAA} 2011, Oulu, Finland, August 30 -
September 2, 2011, 2011, pp. 83--90.'
mla: 'Ruhroth, Thomas, et al. “ReL: {A} Generic Refactoring Language for Specification
and Execution.” 37th {EUROMICRO} Conference on Software Engineering and Advanced
Applications, {SEAA} 2011, Oulu, Finland, August 30 - September 2, 2011, 2011,
pp. 83--90, doi:10.1109/SEAA.2011.22.'
short: 'T. Ruhroth, H. Wehrheim, S. Ziegert, in: 37th {EUROMICRO} Conference on
Software Engineering and Advanced Applications, {SEAA} 2011, Oulu, Finland, August
30 - September 2, 2011, 2011, pp. 83--90.'
date_created: 2018-06-13T08:23:28Z
date_updated: 2022-01-06T06:59:03Z
department:
- _id: '77'
doi: 10.1109/SEAA.2011.22
page: 83--90
publication: 37th {EUROMICRO} Conference on Software Engineering and Advanced Applications,
{SEAA} 2011, Oulu, Finland, August 30 - September 2, 2011
status: public
title: 'ReL: {A} Generic Refactoring Language for Specification and Execution'
type: conference
user_id: '29719'
year: '2011'
...
---
_id: '3186'
author:
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Derrick J, Schellhorn G, Wehrheim H. Verifying Linearisability with Potential
Linearisation Points. In: J. Butler M, Schulte W, eds. {FM} 2011: Formal Methods
- 17th International Symposium on Formal Methods, Limerick, Ireland, June 20-24,
2011. Proceedings. Lecture Notes in Computer Science. ; 2011:323--337. doi:10.1007/978-3-642-21437-0_25'
apa: 'Derrick, J., Schellhorn, G., & Wehrheim, H. (2011). Verifying Linearisability
with Potential Linearisation Points. In M. J. Butler & W. Schulte (Eds.),
{FM} 2011: Formal Methods - 17th International Symposium on Formal Methods,
Limerick, Ireland, June 20-24, 2011. Proceedings (pp. 323--337). https://doi.org/10.1007/978-3-642-21437-0_25'
bibtex: '@inproceedings{Derrick_Schellhorn_Wehrheim_2011, series={Lecture Notes
in Computer Science}, title={Verifying Linearisability with Potential Linearisation
Points}, DOI={10.1007/978-3-642-21437-0_25},
booktitle={{FM} 2011: Formal Methods - 17th International Symposium on Formal
Methods, Limerick, Ireland, June 20-24, 2011. Proceedings}, author={Derrick, John
and Schellhorn, Gerhard and Wehrheim, Heike}, editor={J. Butler, Michael and Schulte,
WolframEditors}, year={2011}, pages={323--337}, collection={Lecture Notes in Computer
Science} }'
chicago: 'Derrick, John, Gerhard Schellhorn, and Heike Wehrheim. “Verifying Linearisability
with Potential Linearisation Points.” In {FM} 2011: Formal Methods - 17th International
Symposium on Formal Methods, Limerick, Ireland, June 20-24, 2011. Proceedings,
edited by Michael J. Butler and Wolfram Schulte, 323--337. Lecture Notes in Computer
Science, 2011. https://doi.org/10.1007/978-3-642-21437-0_25.'
ieee: 'J. Derrick, G. Schellhorn, and H. Wehrheim, “Verifying Linearisability with
Potential Linearisation Points,” in {FM} 2011: Formal Methods - 17th International
Symposium on Formal Methods, Limerick, Ireland, June 20-24, 2011. Proceedings,
2011, pp. 323--337.'
mla: 'Derrick, John, et al. “Verifying Linearisability with Potential Linearisation
Points.” {FM} 2011: Formal Methods - 17th International Symposium on Formal
Methods, Limerick, Ireland, June 20-24, 2011. Proceedings, edited by Michael
J. Butler and Wolfram Schulte, 2011, pp. 323--337, doi:10.1007/978-3-642-21437-0_25.'
short: 'J. Derrick, G. Schellhorn, H. Wehrheim, in: M. J. Butler, W. Schulte (Eds.),
{FM} 2011: Formal Methods - 17th International Symposium on Formal Methods, Limerick,
Ireland, June 20-24, 2011. Proceedings, 2011, pp. 323--337.'
date_created: 2018-06-13T08:25:07Z
date_updated: 2022-01-06T06:59:03Z
department:
- _id: '77'
doi: 10.1007/978-3-642-21437-0_25
editor:
- first_name: Michael
full_name: J. Butler, Michael
last_name: J. Butler
- first_name: Wolfram
full_name: Schulte, Wolfram
last_name: Schulte
page: 323--337
publication: '{FM} 2011: Formal Methods - 17th International Symposium on Formal Methods,
Limerick, Ireland, June 20-24, 2011. Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: Verifying Linearisability with Potential Linearisation Points
type: conference
user_id: '29719'
year: '2011'
...
---
_id: '3187'
author:
- first_name: Dominik
full_name: Steenken, Dominik
last_name: Steenken
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: 'Steenken D, Wehrheim H, Wonisch D. Sound and Complete Abstract Graph Transformation.
In: da Silva Sim{\~{a}}o A, Morgan C, eds. Formal Methods, Foundations and
Applications - 14th Brazilian Symposium, {SBMF} 2011, S{\~{a}}o Paulo, Brazil,
September 26-30, 2011, Revised Selected Papers. Lecture Notes in Computer
Science. ; 2011:92--107. doi:10.1007/978-3-642-25032-3_7'
apa: Steenken, D., Wehrheim, H., & Wonisch, D. (2011). Sound and Complete Abstract
Graph Transformation. In A. da Silva Sim{\~{a}}o & C. Morgan (Eds.), Formal
Methods, Foundations and Applications - 14th Brazilian Symposium, {SBMF} 2011,
S{\~{a}}o Paulo, Brazil, September 26-30, 2011, Revised Selected Papers (pp.
92--107). https://doi.org/10.1007/978-3-642-25032-3_7
bibtex: '@inproceedings{Steenken_Wehrheim_Wonisch_2011, series={Lecture Notes in
Computer Science}, title={Sound and Complete Abstract Graph Transformation}, DOI={10.1007/978-3-642-25032-3_7},
booktitle={Formal Methods, Foundations and Applications - 14th Brazilian Symposium,
{SBMF} 2011, S{\~{a}}o Paulo, Brazil, September 26-30, 2011, Revised Selected
Papers}, author={Steenken, Dominik and Wehrheim, Heike and Wonisch, Daniel}, editor={da
Silva Sim{\~{a}}o, Adenilso and Morgan, CarrollEditors}, year={2011}, pages={92--107},
collection={Lecture Notes in Computer Science} }'
chicago: Steenken, Dominik, Heike Wehrheim, and Daniel Wonisch. “Sound and Complete
Abstract Graph Transformation.” In Formal Methods, Foundations and Applications
- 14th Brazilian Symposium, {SBMF} 2011, S{\~{a}}o Paulo, Brazil, September 26-30,
2011, Revised Selected Papers, edited by Adenilso da Silva Sim{\~{a}}o and
Carroll Morgan, 92--107. Lecture Notes in Computer Science, 2011. https://doi.org/10.1007/978-3-642-25032-3_7.
ieee: D. Steenken, H. Wehrheim, and D. Wonisch, “Sound and Complete Abstract Graph
Transformation,” in Formal Methods, Foundations and Applications - 14th Brazilian
Symposium, {SBMF} 2011, S{\~{a}}o Paulo, Brazil, September 26-30, 2011, Revised
Selected Papers, 2011, pp. 92--107.
mla: Steenken, Dominik, et al. “Sound and Complete Abstract Graph Transformation.”
Formal Methods, Foundations and Applications - 14th Brazilian Symposium, {SBMF}
2011, S{\~{a}}o Paulo, Brazil, September 26-30, 2011, Revised Selected Papers,
edited by Adenilso da Silva Sim{\~{a}}o and Carroll Morgan, 2011, pp. 92--107,
doi:10.1007/978-3-642-25032-3_7.
short: 'D. Steenken, H. Wehrheim, D. Wonisch, in: A. da Silva Sim{\~{a}}o, C. Morgan
(Eds.), Formal Methods, Foundations and Applications - 14th Brazilian Symposium,
{SBMF} 2011, S{\~{a}}o Paulo, Brazil, September 26-30, 2011, Revised Selected
Papers, 2011, pp. 92--107.'
date_created: 2018-06-13T08:32:12Z
date_updated: 2022-01-06T06:59:03Z
department:
- _id: '77'
doi: 10.1007/978-3-642-25032-3_7
editor:
- first_name: Adenilso
full_name: da Silva Sim{\~{a}}o, Adenilso
last_name: da Silva Sim{\~{a}}o
- first_name: Carroll
full_name: Morgan, Carroll
last_name: Morgan
page: 92--107
publication: Formal Methods, Foundations and Applications - 14th Brazilian Symposium,
{SBMF} 2011, S{\~{a}}o Paulo, Brazil, September 26-30, 2011, Revised Selected Papers
series_title: Lecture Notes in Computer Science
status: public
title: Sound and Complete Abstract Graph Transformation
type: conference
user_id: '29719'
year: '2011'
...
---
_id: '3188'
author:
- first_name: Steve
full_name: Schneider, Steve
last_name: Schneider
- first_name: Helen
full_name: Treharne, Helen
last_name: Treharne
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Schneider S, Treharne H, Wehrheim H. A {CSP} Account of Event-B Refinement.
In: Derrick J, A. Boiten E, Reeves S, eds. Proceedings 15th International Refinement
Workshop, Refine@FM 2011, Limerick, Ireland, 20th June 2011. {EPTCS}. ; 2011:139--154.
doi:10.4204/EPTCS.55.9'
apa: Schneider, S., Treharne, H., & Wehrheim, H. (2011). A {CSP} Account of
Event-B Refinement. In J. Derrick, E. A. Boiten, & S. Reeves (Eds.), Proceedings
15th International Refinement Workshop, Refine@FM 2011, Limerick, Ireland, 20th
June 2011. (pp. 139--154). https://doi.org/10.4204/EPTCS.55.9
bibtex: '@inproceedings{Schneider_Treharne_Wehrheim_2011, series={{EPTCS}}, title={A
{CSP} Account of Event-B Refinement}, DOI={10.4204/EPTCS.55.9},
booktitle={Proceedings 15th International Refinement Workshop, Refine@FM 2011,
Limerick, Ireland, 20th June 2011.}, author={Schneider, Steve and Treharne, Helen
and Wehrheim, Heike}, editor={Derrick, John and A. Boiten, Eerke and Reeves, SteveEditors},
year={2011}, pages={139--154}, collection={{EPTCS}} }'
chicago: Schneider, Steve, Helen Treharne, and Heike Wehrheim. “A {CSP} Account
of Event-B Refinement.” In Proceedings 15th International Refinement Workshop,
Refine@FM 2011, Limerick, Ireland, 20th June 2011., edited by John Derrick,
Eerke A. Boiten, and Steve Reeves, 139--154. {EPTCS}, 2011. https://doi.org/10.4204/EPTCS.55.9.
ieee: S. Schneider, H. Treharne, and H. Wehrheim, “A {CSP} Account of Event-B Refinement,”
in Proceedings 15th International Refinement Workshop, Refine@FM 2011, Limerick,
Ireland, 20th June 2011., 2011, pp. 139--154.
mla: Schneider, Steve, et al. “A {CSP} Account of Event-B Refinement.” Proceedings
15th International Refinement Workshop, Refine@FM 2011, Limerick, Ireland, 20th
June 2011., edited by John Derrick et al., 2011, pp. 139--154, doi:10.4204/EPTCS.55.9.
short: 'S. Schneider, H. Treharne, H. Wehrheim, in: J. Derrick, E. A. Boiten, S.
Reeves (Eds.), Proceedings 15th International Refinement Workshop, Refine@FM 2011,
Limerick, Ireland, 20th June 2011., 2011, pp. 139--154.'
date_created: 2018-06-13T08:43:19Z
date_updated: 2022-01-06T06:59:03Z
department:
- _id: '77'
doi: 10.4204/EPTCS.55.9
editor:
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Eerke
full_name: A. Boiten, Eerke
last_name: A. Boiten
- first_name: Steve
full_name: Reeves, Steve
last_name: Reeves
page: 139--154
publication: Proceedings 15th International Refinement Workshop, Refine@FM 2011, Limerick,
Ireland, 20th June 2011.
series_title: '{EPTCS}'
status: public
title: A {CSP} Account of Event-B Refinement
type: conference
user_id: '29719'
year: '2011'
...
---
_id: '647'
author:
- first_name: Michael
full_name: Leuschel, Michael
last_name: Leuschel
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Leuschel M, Wehrheim H. Selected papers on Integrated Formal Methods (iFM09).
Science of Computer Programming. 2011;(10):835--836. doi:10.1016/j.scico.2011.01.009
apa: Leuschel, M., & Wehrheim, H. (2011). Selected papers on Integrated Formal
Methods (iFM09). Science of Computer Programming, (10), 835--836. https://doi.org/10.1016/j.scico.2011.01.009
bibtex: '@article{Leuschel_Wehrheim_2011, title={Selected papers on Integrated Formal
Methods (iFM09)}, DOI={10.1016/j.scico.2011.01.009},
number={10}, journal={Science of Computer Programming}, publisher={Elsevier},
author={Leuschel, Michael and Wehrheim, Heike}, year={2011}, pages={835--836}
}'
chicago: 'Leuschel, Michael, and Heike Wehrheim. “Selected Papers on Integrated
Formal Methods (IFM09).” Science of Computer Programming, no. 10 (2011):
835--836. https://doi.org/10.1016/j.scico.2011.01.009.'
ieee: M. Leuschel and H. Wehrheim, “Selected papers on Integrated Formal Methods
(iFM09),” Science of Computer Programming, no. 10, pp. 835--836, 2011.
mla: Leuschel, Michael, and Heike Wehrheim. “Selected Papers on Integrated Formal
Methods (IFM09).” Science of Computer Programming, no. 10, Elsevier, 2011,
pp. 835--836, doi:10.1016/j.scico.2011.01.009.
short: M. Leuschel, H. Wehrheim, Science of Computer Programming (2011) 835--836.
date_created: 2017-10-17T12:42:58Z
date_updated: 2022-01-06T07:03:06Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.scico.2011.01.009
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:56:48Z
date_updated: 2018-03-14T13:56:48Z
file_id: '1226'
file_name: 647-LeuschelWehrheim.pdf
file_size: 139105
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:56:48Z
has_accepted_license: '1'
issue: '10'
language:
- iso: eng
page: 835--836
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Science of Computer Programming
publisher: Elsevier
status: public
title: Selected papers on Integrated Formal Methods (iFM09)
type: journal_article
user_id: '477'
year: '2011'
...
---
_id: '649'
abstract:
- lang: eng
text: 'Today, the concept of service oriented architectures provides a way of building
integrated solutions out of existing services. To this end, services from different
providers are composed using advanced orchestration and choreography techniques.
However, while this principle allows for greater flexibility at a smaller cost,
the use of third party services also includes a risk: Deployed services might
not work as claimed by their providers. In this paper, we propose a technique
for analyzing the expected reliability of service compositions based on ratings
given by (previous) service users. Every service thereby comes with a reputation,
and the analysis computes an overall reliability of a service composition from
the reputations of its constituent services. The proposed model-driven approach
proceeds by translating statechart models of service compositions into input for
a probabilistic model checker (PRISM) using state-of-the-art model transformations
techniques. The approach has been implemented as an Eclipse plug-in and is fully
compliant with UML.'
author:
- first_name: Galina
full_name: Besova, Galina
last_name: Besova
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Annika
full_name: Wagner, Annika
last_name: Wagner
citation:
ama: Besova G, Wehrheim H, Wagner A. Reputation-based Reliability Prediction of
Service Compositions. Electronic Notes in Theoretical Computer Science.
2011;(2):3-16. doi:10.1016/j.entcs.2011.11.008
apa: Besova, G., Wehrheim, H., & Wagner, A. (2011). Reputation-based Reliability
Prediction of Service Compositions. Electronic Notes in Theoretical Computer
Science, (2), 3–16. https://doi.org/10.1016/j.entcs.2011.11.008
bibtex: '@article{Besova_Wehrheim_Wagner_2011, title={Reputation-based Reliability
Prediction of Service Compositions}, DOI={10.1016/j.entcs.2011.11.008},
number={2}, journal={Electronic Notes in Theoretical Computer Science}, publisher={Elsevier},
author={Besova, Galina and Wehrheim, Heike and Wagner, Annika}, year={2011}, pages={3–16}
}'
chicago: 'Besova, Galina, Heike Wehrheim, and Annika Wagner. “Reputation-Based Reliability
Prediction of Service Compositions.” Electronic Notes in Theoretical Computer
Science, no. 2 (2011): 3–16. https://doi.org/10.1016/j.entcs.2011.11.008.'
ieee: G. Besova, H. Wehrheim, and A. Wagner, “Reputation-based Reliability Prediction
of Service Compositions,” Electronic Notes in Theoretical Computer Science,
no. 2, pp. 3–16, 2011.
mla: Besova, Galina, et al. “Reputation-Based Reliability Prediction of Service
Compositions.” Electronic Notes in Theoretical Computer Science, no. 2,
Elsevier, 2011, pp. 3–16, doi:10.1016/j.entcs.2011.11.008.
short: G. Besova, H. Wehrheim, A. Wagner, Electronic Notes in Theoretical Computer
Science (2011) 3–16.
date_created: 2017-10-17T12:42:58Z
date_updated: 2022-01-06T07:03:07Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.entcs.2011.11.008
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:55:38Z
date_updated: 2018-03-14T13:55:38Z
file_id: '1225'
file_name: 649-ETAPS2011-Besova-Wehrheim-Wagner_01.pdf
file_size: 534727
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:55:38Z
has_accepted_license: '1'
issue: '2'
language:
- iso: eng
page: 3-16
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Electronic Notes in Theoretical Computer Science
publisher: Elsevier
status: public
title: Reputation-based Reliability Prediction of Service Compositions
type: journal_article
user_id: '477'
year: '2011'
...
---
_id: '658'
author:
- first_name: Alexander
full_name: Schremmer, Alexander
last_name: Schremmer
citation:
ama: Schremmer A. Function Specification Inference Using Craig Interpolation.
Universität Paderborn; 2011.
apa: Schremmer, A. (2011). Function Specification Inference Using Craig Interpolation.
Universität Paderborn.
bibtex: '@book{Schremmer_2011, title={Function Specification Inference Using Craig
Interpolation}, publisher={Universität Paderborn}, author={Schremmer, Alexander},
year={2011} }'
chicago: Schremmer, Alexander. Function Specification Inference Using Craig Interpolation.
Universität Paderborn, 2011.
ieee: A. Schremmer, Function Specification Inference Using Craig Interpolation.
Universität Paderborn, 2011.
mla: Schremmer, Alexander. Function Specification Inference Using Craig Interpolation.
Universität Paderborn, 2011.
short: A. Schremmer, Function Specification Inference Using Craig Interpolation,
Universität Paderborn, 2011.
date_created: 2017-10-17T12:43:00Z
date_updated: 2022-01-06T07:03:12Z
department:
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Function Specification Inference Using Craig Interpolation
type: mastersthesis
user_id: '477'
year: '2011'
...
---
_id: '3195'
author:
- first_name: Steve
full_name: Schneider, Steve
last_name: Schneider
- first_name: Helen
full_name: Treharne, Helen
last_name: Treharne
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Schneider S, Treharne H, Wehrheim H. A {CSP} Approach to Control in Event-B.
In: M{\’{e}}ry D, Merz S, eds. Integrated Formal Methods - 8th International
Conference, {IFM} 2010, Nancy, France, October 11-14, 2010. Proceedings. Lecture
Notes in Computer Science. ; 2010:260--274. doi:10.1007/978-3-642-16265-7_19'
apa: Schneider, S., Treharne, H., & Wehrheim, H. (2010). A {CSP} Approach to
Control in Event-B. In D. M{\’{e}}ry & S. Merz (Eds.), Integrated Formal
Methods - 8th International Conference, {IFM} 2010, Nancy, France, October 11-14,
2010. Proceedings (pp. 260--274). https://doi.org/10.1007/978-3-642-16265-7_19
bibtex: '@inproceedings{Schneider_Treharne_Wehrheim_2010, series={Lecture Notes
in Computer Science}, title={A {CSP} Approach to Control in Event-B}, DOI={10.1007/978-3-642-16265-7_19},
booktitle={Integrated Formal Methods - 8th International Conference, {IFM} 2010,
Nancy, France, October 11-14, 2010. Proceedings}, author={Schneider, Steve and
Treharne, Helen and Wehrheim, Heike}, editor={M{\’{e}}ry, Dominique and Merz,
StephanEditors}, year={2010}, pages={260--274}, collection={Lecture Notes in Computer
Science} }'
chicago: Schneider, Steve, Helen Treharne, and Heike Wehrheim. “A {CSP} Approach
to Control in Event-B.” In Integrated Formal Methods - 8th International Conference,
{IFM} 2010, Nancy, France, October 11-14, 2010. Proceedings, edited by Dominique
M{\’{e}}ry and Stephan Merz, 260--274. Lecture Notes in Computer Science, 2010.
https://doi.org/10.1007/978-3-642-16265-7_19.
ieee: S. Schneider, H. Treharne, and H. Wehrheim, “A {CSP} Approach to Control in
Event-B,” in Integrated Formal Methods - 8th International Conference, {IFM}
2010, Nancy, France, October 11-14, 2010. Proceedings, 2010, pp. 260--274.
mla: Schneider, Steve, et al. “A {CSP} Approach to Control in Event-B.” Integrated
Formal Methods - 8th International Conference, {IFM} 2010, Nancy, France, October
11-14, 2010. Proceedings, edited by Dominique M{\’{e}}ry and Stephan Merz,
2010, pp. 260--274, doi:10.1007/978-3-642-16265-7_19.
short: 'S. Schneider, H. Treharne, H. Wehrheim, in: D. M{\’{e}}ry, S. Merz (Eds.),
Integrated Formal Methods - 8th International Conference, {IFM} 2010, Nancy, France,
October 11-14, 2010. Proceedings, 2010, pp. 260--274.'
date_created: 2018-06-13T09:20:53Z
date_updated: 2022-01-06T06:59:04Z
department:
- _id: '77'
doi: 10.1007/978-3-642-16265-7_19
editor:
- first_name: Dominique
full_name: M{\'{e}}ry, Dominique
last_name: M{\'{e}}ry
- first_name: Stephan
full_name: Merz, Stephan
last_name: Merz
page: 260--274
publication: Integrated Formal Methods - 8th International Conference, {IFM} 2010,
Nancy, France, October 11-14, 2010. Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: A {CSP} Approach to Control in Event-B
type: conference
user_id: '29719'
year: '2010'
...
---
_id: '3196'
author:
- first_name: Klaus
full_name: Dräger, Klaus
last_name: Dräger
- first_name: Andrey
full_name: Kupriyanov, Andrey
last_name: Kupriyanov
- first_name: Bernd
full_name: Finkbeiner, Bernd
last_name: Finkbeiner
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Dräger K, Kupriyanov A, Finkbeiner B, Wehrheim H. {SLAB:} {A} Certifying Model
Checker for Infinite-State Concurrent Systems. In: Esparza J, Majumdar R, eds.
Tools and Algorithms for the Construction and Analysis of Systems, 16th International
Conference, {TACAS} 2010, Held as Part of the Joint European Conferences on Theory
and Practice of Software, {ETAPS} 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings.
Lecture Notes in Computer Science. ; 2010:271--274. doi:10.1007/978-3-642-12002-2_22'
apa: Dräger, K., Kupriyanov, A., Finkbeiner, B., & Wehrheim, H. (2010). {SLAB:}
{A} Certifying Model Checker for Infinite-State Concurrent Systems. In J. Esparza
& R. Majumdar (Eds.), Tools and Algorithms for the Construction and Analysis
of Systems, 16th International Conference, {TACAS} 2010, Held as Part of the Joint
European Conferences on Theory and Practice of Software, {ETAPS} 2010, Paphos,
Cyprus, March 20-28, 2010. Proceedings (pp. 271--274). https://doi.org/10.1007/978-3-642-12002-2_22
bibtex: '@inproceedings{Dräger_Kupriyanov_Finkbeiner_Wehrheim_2010, series={Lecture
Notes in Computer Science}, title={{SLAB:} {A} Certifying Model Checker for Infinite-State
Concurrent Systems}, DOI={10.1007/978-3-642-12002-2_22},
booktitle={Tools and Algorithms for the Construction and Analysis of Systems,
16th International Conference, {TACAS} 2010, Held as Part of the Joint European
Conferences on Theory and Practice of Software, {ETAPS} 2010, Paphos, Cyprus,
March 20-28, 2010. Proceedings}, author={Dräger, Klaus and Kupriyanov, Andrey
and Finkbeiner, Bernd and Wehrheim, Heike}, editor={Esparza, Javier and Majumdar,
RupakEditors}, year={2010}, pages={271--274}, collection={Lecture Notes in Computer
Science} }'
chicago: Dräger, Klaus, Andrey Kupriyanov, Bernd Finkbeiner, and Heike Wehrheim.
“{SLAB:} {A} Certifying Model Checker for Infinite-State Concurrent Systems.”
In Tools and Algorithms for the Construction and Analysis of Systems, 16th
International Conference, {TACAS} 2010, Held as Part of the Joint European Conferences
on Theory and Practice of Software, {ETAPS} 2010, Paphos, Cyprus, March 20-28,
2010. Proceedings, edited by Javier Esparza and Rupak Majumdar, 271--274.
Lecture Notes in Computer Science, 2010. https://doi.org/10.1007/978-3-642-12002-2_22.
ieee: K. Dräger, A. Kupriyanov, B. Finkbeiner, and H. Wehrheim, “{SLAB:} {A} Certifying
Model Checker for Infinite-State Concurrent Systems,” in Tools and Algorithms
for the Construction and Analysis of Systems, 16th International Conference, {TACAS}
2010, Held as Part of the Joint European Conferences on Theory and Practice of
Software, {ETAPS} 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings, 2010,
pp. 271--274.
mla: Dräger, Klaus, et al. “{SLAB:} {A} Certifying Model Checker for Infinite-State
Concurrent Systems.” Tools and Algorithms for the Construction and Analysis
of Systems, 16th International Conference, {TACAS} 2010, Held as Part of the Joint
European Conferences on Theory and Practice of Software, {ETAPS} 2010, Paphos,
Cyprus, March 20-28, 2010. Proceedings, edited by Javier Esparza and Rupak
Majumdar, 2010, pp. 271--274, doi:10.1007/978-3-642-12002-2_22.
short: 'K. Dräger, A. Kupriyanov, B. Finkbeiner, H. Wehrheim, in: J. Esparza, R.
Majumdar (Eds.), Tools and Algorithms for the Construction and Analysis of Systems,
16th International Conference, {TACAS} 2010, Held as Part of the Joint European
Conferences on Theory and Practice of Software, {ETAPS} 2010, Paphos, Cyprus,
March 20-28, 2010. Proceedings, 2010, pp. 271--274.'
date_created: 2018-06-13T09:22:07Z
date_updated: 2022-01-06T06:59:04Z
department:
- _id: '77'
doi: 10.1007/978-3-642-12002-2_22
editor:
- first_name: Javier
full_name: Esparza, Javier
last_name: Esparza
- first_name: Rupak
full_name: Majumdar, Rupak
last_name: Majumdar
page: 271--274
publication: Tools and Algorithms for the Construction and Analysis of Systems, 16th
International Conference, {TACAS} 2010, Held as Part of the Joint European Conferences
on Theory and Practice of Software, {ETAPS} 2010, Paphos, Cyprus, March 20-28, 2010.
Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: '{SLAB:} {A} Certifying Model Checker for Infinite-State Concurrent Systems'
type: conference
user_id: '29719'
year: '2010'
...
---
_id: '3198'
author:
- first_name: Dominik
full_name: Steenken, Dominik
last_name: Steenken
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: Steenken D, Wehrheim H, Wonisch D. Towards {A} Shape Analysis for Graph Transformation
Systems. CoRR. 2010.
apa: Steenken, D., Wehrheim, H., & Wonisch, D. (2010). Towards {A} Shape Analysis
for Graph Transformation Systems. CoRR.
bibtex: '@article{Steenken_Wehrheim_Wonisch_2010, title={Towards {A} Shape Analysis
for Graph Transformation Systems}, journal={CoRR}, author={Steenken, Dominik and
Wehrheim, Heike and Wonisch, Daniel}, year={2010} }'
chicago: Steenken, Dominik, Heike Wehrheim, and Daniel Wonisch. “Towards {A} Shape
Analysis for Graph Transformation Systems.” CoRR, 2010.
ieee: D. Steenken, H. Wehrheim, and D. Wonisch, “Towards {A} Shape Analysis for
Graph Transformation Systems,” CoRR, 2010.
mla: Steenken, Dominik, et al. “Towards {A} Shape Analysis for Graph Transformation
Systems.” CoRR, 2010.
short: D. Steenken, H. Wehrheim, D. Wonisch, CoRR (2010).
date_created: 2018-06-13T09:23:16Z
date_updated: 2022-01-06T06:59:04Z
department:
- _id: '77'
publication: CoRR
status: public
title: Towards {A} Shape Analysis for Graph Transformation Systems
type: journal_article
user_id: '29719'
year: '2010'
...
---
_id: '3189'
author:
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Derrick J, Wehrheim H. Model transformations across views. Sci Comput Program.
2010;(3):192--210. doi:10.1016/j.scico.2009.11.004
apa: Derrick, J., & Wehrheim, H. (2010). Model transformations across views.
Sci. Comput. Program., (3), 192--210. https://doi.org/10.1016/j.scico.2009.11.004
bibtex: '@article{Derrick_Wehrheim_2010, title={Model transformations across views},
DOI={10.1016/j.scico.2009.11.004},
number={3}, journal={Sci. Comput. Program.}, author={Derrick, John and Wehrheim,
Heike}, year={2010}, pages={192--210} }'
chicago: 'Derrick, John, and Heike Wehrheim. “Model Transformations across Views.”
Sci. Comput. Program., no. 3 (2010): 192--210. https://doi.org/10.1016/j.scico.2009.11.004.'
ieee: J. Derrick and H. Wehrheim, “Model transformations across views,” Sci.
Comput. Program., no. 3, pp. 192--210, 2010.
mla: Derrick, John, and Heike Wehrheim. “Model Transformations across Views.” Sci.
Comput. Program., no. 3, 2010, pp. 192--210, doi:10.1016/j.scico.2009.11.004.
short: J. Derrick, H. Wehrheim, Sci. Comput. Program. (2010) 192--210.
date_created: 2018-06-13T08:44:32Z
date_updated: 2022-01-06T06:59:03Z
department:
- _id: '77'
doi: 10.1016/j.scico.2009.11.004
issue: '3'
page: 192--210
publication: Sci. Comput. Program.
status: public
title: Model transformations across views
type: journal_article
user_id: '29719'
year: '2010'
...
---
_id: '3191'
author:
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Schäfer W, Wehrheim H. Model-Driven Development with Mechatronic {UML}. In:
Engels G, Lewerentz C, Sch{\"{a}}fer W, Sch{\"{u}}rr A, Westfechtel B, eds. Graph
Transformations and Model-Driven Engineering - Essays Dedicated to Manfred Nagl
on the Occasion of His 65th Birthday. Lecture Notes in Computer Science. ;
2010:533--554. doi:10.1007/978-3-642-17322-6_23'
apa: Schäfer, W., & Wehrheim, H. (2010). Model-Driven Development with Mechatronic
{UML}. In G. Engels, C. Lewerentz, W. Sch{\"{a}}fer, A. Sch{\"{u}}rr, & B.
Westfechtel (Eds.), Graph Transformations and Model-Driven Engineering - Essays
Dedicated to Manfred Nagl on the Occasion of his 65th Birthday (pp. 533--554).
https://doi.org/10.1007/978-3-642-17322-6_23
bibtex: '@inproceedings{Schäfer_Wehrheim_2010, series={Lecture Notes in Computer
Science}, title={Model-Driven Development with Mechatronic {UML}}, DOI={10.1007/978-3-642-17322-6_23},
booktitle={Graph Transformations and Model-Driven Engineering - Essays Dedicated
to Manfred Nagl on the Occasion of his 65th Birthday}, author={Schäfer, Wilhelm
and Wehrheim, Heike}, editor={Engels, Gregor and Lewerentz, Claus and Sch{\"{a}}fer,
Wilhelm and Sch{\"{u}}rr, Andy and Westfechtel, BernhardEditors}, year={2010},
pages={533--554}, collection={Lecture Notes in Computer Science} }'
chicago: Schäfer, Wilhelm, and Heike Wehrheim. “Model-Driven Development with Mechatronic
{UML}.” In Graph Transformations and Model-Driven Engineering - Essays Dedicated
to Manfred Nagl on the Occasion of His 65th Birthday, edited by Gregor Engels,
Claus Lewerentz, Wilhelm Sch{\"{a}}fer, Andy Sch{\"{u}}rr, and Bernhard Westfechtel,
533--554. Lecture Notes in Computer Science, 2010. https://doi.org/10.1007/978-3-642-17322-6_23.
ieee: W. Schäfer and H. Wehrheim, “Model-Driven Development with Mechatronic {UML},”
in Graph Transformations and Model-Driven Engineering - Essays Dedicated to
Manfred Nagl on the Occasion of his 65th Birthday, 2010, pp. 533--554.
mla: Schäfer, Wilhelm, and Heike Wehrheim. “Model-Driven Development with Mechatronic
{UML}.” Graph Transformations and Model-Driven Engineering - Essays Dedicated
to Manfred Nagl on the Occasion of His 65th Birthday, edited by Gregor Engels
et al., 2010, pp. 533--554, doi:10.1007/978-3-642-17322-6_23.
short: 'W. Schäfer, H. Wehrheim, in: G. Engels, C. Lewerentz, W. Sch{\"{a}}fer,
A. Sch{\"{u}}rr, B. Westfechtel (Eds.), Graph Transformations and Model-Driven
Engineering - Essays Dedicated to Manfred Nagl on the Occasion of His 65th Birthday,
2010, pp. 533--554.'
date_created: 2018-06-13T09:10:56Z
date_updated: 2022-01-06T06:59:04Z
department:
- _id: '77'
doi: 10.1007/978-3-642-17322-6_23
editor:
- first_name: Gregor
full_name: Engels, Gregor
last_name: Engels
- first_name: Claus
full_name: Lewerentz, Claus
last_name: Lewerentz
- first_name: Wilhelm
full_name: Sch{\"{a}}fer, Wilhelm
last_name: Sch{\"{a}}fer
- first_name: Andy
full_name: Sch{\"{u}}rr, Andy
last_name: Sch{\"{u}}rr
- first_name: Bernhard
full_name: Westfechtel, Bernhard
last_name: Westfechtel
page: 533--554
publication: Graph Transformations and Model-Driven Engineering - Essays Dedicated
to Manfred Nagl on the Occasion of his 65th Birthday
series_title: Lecture Notes in Computer Science
status: public
title: Model-Driven Development with Mechatronic {UML}
type: conference
user_id: '29719'
year: '2010'
...
---
_id: '3193'
author:
- first_name: Nils
full_name: Timm, Nils
last_name: Timm
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Timm N, Wehrheim H. On Symmetries and Spotlights - Verifying Parameterised
Systems. In: Song Dong J, Zhu H, eds. Formal Methods and Software Engineering
- 12th International Conference on Formal Engineering Methods, {ICFEM} 2010, Shanghai,
China, November 17-19, 2010. Proceedings. Lecture Notes in Computer Science.
; 2010:534--548. doi:10.1007/978-3-642-16901-4_35'
apa: Timm, N., & Wehrheim, H. (2010). On Symmetries and Spotlights - Verifying
Parameterised Systems. In J. Song Dong & H. Zhu (Eds.), Formal Methods
and Software Engineering - 12th International Conference on Formal Engineering
Methods, {ICFEM} 2010, Shanghai, China, November 17-19, 2010. Proceedings
(pp. 534--548). https://doi.org/10.1007/978-3-642-16901-4_35
bibtex: '@inproceedings{Timm_Wehrheim_2010, series={Lecture Notes in Computer Science},
title={On Symmetries and Spotlights - Verifying Parameterised Systems}, DOI={10.1007/978-3-642-16901-4_35},
booktitle={Formal Methods and Software Engineering - 12th International Conference
on Formal Engineering Methods, {ICFEM} 2010, Shanghai, China, November 17-19,
2010. Proceedings}, author={Timm, Nils and Wehrheim, Heike}, editor={Song Dong,
Jin and Zhu, HuibiaoEditors}, year={2010}, pages={534--548}, collection={Lecture
Notes in Computer Science} }'
chicago: Timm, Nils, and Heike Wehrheim. “On Symmetries and Spotlights - Verifying
Parameterised Systems.” In Formal Methods and Software Engineering - 12th International
Conference on Formal Engineering Methods, {ICFEM} 2010, Shanghai, China, November
17-19, 2010. Proceedings, edited by Jin Song Dong and Huibiao Zhu, 534--548.
Lecture Notes in Computer Science, 2010. https://doi.org/10.1007/978-3-642-16901-4_35.
ieee: N. Timm and H. Wehrheim, “On Symmetries and Spotlights - Verifying Parameterised
Systems,” in Formal Methods and Software Engineering - 12th International Conference
on Formal Engineering Methods, {ICFEM} 2010, Shanghai, China, November 17-19,
2010. Proceedings, 2010, pp. 534--548.
mla: Timm, Nils, and Heike Wehrheim. “On Symmetries and Spotlights - Verifying Parameterised
Systems.” Formal Methods and Software Engineering - 12th International Conference
on Formal Engineering Methods, {ICFEM} 2010, Shanghai, China, November 17-19,
2010. Proceedings, edited by Jin Song Dong and Huibiao Zhu, 2010, pp. 534--548,
doi:10.1007/978-3-642-16901-4_35.
short: 'N. Timm, H. Wehrheim, in: J. Song Dong, H. Zhu (Eds.), Formal Methods and
Software Engineering - 12th International Conference on Formal Engineering Methods,
{ICFEM} 2010, Shanghai, China, November 17-19, 2010. Proceedings, 2010, pp. 534--548.'
date_created: 2018-06-13T09:12:28Z
date_updated: 2022-01-06T06:59:04Z
department:
- _id: '77'
doi: 10.1007/978-3-642-16901-4_35
editor:
- first_name: Jin
full_name: Song Dong, Jin
last_name: Song Dong
- first_name: Huibiao
full_name: Zhu, Huibiao
last_name: Zhu
page: 534--548
publication: Formal Methods and Software Engineering - 12th International Conference
on Formal Engineering Methods, {ICFEM} 2010, Shanghai, China, November 17-19, 2010.
Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: On Symmetries and Spotlights - Verifying Parameterised Systems
type: conference
user_id: '29719'
year: '2010'
...
---
_id: '3194'
author:
- first_name: Mathias
full_name: Hülsbusch, Mathias
last_name: Hülsbusch
- first_name: Barbara
full_name: König, Barbara
last_name: König
- first_name: Arend
full_name: Rensink, Arend
last_name: Rensink
- first_name: Maria
full_name: Semenyak, Maria
last_name: Semenyak
- first_name: Christian
full_name: Soltenborn, Christian
id: '1737'
last_name: Soltenborn
orcid: 0000-0002-0342-8227
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Hülsbusch M, König B, Rensink A, Semenyak M, Soltenborn C, Wehrheim H. Showing
Full Semantics Preservation in Model Transformation - {A} Comparison of Techniques.
In: M{\’{e}}ry D, Merz S, eds. Integrated Formal Methods - 8th International
Conference, {IFM} 2010, Nancy, France, October 11-14, 2010. Proceedings. Lecture
Notes in Computer Science. ; 2010:183--198. doi:10.1007/978-3-642-16265-7_14'
apa: Hülsbusch, M., König, B., Rensink, A., Semenyak, M., Soltenborn, C., &
Wehrheim, H. (2010). Showing Full Semantics Preservation in Model Transformation
- {A} Comparison of Techniques. In D. M{\’{e}}ry & S. Merz (Eds.), Integrated
Formal Methods - 8th International Conference, {IFM} 2010, Nancy, France, October
11-14, 2010. Proceedings (pp. 183--198). https://doi.org/10.1007/978-3-642-16265-7_14
bibtex: '@inproceedings{Hülsbusch_König_Rensink_Semenyak_Soltenborn_Wehrheim_2010,
series={Lecture Notes in Computer Science}, title={Showing Full Semantics Preservation
in Model Transformation - {A} Comparison of Techniques}, DOI={10.1007/978-3-642-16265-7_14},
booktitle={Integrated Formal Methods - 8th International Conference, {IFM} 2010,
Nancy, France, October 11-14, 2010. Proceedings}, author={Hülsbusch, Mathias and
König, Barbara and Rensink, Arend and Semenyak, Maria and Soltenborn, Christian
and Wehrheim, Heike}, editor={M{\’{e}}ry, Dominique and Merz, StephanEditors},
year={2010}, pages={183--198}, collection={Lecture Notes in Computer Science}
}'
chicago: Hülsbusch, Mathias, Barbara König, Arend Rensink, Maria Semenyak, Christian
Soltenborn, and Heike Wehrheim. “Showing Full Semantics Preservation in Model
Transformation - {A} Comparison of Techniques.” In Integrated Formal Methods
- 8th International Conference, {IFM} 2010, Nancy, France, October 11-14, 2010.
Proceedings, edited by Dominique M{\’{e}}ry and Stephan Merz, 183--198. Lecture
Notes in Computer Science, 2010. https://doi.org/10.1007/978-3-642-16265-7_14.
ieee: M. Hülsbusch, B. König, A. Rensink, M. Semenyak, C. Soltenborn, and H. Wehrheim,
“Showing Full Semantics Preservation in Model Transformation - {A} Comparison
of Techniques,” in Integrated Formal Methods - 8th International Conference,
{IFM} 2010, Nancy, France, October 11-14, 2010. Proceedings, 2010, pp. 183--198.
mla: Hülsbusch, Mathias, et al. “Showing Full Semantics Preservation in Model Transformation
- {A} Comparison of Techniques.” Integrated Formal Methods - 8th International
Conference, {IFM} 2010, Nancy, France, October 11-14, 2010. Proceedings, edited
by Dominique M{\’{e}}ry and Stephan Merz, 2010, pp. 183--198, doi:10.1007/978-3-642-16265-7_14.
short: 'M. Hülsbusch, B. König, A. Rensink, M. Semenyak, C. Soltenborn, H. Wehrheim,
in: D. M{\’{e}}ry, S. Merz (Eds.), Integrated Formal Methods - 8th International
Conference, {IFM} 2010, Nancy, France, October 11-14, 2010. Proceedings, 2010,
pp. 183--198.'
date_created: 2018-06-13T09:19:33Z
date_updated: 2022-01-06T06:59:04Z
department:
- _id: '77'
doi: 10.1007/978-3-642-16265-7_14
editor:
- first_name: Dominique
full_name: M{\'{e}}ry, Dominique
last_name: M{\'{e}}ry
- first_name: Stephan
full_name: Merz, Stephan
last_name: Merz
language:
- iso: eng
page: 183--198
publication: Integrated Formal Methods - 8th International Conference, {IFM} 2010,
Nancy, France, October 11-14, 2010. Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Showing Full Semantics Preservation in Model Transformation - {A} Comparison
of Techniques
type: conference
user_id: '14955'
year: '2010'
...
---
_id: '3199'
author:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: Wehrheim H, Wonisch D. Compositional {CSP} Traces Refinement Checking. Electr
Notes Theor Comput Sci. 2009;(2):135--151. doi:10.1016/j.entcs.2009.08.022
apa: Wehrheim, H., & Wonisch, D. (2009). Compositional {CSP} Traces Refinement
Checking. Electr. Notes Theor. Comput. Sci., (2), 135--151. https://doi.org/10.1016/j.entcs.2009.08.022
bibtex: '@article{Wehrheim_Wonisch_2009, title={Compositional {CSP} Traces Refinement
Checking}, DOI={10.1016/j.entcs.2009.08.022},
number={2}, journal={Electr. Notes Theor. Comput. Sci.}, author={Wehrheim, Heike
and Wonisch, Daniel}, year={2009}, pages={135--151} }'
chicago: 'Wehrheim, Heike, and Daniel Wonisch. “Compositional {CSP} Traces Refinement
Checking.” Electr. Notes Theor. Comput. Sci., no. 2 (2009): 135--151. https://doi.org/10.1016/j.entcs.2009.08.022.'
ieee: H. Wehrheim and D. Wonisch, “Compositional {CSP} Traces Refinement Checking,”
Electr. Notes Theor. Comput. Sci., no. 2, pp. 135--151, 2009.
mla: Wehrheim, Heike, and Daniel Wonisch. “Compositional {CSP} Traces Refinement
Checking.” Electr. Notes Theor. Comput. Sci., no. 2, 2009, pp. 135--151,
doi:10.1016/j.entcs.2009.08.022.
short: H. Wehrheim, D. Wonisch, Electr. Notes Theor. Comput. Sci. (2009) 135--151.
date_created: 2018-06-13T09:24:52Z
date_updated: 2022-01-06T06:59:04Z
department:
- _id: '77'
doi: 10.1016/j.entcs.2009.08.022
issue: '2'
page: 135--151
publication: Electr. Notes Theor. Comput. Sci.
status: public
title: Compositional {CSP} Traces Refinement Checking
type: journal_article
user_id: '29719'
year: '2009'
...
---
_id: '3200'
author:
- first_name: Thomas
full_name: Ruhroth, Thomas
last_name: Ruhroth
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Ruhroth T, Wehrheim H. Static Class Elements for Object-Z. Electr Notes
Theor Comput Sci. 2009:193--205. doi:10.1016/j.entcs.2009.12.025
apa: Ruhroth, T., & Wehrheim, H. (2009). Static Class Elements for Object-Z.
Electr. Notes Theor. Comput. Sci., 193--205. https://doi.org/10.1016/j.entcs.2009.12.025
bibtex: '@article{Ruhroth_Wehrheim_2009, title={Static Class Elements for Object-Z},
DOI={10.1016/j.entcs.2009.12.025},
journal={Electr. Notes Theor. Comput. Sci.}, author={Ruhroth, Thomas and Wehrheim,
Heike}, year={2009}, pages={193--205} }'
chicago: Ruhroth, Thomas, and Heike Wehrheim. “Static Class Elements for Object-Z.”
Electr. Notes Theor. Comput. Sci., 2009, 193--205. https://doi.org/10.1016/j.entcs.2009.12.025.
ieee: T. Ruhroth and H. Wehrheim, “Static Class Elements for Object-Z,” Electr.
Notes Theor. Comput. Sci., pp. 193--205, 2009.
mla: Ruhroth, Thomas, and Heike Wehrheim. “Static Class Elements for Object-Z.”
Electr. Notes Theor. Comput. Sci., 2009, pp. 193--205, doi:10.1016/j.entcs.2009.12.025.
short: T. Ruhroth, H. Wehrheim, Electr. Notes Theor. Comput. Sci. (2009) 193--205.
date_created: 2018-06-13T09:26:31Z
date_updated: 2022-01-06T06:59:04Z
department:
- _id: '77'
doi: 10.1016/j.entcs.2009.12.025
page: 193--205
publication: Electr. Notes Theor. Comput. Sci.
status: public
title: Static Class Elements for Object-Z
type: journal_article
user_id: '29719'
year: '2009'
...
---
_id: '3201'
author:
- first_name: Thomas
full_name: Ruhroth, Thomas
last_name: Ruhroth
- first_name: Hendrik
full_name: Voigt, Hendrik
last_name: Voigt
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Ruhroth T, Voigt H, Wehrheim H. Measure, Diagnose, Refactor: {A} Formal Quality
Cycle for Software Models. In: 35th Euromicro Conference on Software Engineering
and Advanced Applications, {SEAA} 2009, Patras, Greece, August 27-29, 2009, Proceedings.
; 2009:360--367. doi:10.1109/SEAA.2009.39'
apa: 'Ruhroth, T., Voigt, H., & Wehrheim, H. (2009). Measure, Diagnose, Refactor:
{A} Formal Quality Cycle for Software Models. In 35th Euromicro Conference
on Software Engineering and Advanced Applications, {SEAA} 2009, Patras, Greece,
August 27-29, 2009, Proceedings (pp. 360--367). https://doi.org/10.1109/SEAA.2009.39'
bibtex: '@inproceedings{Ruhroth_Voigt_Wehrheim_2009, title={Measure, Diagnose, Refactor:
{A} Formal Quality Cycle for Software Models}, DOI={10.1109/SEAA.2009.39},
booktitle={35th Euromicro Conference on Software Engineering and Advanced Applications,
{SEAA} 2009, Patras, Greece, August 27-29, 2009, Proceedings}, author={Ruhroth,
Thomas and Voigt, Hendrik and Wehrheim, Heike}, year={2009}, pages={360--367}
}'
chicago: 'Ruhroth, Thomas, Hendrik Voigt, and Heike Wehrheim. “Measure, Diagnose,
Refactor: {A} Formal Quality Cycle for Software Models.” In 35th Euromicro
Conference on Software Engineering and Advanced Applications, {SEAA} 2009, Patras,
Greece, August 27-29, 2009, Proceedings, 360--367, 2009. https://doi.org/10.1109/SEAA.2009.39.'
ieee: 'T. Ruhroth, H. Voigt, and H. Wehrheim, “Measure, Diagnose, Refactor: {A}
Formal Quality Cycle for Software Models,” in 35th Euromicro Conference on
Software Engineering and Advanced Applications, {SEAA} 2009, Patras, Greece, August
27-29, 2009, Proceedings, 2009, pp. 360--367.'
mla: 'Ruhroth, Thomas, et al. “Measure, Diagnose, Refactor: {A} Formal Quality Cycle
for Software Models.” 35th Euromicro Conference on Software Engineering and
Advanced Applications, {SEAA} 2009, Patras, Greece, August 27-29, 2009, Proceedings,
2009, pp. 360--367, doi:10.1109/SEAA.2009.39.'
short: 'T. Ruhroth, H. Voigt, H. Wehrheim, in: 35th Euromicro Conference on Software
Engineering and Advanced Applications, {SEAA} 2009, Patras, Greece, August 27-29,
2009, Proceedings, 2009, pp. 360--367.'
date_created: 2018-06-13T09:30:27Z
date_updated: 2022-01-06T06:59:04Z
department:
- _id: '77'
doi: 10.1109/SEAA.2009.39
page: 360--367
publication: 35th Euromicro Conference on Software Engineering and Advanced Applications,
{SEAA} 2009, Patras, Greece, August 27-29, 2009, Proceedings
status: public
title: 'Measure, Diagnose, Refactor: {A} Formal Quality Cycle for Software Models'
type: conference
user_id: '29719'
year: '2009'
...
---
_id: '3202'
citation:
ama: Leuschel M, Wehrheim H, eds. Integrated Formal Methods, 7th International
Conference, {IFM} 2009, D{\"{u}}sseldorf, Germany, February 16-19, 2009. Proceedings.;
2009. doi:10.1007/978-3-642-00255-7
apa: Leuschel, M., & Wehrheim, H. (Eds.). (2009). Integrated Formal Methods,
7th International Conference, {IFM} 2009, D{\"{u}}sseldorf, Germany, February
16-19, 2009. Proceedings. https://doi.org/10.1007/978-3-642-00255-7
bibtex: '@book{Leuschel_Wehrheim_2009, series={Lecture Notes in Computer Science},
title={Integrated Formal Methods, 7th International Conference, {IFM} 2009, D{\"{u}}sseldorf,
Germany, February 16-19, 2009. Proceedings}, DOI={10.1007/978-3-642-00255-7},
year={2009}, collection={Lecture Notes in Computer Science} }'
chicago: Leuschel, Michael, and Heike Wehrheim, eds. Integrated Formal Methods,
7th International Conference, {IFM} 2009, D{\"{u}}sseldorf, Germany, February
16-19, 2009. Proceedings. Lecture Notes in Computer Science, 2009. https://doi.org/10.1007/978-3-642-00255-7.
ieee: M. Leuschel and H. Wehrheim, Eds., Integrated Formal Methods, 7th International
Conference, {IFM} 2009, D{\"{u}}sseldorf, Germany, February 16-19, 2009. Proceedings.
2009.
mla: Leuschel, Michael, and Heike Wehrheim, editors. Integrated Formal Methods,
7th International Conference, {IFM} 2009, D{\"{u}}sseldorf, Germany, February
16-19, 2009. Proceedings. 2009, doi:10.1007/978-3-642-00255-7.
short: M. Leuschel, H. Wehrheim, eds., Integrated Formal Methods, 7th International
Conference, {IFM} 2009, D{\"{u}}sseldorf, Germany, February 16-19, 2009. Proceedings,
2009.
date_created: 2018-06-13T09:44:34Z
date_updated: 2022-01-06T06:59:04Z
department:
- _id: '77'
doi: 10.1007/978-3-642-00255-7
editor:
- first_name: Michael
full_name: Leuschel, Michael
last_name: Leuschel
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
publication_identifier:
isbn:
- 978-3-642-00254-0
series_title: Lecture Notes in Computer Science
status: public
title: Integrated Formal Methods, 7th International Conference, {IFM} 2009, D{\"{u}}sseldorf,
Germany, February 16-19, 2009. Proceedings
type: conference_editor
user_id: '29719'
year: '2009'
...
---
_id: '3203'
author:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Wehrheim H. Refinement in the Presence of Unknowns. Electr Notes Theor Comput
Sci. 2008:255--264. doi:10.1016/j.entcs.2008.02.023
apa: Wehrheim, H. (2008). Refinement in the Presence of Unknowns. Electr. Notes
Theor. Comput. Sci., 255--264. https://doi.org/10.1016/j.entcs.2008.02.023
bibtex: '@article{Wehrheim_2008, title={Refinement in the Presence of Unknowns},
DOI={10.1016/j.entcs.2008.02.023},
journal={Electr. Notes Theor. Comput. Sci.}, author={Wehrheim, Heike}, year={2008},
pages={255--264} }'
chicago: Wehrheim, Heike. “Refinement in the Presence of Unknowns.” Electr. Notes
Theor. Comput. Sci., 2008, 255--264. https://doi.org/10.1016/j.entcs.2008.02.023.
ieee: H. Wehrheim, “Refinement in the Presence of Unknowns,” Electr. Notes Theor.
Comput. Sci., pp. 255--264, 2008.
mla: Wehrheim, Heike. “Refinement in the Presence of Unknowns.” Electr. Notes
Theor. Comput. Sci., 2008, pp. 255--264, doi:10.1016/j.entcs.2008.02.023.
short: H. Wehrheim, Electr. Notes Theor. Comput. Sci. (2008) 255--264.
date_created: 2018-06-13T09:45:42Z
date_updated: 2022-01-06T06:59:04Z
department:
- _id: '77'
doi: 10.1016/j.entcs.2008.02.023
page: 255--264
publication: Electr. Notes Theor. Comput. Sci.
status: public
title: Refinement in the Presence of Unknowns
type: journal_article
user_id: '29719'
year: '2008'
...
---
_id: '3204'
author:
- first_name: H.{-}Christian
full_name: Estler, H.{-}Christian
last_name: Estler
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Estler H.-}Christian, Wehrheim H. Alloy as a Refactoring Checker? Electr
Notes Theor Comput Sci. 2008:331--357. doi:10.1016/j.entcs.2008.06.015
apa: Estler, H. .-}Christian, & Wehrheim, H. (2008). Alloy as a Refactoring
Checker? Electr. Notes Theor. Comput. Sci., 331--357. https://doi.org/10.1016/j.entcs.2008.06.015
bibtex: '@article{Estler_Wehrheim_2008, title={Alloy as a Refactoring Checker?},
DOI={10.1016/j.entcs.2008.06.015},
journal={Electr. Notes Theor. Comput. Sci.}, author={Estler, H.{-}Christian and
Wehrheim, Heike}, year={2008}, pages={331--357} }'
chicago: Estler, H.{-}Christian, and Heike Wehrheim. “Alloy as a Refactoring Checker?”
Electr. Notes Theor. Comput. Sci., 2008, 331--357. https://doi.org/10.1016/j.entcs.2008.06.015.
ieee: H. .-}Christian Estler and H. Wehrheim, “Alloy as a Refactoring Checker?,”
Electr. Notes Theor. Comput. Sci., pp. 331--357, 2008.
mla: Estler, H. .. }Christian, and Heike Wehrheim. “Alloy as a Refactoring Checker?”
Electr. Notes Theor. Comput. Sci., 2008, pp. 331--357, doi:10.1016/j.entcs.2008.06.015.
short: H..-}Christian Estler, H. Wehrheim, Electr. Notes Theor. Comput. Sci. (2008)
331--357.
date_created: 2018-06-13T09:47:06Z
date_updated: 2022-01-06T06:59:04Z
department:
- _id: '77'
doi: 10.1016/j.entcs.2008.06.015
page: 331--357
publication: Electr. Notes Theor. Comput. Sci.
status: public
title: Alloy as a Refactoring Checker?
type: journal_article
user_id: '29719'
year: '2008'
...