---
_id: '20279'
author:
- first_name: Arnab
  full_name: Sharma, Arnab
  id: '67200'
  last_name: Sharma
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: Sharma A, Wehrheim H. Testing Monotonicity of Machine Learning Models. <i>CoRR</i>.
    2020;abs/2002.12278.
  apa: Sharma, A., &#38; Wehrheim, H. (2020). Testing Monotonicity of Machine Learning
    Models. <i>CoRR</i>, <i>abs/2002.12278</i>.
  bibtex: '@article{Sharma_Wehrheim_2020, title={Testing Monotonicity of Machine Learning
    Models}, volume={abs/2002.12278}, journal={CoRR}, author={Sharma, Arnab and Wehrheim,
    Heike}, year={2020} }'
  chicago: Sharma, Arnab, and Heike Wehrheim. “Testing Monotonicity of Machine Learning
    Models.” <i>CoRR</i> abs/2002.12278 (2020).
  ieee: A. Sharma and H. Wehrheim, “Testing Monotonicity of Machine Learning Models,”
    <i>CoRR</i>, vol. abs/2002.12278, 2020.
  mla: Sharma, Arnab, and Heike Wehrheim. “Testing Monotonicity of Machine Learning
    Models.” <i>CoRR</i>, vol. abs/2002.12278, 2020.
  short: A. Sharma, H. Wehrheim, CoRR abs/2002.12278 (2020).
date_created: 2020-11-04T08:48:04Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '77'
language:
- iso: eng
publication: CoRR
status: public
title: Testing Monotonicity of Machine Learning Models
type: journal_article
user_id: '29719'
volume: abs/2002.12278
year: '2020'
...
---
_id: '21016'
author:
- first_name: Sadegh
  full_name: Dalvandi, Sadegh
  last_name: Dalvandi
- first_name: Simon
  full_name: Doherty, Simon
  last_name: Doherty
- first_name: Brijesh
  full_name: Dongol, Brijesh
  last_name: Dongol
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: Dalvandi S, Doherty S, Dongol B, Wehrheim H. Owicki-Gries Reasoning for C11
    RAR (Artifact). <i>Dagstuhl Artifacts Ser</i>. 2020;6(2):15:1-15:2. doi:<a href="https://doi.org/10.4230/DARTS.6.2.15">10.4230/DARTS.6.2.15</a>
  apa: Dalvandi, S., Doherty, S., Dongol, B., &#38; Wehrheim, H. (2020). Owicki-Gries
    Reasoning for C11 RAR (Artifact). <i>Dagstuhl Artifacts Ser.</i>, <i>6</i>(2),
    15:1-15:2. <a href="https://doi.org/10.4230/DARTS.6.2.15">https://doi.org/10.4230/DARTS.6.2.15</a>
  bibtex: '@article{Dalvandi_Doherty_Dongol_Wehrheim_2020, title={Owicki-Gries Reasoning
    for C11 RAR (Artifact)}, volume={6}, DOI={<a href="https://doi.org/10.4230/DARTS.6.2.15">10.4230/DARTS.6.2.15</a>},
    number={2}, journal={Dagstuhl Artifacts Ser.}, author={Dalvandi, Sadegh and Doherty,
    Simon and Dongol, Brijesh and Wehrheim, Heike}, year={2020}, pages={15:1-15:2}
    }'
  chicago: 'Dalvandi, Sadegh, Simon Doherty, Brijesh Dongol, and Heike Wehrheim. “Owicki-Gries
    Reasoning for C11 RAR (Artifact).” <i>Dagstuhl Artifacts Ser.</i> 6, no. 2 (2020):
    15:1-15:2. <a href="https://doi.org/10.4230/DARTS.6.2.15">https://doi.org/10.4230/DARTS.6.2.15</a>.'
  ieee: S. Dalvandi, S. Doherty, B. Dongol, and H. Wehrheim, “Owicki-Gries Reasoning
    for C11 RAR (Artifact),” <i>Dagstuhl Artifacts Ser.</i>, vol. 6, no. 2, pp. 15:1-15:2,
    2020.
  mla: Dalvandi, Sadegh, et al. “Owicki-Gries Reasoning for C11 RAR (Artifact).” <i>Dagstuhl
    Artifacts Ser.</i>, vol. 6, no. 2, 2020, pp. 15:1-15:2, doi:<a href="https://doi.org/10.4230/DARTS.6.2.15">10.4230/DARTS.6.2.15</a>.
  short: S. Dalvandi, S. Doherty, B. Dongol, H. Wehrheim, Dagstuhl Artifacts Ser.
    6 (2020) 15:1-15:2.
date_created: 2021-01-19T10:25:27Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '77'
doi: 10.4230/DARTS.6.2.15
intvolume: '         6'
issue: '2'
language:
- iso: eng
page: 15:1-15:2
publication: Dagstuhl Artifacts Ser.
status: public
title: Owicki-Gries Reasoning for C11 RAR (Artifact)
type: journal_article
user_id: '29719'
volume: 6
year: '2020'
...
---
_id: '21017'
author:
- first_name: Sadegh
  full_name: Dalvandi, Sadegh
  last_name: Dalvandi
- first_name: Simon
  full_name: Doherty, Simon
  last_name: Doherty
- first_name: Brijesh
  full_name: Dongol, Brijesh
  last_name: Dongol
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Dalvandi S, Doherty S, Dongol B, Wehrheim H. Owicki-Gries Reasoning for C11
    RAR. In: Hirschfeld R, Pape T, eds. <i>34th European Conference on Object-Oriented
    Programming, {ECOOP} 2020, November 15-17, 2020, Berlin, Germany (Virtual Conference)</i>.
    Vol 166. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik; 2020:11:1-11:26.
    doi:<a href="https://doi.org/10.4230/LIPIcs.ECOOP.2020.11">10.4230/LIPIcs.ECOOP.2020.11</a>'
  apa: Dalvandi, S., Doherty, S., Dongol, B., &#38; Wehrheim, H. (2020). Owicki-Gries
    Reasoning for C11 RAR. In R. Hirschfeld &#38; T. Pape (Eds.), <i>34th European
    Conference on Object-Oriented Programming, {ECOOP} 2020, November 15-17, 2020,
    Berlin, Germany (Virtual Conference)</i> (Vol. 166, pp. 11:1-11:26). Schloss Dagstuhl
    - Leibniz-Zentrum f{\"{u}}r Informatik. <a href="https://doi.org/10.4230/LIPIcs.ECOOP.2020.11">https://doi.org/10.4230/LIPIcs.ECOOP.2020.11</a>
  bibtex: '@inproceedings{Dalvandi_Doherty_Dongol_Wehrheim_2020, series={LIPIcs},
    title={Owicki-Gries Reasoning for C11 RAR}, volume={166}, DOI={<a href="https://doi.org/10.4230/LIPIcs.ECOOP.2020.11">10.4230/LIPIcs.ECOOP.2020.11</a>},
    booktitle={34th European Conference on Object-Oriented Programming, {ECOOP} 2020,
    November 15-17, 2020, Berlin, Germany (Virtual Conference)}, publisher={Schloss
    Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, author={Dalvandi, Sadegh and
    Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike}, editor={Hirschfeld, Robert
    and Pape, TobiasEditors}, year={2020}, pages={11:1-11:26}, collection={LIPIcs}
    }'
  chicago: Dalvandi, Sadegh, Simon Doherty, Brijesh Dongol, and Heike Wehrheim. “Owicki-Gries
    Reasoning for C11 RAR.” In <i>34th European Conference on Object-Oriented Programming,
    {ECOOP} 2020, November 15-17, 2020, Berlin, Germany (Virtual Conference)</i>,
    edited by Robert Hirschfeld and Tobias Pape, 166:11:1-11:26. LIPIcs. Schloss Dagstuhl
    - Leibniz-Zentrum f{\"{u}}r Informatik, 2020. <a href="https://doi.org/10.4230/LIPIcs.ECOOP.2020.11">https://doi.org/10.4230/LIPIcs.ECOOP.2020.11</a>.
  ieee: S. Dalvandi, S. Doherty, B. Dongol, and H. Wehrheim, “Owicki-Gries Reasoning
    for C11 RAR,” in <i>34th European Conference on Object-Oriented Programming, {ECOOP}
    2020, November 15-17, 2020, Berlin, Germany (Virtual Conference)</i>, 2020, vol.
    166, pp. 11:1-11:26.
  mla: Dalvandi, Sadegh, et al. “Owicki-Gries Reasoning for C11 RAR.” <i>34th European
    Conference on Object-Oriented Programming, {ECOOP} 2020, November 15-17, 2020,
    Berlin, Germany (Virtual Conference)</i>, edited by Robert Hirschfeld and Tobias
    Pape, vol. 166, Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, 2020,
    pp. 11:1-11:26, doi:<a href="https://doi.org/10.4230/LIPIcs.ECOOP.2020.11">10.4230/LIPIcs.ECOOP.2020.11</a>.
  short: 'S. Dalvandi, S. Doherty, B. Dongol, H. Wehrheim, in: R. Hirschfeld, T. Pape
    (Eds.), 34th European Conference on Object-Oriented Programming, {ECOOP} 2020,
    November 15-17, 2020, Berlin, Germany (Virtual Conference), Schloss Dagstuhl -
    Leibniz-Zentrum f{\"{u}}r Informatik, 2020, pp. 11:1-11:26.'
date_created: 2021-01-19T10:29:44Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '77'
doi: 10.4230/LIPIcs.ECOOP.2020.11
editor:
- first_name: Robert
  full_name: Hirschfeld, Robert
  last_name: Hirschfeld
- first_name: Tobias
  full_name: Pape, Tobias
  last_name: Pape
intvolume: '       166'
language:
- iso: eng
page: 11:1-11:26
publication: 34th European Conference on Object-Oriented Programming, {ECOOP} 2020,
  November 15-17, 2020, Berlin, Germany (Virtual Conference)
publisher: Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik
series_title: LIPIcs
status: public
title: Owicki-Gries Reasoning for C11 RAR
type: conference
user_id: '29719'
volume: 166
year: '2020'
...
---
_id: '21018'
author:
- first_name: Cedric
  full_name: Richter, Cedric
  id: '50003'
  last_name: Richter
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Richter C, Wehrheim H. Attend and Represent: A Novel View on Algorithm Selection
    for Software Verification. In: <i>35th {IEEE/ACM} International Conference on
    Automated Software Engineering, {ASE} 2020, Melbourne, Australia, September 21-25,
    2020</i>. {IEEE}; 2020:1016-1028.'
  apa: 'Richter, C., &#38; Wehrheim, H. (2020). Attend and Represent: A Novel View
    on Algorithm Selection for Software Verification. In <i>35th {IEEE/ACM} International
    Conference on Automated Software Engineering, {ASE} 2020, Melbourne, Australia,
    September 21-25, 2020</i> (pp. 1016–1028). {IEEE}.'
  bibtex: '@inproceedings{Richter_Wehrheim_2020, title={Attend and Represent: A Novel
    View on Algorithm Selection for Software Verification}, booktitle={35th {IEEE/ACM}
    International Conference on Automated Software Engineering, {ASE} 2020, Melbourne,
    Australia, September 21-25, 2020}, publisher={{IEEE}}, author={Richter, Cedric
    and Wehrheim, Heike}, year={2020}, pages={1016–1028} }'
  chicago: 'Richter, Cedric, and Heike Wehrheim. “Attend and Represent: A Novel View
    on Algorithm Selection for Software Verification.” In <i>35th {IEEE/ACM} International
    Conference on Automated Software Engineering, {ASE} 2020, Melbourne, Australia,
    September 21-25, 2020</i>, 1016–28. {IEEE}, 2020.'
  ieee: 'C. Richter and H. Wehrheim, “Attend and Represent: A Novel View on Algorithm
    Selection for Software Verification,” in <i>35th {IEEE/ACM} International Conference
    on Automated Software Engineering, {ASE} 2020, Melbourne, Australia, September
    21-25, 2020</i>, 2020, pp. 1016–1028.'
  mla: 'Richter, Cedric, and Heike Wehrheim. “Attend and Represent: A Novel View on
    Algorithm Selection for Software Verification.” <i>35th {IEEE/ACM} International
    Conference on Automated Software Engineering, {ASE} 2020, Melbourne, Australia,
    September 21-25, 2020</i>, {IEEE}, 2020, pp. 1016–28.'
  short: 'C. Richter, H. Wehrheim, in: 35th {IEEE/ACM} International Conference on
    Automated Software Engineering, {ASE} 2020, Melbourne, Australia, September 21-25,
    2020, {IEEE}, 2020, pp. 1016–1028.'
date_created: 2021-01-19T10:32:17Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '77'
language:
- iso: eng
page: 1016-1028
publication: 35th {IEEE/ACM} International Conference on Automated Software Engineering,
  {ASE} 2020, Melbourne, Australia, September 21-25, 2020
publisher: '{IEEE}'
status: public
title: 'Attend and Represent: A Novel View on Algorithm Selection for Software Verification'
type: conference
user_id: '29719'
year: '2020'
...
---
_id: '21019'
citation:
  ama: Ahrendt W, Wehrheim H, eds. <i>Tests and Proofs - 14th International Conference,
    TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [Postponed]</i>.
    Vol 12165. Springer; 2020. doi:<a href="https://doi.org/10.1007/978-3-030-50995-8">10.1007/978-3-030-50995-8</a>
  apa: Ahrendt, W., &#38; Wehrheim, H. (Eds.). (2020). <i>Tests and Proofs - 14th
    International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings
    [postponed]</i> (Vol. 12165). Springer. <a href="https://doi.org/10.1007/978-3-030-50995-8">https://doi.org/10.1007/978-3-030-50995-8</a>
  bibtex: '@book{Ahrendt_Wehrheim_2020, series={Lecture Notes in Computer Science},
    title={Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen,
    Norway, June 22-23, 2020, Proceedings [postponed]}, volume={12165}, DOI={<a href="https://doi.org/10.1007/978-3-030-50995-8">10.1007/978-3-030-50995-8</a>},
    publisher={Springer}, year={2020}, collection={Lecture Notes in Computer Science}
    }'
  chicago: Ahrendt, Wolfgang, and Heike Wehrheim, eds. <i>Tests and Proofs - 14th
    International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings
    [Postponed]</i>. Vol. 12165. Lecture Notes in Computer Science. Springer, 2020.
    <a href="https://doi.org/10.1007/978-3-030-50995-8">https://doi.org/10.1007/978-3-030-50995-8</a>.
  ieee: W. Ahrendt and H. Wehrheim, Eds., <i>Tests and Proofs - 14th International
    Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed]</i>,
    vol. 12165. Springer, 2020.
  mla: Ahrendt, Wolfgang, and Heike Wehrheim, editors. <i>Tests and Proofs - 14th
    International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings
    [Postponed]</i>. Vol. 12165, Springer, 2020, doi:<a href="https://doi.org/10.1007/978-3-030-50995-8">10.1007/978-3-030-50995-8</a>.
  short: W. Ahrendt, H. Wehrheim, eds., Tests and Proofs - 14th International Conference,
    TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [Postponed], Springer,
    2020.
date_created: 2021-01-19T10:35:37Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '77'
doi: 10.1007/978-3-030-50995-8
editor:
- first_name: Wolfgang
  full_name: Ahrendt, Wolfgang
  last_name: Ahrendt
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
intvolume: '     12165'
language:
- iso: eng
publication_identifier:
  isbn:
  - 978-3-030-50994-1
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway,
  June 22-23, 2020, Proceedings [postponed]
type: conference_editor
user_id: '29719'
volume: 12165
year: '2020'
...
---
_id: '17825'
abstract:
- lang: eng
  text: "Software verification has recently made enormous progress due to the\r\ndevelopment
    of novel verification methods and the speed-up of supporting\r\ntechnologies like
    SMT solving. To keep software verification tools up to date\r\nwith these advances,
    tool developers keep on integrating newly designed methods\r\ninto their tools,
    almost exclusively by re-implementing the method within their\r\nown framework.
    While this allows for a conceptual re-use of methods, it\r\nrequires novel implementations
    for every new technique.\r\n  In this paper, we employ cooperative verification
    in order to avoid\r\nreimplementation and enable usage of novel tools as black-box
    components in\r\nverification. Specifically, cooperation is employed for the core
    ingredient of\r\nsoftware verification which is invariant generation. Finding
    an adequate loop\r\ninvariant is key to the success of a verification run. Our
    framework named\r\nCoVerCIG allows a master verification tool to delegate the
    task of invariant\r\ngeneration to one or several specialized helper invariant
    generators. Their\r\nresults are then utilized within the verification run of
    the master verifier,\r\nallowing in particular for crosschecking the validity
    of the invariant. We\r\nexperimentally evaluate our framework on an instance with
    two masters and three\r\ndifferent invariant generators using a number of benchmarks
    from SV-COMP 2020.\r\nThe experiments show that the use of CoVerCIG can increase
    the number of\r\ncorrectly verified tasks without increasing the used resources"
author:
- first_name: Jan Frederik
  full_name: Haltermann, Jan Frederik
  id: '44413'
  last_name: Haltermann
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: Haltermann JF, Wehrheim H. Cooperative Verification via Collective Invariant
    Generation. <i>arXiv:200804551</i>. 2020.
  apa: Haltermann, J. F., &#38; Wehrheim, H. (2020). Cooperative Verification via
    Collective Invariant Generation. <i>ArXiv:2008.04551</i>.
  bibtex: '@article{Haltermann_Wehrheim_2020, title={Cooperative Verification via
    Collective Invariant Generation}, journal={arXiv:2008.04551}, author={Haltermann,
    Jan Frederik and Wehrheim, Heike}, year={2020} }'
  chicago: Haltermann, Jan Frederik, and Heike Wehrheim. “Cooperative Verification
    via Collective Invariant Generation.” <i>ArXiv:2008.04551</i>, 2020.
  ieee: J. F. Haltermann and H. Wehrheim, “Cooperative Verification via Collective
    Invariant Generation,” <i>arXiv:2008.04551</i>. 2020.
  mla: Haltermann, Jan Frederik, and Heike Wehrheim. “Cooperative Verification via
    Collective Invariant Generation.” <i>ArXiv:2008.04551</i>, 2020.
  short: J.F. Haltermann, H. Wehrheim, ArXiv:2008.04551 (2020).
date_created: 2020-08-12T06:49:18Z
date_updated: 2022-01-06T06:53:20Z
department:
- _id: '77'
language:
- iso: eng
project:
- _id: '85'
  name: Kooperative Softwareverifikation
publication: arXiv:2008.04551
status: public
title: Cooperative Verification via Collective Invariant Generation
type: preprint
user_id: '44413'
year: '2020'
...
---
_id: '16724'
author:
- first_name: Arnab
  full_name: Sharma, Arnab
  id: '67200'
  last_name: Sharma
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Sharma A, Wehrheim H. Higher Income, Larger Loan? Monotonicity Testing of
    Machine Learning Models. In: <i>Proceedings of the ACM SIGSOFT International Symposium
    on Software Testing and Analysis (ISSTA).</i> ACM.'
  apa: Sharma, A., &#38; Wehrheim, H. (n.d.). Higher Income, Larger Loan? Monotonicity
    Testing of Machine Learning Models. In <i>Proceedings of the ACM SIGSOFT International
    Symposium on Software Testing and Analysis (ISSTA).</i> ACM.
  bibtex: '@inproceedings{Sharma_Wehrheim, title={Higher Income, Larger Loan? Monotonicity
    Testing of Machine Learning Models}, booktitle={Proceedings of the ACM SIGSOFT
    International Symposium on Software Testing and Analysis (ISSTA).}, publisher={ACM},
    author={Sharma, Arnab and Wehrheim, Heike} }'
  chicago: Sharma, Arnab, and Heike Wehrheim. “Higher Income, Larger Loan? Monotonicity
    Testing of Machine Learning Models.” In <i>Proceedings of the ACM SIGSOFT International
    Symposium on Software Testing and Analysis (ISSTA).</i> ACM, n.d.
  ieee: A. Sharma and H. Wehrheim, “Higher Income, Larger Loan? Monotonicity Testing
    of Machine Learning Models,” in <i>Proceedings of the ACM SIGSOFT International
    Symposium on Software Testing and Analysis (ISSTA).</i>
  mla: Sharma, Arnab, and Heike Wehrheim. “Higher Income, Larger Loan? Monotonicity
    Testing of Machine Learning Models.” <i>Proceedings of the ACM SIGSOFT International
    Symposium on Software Testing and Analysis (ISSTA).</i>, ACM.
  short: 'A. Sharma, H. Wehrheim, in: Proceedings of the ACM SIGSOFT International
    Symposium on Software Testing and Analysis (ISSTA)., ACM, n.d.'
date_created: 2020-04-19T14:01:53Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '7'
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '11'
  name: SFB 901 - Subproject B3
publication: Proceedings of the ACM SIGSOFT International Symposium on Software Testing
  and Analysis (ISSTA).
publication_status: accepted
publisher: ACM
status: public
title: Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models
type: conference
user_id: '477'
year: '2020'
...
---
_id: '16725'
author:
- first_name: Cedric
  full_name: Richter, Cedric
  id: '50003'
  last_name: Richter
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
- first_name: Marie-Christine
  full_name: Jakobs, Marie-Christine
  last_name: Jakobs
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: Richter C, Hüllermeier E, Jakobs M-C, Wehrheim H. Algorithm Selection for Software
    Validation Based on Graph Kernels. <i>Journal of Automated Software Engineering</i>.
  apa: Richter, C., Hüllermeier, E., Jakobs, M.-C., &#38; Wehrheim, H. (n.d.). Algorithm
    Selection for Software Validation Based on Graph Kernels. <i>Journal of Automated
    Software Engineering</i>.
  bibtex: '@article{Richter_Hüllermeier_Jakobs_Wehrheim, title={Algorithm Selection
    for Software Validation Based on Graph Kernels}, journal={Journal of Automated
    Software Engineering}, publisher={Springer}, author={Richter, Cedric and Hüllermeier,
    Eyke and Jakobs, Marie-Christine and Wehrheim, Heike} }'
  chicago: Richter, Cedric, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim.
    “Algorithm Selection for Software Validation Based on Graph Kernels.” <i>Journal
    of Automated Software Engineering</i>, n.d.
  ieee: C. Richter, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Algorithm Selection
    for Software Validation Based on Graph Kernels,” <i>Journal of Automated Software
    Engineering</i>.
  mla: Richter, Cedric, et al. “Algorithm Selection for Software Validation Based
    on Graph Kernels.” <i>Journal of Automated Software Engineering</i>, Springer.
  short: C. Richter, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Journal of Automated
    Software Engineering (n.d.).
date_created: 2020-04-19T14:08:06Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '7'
- _id: '77'
- _id: '355'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '11'
  name: SFB 901 - Subproject B3
- _id: '12'
  name: SFB 901 - Subproject B4
publication: Journal of Automated Software Engineering
publication_status: accepted
publisher: Springer
status: public
title: Algorithm Selection for Software Validation Based on Graph Kernels
type: journal_article
user_id: '477'
year: '2020'
...
---
_id: '13770'
author:
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Karl H, Kundisch D, Meyer auf der Heide F, Wehrheim H. A Case for a New IT
    Ecosystem: On-The-Fly Computing. <i>Business &#38; Information Systems Engineering</i>.
    2020;62(6):467-481. doi:<a href="https://doi.org/10.1007/s12599-019-00627-x">10.1007/s12599-019-00627-x</a>'
  apa: 'Karl, H., Kundisch, D., Meyer auf der Heide, F., &#38; Wehrheim, H. (2020).
    A Case for a New IT Ecosystem: On-The-Fly Computing. <i>Business &#38; Information
    Systems Engineering</i>, <i>62</i>(6), 467–481. <a href="https://doi.org/10.1007/s12599-019-00627-x">https://doi.org/10.1007/s12599-019-00627-x</a>'
  bibtex: '@article{Karl_Kundisch_Meyer auf der Heide_Wehrheim_2020, title={A Case
    for a New IT Ecosystem: On-The-Fly Computing}, volume={62}, DOI={<a href="https://doi.org/10.1007/s12599-019-00627-x">10.1007/s12599-019-00627-x</a>},
    number={6}, journal={Business &#38; Information Systems Engineering}, publisher={Springer},
    author={Karl, Holger and Kundisch, Dennis and Meyer auf der Heide, Friedhelm and
    Wehrheim, Heike}, year={2020}, pages={467–481} }'
  chicago: 'Karl, Holger, Dennis Kundisch, Friedhelm Meyer auf der Heide, and Heike
    Wehrheim. “A Case for a New IT Ecosystem: On-The-Fly Computing.” <i>Business &#38;
    Information Systems Engineering</i> 62, no. 6 (2020): 467–81. <a href="https://doi.org/10.1007/s12599-019-00627-x">https://doi.org/10.1007/s12599-019-00627-x</a>.'
  ieee: 'H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for
    a New IT Ecosystem: On-The-Fly Computing,” <i>Business &#38; Information Systems
    Engineering</i>, vol. 62, no. 6, pp. 467–481, 2020, doi: <a href="https://doi.org/10.1007/s12599-019-00627-x">10.1007/s12599-019-00627-x</a>.'
  mla: 'Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.”
    <i>Business &#38; Information Systems Engineering</i>, vol. 62, no. 6, Springer,
    2020, pp. 467–81, doi:<a href="https://doi.org/10.1007/s12599-019-00627-x">10.1007/s12599-019-00627-x</a>.'
  short: H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business &#38;
    Information Systems Engineering 62 (2020) 467–481.
date_created: 2019-10-10T13:41:06Z
date_updated: 2022-12-02T09:27:17Z
ddc:
- '004'
department:
- _id: '276'
- _id: '75'
- _id: '63'
- _id: '77'
doi: 10.1007/s12599-019-00627-x
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2019-12-12T10:24:47Z
  date_updated: 2019-12-12T10:24:47Z
  file_id: '15311'
  file_name: Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf
  file_size: 454532
  relation: main_file
  success: 1
file_date_updated: 2019-12-12T10:24:47Z
has_accepted_license: '1'
intvolume: '        62'
issue: '6'
language:
- iso: eng
page: 467-481
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '82'
  name: SFB 901 - Project Area T
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '6'
  name: SFB 901 - Subproject A2
- _id: '7'
  name: SFB 901 - Subproject A3
- _id: '8'
  name: SFB 901 - Subproject A4
- _id: '9'
  name: SFB 901 - Subproject B1
- _id: '10'
  name: SFB 901 - Subproject B2
- _id: '11'
  name: SFB 901 - Subproject B3
- _id: '12'
  name: SFB 901 - Subproject B4
- _id: '13'
  name: SFB 901 - Subproject C1
- _id: '14'
  name: SFB 901 - Subproject C2
- _id: '15'
  name: SFB 901 - Subproject C3
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '17'
  name: SFB 901 - Subproject C5
- _id: '83'
  name: SFB 901 -Subproject T1
- _id: '84'
  name: SFB 901 -Subproject T2
- _id: '107'
  name: SFB 901 -Subproject T3
- _id: '158'
  name: 'SFB 901 - T4: SFB 901 -Subproject T4'
publication: Business & Information Systems Engineering
publication_status: published
publisher: Springer
status: public
title: 'A Case for a New IT Ecosystem: On-The-Fly Computing'
type: journal_article
user_id: '477'
volume: 62
year: '2020'
...
---
_id: '16214'
author:
- first_name: Felix
  full_name: Pauck, Felix
  id: '22398'
  last_name: Pauck
- first_name: Eric
  full_name: Bodden, Eric
  id: '59256'
  last_name: Bodden
  orcid: 0000-0003-3470-3647
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Pauck F, Bodden E, Wehrheim H. Reproducing Taint-Analysis Results with ReproDroid.
    In: Felderer M, Hasselbring W, Rabiser R, Jung R, eds. <i>Software Engineering
    2020, Fachtagung Des GI-Fachbereichs Softwaretechnik, 24.-28. Februar 2020, Innsbruck,
    Austria</i>. {LNI}. Gesellschaft f{\"{u}}r Informatik e.V.; 2020:123-124. doi:<a
    href="https://doi.org/10.18420/SE2020_36">10.18420/SE2020_36</a>'
  apa: Pauck, F., Bodden, E., &#38; Wehrheim, H. (2020). Reproducing Taint-Analysis
    Results with ReproDroid. In M. Felderer, W. Hasselbring, R. Rabiser, &#38; R.
    Jung (Eds.), <i>Software Engineering 2020, Fachtagung des GI-Fachbereichs Softwaretechnik,
    24.-28. Februar 2020, Innsbruck, Austria</i> (pp. 123–124). Gesellschaft f{\"{u}}r
    Informatik e.V. <a href="https://doi.org/10.18420/SE2020_36">https://doi.org/10.18420/SE2020_36</a>
  bibtex: '@inproceedings{Pauck_Bodden_Wehrheim_2020, series={{LNI}}, title={Reproducing
    Taint-Analysis Results with ReproDroid}, DOI={<a href="https://doi.org/10.18420/SE2020_36">10.18420/SE2020_36</a>},
    booktitle={Software Engineering 2020, Fachtagung des GI-Fachbereichs Softwaretechnik,
    24.-28. Februar 2020, Innsbruck, Austria}, publisher={Gesellschaft f{\"{u}}r Informatik
    e.V.}, author={Pauck, Felix and Bodden, Eric and Wehrheim, Heike}, editor={Felderer,
    Michael and Hasselbring, Wilhelm and Rabiser, Rick and Jung, Reiner}, year={2020},
    pages={123–124}, collection={{LNI}} }'
  chicago: Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Reproducing Taint-Analysis
    Results with ReproDroid.” In <i>Software Engineering 2020, Fachtagung Des GI-Fachbereichs
    Softwaretechnik, 24.-28. Februar 2020, Innsbruck, Austria</i>, edited by Michael
    Felderer, Wilhelm Hasselbring, Rick Rabiser, and Reiner Jung, 123–24. {LNI}. Gesellschaft
    f{\"{u}}r Informatik e.V., 2020. <a href="https://doi.org/10.18420/SE2020_36">https://doi.org/10.18420/SE2020_36</a>.
  ieee: 'F. Pauck, E. Bodden, and H. Wehrheim, “Reproducing Taint-Analysis Results
    with ReproDroid,” in <i>Software Engineering 2020, Fachtagung des GI-Fachbereichs
    Softwaretechnik, 24.-28. Februar 2020, Innsbruck, Austria</i>, 2020, pp. 123–124,
    doi: <a href="https://doi.org/10.18420/SE2020_36">10.18420/SE2020_36</a>.'
  mla: Pauck, Felix, et al. “Reproducing Taint-Analysis Results with ReproDroid.”
    <i>Software Engineering 2020, Fachtagung Des GI-Fachbereichs Softwaretechnik,
    24.-28. Februar 2020, Innsbruck, Austria</i>, edited by Michael Felderer et al.,
    Gesellschaft f{\"{u}}r Informatik e.V., 2020, pp. 123–24, doi:<a href="https://doi.org/10.18420/SE2020_36">10.18420/SE2020_36</a>.
  short: 'F. Pauck, E. Bodden, H. Wehrheim, in: M. Felderer, W. Hasselbring, R. Rabiser,
    R. Jung (Eds.), Software Engineering 2020, Fachtagung Des GI-Fachbereichs Softwaretechnik,
    24.-28. Februar 2020, Innsbruck, Austria, Gesellschaft f{\"{u}}r Informatik e.V.,
    2020, pp. 123–124.'
date_created: 2020-03-03T08:10:33Z
date_updated: 2023-01-18T08:39:53Z
department:
- _id: '34'
- _id: '77'
doi: 10.18420/SE2020_36
editor:
- first_name: Michael
  full_name: Felderer, Michael
  last_name: Felderer
- first_name: Wilhelm
  full_name: Hasselbring, Wilhelm
  last_name: Hasselbring
- first_name: Rick
  full_name: Rabiser, Rick
  last_name: Rabiser
- first_name: Reiner
  full_name: Jung, Reiner
  last_name: Jung
language:
- iso: eng
page: 123-124
publication: Software Engineering 2020, Fachtagung des GI-Fachbereichs Softwaretechnik,
  24.-28. Februar 2020, Innsbruck, Austria
publication_status: published
publisher: Gesellschaft f{\"{u}}r Informatik e.V.
series_title: '{LNI}'
status: public
title: Reproducing Taint-Analysis Results with ReproDroid
type: conference
user_id: '22398'
year: '2020'
...
---
_id: '3287'
abstract:
- lang: eng
  text: "For optimal placement and orchestration of network services, it is crucial\r\nthat
    their structure and semantics are specified clearly and comprehensively\r\nand
    are available to an orchestrator. Existing specification approaches are\r\neither
    ambiguous or miss important aspects regarding the behavior of virtual\r\nnetwork
    functions (VNFs) forming a service. We propose to formally and\r\nunambiguously
    specify the behavior of these functions and services using\r\nQueuing Petri Nets
    (QPNs). QPNs are an established method that allows to\r\nexpress queuing, synchronization,
    stochastically distributed processing delays,\r\nand changing traffic volume and
    characteristics at each VNF. With QPNs,\r\nmultiple VNFs can be connected to complete
    network services in any structure,\r\neven specifying bidirectional network services
    containing loops.\r\n  We discuss how management and orchestration systems can
    benefit from our\r\nclear and comprehensive specification approach, leading to
    better placement of\r\nVNFs and improved Quality of Service. Another benefit of
    formally specifying\r\nnetwork services with QPNs are diverse analysis options,
    which allow valuable\r\ninsights such as the distribution of end-to-end delay.
    We propose a tool-based\r\nworkflow that supports the specification of network
    services and the automatic\r\ngeneration of corresponding simulation code to enable
    an in-depth analysis of\r\ntheir behavior and performance."
author:
- first_name: Stefan Balthasar
  full_name: Schneider, Stefan Balthasar
  id: '35343'
  last_name: Schneider
  orcid: 0000-0001-8210-4011
- first_name: Arnab
  full_name: Sharma, Arnab
  id: '67200'
  last_name: Sharma
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Schneider SB, Sharma A, Karl H, Wehrheim H. Specifying and Analyzing Virtual
    Network Services Using Queuing Petri Nets. In: <i>2019 IFIP/IEEE International
    Symposium on Integrated Network Management (IM)</i>. Washington, DC, USA: IFIP;
    2019:116--124.'
  apa: 'Schneider, S. B., Sharma, A., Karl, H., &#38; Wehrheim, H. (2019). Specifying
    and Analyzing Virtual Network Services Using Queuing Petri Nets. In <i>2019 IFIP/IEEE
    International Symposium on Integrated Network Management (IM)</i> (pp. 116--124).
    Washington, DC, USA: IFIP.'
  bibtex: '@inproceedings{Schneider_Sharma_Karl_Wehrheim_2019, place={Washington,
    DC, USA}, title={Specifying and Analyzing Virtual Network Services Using Queuing
    Petri Nets}, booktitle={2019 IFIP/IEEE International Symposium on Integrated Network
    Management (IM)}, publisher={IFIP}, author={Schneider, Stefan Balthasar and Sharma,
    Arnab and Karl, Holger and Wehrheim, Heike}, year={2019}, pages={116--124} }'
  chicago: 'Schneider, Stefan Balthasar, Arnab Sharma, Holger Karl, and Heike Wehrheim.
    “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets.”
    In <i>2019 IFIP/IEEE International Symposium on Integrated Network Management
    (IM)</i>, 116--124. Washington, DC, USA: IFIP, 2019.'
  ieee: S. B. Schneider, A. Sharma, H. Karl, and H. Wehrheim, “Specifying and Analyzing
    Virtual Network Services Using Queuing Petri Nets,” in <i>2019 IFIP/IEEE International
    Symposium on Integrated Network Management (IM)</i>, Washington, DC, USA, 2019,
    pp. 116--124.
  mla: Schneider, Stefan Balthasar, et al. “Specifying and Analyzing Virtual Network
    Services Using Queuing Petri Nets.” <i>2019 IFIP/IEEE International Symposium
    on Integrated Network Management (IM)</i>, IFIP, 2019, pp. 116--124.
  short: 'S.B. Schneider, A. Sharma, H. Karl, H. Wehrheim, in: 2019 IFIP/IEEE International
    Symposium on Integrated Network Management (IM), IFIP, Washington, DC, USA, 2019,
    pp. 116--124.'
conference:
  end_date: 2019-04-12
  location: Washington, DC, USA
  name: 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)
  start_date: 2019-04-08
date_created: 2018-06-18T15:23:18Z
date_updated: 2022-01-06T06:59:09Z
ddc:
- '040'
department:
- _id: '77'
- _id: '75'
file:
- access_level: open_access
  content_type: application/pdf
  creator: stschn
  date_created: 2019-01-07T12:38:35Z
  date_updated: 2019-01-07T12:38:35Z
  file_id: '6504'
  file_name: ris_preprint.pdf
  file_size: 497528
  relation: main_file
file_date_updated: 2019-01-07T12:38:35Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://dl.ifip.org/db/conf/im/im2019/188490.pdf
oa: '1'
page: 116--124
place: Washington, DC, USA
project:
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '11'
  name: SFB 901 - Subproject B3
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '28'
  grant_number: '761493'
  name: 5G Development and validation platform for global industry-specific network
    services and Apps
- _id: '25'
  call_identifier: 5G PPP Phase 1
  grant_number: '671517'
  name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
    Networks'
publication: 2019 IFIP/IEEE International Symposium on Integrated Network Management
  (IM)
publisher: IFIP
status: public
title: Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets
type: conference
user_id: '35343'
year: '2019'
...
---
_id: '7752'
author:
- first_name: Arnab
  full_name: Sharma, Arnab
  id: '67200'
  last_name: Sharma
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Sharma A, Wehrheim H. Testing Balancedness of ML Algorithms. In: <i>Proceedings
    of the Software Engineering Conference (SE)</i>. Vol P-292. Lecture Notes in Informatics
    (LNI). Stuttgart: Gesellschaft für Informatik e.V. (GI); 2019:157-158.'
  apa: 'Sharma, A., &#38; Wehrheim, H. (2019). Testing Balancedness of ML Algorithms.
    In <i>Proceedings of the Software Engineering Conference (SE)</i> (Vol. P-292,
    pp. 157–158). Stuttgart: Gesellschaft für Informatik e.V. (GI).'
  bibtex: '@inproceedings{Sharma_Wehrheim_2019, place={Stuttgart}, series={Lecture
    Notes in Informatics (LNI)}, title={Testing Balancedness of ML Algorithms}, volume={P-292},
    booktitle={Proceedings of the Software Engineering Conference (SE)}, publisher={Gesellschaft
    für Informatik e.V. (GI)}, author={Sharma, Arnab and Wehrheim, Heike}, year={2019},
    pages={157–158}, collection={Lecture Notes in Informatics (LNI)} }'
  chicago: 'Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.”
    In <i>Proceedings of the Software Engineering Conference (SE)</i>, P-292:157–58.
    Lecture Notes in Informatics (LNI). Stuttgart: Gesellschaft für Informatik e.V.
    (GI), 2019.'
  ieee: A. Sharma and H. Wehrheim, “Testing Balancedness of ML Algorithms,” in <i>Proceedings
    of the Software Engineering Conference (SE)</i>, Stuttgart, 2019, vol. P-292,
    pp. 157–158.
  mla: Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.”
    <i>Proceedings of the Software Engineering Conference (SE)</i>, vol. P-292, Gesellschaft
    für Informatik e.V. (GI), 2019, pp. 157–58.
  short: 'A. Sharma, H. Wehrheim, in: Proceedings of the Software Engineering Conference
    (SE), Gesellschaft für Informatik e.V. (GI), Stuttgart, 2019, pp. 157–158.'
conference:
  end_date: 2019-02-22
  location: Stuttgart
  name: Software Engineering(SE)
  start_date: 2019-02-18
date_created: 2019-02-19T08:28:23Z
date_updated: 2022-01-06T07:03:45Z
department:
- _id: '34'
- _id: '77'
language:
- iso: eng
page: 157 - 158
place: Stuttgart
project:
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '11'
  name: SFB 901 - Subproject B3
- _id: '1'
  name: SFB 901
publication: Proceedings of the Software Engineering Conference (SE)
publication_identifier:
  isbn:
  - 978-3-88579-686-2
publication_status: published
publisher: Gesellschaft für Informatik e.V. (GI)
series_title: Lecture Notes in Informatics (LNI)
status: public
title: Testing Balancedness of ML Algorithms
type: conference_abstract
user_id: '477'
volume: P-292
year: '2019'
...
---
_id: '7635'
author:
- first_name: Arnab
  full_name: Sharma, Arnab
  id: '67200'
  last_name: Sharma
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Sharma A, Wehrheim H. Testing Machine Learning Algorithms for Balanced Data
    Usage. In: <i>IEEE International Conference on Software Testing, Verification
    and Validation (ICST)</i>. Xi’an, China: IEEE; 2019:125--135.'
  apa: 'Sharma, A., &#38; Wehrheim, H. (2019). Testing Machine Learning Algorithms
    for Balanced Data Usage. In <i>IEEE International Conference on Software Testing,
    Verification and Validation (ICST)</i> (pp. 125--135). Xi’an, China: IEEE.'
  bibtex: '@inproceedings{Sharma_Wehrheim_2019, place={Xi’an, China}, title={Testing
    Machine Learning Algorithms for Balanced Data Usage}, booktitle={IEEE International
    Conference on Software Testing, Verification and Validation (ICST)}, publisher={IEEE},
    author={Sharma, Arnab and Wehrheim, Heike}, year={2019}, pages={125--135} }'
  chicago: 'Sharma, Arnab, and Heike Wehrheim. “Testing Machine Learning Algorithms
    for Balanced Data Usage.” In <i>IEEE International Conference on Software Testing,
    Verification and Validation (ICST)</i>, 125--135. Xi’an, China: IEEE, 2019.'
  ieee: A. Sharma and H. Wehrheim, “Testing Machine Learning Algorithms for Balanced
    Data Usage,” in <i>IEEE International Conference on Software Testing, Verification
    and Validation (ICST)</i>, Xi’an, China, April, 2019, 2019, pp. 125--135.
  mla: Sharma, Arnab, and Heike Wehrheim. “Testing Machine Learning Algorithms for
    Balanced Data Usage.” <i>IEEE International Conference on Software Testing, Verification
    and Validation (ICST)</i>, IEEE, 2019, pp. 125--135.
  short: 'A. Sharma, H. Wehrheim, in: IEEE International Conference on Software Testing,
    Verification and Validation (ICST), IEEE, Xi’an, China, 2019, pp. 125--135.'
conference:
  end_date: 2019-04-27
  location: Xi'an, China, April, 2019
  name: IEEE International Conference on Software Testing, Verification and Validation
    (ICST)
  start_date: 2019-04-22
date_created: 2019-02-12T12:31:57Z
date_updated: 2022-01-06T07:03:42Z
ddc:
- '004'
department:
- _id: '34'
- _id: '77'
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2019-08-26T10:56:34Z
  date_updated: 2019-08-26T10:56:34Z
  file_id: '12960'
  file_name: 08730187.pdf
  file_size: 266375
  relation: main_file
  success: 1
file_date_updated: 2019-08-26T10:56:34Z
has_accepted_license: '1'
language:
- iso: eng
page: 125--135
place: Xi'an, China
project:
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '11'
  name: SFB 901 - Subproject B3
- _id: '1'
  name: SFB 901
publication: IEEE International Conference on Software Testing, Verification and Validation
  (ICST)
publication_status: published
publisher: IEEE
status: public
title: Testing Machine Learning Algorithms for Balanced Data Usage
type: conference
user_id: '29719'
year: '2019'
...
---
_id: '16215'
author:
- first_name: John
  full_name: Derrick, John
  last_name: Derrick
- first_name: Simon
  full_name: Doherty, Simon
  last_name: Doherty
- first_name: Brijesh
  full_name: Dongol, Brijesh
  last_name: Dongol
- first_name: Gerhard
  full_name: Schellhorn, Gerhard
  last_name: Schellhorn
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Derrick J, Doherty S, Dongol B, Schellhorn G, Wehrheim H. Verifying Correctness
    of Persistent Concurrent Data Structures. In: H. ter Beek M, McIver A, N. Oliveira
    J, eds. <i>Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019,
    Porto, Portugal, October 7-11, 2019, Proceedings</i>. Vol 11800. Lecture Notes
    in Computer Science. Springer; 2019:179-195. doi:<a href="https://doi.org/10.1007/978-3-030-30942-8\_12">10.1007/978-3-030-30942-8\_12</a>'
  apa: Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., &#38; Wehrheim, H. (2019).
    Verifying Correctness of Persistent Concurrent Data Structures. In M. H. ter Beek,
    A. McIver, &#38; J. N. Oliveira (Eds.), <i>Formal Methods - The Next 30 Years
    - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings</i>
    (Vol. 11800, pp. 179–195). Springer. <a href="https://doi.org/10.1007/978-3-030-30942-8\_12">https://doi.org/10.1007/978-3-030-30942-8\_12</a>
  bibtex: '@inproceedings{Derrick_Doherty_Dongol_Schellhorn_Wehrheim_2019, series={Lecture
    Notes in Computer Science}, title={Verifying Correctness of Persistent Concurrent
    Data Structures}, volume={11800}, DOI={<a href="https://doi.org/10.1007/978-3-030-30942-8\_12">10.1007/978-3-030-30942-8\_12</a>},
    booktitle={Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019,
    Porto, Portugal, October 7-11, 2019, Proceedings}, publisher={Springer}, author={Derrick,
    John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim,
    Heike}, editor={H. ter Beek, Maurice and McIver, Annabelle and N. Oliveira, Jos{\’{e}}Editors},
    year={2019}, pages={179–195}, collection={Lecture Notes in Computer Science} }'
  chicago: Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike
    Wehrheim. “Verifying Correctness of Persistent Concurrent Data Structures.” In
    <i>Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto,
    Portugal, October 7-11, 2019, Proceedings</i>, edited by Maurice H. ter Beek,
    Annabelle McIver, and Jos{\’{e}} N. Oliveira, 11800:179–95. Lecture Notes in Computer
    Science. Springer, 2019. <a href="https://doi.org/10.1007/978-3-030-30942-8\_12">https://doi.org/10.1007/978-3-030-30942-8\_12</a>.
  ieee: J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, and H. Wehrheim, “Verifying
    Correctness of Persistent Concurrent Data Structures,” in <i>Formal Methods -
    The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October
    7-11, 2019, Proceedings</i>, 2019, vol. 11800, pp. 179–195.
  mla: Derrick, John, et al. “Verifying Correctness of Persistent Concurrent Data
    Structures.” <i>Formal Methods - The Next 30 Years - Third World Congress, {FM}
    2019, Porto, Portugal, October 7-11, 2019, Proceedings</i>, edited by Maurice
    H. ter Beek et al., vol. 11800, Springer, 2019, pp. 179–95, doi:<a href="https://doi.org/10.1007/978-3-030-30942-8\_12">10.1007/978-3-030-30942-8\_12</a>.
  short: 'J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, H. Wehrheim, in: M. H.
    ter Beek, A. McIver, J. N. Oliveira (Eds.), Formal Methods - The Next 30 Years
    - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings,
    Springer, 2019, pp. 179–195.'
date_created: 2020-03-03T08:15:53Z
date_updated: 2022-01-06T06:52:45Z
department:
- _id: '34'
- _id: '77'
doi: 10.1007/978-3-030-30942-8\_12
editor:
- first_name: Maurice
  full_name: H. ter Beek, Maurice
  last_name: H. ter Beek
- first_name: Annabelle
  full_name: McIver, Annabelle
  last_name: McIver
- first_name: Jos{\'{e}}
  full_name: N. Oliveira, Jos{\'{e}}
  last_name: N. Oliveira
intvolume: '     11800'
language:
- iso: eng
page: 179-195
publication: Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019,
  Porto, Portugal, October 7-11, 2019, Proceedings
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Verifying Correctness of Persistent Concurrent Data Structures
type: conference
user_id: '29719'
volume: 11800
year: '2019'
...
---
_id: '16216'
author:
- first_name: Alessandra
  full_name: Russo, Alessandra
  last_name: Russo
- first_name: Andy
  full_name: Schürr, Andy
  last_name: Schürr
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: Russo A, Schürr A, Wehrheim H. Editorial. <i>Formal Asp Comput</i>. 2019;31(5):457-458.
    doi:<a href="https://doi.org/10.1007/s00165-019-00495-y">10.1007/s00165-019-00495-y</a>
  apa: Russo, A., Schürr, A., &#38; Wehrheim, H. (2019). Editorial. <i>Formal Asp.
    Comput.</i>, <i>31</i>(5), 457–458. <a href="https://doi.org/10.1007/s00165-019-00495-y">https://doi.org/10.1007/s00165-019-00495-y</a>
  bibtex: '@article{Russo_Schürr_Wehrheim_2019, title={Editorial}, volume={31}, DOI={<a
    href="https://doi.org/10.1007/s00165-019-00495-y">10.1007/s00165-019-00495-y</a>},
    number={5}, journal={Formal Asp. Comput.}, author={Russo, Alessandra and Schürr,
    Andy and Wehrheim, Heike}, year={2019}, pages={457–458} }'
  chicago: 'Russo, Alessandra, Andy Schürr, and Heike Wehrheim. “Editorial.” <i>Formal
    Asp. Comput.</i> 31, no. 5 (2019): 457–58. <a href="https://doi.org/10.1007/s00165-019-00495-y">https://doi.org/10.1007/s00165-019-00495-y</a>.'
  ieee: A. Russo, A. Schürr, and H. Wehrheim, “Editorial,” <i>Formal Asp. Comput.</i>,
    vol. 31, no. 5, pp. 457–458, 2019.
  mla: Russo, Alessandra, et al. “Editorial.” <i>Formal Asp. Comput.</i>, vol. 31,
    no. 5, 2019, pp. 457–58, doi:<a href="https://doi.org/10.1007/s00165-019-00495-y">10.1007/s00165-019-00495-y</a>.
  short: A. Russo, A. Schürr, H. Wehrheim, Formal Asp. Comput. 31 (2019) 457–458.
date_created: 2020-03-03T08:17:44Z
date_updated: 2022-01-06T06:52:45Z
department:
- _id: '34'
- _id: '77'
doi: 10.1007/s00165-019-00495-y
intvolume: '        31'
issue: '5'
language:
- iso: eng
page: 457-458
publication: Formal Asp. Comput.
status: public
title: Editorial
type: journal_article
user_id: '29719'
volume: 31
year: '2019'
...
---
_id: '16217'
author:
- first_name: Martin
  full_name: Fränzle, Martin
  last_name: Fränzle
- first_name: Deepak
  full_name: Kapur, Deepak
  last_name: Kapur
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
- first_name: Naijun
  full_name: Zhan, Naijun
  last_name: Zhan
citation:
  ama: Fränzle M, Kapur D, Wehrheim H, Zhan N. Editorial. <i>Formal Asp Comput</i>.
    2019;31(1):1. doi:<a href="https://doi.org/10.1007/s00165-018-00477-6">10.1007/s00165-018-00477-6</a>
  apa: Fränzle, M., Kapur, D., Wehrheim, H., &#38; Zhan, N. (2019). Editorial. <i>Formal
    Asp. Comput.</i>, <i>31</i>(1), 1. <a href="https://doi.org/10.1007/s00165-018-00477-6">https://doi.org/10.1007/s00165-018-00477-6</a>
  bibtex: '@article{Fränzle_Kapur_Wehrheim_Zhan_2019, title={Editorial}, volume={31},
    DOI={<a href="https://doi.org/10.1007/s00165-018-00477-6">10.1007/s00165-018-00477-6</a>},
    number={1}, journal={Formal Asp. Comput.}, author={Fränzle, Martin and Kapur,
    Deepak and Wehrheim, Heike and Zhan, Naijun}, year={2019}, pages={1} }'
  chicago: 'Fränzle, Martin, Deepak Kapur, Heike Wehrheim, and Naijun Zhan. “Editorial.”
    <i>Formal Asp. Comput.</i> 31, no. 1 (2019): 1. <a href="https://doi.org/10.1007/s00165-018-00477-6">https://doi.org/10.1007/s00165-018-00477-6</a>.'
  ieee: M. Fränzle, D. Kapur, H. Wehrheim, and N. Zhan, “Editorial,” <i>Formal Asp.
    Comput.</i>, vol. 31, no. 1, p. 1, 2019.
  mla: Fränzle, Martin, et al. “Editorial.” <i>Formal Asp. Comput.</i>, vol. 31, no.
    1, 2019, p. 1, doi:<a href="https://doi.org/10.1007/s00165-018-00477-6">10.1007/s00165-018-00477-6</a>.
  short: M. Fränzle, D. Kapur, H. Wehrheim, N. Zhan, Formal Asp. Comput. 31 (2019)
    1.
date_created: 2020-03-03T08:19:35Z
date_updated: 2022-01-06T06:52:45Z
department:
- _id: '34'
- _id: '77'
doi: 10.1007/s00165-018-00477-6
intvolume: '        31'
issue: '1'
language:
- iso: eng
page: '1'
publication: Formal Asp. Comput.
status: public
title: Editorial
type: journal_article
user_id: '29719'
volume: 31
year: '2019'
...
---
_id: '13993'
author:
- first_name: John
  full_name: Derrick, John
  last_name: Derrick
- first_name: Simon
  full_name: Doherty, Simon
  last_name: Doherty
- first_name: Brijesh
  full_name: Dongol, Brijesh
  last_name: Dongol
- first_name: Gerhard
  full_name: Schellhorn, Gerhard
  last_name: Schellhorn
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Derrick J, Doherty S, Dongol B, Schellhorn G, Wehrheim H. Verifying Correctness
    of Persistent Concurrent Data Structures. In: <i>Formal Methods - The Next 30
    Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019,
    Proceedings</i>. ; 2019:179-195. doi:<a href="https://doi.org/10.1007/978-3-030-30942-8\_12">10.1007/978-3-030-30942-8\_12</a>'
  apa: Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., &#38; Wehrheim, H. (2019).
    Verifying Correctness of Persistent Concurrent Data Structures. In <i>Formal Methods
    - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October
    7-11, 2019, Proceedings</i> (pp. 179–195). <a href="https://doi.org/10.1007/978-3-030-30942-8\_12">https://doi.org/10.1007/978-3-030-30942-8\_12</a>
  bibtex: '@inproceedings{Derrick_Doherty_Dongol_Schellhorn_Wehrheim_2019, title={Verifying
    Correctness of Persistent Concurrent Data Structures}, DOI={<a href="https://doi.org/10.1007/978-3-030-30942-8\_12">10.1007/978-3-030-30942-8\_12</a>},
    booktitle={Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019,
    Porto, Portugal, October 7-11, 2019, Proceedings}, author={Derrick, John and Doherty,
    Simon and Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike}, year={2019},
    pages={179–195} }'
  chicago: Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike
    Wehrheim. “Verifying Correctness of Persistent Concurrent Data Structures.” In
    <i>Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto,
    Portugal, October 7-11, 2019, Proceedings</i>, 179–95, 2019. <a href="https://doi.org/10.1007/978-3-030-30942-8\_12">https://doi.org/10.1007/978-3-030-30942-8\_12</a>.
  ieee: J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, and H. Wehrheim, “Verifying
    Correctness of Persistent Concurrent Data Structures,” in <i>Formal Methods -
    The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October
    7-11, 2019, Proceedings</i>, 2019, pp. 179–195.
  mla: Derrick, John, et al. “Verifying Correctness of Persistent Concurrent Data
    Structures.” <i>Formal Methods - The Next 30 Years - Third World Congress, {FM}
    2019, Porto, Portugal, October 7-11, 2019, Proceedings</i>, 2019, pp. 179–95,
    doi:<a href="https://doi.org/10.1007/978-3-030-30942-8\_12">10.1007/978-3-030-30942-8\_12</a>.
  short: 'J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, H. Wehrheim, in: Formal
    Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal,
    October 7-11, 2019, Proceedings, 2019, pp. 179–195.'
date_created: 2019-10-24T08:20:28Z
date_updated: 2022-01-06T06:51:48Z
department:
- _id: '77'
doi: 10.1007/978-3-030-30942-8\_12
language:
- iso: eng
page: 179-195
project:
- _id: '78'
  name: Validation of Software Transactional Memory
publication: Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019,
  Porto, Portugal, October 7-11, 2019, Proceedings
status: public
title: Verifying Correctness of Persistent Concurrent Data Structures
type: conference
user_id: '29719'
year: '2019'
...
---
_id: '10011'
author:
- first_name: Martin
  full_name: Fränzle, Martin
  last_name: Fränzle
- first_name: Deepak
  full_name: Kapur, Deepak
  last_name: Kapur
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
- first_name: Naijun
  full_name: Zhan, Naijun
  last_name: Zhan
citation:
  ama: Fränzle M, Kapur D, Wehrheim H, Zhan N. Editorial. <i>Formal Asp Comput</i>.
    2019;31(1):1. doi:<a href="https://doi.org/10.1007/s00165-018-00477-6">10.1007/s00165-018-00477-6</a>
  apa: Fränzle, M., Kapur, D., Wehrheim, H., &#38; Zhan, N. (2019). Editorial. <i>Formal
    Asp. Comput.</i>, <i>31</i>(1), 1. <a href="https://doi.org/10.1007/s00165-018-00477-6">https://doi.org/10.1007/s00165-018-00477-6</a>
  bibtex: '@article{Fränzle_Kapur_Wehrheim_Zhan_2019, title={Editorial}, volume={31},
    DOI={<a href="https://doi.org/10.1007/s00165-018-00477-6">10.1007/s00165-018-00477-6</a>},
    number={1}, journal={Formal Asp. Comput.}, author={Fränzle, Martin and Kapur,
    Deepak and Wehrheim, Heike and Zhan, Naijun}, year={2019}, pages={1} }'
  chicago: 'Fränzle, Martin, Deepak Kapur, Heike Wehrheim, and Naijun Zhan. “Editorial.”
    <i>Formal Asp. Comput.</i> 31, no. 1 (2019): 1. <a href="https://doi.org/10.1007/s00165-018-00477-6">https://doi.org/10.1007/s00165-018-00477-6</a>.'
  ieee: M. Fränzle, D. Kapur, H. Wehrheim, and N. Zhan, “Editorial,” <i>Formal Asp.
    Comput.</i>, vol. 31, no. 1, p. 1, 2019.
  mla: Fränzle, Martin, et al. “Editorial.” <i>Formal Asp. Comput.</i>, vol. 31, no.
    1, 2019, p. 1, doi:<a href="https://doi.org/10.1007/s00165-018-00477-6">10.1007/s00165-018-00477-6</a>.
  short: M. Fränzle, D. Kapur, H. Wehrheim, N. Zhan, Formal Asp. Comput. 31 (2019)
    1.
date_created: 2019-05-28T06:32:57Z
date_updated: 2022-01-06T06:50:22Z
department:
- _id: '77'
doi: 10.1007/s00165-018-00477-6
intvolume: '        31'
issue: '1'
language:
- iso: eng
page: '1'
publication: Formal Asp. Comput.
status: public
title: Editorial
type: journal_article
user_id: '29719'
volume: 31
year: '2019'
...
---
_id: '10091'
author:
- first_name: Jürgen
  full_name: König, Jürgen
  id: '22358'
  last_name: König
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'König J, Wehrheim H. Data Independence for Software Transactional Memory.
    In: M. Badger J, Yvonne Rozier K, eds. <i>{NASA} Formal Methods - 11th International
    Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings</i>. Vol 11460.
    Lecture Notes in Computer Science. Springer; 2019:263-279. doi:<a href="https://doi.org/10.1007/978-3-030-20652-9\_18">10.1007/978-3-030-20652-9\_18</a>'
  apa: König, J., &#38; Wehrheim, H. (2019). Data Independence for Software Transactional
    Memory. In J. M. Badger &#38; K. Yvonne Rozier (Eds.), <i>{NASA} Formal Methods
    - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings</i>
    (Vol. 11460, pp. 263–279). Springer. <a href="https://doi.org/10.1007/978-3-030-20652-9\_18">https://doi.org/10.1007/978-3-030-20652-9\_18</a>
  bibtex: '@inproceedings{König_Wehrheim_2019, series={Lecture Notes in Computer Science},
    title={Data Independence for Software Transactional Memory}, volume={11460}, DOI={<a
    href="https://doi.org/10.1007/978-3-030-20652-9\_18">10.1007/978-3-030-20652-9\_18</a>},
    booktitle={{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston,
    TX, USA, May 7-9, 2019, Proceedings}, publisher={Springer}, author={König, Jürgen
    and Wehrheim, Heike}, editor={M. Badger, Julia and Yvonne Rozier, KristinEditors},
    year={2019}, pages={263–279}, collection={Lecture Notes in Computer Science} }'
  chicago: König, Jürgen, and Heike Wehrheim. “Data Independence for Software Transactional
    Memory.” In <i>{NASA} Formal Methods - 11th International Symposium, {NFM} 2019,
    Houston, TX, USA, May 7-9, 2019, Proceedings</i>, edited by Julia M. Badger and
    Kristin Yvonne Rozier, 11460:263–79. Lecture Notes in Computer Science. Springer,
    2019. <a href="https://doi.org/10.1007/978-3-030-20652-9\_18">https://doi.org/10.1007/978-3-030-20652-9\_18</a>.
  ieee: J. König and H. Wehrheim, “Data Independence for Software Transactional Memory,”
    in <i>{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston,
    TX, USA, May 7-9, 2019, Proceedings</i>, 2019, vol. 11460, pp. 263–279.
  mla: König, Jürgen, and Heike Wehrheim. “Data Independence for Software Transactional
    Memory.” <i>{NASA} Formal Methods - 11th International Symposium, {NFM} 2019,
    Houston, TX, USA, May 7-9, 2019, Proceedings</i>, edited by Julia M. Badger and
    Kristin Yvonne Rozier, vol. 11460, Springer, 2019, pp. 263–79, doi:<a href="https://doi.org/10.1007/978-3-030-20652-9\_18">10.1007/978-3-030-20652-9\_18</a>.
  short: 'J. König, H. Wehrheim, in: J. M. Badger, K. Yvonne Rozier (Eds.), {NASA}
    Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May
    7-9, 2019, Proceedings, Springer, 2019, pp. 263–279.'
date_created: 2019-06-03T07:51:26Z
date_updated: 2022-01-06T06:50:28Z
department:
- _id: '77'
doi: 10.1007/978-3-030-20652-9\_18
editor:
- first_name: Julia
  full_name: M. Badger, Julia
  last_name: M. Badger
- first_name: Kristin
  full_name: Yvonne Rozier, Kristin
  last_name: Yvonne Rozier
intvolume: '     11460'
language:
- iso: eng
page: 263-279
project:
- _id: '78'
  name: Validation of Software Transactional Memory
publication: '{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston,
  TX, USA, May 7-9, 2019, Proceedings'
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Data Independence for Software Transactional Memory
type: conference
user_id: '22358'
volume: 11460
year: '2019'
...
---
_id: '10092'
author:
- first_name: Simon
  full_name: Doherty, Simon
  last_name: Doherty
- first_name: Brijesh
  full_name: Dongol, Brijesh
  last_name: Dongol
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
- first_name: John
  full_name: Derrick, John
  last_name: Derrick
citation:
  ama: 'Doherty S, Dongol B, Wehrheim H, Derrick J. Verifying C11 programs operationally.
    In: K. Hollingsworth J, Keidar I, eds. <i>Proceedings of the 24th {ACM} {SIGPLAN}
    Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington,
    DC, USA, February 16-20, 2019</i>. {ACM}; 2019:355-365. doi:<a href="https://doi.org/10.1145/3293883.3295702">10.1145/3293883.3295702</a>'
  apa: Doherty, S., Dongol, B., Wehrheim, H., &#38; Derrick, J. (2019). Verifying
    C11 programs operationally. In J. K. Hollingsworth &#38; I. Keidar (Eds.), <i>Proceedings
    of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming,
    PPoPP 2019, Washington, DC, USA, February 16-20, 2019</i> (pp. 355–365). {ACM}.
    <a href="https://doi.org/10.1145/3293883.3295702">https://doi.org/10.1145/3293883.3295702</a>
  bibtex: '@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2019, title={Verifying C11
    programs operationally}, DOI={<a href="https://doi.org/10.1145/3293883.3295702">10.1145/3293883.3295702</a>},
    booktitle={Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and
    Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20,
    2019}, publisher={{ACM}}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim,
    Heike and Derrick, John}, editor={K. Hollingsworth, Jeffrey and Keidar, IditEditors},
    year={2019}, pages={355–365} }'
  chicago: Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Verifying
    C11 Programs Operationally.” In <i>Proceedings of the 24th {ACM} {SIGPLAN} Symposium
    on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC,
    USA, February 16-20, 2019</i>, edited by Jeffrey K. Hollingsworth and Idit Keidar,
    355–65. {ACM}, 2019. <a href="https://doi.org/10.1145/3293883.3295702">https://doi.org/10.1145/3293883.3295702</a>.
  ieee: S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Verifying C11 programs
    operationally,” in <i>Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles
    and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February
    16-20, 2019</i>, 2019, pp. 355–365.
  mla: Doherty, Simon, et al. “Verifying C11 Programs Operationally.” <i>Proceedings
    of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming,
    PPoPP 2019, Washington, DC, USA, February 16-20, 2019</i>, edited by Jeffrey K.
    Hollingsworth and Idit Keidar, {ACM}, 2019, pp. 355–65, doi:<a href="https://doi.org/10.1145/3293883.3295702">10.1145/3293883.3295702</a>.
  short: 'S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: J. K. Hollingsworth,
    I. Keidar (Eds.), Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles
    and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February
    16-20, 2019, {ACM}, 2019, pp. 355–365.'
date_created: 2019-06-03T07:59:36Z
date_updated: 2022-01-06T06:50:28Z
department:
- _id: '77'
doi: 10.1145/3293883.3295702
editor:
- first_name: Jeffrey
  full_name: K. Hollingsworth, Jeffrey
  last_name: K. Hollingsworth
- first_name: Idit
  full_name: Keidar, Idit
  last_name: Keidar
language:
- iso: eng
page: 355-365
project:
- _id: '78'
  name: Validation of Software Transactional Memory
publication: Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice
  of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019
publisher: '{ACM}'
status: public
title: Verifying C11 programs operationally
type: conference
user_id: '29719'
year: '2019'
...
