[{"date_created":"2018-06-13T07:55:10Z","department":[{"_id":"77"}],"type":"journal_article","citation":{"bibtex":"@article{Schneider_Treharne_Wehrheim_2014, title={The behavioural semantics of Event-B refinement}, DOI={<a href=\"https://doi.org/10.1007/s00165-012-0265-0\">10.1007/s00165-012-0265-0</a>}, number={2}, journal={Formal Asp. Comput.}, author={Schneider, Steve and Treharne, Helen and Wehrheim, Heike}, year={2014}, pages={251--280} }","ama":"Schneider S, Treharne H, Wehrheim H. The behavioural semantics of Event-B refinement. <i>Formal Asp Comput</i>. 2014;(2):251--280. doi:<a href=\"https://doi.org/10.1007/s00165-012-0265-0\">10.1007/s00165-012-0265-0</a>","mla":"Schneider, Steve, et al. “The Behavioural Semantics of Event-B Refinement.” <i>Formal Asp. Comput.</i>, no. 2, 2014, pp. 251--280, doi:<a href=\"https://doi.org/10.1007/s00165-012-0265-0\">10.1007/s00165-012-0265-0</a>.","short":"S. Schneider, H. Treharne, H. Wehrheim, Formal Asp. Comput. (2014) 251--280.","chicago":"Schneider, Steve, Helen Treharne, and Heike Wehrheim. “The Behavioural Semantics of Event-B Refinement.” <i>Formal Asp. Comput.</i>, no. 2 (2014): 251--280. <a href=\"https://doi.org/10.1007/s00165-012-0265-0\">https://doi.org/10.1007/s00165-012-0265-0</a>.","ieee":"S. Schneider, H. Treharne, and H. Wehrheim, “The behavioural semantics of Event-B refinement,” <i>Formal Asp. Comput.</i>, no. 2, pp. 251--280, 2014.","apa":"Schneider, S., Treharne, H., &#38; Wehrheim, H. (2014). The behavioural semantics of Event-B refinement. <i>Formal Asp. Comput.</i>, (2), 251--280. <a href=\"https://doi.org/10.1007/s00165-012-0265-0\">https://doi.org/10.1007/s00165-012-0265-0</a>"},"publication":"Formal Asp. Comput.","issue":"2","_id":"3167","page":"251--280","user_id":"29719","doi":"10.1007/s00165-012-0265-0","author":[{"first_name":"Steve","last_name":"Schneider","full_name":"Schneider, Steve"},{"first_name":"Helen","last_name":"Treharne","full_name":"Treharne, Helen"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"title":"The behavioural semantics of Event-B refinement","year":"2014","status":"public","date_updated":"2022-01-06T06:59:01Z"},{"publication":"Sci. Comput. Program.","citation":{"ieee":"B. Tofan, O. Travkin, G. Schellhorn, and H. Wehrheim, “Two approaches for proving linearizability of multiset,” <i>Sci. Comput. Program.</i>, pp. 297--314, 2014.","apa":"Tofan, B., Travkin, O., Schellhorn, G., &#38; Wehrheim, H. (2014). Two approaches for proving linearizability of multiset. <i>Sci. Comput. Program.</i>, 297--314. <a href=\"https://doi.org/10.1016/j.scico.2014.04.001\">https://doi.org/10.1016/j.scico.2014.04.001</a>","chicago":"Tofan, Bogdan, Oleg Travkin, Gerhard Schellhorn, and Heike Wehrheim. “Two Approaches for Proving Linearizability of Multiset.” <i>Sci. Comput. Program.</i>, 2014, 297--314. <a href=\"https://doi.org/10.1016/j.scico.2014.04.001\">https://doi.org/10.1016/j.scico.2014.04.001</a>.","short":"B. Tofan, O. Travkin, G. Schellhorn, H. Wehrheim, Sci. Comput. Program. (2014) 297--314.","mla":"Tofan, Bogdan, et al. “Two Approaches for Proving Linearizability of Multiset.” <i>Sci. Comput. Program.</i>, 2014, pp. 297--314, doi:<a href=\"https://doi.org/10.1016/j.scico.2014.04.001\">10.1016/j.scico.2014.04.001</a>.","bibtex":"@article{Tofan_Travkin_Schellhorn_Wehrheim_2014, title={Two approaches for proving linearizability of multiset}, DOI={<a href=\"https://doi.org/10.1016/j.scico.2014.04.001\">10.1016/j.scico.2014.04.001</a>}, journal={Sci. Comput. Program.}, author={Tofan, Bogdan and Travkin, Oleg and Schellhorn, Gerhard and Wehrheim, Heike}, year={2014}, pages={297--314} }","ama":"Tofan B, Travkin O, Schellhorn G, Wehrheim H. Two approaches for proving linearizability of multiset. <i>Sci Comput Program</i>. 2014:297--314. doi:<a href=\"https://doi.org/10.1016/j.scico.2014.04.001\">10.1016/j.scico.2014.04.001</a>"},"date_created":"2018-06-13T07:56:12Z","type":"journal_article","department":[{"_id":"77"}],"year":"2014","title":"Two approaches for proving linearizability of multiset","status":"public","author":[{"full_name":"Tofan, Bogdan","last_name":"Tofan","first_name":"Bogdan"},{"full_name":"Travkin, Oleg","first_name":"Oleg","last_name":"Travkin"},{"last_name":"Schellhorn","first_name":"Gerhard","full_name":"Schellhorn, Gerhard"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"date_updated":"2022-01-06T06:59:01Z","page":"297--314","_id":"3168","user_id":"29719","doi":"10.1016/j.scico.2014.04.001"},{"page":"31:1--31:37","_id":"3169","user_id":"29719","doi":"10.1145/2629496","year":"2014","title":"A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures","status":"public","author":[{"full_name":"Schellhorn, Gerhard","last_name":"Schellhorn","first_name":"Gerhard"},{"full_name":"Derrick, John","first_name":"John","last_name":"Derrick"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"date_updated":"2022-01-06T06:59:01Z","date_created":"2018-06-13T07:57:31Z","type":"journal_article","department":[{"_id":"77"}],"publication":"{ACM} Trans. Comput. Log.","issue":"4","citation":{"ieee":"G. Schellhorn, J. Derrick, and H. Wehrheim, “A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures,” <i>{ACM} Trans. Comput. Log.</i>, no. 4, pp. 31:1--31:37, 2014.","apa":"Schellhorn, G., Derrick, J., &#38; Wehrheim, H. (2014). A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures. <i>{ACM} Trans. Comput. Log.</i>, (4), 31:1--31:37. <a href=\"https://doi.org/10.1145/2629496\">https://doi.org/10.1145/2629496</a>","short":"G. Schellhorn, J. Derrick, H. Wehrheim, {ACM} Trans. Comput. Log. (2014) 31:1--31:37.","chicago":"Schellhorn, Gerhard, John Derrick, and Heike Wehrheim. “A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures.” <i>{ACM} Trans. Comput. Log.</i>, no. 4 (2014): 31:1--31:37. <a href=\"https://doi.org/10.1145/2629496\">https://doi.org/10.1145/2629496</a>.","mla":"Schellhorn, Gerhard, et al. “A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures.” <i>{ACM} Trans. Comput. Log.</i>, no. 4, 2014, pp. 31:1--31:37, doi:<a href=\"https://doi.org/10.1145/2629496\">10.1145/2629496</a>.","bibtex":"@article{Schellhorn_Derrick_Wehrheim_2014, title={A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures}, DOI={<a href=\"https://doi.org/10.1145/2629496\">10.1145/2629496</a>}, number={4}, journal={{ACM} Trans. Comput. Log.}, author={Schellhorn, Gerhard and Derrick, John and Wehrheim, Heike}, year={2014}, pages={31:1--31:37} }","ama":"Schellhorn G, Derrick J, Wehrheim H. A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures. <i>{ACM} Trans Comput Log</i>. 2014;(4):31:1--31:37. doi:<a href=\"https://doi.org/10.1145/2629496\">10.1145/2629496</a>"}},{"publication":"{FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings","citation":{"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.","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. <i>{FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings</i>. Lecture Notes in Computer Science. ; 2014:200--214. doi:<a href=\"https://doi.org/10.1007/978-3-319-06410-9_15\">10.1007/978-3-319-06410-9_15</a>","chicago":"Derrick, John, Brijesh Dongol, Gerhard Schellhorn, Bogdan Tofan, Oleg Travkin, and Heike Wehrheim. “Quiescent Consistency: Defining and Verifying Relaxed Linearizability.” In <i>{FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings</i>, edited by Cliff B. Jones, Pekka Pihlajasaari, and Jun Sun, 200--214. Lecture Notes in Computer Science, 2014. <a href=\"https://doi.org/10.1007/978-3-319-06410-9_15\">https://doi.org/10.1007/978-3-319-06410-9_15</a>.","bibtex":"@inproceedings{Derrick_Dongol_Schellhorn_Tofan_Travkin_Wehrheim_2014, series={Lecture Notes in Computer Science}, title={Quiescent Consistency: Defining and Verifying Relaxed Linearizability}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-06410-9_15\">10.1007/978-3-319-06410-9_15</a>}, 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} }","mla":"Derrick, John, et al. “Quiescent Consistency: Defining and Verifying Relaxed Linearizability.” <i>{FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings</i>, edited by Cliff B. Jones et al., 2014, pp. 200--214, doi:<a href=\"https://doi.org/10.1007/978-3-319-06410-9_15\">10.1007/978-3-319-06410-9_15</a>.","apa":"Derrick, J., Dongol, B., Schellhorn, G., Tofan, B., Travkin, O., &#38; Wehrheim, H. (2014). Quiescent Consistency: Defining and Verifying Relaxed Linearizability. In C. B. Jones, P. Pihlajasaari, &#38; J. Sun (Eds.), <i>{FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings</i> (pp. 200--214). <a href=\"https://doi.org/10.1007/978-3-319-06410-9_15\">https://doi.org/10.1007/978-3-319-06410-9_15</a>","ieee":"J. Derrick, B. Dongol, G. Schellhorn, B. Tofan, O. Travkin, and H. Wehrheim, “Quiescent Consistency: Defining and Verifying Relaxed Linearizability,” in <i>{FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings</i>, 2014, pp. 200--214."},"date_created":"2018-06-13T07:58:40Z","type":"conference","department":[{"_id":"77"}],"year":"2014","title":"Quiescent Consistency: Defining and Verifying Relaxed Linearizability","status":"public","author":[{"last_name":"Derrick","first_name":"John","full_name":"Derrick, John"},{"full_name":"Dongol, Brijesh","first_name":"Brijesh","last_name":"Dongol"},{"last_name":"Schellhorn","first_name":"Gerhard","full_name":"Schellhorn, Gerhard"},{"full_name":"Tofan, Bogdan","first_name":"Bogdan","last_name":"Tofan"},{"full_name":"Travkin, Oleg","first_name":"Oleg","last_name":"Travkin"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"date_updated":"2022-01-06T06:59:02Z","page":"200--214","series_title":"Lecture Notes in Computer Science","_id":"3170","doi":"10.1007/978-3-319-06410-9_15","user_id":"29719","editor":[{"full_name":"B. Jones, Cliff","last_name":"B. Jones","first_name":"Cliff"},{"last_name":"Pihlajasaari","first_name":"Pekka","full_name":"Pihlajasaari, Pekka"},{"full_name":"Sun, Jun","last_name":"Sun","first_name":"Jun"}]},{"publication":"Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings","citation":{"mla":"Travkin, Oleg, and Heike Wehrheim. “Handling {TSO} in Mechanized Linearizability Proofs.” <i>Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings</i>, edited by Eran Yahav, 2014, pp. 132--147, doi:<a href=\"https://doi.org/10.1007/978-3-319-13338-6_11\">10.1007/978-3-319-13338-6_11</a>.","apa":"Travkin, O., &#38; Wehrheim, H. (2014). Handling {TSO} in Mechanized Linearizability Proofs. In E. Yahav (Ed.), <i>Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings</i> (pp. 132--147). <a href=\"https://doi.org/10.1007/978-3-319-13338-6_11\">https://doi.org/10.1007/978-3-319-13338-6_11</a>","ieee":"O. Travkin and H. Wehrheim, “Handling {TSO} in Mechanized Linearizability Proofs,” in <i>Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings</i>, 2014, pp. 132--147.","chicago":"Travkin, Oleg, and Heike Wehrheim. “Handling {TSO} in Mechanized Linearizability Proofs.” In <i>Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings</i>, edited by Eran Yahav, 132--147. Lecture Notes in Computer Science, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13338-6_11\">https://doi.org/10.1007/978-3-319-13338-6_11</a>.","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.","ama":"Travkin O, Wehrheim H. Handling {TSO} in Mechanized Linearizability Proofs. In: Yahav E, ed. <i>Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings</i>. Lecture Notes in Computer Science. ; 2014:132--147. doi:<a href=\"https://doi.org/10.1007/978-3-319-13338-6_11\">10.1007/978-3-319-13338-6_11</a>","bibtex":"@inproceedings{Travkin_Wehrheim_2014, series={Lecture Notes in Computer Science}, title={Handling {TSO} in Mechanized Linearizability Proofs}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13338-6_11\">10.1007/978-3-319-13338-6_11</a>}, 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} }"},"date_created":"2018-06-13T07:59:46Z","type":"conference","department":[{"_id":"77"}],"status":"public","title":"Handling {TSO} in Mechanized Linearizability Proofs","year":"2014","author":[{"full_name":"Travkin, Oleg","first_name":"Oleg","last_name":"Travkin"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"date_updated":"2022-01-06T06:59:02Z","page":"132--147","series_title":"Lecture Notes in Computer Science","_id":"3171","doi":"10.1007/978-3-319-13338-6_11","user_id":"29719","editor":[{"full_name":"Yahav, Eran","last_name":"Yahav","first_name":"Eran"}]},{"editor":[{"full_name":"Merz, Stephan","last_name":"Merz","first_name":"Stephan"},{"first_name":"Jun","last_name":"Pang","full_name":"Pang, Jun"}],"user_id":"29719","doi":"10.1007/978-3-319-11737-9_14","series_title":"Lecture Notes in Computer Science","_id":"3172","page":"203--218","date_updated":"2022-01-06T06:59:02Z","author":[{"full_name":"Isenberg, Tobias","last_name":"Isenberg","first_name":"Tobias"},{"id":"573","first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"status":"public","title":"Timed Automata Verification via {IC3} with Zones","year":"2014","department":[{"_id":"77"}],"type":"conference","date_created":"2018-06-13T08:01:04Z","citation":{"ieee":"T. Isenberg and H. Wehrheim, “Timed Automata Verification via {IC3} with Zones,” in <i>Formal Methods and Software Engineering - 16th International Conference on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings</i>, 2014, pp. 203--218.","apa":"Isenberg, T., &#38; Wehrheim, H. (2014). Timed Automata Verification via {IC3} with Zones. In S. Merz &#38; J. Pang (Eds.), <i>Formal Methods and Software Engineering - 16th International Conference on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings</i> (pp. 203--218). <a href=\"https://doi.org/10.1007/978-3-319-11737-9_14\">https://doi.org/10.1007/978-3-319-11737-9_14</a>","mla":"Isenberg, Tobias, and Heike Wehrheim. “Timed Automata Verification via {IC3} with Zones.” <i>Formal Methods and Software Engineering - 16th International Conference on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings</i>, edited by Stephan Merz and Jun Pang, 2014, pp. 203--218, doi:<a href=\"https://doi.org/10.1007/978-3-319-11737-9_14\">10.1007/978-3-319-11737-9_14</a>.","bibtex":"@inproceedings{Isenberg_Wehrheim_2014, series={Lecture Notes in Computer Science}, title={Timed Automata Verification via {IC3} with Zones}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-11737-9_14\">10.1007/978-3-319-11737-9_14</a>}, 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 <i>Formal Methods and Software Engineering - 16th International Conference on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings</i>, edited by Stephan Merz and Jun Pang, 203--218. Lecture Notes in Computer Science, 2014. <a href=\"https://doi.org/10.1007/978-3-319-11737-9_14\">https://doi.org/10.1007/978-3-319-11737-9_14</a>.","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.","ama":"Isenberg T, Wehrheim H. Timed Automata Verification via {IC3} with Zones. In: Merz S, Pang J, eds. <i>Formal Methods and Software Engineering - 16th International Conference on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings</i>. Lecture Notes in Computer Science. ; 2014:203--218. doi:<a href=\"https://doi.org/10.1007/978-3-319-11737-9_14\">10.1007/978-3-319-11737-9_14</a>"},"publication":"Formal Methods and Software Engineering - 16th International Conference on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings"},{"user_id":"29719","doi":"10.1007/978-3-319-10181-1_14","editor":[{"first_name":"Elvira","last_name":"Albert","full_name":"Albert, Elvira"},{"first_name":"Emil","last_name":"Sekerinski","full_name":"Sekerinski, Emil"}],"page":"221--237","series_title":"Lecture Notes in Computer Science","_id":"3173","date_updated":"2022-01-06T06:59:02Z","year":"2014","title":"Managing {LTL} Properties in Event-B Refinement","status":"public","author":[{"last_name":"A. Schneider","first_name":"Steve","full_name":"A. Schneider, Steve"},{"last_name":"Treharne","first_name":"Helen","full_name":"Treharne, Helen"},{"id":"573","first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"},{"full_name":"M. Williams, David","last_name":"M. Williams","first_name":"David"}],"type":"conference","department":[{"_id":"77"}],"date_created":"2018-06-13T08:04:33Z","publication":"Integrated Formal Methods - 11th International Conference, {IFM} 2014, Bertinoro, Italy, September 9-11, 2014, Proceedings","citation":{"ieee":"S. A. Schneider, H. Treharne, H. Wehrheim, and D. M. Williams, “Managing {LTL} Properties in Event-B Refinement,” in <i>Integrated Formal Methods - 11th International Conference, {IFM} 2014, Bertinoro, Italy, September 9-11, 2014, Proceedings</i>, 2014, pp. 221--237.","apa":"A. Schneider, S., Treharne, H., Wehrheim, H., &#38; M. Williams, D. (2014). Managing {LTL} Properties in Event-B Refinement. In E. Albert &#38; E. Sekerinski (Eds.), <i>Integrated Formal Methods - 11th International Conference, {IFM} 2014, Bertinoro, Italy, September 9-11, 2014, Proceedings</i> (pp. 221--237). <a href=\"https://doi.org/10.1007/978-3-319-10181-1_14\">https://doi.org/10.1007/978-3-319-10181-1_14</a>","mla":"A. Schneider, Steve, et al. “Managing {LTL} Properties in Event-B Refinement.” <i>Integrated Formal Methods - 11th International Conference, {IFM} 2014, Bertinoro, Italy, September 9-11, 2014, Proceedings</i>, edited by Elvira Albert and Emil Sekerinski, 2014, pp. 221--237, doi:<a href=\"https://doi.org/10.1007/978-3-319-10181-1_14\">10.1007/978-3-319-10181-1_14</a>.","bibtex":"@inproceedings{A. Schneider_Treharne_Wehrheim_M. Williams_2014, series={Lecture Notes in Computer Science}, title={Managing {LTL} Properties in Event-B Refinement}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-10181-1_14\">10.1007/978-3-319-10181-1_14</a>}, 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 <i>Integrated Formal Methods - 11th International Conference, {IFM} 2014, Bertinoro, Italy, September 9-11, 2014, Proceedings</i>, edited by Elvira Albert and Emil Sekerinski, 221--237. Lecture Notes in Computer Science, 2014. <a href=\"https://doi.org/10.1007/978-3-319-10181-1_14\">https://doi.org/10.1007/978-3-319-10181-1_14</a>.","ama":"A. Schneider S, Treharne H, Wehrheim H, M. Williams D. Managing {LTL} Properties in Event-B Refinement. In: Albert E, Sekerinski E, eds. <i>Integrated Formal Methods - 11th International Conference, {IFM} 2014, Bertinoro, Italy, September 9-11, 2014, Proceedings</i>. Lecture Notes in Computer Science. ; 2014:221--237. doi:<a href=\"https://doi.org/10.1007/978-3-319-10181-1_14\">10.1007/978-3-319-10181-1_14</a>","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."}},{"_id":"3174","user_id":"29719","author":[{"last_name":"Schneider","first_name":"Steve","full_name":"Schneider, Steve"},{"full_name":"Treharne, Helen","last_name":"Treharne","first_name":"Helen"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"},{"full_name":"M. Williams, David","first_name":"David","last_name":"M. Williams"}],"status":"public","title":"Managing {LTL} properties in Event-B refinement","year":"2014","date_updated":"2022-01-06T06:59:02Z","date_created":"2018-06-13T08:05:39Z","department":[{"_id":"77"}],"type":"journal_article","citation":{"ieee":"S. Schneider, H. Treharne, H. Wehrheim, and D. M. Williams, “Managing {LTL} properties in Event-B refinement,” <i>CoRR</i>, 2014.","apa":"Schneider, S., Treharne, H., Wehrheim, H., &#38; M. Williams, D. (2014). Managing {LTL} properties in Event-B refinement. <i>CoRR</i>.","short":"S. Schneider, H. Treharne, H. Wehrheim, D. M. Williams, CoRR (2014).","chicago":"Schneider, Steve, Helen Treharne, Heike Wehrheim, and David M. Williams. “Managing {LTL} Properties in Event-B Refinement.” <i>CoRR</i>, 2014.","mla":"Schneider, Steve, et al. “Managing {LTL} Properties in Event-B Refinement.” <i>CoRR</i>, 2014.","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} }","ama":"Schneider S, Treharne H, Wehrheim H, M. Williams D. Managing {LTL} properties in Event-B refinement. <i>CoRR</i>. 2014."},"publication":"CoRR"},{"year":"2014","title":"Proof-Carrying Hardware via {IC3}","status":"public","author":[{"last_name":"Isenberg","first_name":"Tobias","full_name":"Isenberg, Tobias"},{"id":"573","full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"date_updated":"2022-01-06T06:59:02Z","_id":"3175","user_id":"29719","publication":"CoRR","citation":{"chicago":"Isenberg, Tobias, and Heike Wehrheim. “Proof-Carrying Hardware via {IC3}.” <i>CoRR</i>, 2014.","short":"T. Isenberg, H. Wehrheim, CoRR (2014).","apa":"Isenberg, T., &#38; Wehrheim, H. (2014). Proof-Carrying Hardware via {IC3}. <i>CoRR</i>.","ieee":"T. Isenberg and H. Wehrheim, “Proof-Carrying Hardware via {IC3},” <i>CoRR</i>, 2014.","ama":"Isenberg T, Wehrheim H. Proof-Carrying Hardware via {IC3}. <i>CoRR</i>. 2014.","bibtex":"@article{Isenberg_Wehrheim_2014, title={Proof-Carrying Hardware via {IC3}}, journal={CoRR}, author={Isenberg, Tobias and Wehrheim, Heike}, year={2014} }","mla":"Isenberg, Tobias, and Heike Wehrheim. “Proof-Carrying Hardware via {IC3}.” <i>CoRR</i>, 2014."},"date_created":"2018-06-13T08:07:24Z","type":"journal_article","department":[{"_id":"77"}]},{"abstract":[{"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. ","lang":"eng"}],"publication":"Proceedings of the 21st International Symposium on Model Checking of Software (SPIN)","type":"conference","department":[{"_id":"77"}],"file":[{"creator":"florida","date_created":"2018-03-16T11:25:35Z","date_updated":"2018-03-16T11:25:35Z","relation":"main_file","access_level":"closed","file_size":487366,"file_name":"450-p30-jakobs.pdf","success":1,"content_type":"application/pdf","file_id":"1345"}],"date_created":"2017-10-17T12:42:19Z","date_updated":"2022-01-06T07:01:07Z","title":"Certification for Configurable Program Analysis","year":"2014","author":[{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike","id":"573"}],"doi":"10.1145/2632362.2632372","language":[{"iso":"eng"}],"series_title":"SPIN 2014","project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"file_date_updated":"2018-03-16T11:25:35Z","citation":{"apa":"Jakobs, M.-C., &#38; Wehrheim, H. (2014). Certification for Configurable Program Analysis. In <i>Proceedings of the 21st International Symposium on Model Checking of Software (SPIN)</i> (pp. 30–39). <a href=\"https://doi.org/10.1145/2632362.2632372\">https://doi.org/10.1145/2632362.2632372</a>","ieee":"M.-C. Jakobs and H. Wehrheim, “Certification for Configurable Program Analysis,” in <i>Proceedings of the 21st International Symposium on Model Checking of Software (SPIN)</i>, 2014, pp. 30–39.","short":"M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 21st International Symposium on Model Checking of Software (SPIN), 2014, pp. 30–39.","chicago":"Jakobs, Marie-Christine, and Heike Wehrheim. “Certification for Configurable Program Analysis.” In <i>Proceedings of the 21st International Symposium on Model Checking of Software (SPIN)</i>, 30–39. SPIN 2014, 2014. <a href=\"https://doi.org/10.1145/2632362.2632372\">https://doi.org/10.1145/2632362.2632372</a>.","mla":"Jakobs, Marie-Christine, and Heike Wehrheim. “Certification for Configurable Program Analysis.” <i>Proceedings of the 21st International Symposium on Model Checking of Software (SPIN)</i>, 2014, pp. 30–39, doi:<a href=\"https://doi.org/10.1145/2632362.2632372\">10.1145/2632362.2632372</a>.","ama":"Jakobs M-C, Wehrheim H. Certification for Configurable Program Analysis. In: <i>Proceedings of the 21st International Symposium on Model Checking of Software (SPIN)</i>. SPIN 2014. ; 2014:30-39. doi:<a href=\"https://doi.org/10.1145/2632362.2632372\">10.1145/2632362.2632372</a>","bibtex":"@inproceedings{Jakobs_Wehrheim_2014, series={SPIN 2014}, title={Certification for Configurable Program Analysis}, DOI={<a href=\"https://doi.org/10.1145/2632362.2632372\">10.1145/2632362.2632372</a>}, 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} }"},"has_accepted_license":"1","status":"public","user_id":"477","ddc":["040"],"page":"30-39","_id":"450"},{"citation":{"mla":"Jakobs, Marie-Christine, et al. “Integrating Software and Hardware Verification.” <i>Proceedings of the 11th International Conference on Integrated Formal Methods (IFM)</i>, edited by Elvira Albert and Emil Sekerinski, 2014, pp. 307–22, doi:<a href=\"https://doi.org/10.1007/978-3-319-10181-1_19\">10.1007/978-3-319-10181-1_19</a>.","ama":"Jakobs M-C, Platzner M, Wiersema T, Wehrheim H. Integrating Software and Hardware Verification. In: Albert E, Sekerinski E, eds. <i>Proceedings of the 11th International Conference on Integrated Formal Methods (IFM)</i>. LNCS. ; 2014:307-322. doi:<a href=\"https://doi.org/10.1007/978-3-319-10181-1_19\">10.1007/978-3-319-10181-1_19</a>","bibtex":"@inproceedings{Jakobs_Platzner_Wiersema_Wehrheim_2014, series={LNCS}, title={Integrating Software and Hardware Verification}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-10181-1_19\">10.1007/978-3-319-10181-1_19</a>}, 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} }","apa":"Jakobs, M.-C., Platzner, M., Wiersema, T., &#38; Wehrheim, H. (2014). Integrating Software and Hardware Verification. In E. Albert &#38; E. Sekerinski (Eds.), <i>Proceedings of the 11th International Conference on Integrated Formal Methods (iFM)</i> (pp. 307–322). <a href=\"https://doi.org/10.1007/978-3-319-10181-1_19\">https://doi.org/10.1007/978-3-319-10181-1_19</a>","ieee":"M.-C. Jakobs, M. Platzner, T. Wiersema, and H. Wehrheim, “Integrating Software and Hardware Verification,” in <i>Proceedings of the 11th International Conference on Integrated Formal Methods (iFM)</i>, 2014, pp. 307–322.","chicago":"Jakobs, Marie-Christine, Marco Platzner, Tobias Wiersema, and Heike Wehrheim. “Integrating Software and Hardware Verification.” In <i>Proceedings of the 11th International Conference on Integrated Formal Methods (IFM)</i>, edited by Elvira Albert and Emil Sekerinski, 307–22. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-10181-1_19\">https://doi.org/10.1007/978-3-319-10181-1_19</a>.","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."},"file_date_updated":"2018-03-16T11:35:28Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"408","page":"307-322","editor":[{"last_name":"Albert","first_name":"Elvira","full_name":"Albert, Elvira"},{"last_name":"Sekerinski","first_name":"Emil","full_name":"Sekerinski, Emil"}],"user_id":"477","ddc":["040"],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:11Z","file":[{"access_level":"closed","file_size":561325,"file_name":"408-jakobs14_ifm.pdf","date_updated":"2018-03-16T11:35:28Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1364","creator":"florida","date_created":"2018-03-16T11:35:28Z"}],"department":[{"_id":"77"},{"_id":"78"}],"type":"conference","publication":"Proceedings of the 11th International Conference on Integrated Formal Methods (iFM)","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-10181-1_19","author":[{"first_name":"Marie-Christine","last_name":"Jakobs","full_name":"Jakobs, Marie-Christine"},{"id":"398","full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"},{"last_name":"Wiersema","first_name":"Tobias","full_name":"Wiersema, Tobias","id":"3118"},{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike","id":"573"}],"year":"2014","title":"Integrating Software and Hardware Verification","date_updated":"2022-01-06T07:00:14Z"},{"file_date_updated":"2018-03-16T11:33:33Z","citation":{"mla":"Besova, Galina, et al. “Grammar-Based Model Transformations.” <i>Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)</i>, 2014, pp. 1601–10, doi:<a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">10.1016/j.cl.2015.05.003</a>.","ama":"Besova G, Steenke D, Wehrheim H. Grammar-based model transformations. In: <i>Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)</i>. ; 2014:1601-1610. doi:<a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">10.1016/j.cl.2015.05.003</a>","bibtex":"@inproceedings{Besova_Steenke_Wehrheim_2014, title={Grammar-based model transformations}, DOI={<a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">10.1016/j.cl.2015.05.003</a>}, 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} }","apa":"Besova, G., Steenke, D., &#38; Wehrheim, H. (2014). Grammar-based model transformations. In <i>Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)</i> (pp. 1601–1610). <a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">https://doi.org/10.1016/j.cl.2015.05.003</a>","ieee":"G. Besova, D. Steenke, and H. Wehrheim, “Grammar-based model transformations,” in <i>Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)</i>, 2014, pp. 1601–1610.","short":"G. Besova, D. Steenke, H. Wehrheim, in: Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD), 2014, pp. 1601–1610.","chicago":"Besova, Galina, Dominik Steenke, and Heike Wehrheim. “Grammar-Based Model Transformations.” In <i>Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)</i>, 1601–10, 2014. <a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">https://doi.org/10.1016/j.cl.2015.05.003</a>."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"page":"1601-1610","_id":"417","user_id":"477","ddc":["040"],"status":"public","has_accepted_license":"1","file":[{"relation":"main_file","date_updated":"2018-03-16T11:33:33Z","file_name":"417-main.pdf","file_size":643382,"access_level":"closed","file_id":"1360","content_type":"application/pdf","success":1,"creator":"florida","date_created":"2018-03-16T11:33:33Z"}],"date_created":"2017-10-17T12:42:13Z","type":"conference","department":[{"_id":"77"}],"publication":"Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1016/j.cl.2015.05.003","year":"2014","title":"Grammar-based model transformations","author":[{"full_name":"Besova, Galina","first_name":"Galina","last_name":"Besova"},{"full_name":"Steenke, Dominik","last_name":"Steenke","first_name":"Dominik"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"date_updated":"2022-01-06T07:00:28Z"},{"type":"bachelorsthesis","department":[{"_id":"77"}],"oa":"1","file":[{"date_created":"2019-08-07T09:00:20Z","creator":"fpauck","title":"Bachelorarbeit","content_type":"application/pdf","file_id":"12906","date_updated":"2019-08-07T09:05:38Z","relation":"main_file","access_level":"open_access","file_size":3191756,"file_name":"fpauck_2014.pdf"}],"date_created":"2017-10-17T12:42:13Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"file_date_updated":"2019-08-07T09:05:38Z","citation":{"ama":"Pauck F. <i>Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren</i>. Universität Paderborn; 2014.","bibtex":"@book{Pauck_2014, title={Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren}, publisher={Universität Paderborn}, author={Pauck, Felix}, year={2014} }","mla":"Pauck, Felix. <i>Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren</i>. Universität Paderborn, 2014.","chicago":"Pauck, Felix. <i>Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren</i>. Universität Paderborn, 2014.","short":"F. Pauck, Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren, Universität Paderborn, 2014.","apa":"Pauck, F. (2014). <i>Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren</i>. Universität Paderborn.","ieee":"F. Pauck, <i>Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren</i>. Universität Paderborn, 2014."},"supervisor":[{"id":"573","full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"user_id":"22398","ddc":["000"],"language":[{"iso":"ger"}],"_id":"418","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:00:30Z","has_accepted_license":"1","year":"2014","title":"Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren","status":"public","author":[{"id":"22398","first_name":"Felix","last_name":"Pauck","full_name":"Pauck, Felix"}]},{"page":"178--192","series_title":"Lecture Notes in Computer Science","_id":"3176","doi":"10.1007/978-3-642-38592-6_13","user_id":"29719","editor":[{"first_name":"Dirk","last_name":"Beyer","full_name":"Beyer, Dirk"},{"full_name":"Boreale, Michele","first_name":"Michele","last_name":"Boreale"}],"year":"2013","title":"Bounded Model Checking of Graph Transformation Systems via {SMT} Solving","status":"public","author":[{"last_name":"Isenberg","first_name":"Tobias","full_name":"Isenberg, Tobias"},{"last_name":"Steenken","first_name":"Dominik","full_name":"Steenken, Dominik"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"date_updated":"2022-01-06T06:59:02Z","date_created":"2018-06-13T08:08:39Z","type":"conference","department":[{"_id":"77"}],"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","citation":{"apa":"Isenberg, T., Steenken, D., &#38; Wehrheim, H. (2013). Bounded Model Checking of Graph Transformation Systems via {SMT} Solving. In D. Beyer &#38; M. Boreale (Eds.), <i>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</i> (pp. 178--192). <a href=\"https://doi.org/10.1007/978-3-642-38592-6_13\">https://doi.org/10.1007/978-3-642-38592-6_13</a>","ieee":"T. Isenberg, D. Steenken, and H. Wehrheim, “Bounded Model Checking of Graph Transformation Systems via {SMT} Solving,” in <i>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</i>, 2013, pp. 178--192.","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.","chicago":"Isenberg, Tobias, Dominik Steenken, and Heike Wehrheim. “Bounded Model Checking of Graph Transformation Systems via {SMT} Solving.” In <i>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</i>, edited by Dirk Beyer and Michele Boreale, 178--192. Lecture Notes in Computer Science, 2013. <a href=\"https://doi.org/10.1007/978-3-642-38592-6_13\">https://doi.org/10.1007/978-3-642-38592-6_13</a>.","mla":"Isenberg, Tobias, et al. “Bounded Model Checking of Graph Transformation Systems via {SMT} Solving.” <i>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</i>, edited by Dirk Beyer and Michele Boreale, 2013, pp. 178--192, doi:<a href=\"https://doi.org/10.1007/978-3-642-38592-6_13\">10.1007/978-3-642-38592-6_13</a>.","ama":"Isenberg T, Steenken D, Wehrheim H. Bounded Model Checking of Graph Transformation Systems via {SMT} Solving. In: Beyer D, Boreale M, eds. <i>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</i>. Lecture Notes in Computer Science. ; 2013:178--192. doi:<a href=\"https://doi.org/10.1007/978-3-642-38592-6_13\">10.1007/978-3-642-38592-6_13</a>","bibtex":"@inproceedings{Isenberg_Steenken_Wehrheim_2013, series={Lecture Notes in Computer Science}, title={Bounded Model Checking of Graph Transformation Systems via {SMT} Solving}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-38592-6_13\">10.1007/978-3-642-38592-6_13</a>}, 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} }"}},{"citation":{"bibtex":"@inproceedings{Travkin_Mütze_Wehrheim_2013, series={Lecture Notes in Computer Science}, title={{SPIN} as a Linearizability Checker under Weak Memory Models}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-03077-7_21\">10.1007/978-3-319-03077-7_21</a>}, 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} }","ama":"Travkin O, Mütze A, Wehrheim H. {SPIN} as a Linearizability Checker under Weak Memory Models. In: Bertacco V, Legay A, eds. <i>Hardware and Software: Verification and Testing - 9th International Haifa Verification Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013, Proceedings</i>. Lecture Notes in Computer Science. ; 2013:311--326. doi:<a href=\"https://doi.org/10.1007/978-3-319-03077-7_21\">10.1007/978-3-319-03077-7_21</a>","mla":"Travkin, Oleg, et al. “{SPIN} as a Linearizability Checker under Weak Memory Models.” <i>Hardware and Software: Verification and Testing - 9th International Haifa Verification Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013, Proceedings</i>, edited by Valeria Bertacco and Axel Legay, 2013, pp. 311--326, doi:<a href=\"https://doi.org/10.1007/978-3-319-03077-7_21\">10.1007/978-3-319-03077-7_21</a>.","chicago":"Travkin, Oleg, Annika Mütze, and Heike Wehrheim. “{SPIN} as a Linearizability Checker under Weak Memory Models.” In <i>Hardware and Software: Verification and Testing - 9th International Haifa Verification Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013, Proceedings</i>, edited by Valeria Bertacco and Axel Legay, 311--326. Lecture Notes in Computer Science, 2013. <a href=\"https://doi.org/10.1007/978-3-319-03077-7_21\">https://doi.org/10.1007/978-3-319-03077-7_21</a>.","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.","ieee":"O. Travkin, A. Mütze, and H. Wehrheim, “{SPIN} as a Linearizability Checker under Weak Memory Models,” in <i>Hardware and Software: Verification and Testing - 9th International Haifa Verification Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013, Proceedings</i>, 2013, pp. 311--326.","apa":"Travkin, O., Mütze, A., &#38; Wehrheim, H. (2013). {SPIN} as a Linearizability Checker under Weak Memory Models. In V. Bertacco &#38; A. Legay (Eds.), <i>Hardware and Software: Verification and Testing - 9th International Haifa Verification Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013, Proceedings</i> (pp. 311--326). <a href=\"https://doi.org/10.1007/978-3-319-03077-7_21\">https://doi.org/10.1007/978-3-319-03077-7_21</a>"},"publication":"Hardware and Software: Verification and Testing - 9th International Haifa Verification Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013, Proceedings","department":[{"_id":"77"}],"type":"conference","date_created":"2018-06-13T08:09:44Z","date_updated":"2022-01-06T06:59:02Z","author":[{"full_name":"Travkin, Oleg","first_name":"Oleg","last_name":"Travkin"},{"first_name":"Annika","last_name":"Mütze","full_name":"Mütze, Annika"},{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike","id":"573"}],"title":"{SPIN} as a Linearizability Checker under Weak Memory Models","year":"2013","status":"public","editor":[{"full_name":"Bertacco, Valeria","first_name":"Valeria","last_name":"Bertacco"},{"first_name":"Axel","last_name":"Legay","full_name":"Legay, Axel"}],"user_id":"29719","doi":"10.1007/978-3-319-03077-7_21","series_title":"Lecture Notes in Computer Science","_id":"3177","page":"311--326"},{"publication":"Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings","citation":{"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={<a href=\"https://doi.org/10.1007/978-3-642-39718-9_11\">10.1007/978-3-642-39718-9_11</a>}, 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} }","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. <i>Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings</i>. Lecture Notes in Computer Science. ; 2013:177--194. doi:<a href=\"https://doi.org/10.1007/978-3-642-39718-9_11\">10.1007/978-3-642-39718-9_11</a>","mla":"Dongol, Brijesh, et al. “A High-Level Semantics for Program Execution under Total Store Order Memory.” <i>Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings</i>, edited by Zhiming Liu et al., 2013, pp. 177--194, doi:<a href=\"https://doi.org/10.1007/978-3-642-39718-9_11\">10.1007/978-3-642-39718-9_11</a>.","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.","chicago":"Dongol, Brijesh, Oleg Travkin, John Derrick, and Heike Wehrheim. “A High-Level Semantics for Program Execution under Total Store Order Memory.” In <i>Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings</i>, edited by Zhiming Liu, Jim Woodcock, and Huibiao Zhu, 177--194. Lecture Notes in Computer Science, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39718-9_11\">https://doi.org/10.1007/978-3-642-39718-9_11</a>.","ieee":"B. Dongol, O. Travkin, J. Derrick, and H. Wehrheim, “A High-Level Semantics for Program Execution under Total Store Order Memory,” in <i>Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings</i>, 2013, pp. 177--194.","apa":"Dongol, B., Travkin, O., Derrick, J., &#38; Wehrheim, H. (2013). A High-Level Semantics for Program Execution under Total Store Order Memory. In Z. Liu, J. Woodcock, &#38; H. Zhu (Eds.), <i>Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings</i> (pp. 177--194). <a href=\"https://doi.org/10.1007/978-3-642-39718-9_11\">https://doi.org/10.1007/978-3-642-39718-9_11</a>"},"date_created":"2018-06-13T08:13:31Z","type":"conference","department":[{"_id":"77"}],"title":"A High-Level Semantics for Program Execution under Total Store Order Memory","year":"2013","status":"public","author":[{"first_name":"Brijesh","last_name":"Dongol","full_name":"Dongol, Brijesh"},{"full_name":"Travkin, Oleg","last_name":"Travkin","first_name":"Oleg"},{"first_name":"John","last_name":"Derrick","full_name":"Derrick, John"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_updated":"2022-01-06T06:59:02Z","page":"177--194","_id":"3178","series_title":"Lecture Notes in Computer Science","user_id":"29719","doi":"10.1007/978-3-642-39718-9_11","editor":[{"first_name":"Zhiming","last_name":"Liu","full_name":"Liu, Zhiming"},{"last_name":"Woodcock","first_name":"Jim","full_name":"Woodcock, Jim"},{"last_name":"Zhu","first_name":"Huibiao","full_name":"Zhu, Huibiao"}]},{"editor":[{"full_name":"Kowalewski, Stefan","first_name":"Stefan","last_name":"Kowalewski"},{"first_name":"Bernhard","last_name":"Rumpe","full_name":"Rumpe, Bernhard"}],"user_id":"29719","series_title":"{LNI}","_id":"3179","page":"271--284","date_updated":"2022-01-06T06:59:02Z","author":[{"full_name":"Ziegert, Steffen","first_name":"Steffen","last_name":"Ziegert"},{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike","id":"573"}],"year":"2013","status":"public","title":"Temporal Reconfiguration Plans for Self-Adaptive Systems","department":[{"_id":"77"}],"type":"conference","date_created":"2018-06-13T08:15:08Z","citation":{"apa":"Ziegert, S., &#38; Wehrheim, H. (2013). Temporal Reconfiguration Plans for Self-Adaptive Systems. In S. Kowalewski &#38; B. Rumpe (Eds.), <i>Software Engineering 2013: Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\\\"{a}}rz 2013 in Aachen</i> (pp. 271--284).","ieee":"S. Ziegert and H. Wehrheim, “Temporal Reconfiguration Plans for Self-Adaptive Systems,” in <i>Software Engineering 2013: Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\\\"{a}}rz 2013 in Aachen</i>, 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.","chicago":"Ziegert, Steffen, and Heike Wehrheim. “Temporal Reconfiguration Plans for Self-Adaptive Systems.” In <i>Software Engineering 2013: Fachtagung Des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\\\"{a}}rz 2013 in Aachen</i>, edited by Stefan Kowalewski and Bernhard Rumpe, 271--284. {LNI}, 2013.","mla":"Ziegert, Steffen, and Heike Wehrheim. “Temporal Reconfiguration Plans for Self-Adaptive Systems.” <i>Software Engineering 2013: Fachtagung Des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\\\"{a}}rz 2013 in Aachen</i>, edited by Stefan Kowalewski and Bernhard Rumpe, 2013, pp. 271--284.","ama":"Ziegert S, Wehrheim H. Temporal Reconfiguration Plans for Self-Adaptive Systems. In: Kowalewski S, Rumpe B, eds. <i>Software Engineering 2013: Fachtagung Des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\\\"{a}}rz 2013 in Aachen</i>. {LNI}. ; 2013: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}} }"},"publication":"Software Engineering 2013: Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\\\"{a}}rz 2013 in Aachen"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2018-03-16T11:18:41Z","citation":{"mla":"Wonisch, Daniel, et al. “Zero Overhead Runtime Monitoring.” <i>Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)</i>, 2013, pp. 244–58, doi:<a href=\"https://doi.org/10.1007/978-3-642-40561-7_17\">10.1007/978-3-642-40561-7_17</a>.","bibtex":"@inproceedings{Wonisch_Schremmer_Wehrheim_2013, series={LNCS}, title={Zero Overhead Runtime Monitoring}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-40561-7_17\">10.1007/978-3-642-40561-7_17</a>}, 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} }","ama":"Wonisch D, Schremmer A, Wehrheim H. Zero Overhead Runtime Monitoring. In: <i>Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)</i>. LNCS. ; 2013:244-258. doi:<a href=\"https://doi.org/10.1007/978-3-642-40561-7_17\">10.1007/978-3-642-40561-7_17</a>","ieee":"D. Wonisch, A. Schremmer, and H. Wehrheim, “Zero Overhead Runtime Monitoring,” in <i>Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)</i>, 2013, pp. 244–258.","apa":"Wonisch, D., Schremmer, A., &#38; Wehrheim, H. (2013). Zero Overhead Runtime Monitoring. In <i>Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)</i> (pp. 244–258). <a href=\"https://doi.org/10.1007/978-3-642-40561-7_17\">https://doi.org/10.1007/978-3-642-40561-7_17</a>","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.","chicago":"Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Zero Overhead Runtime Monitoring.” In <i>Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)</i>, 244–58. LNCS, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40561-7_17\">https://doi.org/10.1007/978-3-642-40561-7_17</a>."},"has_accepted_license":"1","status":"public","user_id":"477","ddc":["040"],"page":"244-258","_id":"469","abstract":[{"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.","lang":"eng"}],"publication":"Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)","type":"conference","department":[{"_id":"77"}],"file":[{"access_level":"closed","file_size":394804,"file_name":"469-WSW2013-2.pdf","date_updated":"2018-03-16T11:18:41Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"1332","creator":"florida","date_created":"2018-03-16T11:18:41Z"}],"date_created":"2017-10-17T12:42:23Z","date_updated":"2022-01-06T07:01:18Z","title":"Zero Overhead Runtime Monitoring","year":"2013","author":[{"full_name":"Wonisch, Daniel","first_name":"Daniel","last_name":"Wonisch"},{"full_name":"Schremmer, Alexander","first_name":"Alexander","last_name":"Schremmer"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"doi":"10.1007/978-3-642-40561-7_17","series_title":"LNCS","language":[{"iso":"eng"}]},{"ddc":["040"],"user_id":"477","_id":"478","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:22Z","has_accepted_license":"1","year":"2013","title":"Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems","status":"public","author":[{"full_name":"Timm, Nils","first_name":"Nils","last_name":"Timm"}],"type":"dissertation","department":[{"_id":"77"}],"file":[{"file_id":"1324","content_type":"application/pdf","success":1,"file_name":"478-Dissertation-Timm.pdf","file_size":931458,"access_level":"closed","relation":"main_file","date_updated":"2018-03-15T14:06:05Z","date_created":"2018-03-15T14:06:05Z","creator":"florida"}],"date_created":"2017-10-17T12:42:25Z","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."}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2018-03-15T14:06:05Z","supervisor":[{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"citation":{"mla":"Timm, Nils. <i>Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems</i>. Universität Paderborn, 2013.","ama":"Timm N. <i>Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems</i>. Universität Paderborn; 2013.","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} }","apa":"Timm, N. (2013). <i>Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems</i>. Universität Paderborn.","ieee":"N. Timm, <i>Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems</i>. Universität Paderborn, 2013.","chicago":"Timm, Nils. <i>Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems</i>. Universität Paderborn, 2013.","short":"N. Timm, Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems, Universität Paderborn, 2013."}},{"citation":{"bibtex":"@inproceedings{Wonisch_Schremmer_Wehrheim_2013, series={LNCS}, title={Programs from Proofs – A PCC Alternative}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-39799-8_65\">10.1007/978-3-642-39799-8_65</a>}, 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} }","ama":"Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs – A PCC Alternative. In: <i>Proceedings of the 25th International Conference on Computer Aided Verification (CAV)</i>. LNCS. ; 2013:912-927. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_65\">10.1007/978-3-642-39799-8_65</a>","mla":"Wonisch, Daniel, et al. “Programs from Proofs – A PCC Alternative.” <i>Proceedings of the 25th International Conference on Computer Aided Verification (CAV)</i>, 2013, pp. 912–27, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_65\">10.1007/978-3-642-39799-8_65</a>.","chicago":"Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Programs from Proofs – A PCC Alternative.” In <i>Proceedings of the 25th International Conference on Computer Aided Verification (CAV)</i>, 912–27. LNCS, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_65\">https://doi.org/10.1007/978-3-642-39799-8_65</a>.","short":"D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the 25th International Conference on Computer Aided Verification (CAV), 2013, pp. 912–927.","ieee":"D. Wonisch, A. Schremmer, and H. Wehrheim, “Programs from Proofs – A PCC Alternative,” in <i>Proceedings of the 25th International Conference on Computer Aided Verification (CAV)</i>, 2013, pp. 912–927.","apa":"Wonisch, D., Schremmer, A., &#38; Wehrheim, H. (2013). Programs from Proofs – A PCC Alternative. In <i>Proceedings of the 25th International Conference on Computer Aided Verification (CAV)</i> (pp. 912–927). <a href=\"https://doi.org/10.1007/978-3-642-39799-8_65\">https://doi.org/10.1007/978-3-642-39799-8_65</a>"},"file_date_updated":"2018-03-15T13:42:30Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"status":"public","has_accepted_license":"1","_id":"498","page":"912-927","user_id":"477","ddc":["040"],"publication":"Proceedings of the 25th International Conference on Computer Aided Verification (CAV)","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."}],"date_created":"2017-10-17T12:42:29Z","file":[{"file_id":"1313","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-03-15T13:42:30Z","file_name":"498-WonischSchremmerWehrheim2013.pdf","access_level":"closed","file_size":487617,"date_created":"2018-03-15T13:42:30Z","creator":"florida"}],"department":[{"_id":"77"}],"type":"conference","author":[{"full_name":"Wonisch, Daniel","first_name":"Daniel","last_name":"Wonisch"},{"last_name":"Schremmer","first_name":"Alexander","full_name":"Schremmer, Alexander"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"year":"2013","title":"Programs from Proofs – A PCC Alternative","date_updated":"2022-01-06T07:01:32Z","series_title":"LNCS","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-39799-8_65"}]