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