[{"title":"Integrating Software and Hardware Verification","department":[{"_id":"77"},{"_id":"78"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"editor":[{"last_name":"Albert","full_name":"Albert, Elvira","first_name":"Elvira"},{"last_name":"Sekerinski","first_name":"Emil","full_name":"Sekerinski, Emil"}],"date_updated":"2022-01-06T07:00:14Z","doi":"10.1007/978-3-319-10181-1_19","series_title":"LNCS","language":[{"iso":"eng"}],"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"}],"user_id":"477","ddc":["040"],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-16T11:35:28Z","creator":"florida","file_id":"1364","file_size":561325,"access_level":"closed","date_created":"2018-03-16T11:35:28Z","file_name":"408-jakobs14_ifm.pdf"}],"file_date_updated":"2018-03-16T11:35:28Z","publication":"Proceedings of the 11th International Conference on Integrated Formal Methods (iFM)","author":[{"last_name":"Jakobs","full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine"},{"first_name":"Marco","full_name":"Platzner, Marco","last_name":"Platzner","id":"398"},{"id":"3118","last_name":"Wiersema","full_name":"Wiersema, Tobias","first_name":"Tobias"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"date_created":"2017-10-17T12:42:11Z","has_accepted_license":"1","status":"public","_id":"408","page":"307-322","citation":{"ama":"Jakobs M-C, Platzner M, Wiersema T, Wehrheim H. Integrating Software and Hardware Verification. In: Albert E, Sekerinski E, eds. Proceedings of the 11th International Conference on Integrated Formal Methods (IFM). LNCS. ; 2014:307-322. doi:10.1007/978-3-319-10181-1_19","apa":"Jakobs, M.-C., Platzner, M., Wiersema, T., & Wehrheim, H. (2014). Integrating Software and Hardware Verification. In E. Albert & E. Sekerinski (Eds.), Proceedings of the 11th International Conference on Integrated Formal Methods (iFM) (pp. 307–322). https://doi.org/10.1007/978-3-319-10181-1_19","chicago":"Jakobs, Marie-Christine, Marco Platzner, Tobias Wiersema, and Heike Wehrheim. “Integrating Software and Hardware Verification.” In Proceedings of the 11th International Conference on Integrated Formal Methods (IFM), edited by Elvira Albert and Emil Sekerinski, 307–22. LNCS, 2014. https://doi.org/10.1007/978-3-319-10181-1_19.","mla":"Jakobs, Marie-Christine, et al. “Integrating Software and Hardware Verification.” Proceedings of the 11th International Conference on Integrated Formal Methods (IFM), edited by Elvira Albert and Emil Sekerinski, 2014, pp. 307–22, doi:10.1007/978-3-319-10181-1_19.","bibtex":"@inproceedings{Jakobs_Platzner_Wiersema_Wehrheim_2014, series={LNCS}, title={Integrating Software and Hardware Verification}, DOI={10.1007/978-3-319-10181-1_19}, booktitle={Proceedings of the 11th International Conference on Integrated Formal Methods (iFM)}, author={Jakobs, Marie-Christine and Platzner, Marco and Wiersema, Tobias and Wehrheim, Heike}, editor={Albert, Elvira and Sekerinski, EmilEditors}, year={2014}, pages={307–322}, collection={LNCS} }","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.","ieee":"M.-C. Jakobs, M. Platzner, T. Wiersema, and H. Wehrheim, “Integrating Software and Hardware Verification,” in Proceedings of the 11th International Conference on Integrated Formal Methods (iFM), 2014, pp. 307–322."},"type":"conference","year":"2014"},{"file":[{"access_level":"closed","file_name":"417-main.pdf","date_created":"2018-03-16T11:33:33Z","relation":"main_file","success":1,"date_updated":"2018-03-16T11:33:33Z","content_type":"application/pdf","creator":"florida","file_id":"1360","file_size":643382}],"publication":"Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)","file_date_updated":"2018-03-16T11:33:33Z","author":[{"last_name":"Besova","full_name":"Besova, Galina","first_name":"Galina"},{"first_name":"Dominik","full_name":"Steenke, Dominik","last_name":"Steenke"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"date_created":"2017-10-17T12:42:13Z","has_accepted_license":"1","status":"public","abstract":[{"lang":"eng","text":"Model transformation is a key concept in modeldrivensoftware engineering. The definition of model transformationsis usually based on meta-models describing the abstractsyntax of languages. While meta-models are thereby able to abstractfrom superfluous details of concrete syntax, they often loosestructural information inherent in languages, like information onmodel elements always occurring together in particular shapes.As a consequence, model transformations cannot naturally re-uselanguage structures, thus leading to unnecessary complexity intheir development as well as analysis.In this paper, we propose a new approach to model transformationdevelopment which allows to simplify and improve thequality of the developed transformations via the exploitation ofthe languages’ structures. The approach is based on context-freegrammars and transformations defined by pairing productions ofsource and target grammars. We show that such transformationsexhibit three important characteristics: they are sound, completeand deterministic."}],"user_id":"477","ddc":["040"],"page":"1601-1610","citation":{"short":"G. Besova, D. Steenke, H. Wehrheim, in: Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD), 2014, pp. 1601–1610.","ieee":"G. Besova, D. Steenke, and H. Wehrheim, “Grammar-based model transformations,” in Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD), 2014, pp. 1601–1610.","chicago":"Besova, Galina, Dominik Steenke, and Heike Wehrheim. “Grammar-Based Model Transformations.” In Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD), 1601–10, 2014. https://doi.org/10.1016/j.cl.2015.05.003.","ama":"Besova G, Steenke D, Wehrheim H. Grammar-based model transformations. In: Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD). ; 2014:1601-1610. doi:10.1016/j.cl.2015.05.003","apa":"Besova, G., Steenke, D., & Wehrheim, H. (2014). Grammar-based model transformations. In Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD) (pp. 1601–1610). https://doi.org/10.1016/j.cl.2015.05.003","bibtex":"@inproceedings{Besova_Steenke_Wehrheim_2014, title={Grammar-based model transformations}, DOI={10.1016/j.cl.2015.05.003}, booktitle={Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)}, author={Besova, Galina and Steenke, Dominik and Wehrheim, Heike}, year={2014}, pages={1601–1610} }","mla":"Besova, Galina, et al. “Grammar-Based Model Transformations.” Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD), 2014, pp. 1601–10, doi:10.1016/j.cl.2015.05.003."},"year":"2014","type":"conference","_id":"417","department":[{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"title":"Grammar-based model transformations","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:00:28Z","doi":"10.1016/j.cl.2015.05.003"},{"status":"public","has_accepted_license":"1","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"date_created":"2017-10-17T12:42:13Z","file":[{"file_name":"fpauck_2014.pdf","date_created":"2019-08-07T09:00:20Z","access_level":"open_access","file_size":3191756,"creator":"fpauck","file_id":"12906","title":"Bachelorarbeit","date_updated":"2019-08-07T09:05:38Z","content_type":"application/pdf","relation":"main_file"}],"publisher":"Universität Paderborn","author":[{"last_name":"Pauck","id":"22398","first_name":"Felix","full_name":"Pauck, Felix"}],"department":[{"_id":"77"}],"file_date_updated":"2019-08-07T09:05:38Z","user_id":"22398","title":"Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren","ddc":["000"],"supervisor":[{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"language":[{"iso":"ger"}],"year":"2014","citation":{"ama":"Pauck F. Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren. Universität Paderborn; 2014.","apa":"Pauck, F. (2014). Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren. Universität Paderborn.","chicago":"Pauck, Felix. Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren. Universität Paderborn, 2014.","mla":"Pauck, Felix. Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren. Universität Paderborn, 2014.","bibtex":"@book{Pauck_2014, title={Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren}, publisher={Universität Paderborn}, author={Pauck, Felix}, year={2014} }","short":"F. Pauck, Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren, Universität Paderborn, 2014.","ieee":"F. Pauck, Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren. Universität Paderborn, 2014."},"type":"bachelorsthesis","oa":"1","_id":"418","date_updated":"2022-01-06T07:00:30Z"},{"editor":[{"first_name":"Dirk","full_name":"Beyer, Dirk","last_name":"Beyer"},{"last_name":"Boreale","full_name":"Boreale, Michele","first_name":"Michele"}],"date_created":"2018-06-13T08:08:39Z","status":"public","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","author":[{"full_name":"Isenberg, Tobias","first_name":"Tobias","last_name":"Isenberg"},{"full_name":"Steenken, Dominik","first_name":"Dominik","last_name":"Steenken"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"title":"Bounded Model Checking of Graph Transformation Systems via {SMT} Solving","user_id":"29719","page":"178--192","year":"2013","citation":{"ieee":"T. Isenberg, D. Steenken, and H. Wehrheim, “Bounded Model Checking of Graph Transformation Systems via {SMT} Solving,” in Formal Techniques for Distributed Systems - Joint {IFIP} {WG} 6.1 International Conference, {FMOODS/FORTE} 2013, Held as Part of the 8th International Federated Conference on Distributed Computing Techniques, DisCoTec 2013, Florence, Italy, June 3-5, 2013. Proceedings, 2013, pp. 178--192.","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.","mla":"Isenberg, Tobias, et al. “Bounded Model Checking of Graph Transformation Systems via {SMT} Solving.” Formal Techniques for Distributed Systems - Joint {IFIP} {WG} 6.1 International Conference, {FMOODS/FORTE} 2013, Held as Part of the 8th International Federated Conference on Distributed Computing Techniques, DisCoTec 2013, Florence, Italy, June 3-5, 2013. Proceedings, edited by Dirk Beyer and Michele Boreale, 2013, pp. 178--192, doi:10.1007/978-3-642-38592-6_13.","bibtex":"@inproceedings{Isenberg_Steenken_Wehrheim_2013, series={Lecture Notes in Computer Science}, title={Bounded Model Checking of Graph Transformation Systems via {SMT} Solving}, DOI={10.1007/978-3-642-38592-6_13}, booktitle={Formal Techniques for Distributed Systems - Joint {IFIP} {WG} 6.1 International Conference, {FMOODS/FORTE} 2013, Held as Part of the 8th International Federated Conference on Distributed Computing Techniques, DisCoTec 2013, Florence, Italy, June 3-5, 2013. Proceedings}, author={Isenberg, Tobias and Steenken, Dominik and Wehrheim, Heike}, editor={Beyer, Dirk and Boreale, MicheleEditors}, year={2013}, pages={178--192}, collection={Lecture Notes in Computer Science} }","apa":"Isenberg, T., Steenken, D., & Wehrheim, H. (2013). Bounded Model Checking of Graph Transformation Systems via {SMT} Solving. In D. Beyer & M. Boreale (Eds.), Formal Techniques for Distributed Systems - Joint {IFIP} {WG} 6.1 International Conference, {FMOODS/FORTE} 2013, Held as Part of the 8th International Federated Conference on Distributed Computing Techniques, DisCoTec 2013, Florence, Italy, June 3-5, 2013. Proceedings (pp. 178--192). https://doi.org/10.1007/978-3-642-38592-6_13","ama":"Isenberg T, Steenken D, Wehrheim H. Bounded Model Checking of Graph Transformation Systems via {SMT} Solving. In: Beyer D, Boreale M, eds. Formal Techniques for Distributed Systems - Joint {IFIP} {WG} 6.1 International Conference, {FMOODS/FORTE} 2013, Held as Part of the 8th International Federated Conference on Distributed Computing Techniques, DisCoTec 2013, Florence, Italy, June 3-5, 2013. Proceedings. Lecture Notes in Computer Science. ; 2013:178--192. doi:10.1007/978-3-642-38592-6_13","chicago":"Isenberg, Tobias, Dominik Steenken, and Heike Wehrheim. “Bounded Model Checking of Graph Transformation Systems via {SMT} Solving.” In Formal Techniques for Distributed Systems - Joint {IFIP} {WG} 6.1 International Conference, {FMOODS/FORTE} 2013, Held as Part of the 8th International Federated Conference on Distributed Computing Techniques, DisCoTec 2013, Florence, Italy, June 3-5, 2013. Proceedings, edited by Dirk Beyer and Michele Boreale, 178--192. Lecture Notes in Computer Science, 2013. https://doi.org/10.1007/978-3-642-38592-6_13."},"type":"conference","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-642-38592-6_13","date_updated":"2022-01-06T06:59:02Z","_id":"3176"},{"doi":"10.1007/978-3-319-03077-7_21","_id":"3177","date_updated":"2022-01-06T06:59:02Z","page":"311--326","type":"conference","year":"2013","citation":{"mla":"Travkin, Oleg, et al. “{SPIN} as a Linearizability Checker under Weak Memory Models.” Hardware and Software: Verification and Testing - 9th International Haifa Verification Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013, Proceedings, edited by Valeria Bertacco and Axel Legay, 2013, pp. 311--326, doi:10.1007/978-3-319-03077-7_21.","bibtex":"@inproceedings{Travkin_Mütze_Wehrheim_2013, series={Lecture Notes in Computer Science}, title={{SPIN} as a Linearizability Checker under Weak Memory Models}, DOI={10.1007/978-3-319-03077-7_21}, booktitle={Hardware and Software: Verification and Testing - 9th International Haifa Verification Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013, Proceedings}, author={Travkin, Oleg and Mütze, Annika and Wehrheim, Heike}, editor={Bertacco, Valeria and Legay, AxelEditors}, year={2013}, pages={311--326}, collection={Lecture Notes in Computer Science} }","chicago":"Travkin, Oleg, Annika Mütze, and Heike Wehrheim. “{SPIN} as a Linearizability Checker under Weak Memory Models.” In Hardware and Software: Verification and Testing - 9th International Haifa Verification Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013, Proceedings, edited by Valeria Bertacco and Axel Legay, 311--326. Lecture Notes in Computer Science, 2013. https://doi.org/10.1007/978-3-319-03077-7_21.","ama":"Travkin O, Mütze A, Wehrheim H. {SPIN} as a Linearizability Checker under Weak Memory Models. In: Bertacco V, Legay A, eds. Hardware and Software: Verification and Testing - 9th International Haifa Verification Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013, Proceedings. Lecture Notes in Computer Science. ; 2013:311--326. doi:10.1007/978-3-319-03077-7_21","apa":"Travkin, O., Mütze, A., & Wehrheim, H. (2013). {SPIN} as a Linearizability Checker under Weak Memory Models. In V. Bertacco & A. Legay (Eds.), Hardware and Software: Verification and Testing - 9th International Haifa Verification Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013, Proceedings (pp. 311--326). https://doi.org/10.1007/978-3-319-03077-7_21","ieee":"O. Travkin, A. Mütze, and H. Wehrheim, “{SPIN} as a Linearizability Checker under Weak Memory Models,” in Hardware and Software: Verification and Testing - 9th International Haifa Verification Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013, Proceedings, 2013, pp. 311--326.","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."},"series_title":"Lecture Notes in Computer Science","title":"{SPIN} as a Linearizability Checker under Weak Memory Models","user_id":"29719","editor":[{"first_name":"Valeria","full_name":"Bertacco, Valeria","last_name":"Bertacco"},{"last_name":"Legay","full_name":"Legay, Axel","first_name":"Axel"}],"date_created":"2018-06-13T08:09:44Z","status":"public","publication":"Hardware and Software: Verification and Testing - 9th International Haifa Verification Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013, Proceedings","department":[{"_id":"77"}],"author":[{"last_name":"Travkin","first_name":"Oleg","full_name":"Travkin, Oleg"},{"first_name":"Annika","full_name":"Mütze, Annika","last_name":"Mütze"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}]},{"department":[{"_id":"77"}],"publication":"Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings","author":[{"first_name":"Brijesh","full_name":"Dongol, Brijesh","last_name":"Dongol"},{"first_name":"Oleg","full_name":"Travkin, Oleg","last_name":"Travkin"},{"full_name":"Derrick, John","first_name":"John","last_name":"Derrick"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"date_created":"2018-06-13T08:13:31Z","status":"public","editor":[{"last_name":"Liu","first_name":"Zhiming","full_name":"Liu, Zhiming"},{"first_name":"Jim","full_name":"Woodcock, Jim","last_name":"Woodcock"},{"last_name":"Zhu","first_name":"Huibiao","full_name":"Zhu, Huibiao"}],"user_id":"29719","title":"A High-Level Semantics for Program Execution under Total Store Order Memory","series_title":"Lecture Notes in Computer Science","page":"177--194","year":"2013","citation":{"mla":"Dongol, Brijesh, et al. “A High-Level Semantics for Program Execution under Total Store Order Memory.” Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings, edited by Zhiming Liu et al., 2013, pp. 177--194, doi:10.1007/978-3-642-39718-9_11.","bibtex":"@inproceedings{Dongol_Travkin_Derrick_Wehrheim_2013, series={Lecture Notes in Computer Science}, title={A High-Level Semantics for Program Execution under Total Store Order Memory}, DOI={10.1007/978-3-642-39718-9_11}, booktitle={Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings}, author={Dongol, Brijesh and Travkin, Oleg and Derrick, John and Wehrheim, Heike}, editor={Liu, Zhiming and Woodcock, Jim and Zhu, HuibiaoEditors}, year={2013}, pages={177--194}, collection={Lecture Notes in Computer Science} }","chicago":"Dongol, Brijesh, Oleg Travkin, John Derrick, and Heike Wehrheim. “A High-Level Semantics for Program Execution under Total Store Order Memory.” In Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings, edited by Zhiming Liu, Jim Woodcock, and Huibiao Zhu, 177--194. Lecture Notes in Computer Science, 2013. https://doi.org/10.1007/978-3-642-39718-9_11.","ama":"Dongol B, Travkin O, Derrick J, Wehrheim H. A High-Level Semantics for Program Execution under Total Store Order Memory. In: Liu Z, Woodcock J, Zhu H, eds. Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings. Lecture Notes in Computer Science. ; 2013:177--194. doi:10.1007/978-3-642-39718-9_11","apa":"Dongol, B., Travkin, O., Derrick, J., & Wehrheim, H. (2013). A High-Level Semantics for Program Execution under Total Store Order Memory. In Z. Liu, J. Woodcock, & H. Zhu (Eds.), Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings (pp. 177--194). https://doi.org/10.1007/978-3-642-39718-9_11","ieee":"B. Dongol, O. Travkin, J. Derrick, and H. Wehrheim, “A High-Level Semantics for Program Execution under Total Store Order Memory,” in Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings, 2013, pp. 177--194.","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."},"type":"conference","date_updated":"2022-01-06T06:59:02Z","_id":"3178","doi":"10.1007/978-3-642-39718-9_11"},{"publication":"Software Engineering 2013: Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\\\"{a}}rz 2013 in Aachen","department":[{"_id":"77"}],"author":[{"first_name":"Steffen","full_name":"Ziegert, Steffen","last_name":"Ziegert"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"date_created":"2018-06-13T08:15:08Z","status":"public","editor":[{"last_name":"Kowalewski","first_name":"Stefan","full_name":"Kowalewski, Stefan"},{"first_name":"Bernhard","full_name":"Rumpe, Bernhard","last_name":"Rumpe"}],"user_id":"29719","title":"Temporal Reconfiguration Plans for Self-Adaptive Systems","series_title":"{LNI}","page":"271--284","type":"conference","citation":{"apa":"Ziegert, S., & Wehrheim, H. (2013). Temporal Reconfiguration Plans for Self-Adaptive Systems. In S. Kowalewski & B. Rumpe (Eds.), Software Engineering 2013: Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\\\"{a}}rz 2013 in Aachen (pp. 271--284).","ama":"Ziegert S, Wehrheim H. Temporal Reconfiguration Plans for Self-Adaptive Systems. In: Kowalewski S, Rumpe B, eds. Software Engineering 2013: Fachtagung Des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\\\"{a}}rz 2013 in Aachen. {LNI}. ; 2013:271--284.","chicago":"Ziegert, Steffen, and Heike Wehrheim. “Temporal Reconfiguration Plans for Self-Adaptive Systems.” In Software Engineering 2013: Fachtagung Des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\\\"{a}}rz 2013 in Aachen, edited by Stefan Kowalewski and Bernhard Rumpe, 271--284. {LNI}, 2013.","mla":"Ziegert, Steffen, and Heike Wehrheim. “Temporal Reconfiguration Plans for Self-Adaptive Systems.” Software Engineering 2013: Fachtagung Des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\\\"{a}}rz 2013 in Aachen, edited by Stefan Kowalewski and Bernhard Rumpe, 2013, pp. 271--284.","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}} }","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.","ieee":"S. Ziegert and H. Wehrheim, “Temporal Reconfiguration Plans for Self-Adaptive Systems,” in Software Engineering 2013: Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\\\"{a}}rz 2013 in Aachen, 2013, pp. 271--284."},"year":"2013","date_updated":"2022-01-06T06:59:02Z","_id":"3179"},{"doi":"10.1007/978-3-642-40561-7_17","date_updated":"2022-01-06T07:01:18Z","language":[{"iso":"eng"}],"series_title":"LNCS","title":"Zero Overhead Runtime Monitoring","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"department":[{"_id":"77"}],"_id":"469","type":"conference","year":"2013","citation":{"chicago":"Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Zero Overhead Runtime Monitoring.” In Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM), 244–58. LNCS, 2013. https://doi.org/10.1007/978-3-642-40561-7_17.","apa":"Wonisch, D., Schremmer, A., & Wehrheim, H. (2013). Zero Overhead Runtime Monitoring. In Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM) (pp. 244–258). https://doi.org/10.1007/978-3-642-40561-7_17","ama":"Wonisch D, Schremmer A, Wehrheim H. Zero Overhead Runtime Monitoring. In: Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM). LNCS. ; 2013:244-258. doi:10.1007/978-3-642-40561-7_17","mla":"Wonisch, Daniel, et al. “Zero Overhead Runtime Monitoring.” Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM), 2013, pp. 244–58, doi:10.1007/978-3-642-40561-7_17.","bibtex":"@inproceedings{Wonisch_Schremmer_Wehrheim_2013, series={LNCS}, title={Zero Overhead Runtime Monitoring}, DOI={10.1007/978-3-642-40561-7_17}, booktitle={Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)}, author={Wonisch, Daniel and Schremmer, Alexander and Wehrheim, Heike}, year={2013}, pages={244–258}, collection={LNCS} }","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.","ieee":"D. Wonisch, A. Schremmer, and H. Wehrheim, “Zero Overhead Runtime Monitoring,” in Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM), 2013, pp. 244–258."},"page":"244-258","ddc":["040"],"user_id":"477","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"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:23Z","author":[{"first_name":"Daniel","full_name":"Wonisch, Daniel","last_name":"Wonisch"},{"last_name":"Schremmer","first_name":"Alexander","full_name":"Schremmer, Alexander"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"file_date_updated":"2018-03-16T11:18:41Z","publication":"Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)","file":[{"access_level":"closed","file_name":"469-WSW2013-2.pdf","date_created":"2018-03-16T11:18:41Z","relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-16T11:18:41Z","file_id":"1332","creator":"florida","file_size":394804}]},{"author":[{"last_name":"Timm","first_name":"Nils","full_name":"Timm, Nils"}],"publisher":"Universität Paderborn","file_date_updated":"2018-03-15T14:06:05Z","department":[{"_id":"77"}],"file":[{"file_size":931458,"file_id":"1324","creator":"florida","content_type":"application/pdf","date_updated":"2018-03-15T14:06:05Z","relation":"main_file","success":1,"file_name":"478-Dissertation-Timm.pdf","date_created":"2018-03-15T14:06:05Z","access_level":"closed"}],"has_accepted_license":"1","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"date_created":"2017-10-17T12:42:25Z","abstract":[{"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.","lang":"eng"}],"ddc":["040"],"title":"Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems","user_id":"477","type":"dissertation","citation":{"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} }","mla":"Timm, Nils. Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems. Universität Paderborn, 2013.","chicago":"Timm, Nils. Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems. Universität Paderborn, 2013.","apa":"Timm, N. (2013). Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems. Universität Paderborn.","ama":"Timm N. Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems. Universität Paderborn; 2013.","ieee":"N. Timm, Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems. Universität Paderborn, 2013.","short":"N. Timm, Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems, Universität Paderborn, 2013."},"year":"2013","supervisor":[{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_updated":"2022-01-06T07:01:22Z","_id":"478"},{"citation":{"ieee":"D. Wonisch, A. Schremmer, and H. Wehrheim, “Programs from Proofs – A PCC Alternative,” in Proceedings of the 25th International Conference on Computer Aided Verification (CAV), 2013, pp. 912–927.","short":"D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the 25th International Conference on Computer Aided Verification (CAV), 2013, pp. 912–927.","mla":"Wonisch, Daniel, et al. “Programs from Proofs – A PCC Alternative.” Proceedings of the 25th International Conference on Computer Aided Verification (CAV), 2013, pp. 912–27, doi:10.1007/978-3-642-39799-8_65.","bibtex":"@inproceedings{Wonisch_Schremmer_Wehrheim_2013, series={LNCS}, title={Programs from Proofs – A PCC Alternative}, DOI={10.1007/978-3-642-39799-8_65}, booktitle={Proceedings of the 25th International Conference on Computer Aided Verification (CAV)}, author={Wonisch, Daniel and Schremmer, Alexander and Wehrheim, Heike}, year={2013}, pages={912–927}, collection={LNCS} }","chicago":"Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Programs from Proofs – A PCC Alternative.” In Proceedings of the 25th International Conference on Computer Aided Verification (CAV), 912–27. LNCS, 2013. https://doi.org/10.1007/978-3-642-39799-8_65.","apa":"Wonisch, D., Schremmer, A., & Wehrheim, H. (2013). Programs from Proofs – A PCC Alternative. In Proceedings of the 25th International Conference on Computer Aided Verification (CAV) (pp. 912–927). https://doi.org/10.1007/978-3-642-39799-8_65","ama":"Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs – A PCC Alternative. In: Proceedings of the 25th International Conference on Computer Aided Verification (CAV). LNCS. ; 2013:912-927. doi:10.1007/978-3-642-39799-8_65"},"year":"2013","type":"conference","page":"912-927","_id":"498","file":[{"content_type":"application/pdf","date_updated":"2018-03-15T13:42:30Z","success":1,"relation":"main_file","file_size":487617,"file_id":"1313","creator":"florida","access_level":"closed","date_created":"2018-03-15T13:42:30Z","file_name":"498-WonischSchremmerWehrheim2013.pdf"}],"author":[{"last_name":"Wonisch","full_name":"Wonisch, Daniel","first_name":"Daniel"},{"last_name":"Schremmer","full_name":"Schremmer, Alexander","first_name":"Alexander"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publication":"Proceedings of the 25th International Conference on Computer Aided Verification (CAV)","file_date_updated":"2018-03-15T13:42:30Z","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:29Z","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."}],"user_id":"477","ddc":["040"],"series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:32Z","doi":"10.1007/978-3-642-39799-8_65","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"title":"Programs from Proofs – A PCC Alternative"},{"title":"Knowledge-Based Verification of Service Compositions - An SMT approach","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"doi":"10.1109/ICECCS.2013.14","date_updated":"2022-01-06T07:01:41Z","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"477","abstract":[{"lang":"eng","text":"In the Semantic (Web) Services area, services are considered black boxes with a semantic description of their interfaces as to allow for precise service selection and configuration. The semantic description is usually grounded on domain-specific concepts as modeled in ontologies. This accounts for types used in service signatures, but also predicates occurring in preconditions and effects of services. Ontologies, in particular those enhanced with rules, capture the knowledge of domain experts on properties of and relations between domain concepts. In this paper, we present a verification technique for service compositions which makes use of this domain knowledge. We consider a service composition to be an assembly of services of which we just know signatures, preconditions, and effects. We aim at proving that a composition satisfies a (user-defined) requirement, specified in terms of guaranteed preconditions and required postconditions. As an underlying verification engine we use an SMT solver. To take advantage of the domain knowledge (and often, to enable verification at all), the knowledge is fed into the solver in the form of sorts, uninterpreted functions and in particular assertions as to enhance the solver’s reasoning capabilities. Thereby, we allow for deductions within a domain previously unknown to the solver. We exemplify our technique on a case study from the area of water network optimization software."}],"date_created":"2017-10-17T12:42:33Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-11-02T13:26:08Z","publication":"Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)","author":[{"last_name":"Walther","full_name":"Walther, Sven","first_name":"Sven"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"file":[{"access_level":"closed","file_name":"06601801.pdf","date_created":"2018-11-02T13:26:08Z","date_updated":"2018-11-02T13:26:08Z","content_type":"application/pdf","relation":"main_file","file_size":217085,"file_id":"5248","creator":"ups"}],"_id":"517","page":"24 - 32 ","type":"conference","citation":{"short":"S. Walther, H. Wehrheim, in: Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), 2013, pp. 24–32.","ieee":"S. Walther and H. Wehrheim, “Knowledge-Based Verification of Service Compositions - An SMT approach,” in Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), 2013, pp. 24–32.","chicago":"Walther, Sven, and Heike Wehrheim. “Knowledge-Based Verification of Service Compositions - An SMT Approach.” In Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), 24–32, 2013. https://doi.org/10.1109/ICECCS.2013.14.","apa":"Walther, S., & Wehrheim, H. (2013). Knowledge-Based Verification of Service Compositions - An SMT approach. In Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS) (pp. 24–32). https://doi.org/10.1109/ICECCS.2013.14","ama":"Walther S, Wehrheim H. Knowledge-Based Verification of Service Compositions - An SMT approach. In: Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS). ; 2013:24-32. doi:10.1109/ICECCS.2013.14","mla":"Walther, Sven, and Heike Wehrheim. “Knowledge-Based Verification of Service Compositions - An SMT Approach.” Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), 2013, pp. 24–32, doi:10.1109/ICECCS.2013.14.","bibtex":"@inproceedings{Walther_Wehrheim_2013, title={Knowledge-Based Verification of Service Compositions - An SMT approach}, DOI={10.1109/ICECCS.2013.14}, booktitle={Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)}, author={Walther, Sven and Wehrheim, Heike}, year={2013}, pages={24–32} }"},"year":"2013"},{"status":"public","date_created":"2018-06-13T08:16:49Z","author":[{"full_name":"Travkin, Oleg","first_name":"Oleg","last_name":"Travkin"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"},{"first_name":"Gerhard","full_name":"Schellhorn, Gerhard","last_name":"Schellhorn"}],"publication":"{ECEASST}","department":[{"_id":"77"}],"user_id":"29719","title":"Proving Linearizability of Multiset with Local Proof Obligations","citation":{"apa":"Travkin, O., Wehrheim, H., & Schellhorn, G. (2012). Proving Linearizability of Multiset with Local Proof Obligations. {ECEASST}.","ama":"Travkin O, Wehrheim H, Schellhorn G. Proving Linearizability of Multiset with Local Proof Obligations. {ECEASST}. 2012.","chicago":"Travkin, Oleg, Heike Wehrheim, and Gerhard Schellhorn. “Proving Linearizability of Multiset with Local Proof Obligations.” {ECEASST}, 2012.","mla":"Travkin, Oleg, et al. “Proving Linearizability of Multiset with Local Proof Obligations.” {ECEASST}, 2012.","bibtex":"@article{Travkin_Wehrheim_Schellhorn_2012, title={Proving Linearizability of Multiset with Local Proof Obligations}, journal={{ECEASST}}, author={Travkin, Oleg and Wehrheim, Heike and Schellhorn, Gerhard}, year={2012} }","short":"O. Travkin, H. Wehrheim, G. Schellhorn, {ECEASST} (2012).","ieee":"O. Travkin, H. Wehrheim, and G. Schellhorn, “Proving Linearizability of Multiset with Local Proof Obligations,” {ECEASST}, 2012."},"type":"journal_article","year":"2012","_id":"3180","date_updated":"2022-01-06T06:59:03Z"},{"title":"Model evolution and refinement","user_id":"29719","date_created":"2018-06-13T08:17:58Z","status":"public","publication":"Sci. Comput. Program.","department":[{"_id":"77"}],"author":[{"first_name":"Thomas","full_name":"Ruhroth, Thomas","last_name":"Ruhroth"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"doi":"10.1016/j.scico.2011.04.007","issue":"3","date_updated":"2022-01-06T06:59:03Z","_id":"3181","page":"270--289","type":"journal_article","citation":{"bibtex":"@article{Ruhroth_Wehrheim_2012, title={Model evolution and refinement}, DOI={10.1016/j.scico.2011.04.007}, number={3}, journal={Sci. Comput. Program.}, author={Ruhroth, Thomas and Wehrheim, Heike}, year={2012}, pages={270--289} }","mla":"Ruhroth, Thomas, and Heike Wehrheim. “Model Evolution and Refinement.” Sci. Comput. Program., no. 3, 2012, pp. 270--289, doi:10.1016/j.scico.2011.04.007.","chicago":"Ruhroth, Thomas, and Heike Wehrheim. “Model Evolution and Refinement.” Sci. Comput. Program., no. 3 (2012): 270--289. https://doi.org/10.1016/j.scico.2011.04.007.","ama":"Ruhroth T, Wehrheim H. Model evolution and refinement. Sci Comput Program. 2012;(3):270--289. doi:10.1016/j.scico.2011.04.007","apa":"Ruhroth, T., & Wehrheim, H. (2012). Model evolution and refinement. Sci. Comput. Program., (3), 270--289. https://doi.org/10.1016/j.scico.2011.04.007","ieee":"T. Ruhroth and H. Wehrheim, “Model evolution and refinement,” Sci. Comput. Program., no. 3, pp. 270--289, 2012.","short":"T. Ruhroth, H. Wehrheim, Sci. Comput. Program. (2012) 270--289."},"year":"2012"},{"date_updated":"2022-01-06T06:59:03Z","_id":"3182","doi":"10.1007/978-3-642-31424-7_21","series_title":"Lecture Notes in Computer Science","type":"conference","citation":{"bibtex":"@inproceedings{Schellhorn_Wehrheim_Derrick_2012, series={Lecture Notes in Computer Science}, title={How to Prove Algorithms Linearisable}, DOI={10.1007/978-3-642-31424-7_21}, booktitle={Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings}, author={Schellhorn, Gerhard and Wehrheim, Heike and Derrick, John}, editor={Madhusudan, P. and A. Seshia, SanjitEditors}, year={2012}, pages={243--259}, collection={Lecture Notes in Computer Science} }","mla":"Schellhorn, Gerhard, et al. “How to Prove Algorithms Linearisable.” Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings, edited by P. Madhusudan and Sanjit A. Seshia, 2012, pp. 243--259, doi:10.1007/978-3-642-31424-7_21.","chicago":"Schellhorn, Gerhard, Heike Wehrheim, and John Derrick. “How to Prove Algorithms Linearisable.” In Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings, edited by P. Madhusudan and Sanjit A. Seshia, 243--259. Lecture Notes in Computer Science, 2012. https://doi.org/10.1007/978-3-642-31424-7_21.","apa":"Schellhorn, G., Wehrheim, H., & Derrick, J. (2012). How to Prove Algorithms Linearisable. In P. Madhusudan & S. A. Seshia (Eds.), Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings (pp. 243--259). https://doi.org/10.1007/978-3-642-31424-7_21","ama":"Schellhorn G, Wehrheim H, Derrick J. How to Prove Algorithms Linearisable. In: Madhusudan P, A. Seshia S, eds. Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings. Lecture Notes in Computer Science. ; 2012:243--259. doi:10.1007/978-3-642-31424-7_21","ieee":"G. Schellhorn, H. Wehrheim, and J. Derrick, “How to Prove Algorithms Linearisable,” in Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings, 2012, pp. 243--259.","short":"G. Schellhorn, H. Wehrheim, J. Derrick, in: P. Madhusudan, S. A. Seshia (Eds.), Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings, 2012, pp. 243--259."},"year":"2012","page":"243--259","user_id":"29719","title":"How to Prove Algorithms Linearisable","author":[{"full_name":"Schellhorn, Gerhard","first_name":"Gerhard","last_name":"Schellhorn"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"},{"last_name":"Derrick","first_name":"John","full_name":"Derrick, John"}],"department":[{"_id":"77"}],"publication":"Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings","status":"public","date_created":"2018-06-13T08:19:33Z","editor":[{"last_name":"Madhusudan","full_name":"Madhusudan, P.","first_name":"P."},{"full_name":"A. Seshia, Sanjit","first_name":"Sanjit","last_name":"A. Seshia"}]},{"department":[{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"title":"Predicate Analysis with Block-Abstraction Memoization","series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:02:46Z","doi":"10.1007/978-3-642-34281-3_24","author":[{"last_name":"Wonisch","full_name":"Wonisch, Daniel","first_name":"Daniel"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publication":"Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)","file_date_updated":"2018-03-15T08:33:56Z","file":[{"date_updated":"2018-03-15T08:33:56Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":320901,"file_id":"1258","creator":"florida","access_level":"closed","file_name":"590-WonischWehrheim2012.pdf","date_created":"2018-03-15T08:33:56Z"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:47Z","abstract":[{"text":"Predicate abstraction is an established technique for reducing the size of the state space during verification. In this paper, we extend predication abstraction with block-abstraction memoization (BAM), which exploits the fact that blocks are often executed several times in a program. The verification can thus benefit from caching the values of previous block analyses and reusing them upon next entry into a block. In addition to function bodies, BAM also performs well for nested loops. To further increase effectiveness, block memoization has been integrated with lazy abstraction adopting a lazy strategy for cache refinement. Together, this achieves significant performance increases: our tool (an implementation within the configurable program analysis framework CPAchecker) has won the Competition on Software Verification 2012 in the category “Overall”.","lang":"eng"}],"ddc":["040"],"user_id":"477","type":"conference","citation":{"chicago":"Wonisch, Daniel, and Heike Wehrheim. “Predicate Analysis with Block-Abstraction Memoization.” In Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 332–47. LNCS, 2012. https://doi.org/10.1007/978-3-642-34281-3_24.","ama":"Wonisch D, Wehrheim H. Predicate Analysis with Block-Abstraction Memoization. In: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM). LNCS. ; 2012:332-347. doi:10.1007/978-3-642-34281-3_24","apa":"Wonisch, D., & Wehrheim, H. (2012). Predicate Analysis with Block-Abstraction Memoization. In Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM) (pp. 332–347). https://doi.org/10.1007/978-3-642-34281-3_24","mla":"Wonisch, Daniel, and Heike Wehrheim. “Predicate Analysis with Block-Abstraction Memoization.” Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 332–47, doi:10.1007/978-3-642-34281-3_24.","bibtex":"@inproceedings{Wonisch_Wehrheim_2012, series={LNCS}, title={Predicate Analysis with Block-Abstraction Memoization}, DOI={10.1007/978-3-642-34281-3_24}, booktitle={Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)}, author={Wonisch, Daniel and Wehrheim, Heike}, year={2012}, pages={332–347}, collection={LNCS} }","short":"D. Wonisch, H. Wehrheim, in: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 332–347.","ieee":"D. Wonisch and H. Wehrheim, “Predicate Analysis with Block-Abstraction Memoization,” in Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 332–347."},"year":"2012","page":"332-347","_id":"590"},{"_id":"608","type":"conference","citation":{"ieee":"N. Timm, H. Wehrheim, and M. Czech, “Heuristic-Guided Abstraction Refinement for Concurrent Systems,” in Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–363.","short":"N. Timm, H. Wehrheim, M. Czech, in: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–363.","bibtex":"@inproceedings{Timm_Wehrheim_Czech_2012, series={LNCS}, title={Heuristic-Guided Abstraction Refinement for Concurrent Systems}, DOI={10.1007/978-3-642-34281-3_25}, booktitle={Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)}, author={Timm, Nils and Wehrheim, Heike and Czech, Mike}, year={2012}, pages={348–363}, collection={LNCS} }","mla":"Timm, Nils, et al. “Heuristic-Guided Abstraction Refinement for Concurrent Systems.” Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–63, doi:10.1007/978-3-642-34281-3_25.","chicago":"Timm, Nils, Heike Wehrheim, and Mike Czech. “Heuristic-Guided Abstraction Refinement for Concurrent Systems.” In Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 348–63. LNCS, 2012. https://doi.org/10.1007/978-3-642-34281-3_25.","apa":"Timm, N., Wehrheim, H., & Czech, M. (2012). Heuristic-Guided Abstraction Refinement for Concurrent Systems. In Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM) (pp. 348–363). https://doi.org/10.1007/978-3-642-34281-3_25","ama":"Timm N, Wehrheim H, Czech M. Heuristic-Guided Abstraction Refinement for Concurrent Systems. In: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM). LNCS. ; 2012:348-363. doi:10.1007/978-3-642-34281-3_25"},"year":"2012","page":"348-363","abstract":[{"text":"Predicate abstraction is an established technique in software verification. It inherently includes an abstraction refinement loop successively adding predicates until the right level of abstraction is found. For concurrent systems, predicate abstraction can be combined with spotlight abstraction, further reducing the state space by abstracting away certain processes. Refinement then has to decide whether to add a new predicate or a new process. Selecting the right predicates and processes is a crucial task: The positive effect of abstraction may be compromised by unfavourable refinement decisions. Here we present a heuristic approach to abstraction refinement. The basis for a decision is a set of refinement candidates, derived by multiple counterexample-generation. Candidates are evaluated with respect to their influence on other components in the system. Experimental results show that our technique can significantly speed up verification as compared to a naive abstraction refinement.","lang":"eng"}],"ddc":["040"],"user_id":"477","author":[{"full_name":"Timm, Nils","first_name":"Nils","last_name":"Timm"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"},{"last_name":"Czech","full_name":"Czech, Mike","first_name":"Mike"}],"publication":"Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)","file_date_updated":"2018-03-15T08:15:33Z","file":[{"date_created":"2018-03-15T08:15:33Z","file_name":"608-Timm2013-0main.pdf","access_level":"closed","file_size":396337,"file_id":"1250","creator":"florida","date_updated":"2018-03-15T08:15:33Z","content_type":"application/pdf","success":1,"relation":"main_file"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:50Z","date_updated":"2022-01-06T07:02:52Z","doi":"10.1007/978-3-642-34281-3_25","series_title":"LNCS","language":[{"iso":"eng"}],"title":"Heuristic-Guided Abstraction Refinement for Concurrent Systems","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}]},{"file":[{"access_level":"closed","date_created":"2018-03-15T06:46:05Z","file_name":"627-WonischSV-Comp2012_01.pdf","content_type":"application/pdf","date_updated":"2018-03-15T06:46:05Z","relation":"main_file","success":1,"file_size":184000,"file_id":"1242","creator":"florida"}],"publication":"Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","file_date_updated":"2018-03-15T06:46:05Z","author":[{"full_name":"Wonisch, Daniel","first_name":"Daniel","last_name":"Wonisch"}],"date_created":"2017-10-17T12:42:54Z","has_accepted_license":"1","status":"public","abstract":[{"lang":"eng","text":"Block Abstraction Memoization (ABM) is a technique in software model checking that exploits the modularity of programs during verification by caching. To this end, ABM records the results of block analyses and reuses them if possible when revisiting the same block again. In this paper we present an implementation of ABM into the predicate-analysis component of the software-verification framework CPAchecker. With our participation at the Competition on Software Verification we aim at providing evidence that ABM can not only substantially increase the efficiency of predicate analysis but also enables verification of a wider range of programs."}],"user_id":"477","ddc":["040"],"page":"531-533","year":"2012","citation":{"bibtex":"@inproceedings{Wonisch_2012, series={LNCS}, title={Block Abstraction Memoization for CPAchecker}, DOI={10.1007/978-3-642-28756-5_41}, booktitle={Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)}, author={Wonisch, Daniel}, year={2012}, pages={531–533}, collection={LNCS} }","mla":"Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2012, pp. 531–33, doi:10.1007/978-3-642-28756-5_41.","ama":"Wonisch D. Block Abstraction Memoization for CPAchecker. In: Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS. ; 2012:531-533. doi:10.1007/978-3-642-28756-5_41","apa":"Wonisch, D. (2012). Block Abstraction Memoization for CPAchecker. In Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS) (pp. 531–533). https://doi.org/10.1007/978-3-642-28756-5_41","chicago":"Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” In Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 531–33. LNCS, 2012. https://doi.org/10.1007/978-3-642-28756-5_41.","ieee":"D. Wonisch, “Block Abstraction Memoization for CPAchecker,” in Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2012, pp. 531–533.","short":"D. Wonisch, in: Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2012, pp. 531–533."},"type":"conference","_id":"627","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"title":"Block Abstraction Memoization for CPAchecker","series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:02:59Z","doi":"10.1007/978-3-642-28756-5_41"},{"title":"Weaving-based configuration and modular transformation of multi-layer systems","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"doi":"10.1007/978-3-642-33666-9_49","date_updated":"2022-01-06T07:02:20Z","language":[{"iso":"eng"}],"series_title":"LNCS","ddc":["040"],"user_id":"477","abstract":[{"text":"In model-driven development of multi-layer systems (e.g. application, platform and infrastructure), each layer is usually described by separate models. When generating analysis models or code, these separate models rst of all need to be linked. Hence, existing model transformations for single layers cannot be simply re-used. In this paper, we present a modular approach to the transformation of multi-layer systems. It employs model weaving to dene the interconnections between models of dierent layers. The weaving models themselves are subject to model transformations: The result of transforming a weaving model constitutes a conguration for the models obtained by transforming single layers, thereby allowing for a re-use of existing model transformations. We exemplify our approach by the generation of analysis models for component-based software.","lang":"eng"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:42Z","author":[{"full_name":"Besova, Galina","first_name":"Galina","last_name":"Besova"},{"last_name":"Walther","first_name":"Sven","full_name":"Walther, Sven"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"},{"first_name":"Steffen","full_name":"Becker, Steffen","last_name":"Becker"}],"file_date_updated":"2018-03-15T10:24:06Z","publication":"Proceedings of the 15th International Conference on Model Driven Engineering Languages & Systems (MoDELS)","file":[{"date_updated":"2018-03-15T10:24:06Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":589972,"file_id":"1276","creator":"florida","access_level":"closed","date_created":"2018-03-15T10:24:06Z","file_name":"565-Besova_et_al._-_2012_-_Weaving-Based_Configuration_and_Modular_Transformation_of_Multi-layer_Systems_01.pdf"}],"_id":"565","type":"conference","citation":{"mla":"Besova, Galina, et al. “Weaving-Based Configuration and Modular Transformation of Multi-Layer Systems.” Proceedings of the 15th International Conference on Model Driven Engineering Languages & Systems (MoDELS), 2012, pp. 776–92, doi:10.1007/978-3-642-33666-9_49.","bibtex":"@inproceedings{Besova_Walther_Wehrheim_Becker_2012, series={LNCS}, title={Weaving-based configuration and modular transformation of multi-layer systems}, DOI={10.1007/978-3-642-33666-9_49}, booktitle={Proceedings of the 15th International Conference on Model Driven Engineering Languages & Systems (MoDELS)}, author={Besova, Galina and Walther, Sven and Wehrheim, Heike and Becker, Steffen}, year={2012}, pages={776–792}, collection={LNCS} }","apa":"Besova, G., Walther, S., Wehrheim, H., & Becker, S. (2012). Weaving-based configuration and modular transformation of multi-layer systems. In Proceedings of the 15th International Conference on Model Driven Engineering Languages & Systems (MoDELS) (pp. 776–792). https://doi.org/10.1007/978-3-642-33666-9_49","ama":"Besova G, Walther S, Wehrheim H, Becker S. Weaving-based configuration and modular transformation of multi-layer systems. In: Proceedings of the 15th International Conference on Model Driven Engineering Languages & Systems (MoDELS). LNCS. ; 2012:776-792. doi:10.1007/978-3-642-33666-9_49","chicago":"Besova, Galina, Sven Walther, Heike Wehrheim, and Steffen Becker. “Weaving-Based Configuration and Modular Transformation of Multi-Layer Systems.” In Proceedings of the 15th International Conference on Model Driven Engineering Languages & Systems (MoDELS), 776–92. LNCS, 2012. https://doi.org/10.1007/978-3-642-33666-9_49.","ieee":"G. Besova, S. Walther, H. Wehrheim, and S. Becker, “Weaving-based configuration and modular transformation of multi-layer systems,” in Proceedings of the 15th International Conference on Model Driven Engineering Languages & Systems (MoDELS), 2012, pp. 776–792.","short":"G. Besova, S. Walther, H. Wehrheim, S. Becker, in: Proceedings of the 15th International Conference on Model Driven Engineering Languages & Systems (MoDELS), 2012, pp. 776–792."},"year":"2012","page":"776-792"},{"author":[{"last_name":"Schneider","full_name":"Schneider, Steve","first_name":"Steve"},{"last_name":"Treharne","full_name":"Treharne, Helen","first_name":"Helen"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publication":"Electr. Notes Theor. Comput. Sci.","department":[{"_id":"77"}],"status":"public","date_created":"2018-06-13T08:20:47Z","user_id":"29719","title":"Bounded Retransmission in Event-B{\\(\\parallel\\)}CSP: a Case Study","type":"journal_article","citation":{"mla":"Schneider, Steve, et al. “Bounded Retransmission in Event-B{\\(\\parallel\\)}CSP: A Case Study.” Electr. Notes Theor. Comput. Sci., 2011, pp. 69--80, doi:10.1016/j.entcs.2011.11.019.","bibtex":"@article{Schneider_Treharne_Wehrheim_2011, title={Bounded Retransmission in Event-B{\\(\\parallel\\)}CSP: a Case Study}, DOI={10.1016/j.entcs.2011.11.019}, journal={Electr. Notes Theor. Comput. Sci.}, author={Schneider, Steve and Treharne, Helen and Wehrheim, Heike}, year={2011}, pages={69--80} }","chicago":"Schneider, Steve, Helen Treharne, and Heike Wehrheim. “Bounded Retransmission in Event-B{\\(\\parallel\\)}CSP: A Case Study.” Electr. Notes Theor. Comput. Sci., 2011, 69--80. https://doi.org/10.1016/j.entcs.2011.11.019.","ama":"Schneider S, Treharne H, Wehrheim H. Bounded Retransmission in Event-B{\\(\\parallel\\)}CSP: a Case Study. Electr Notes Theor Comput Sci. 2011:69--80. doi:10.1016/j.entcs.2011.11.019","apa":"Schneider, S., Treharne, H., & Wehrheim, H. (2011). Bounded Retransmission in Event-B{\\(\\parallel\\)}CSP: a Case Study. Electr. Notes Theor. Comput. Sci., 69--80. https://doi.org/10.1016/j.entcs.2011.11.019","ieee":"S. Schneider, H. Treharne, and H. Wehrheim, “Bounded Retransmission in Event-B{\\(\\parallel\\)}CSP: a Case Study,” Electr. Notes Theor. Comput. Sci., pp. 69--80, 2011.","short":"S. Schneider, H. Treharne, H. Wehrheim, Electr. Notes Theor. Comput. Sci. (2011) 69--80."},"year":"2011","page":"69--80","date_updated":"2022-01-06T06:59:03Z","_id":"3183","doi":"10.1016/j.entcs.2011.11.019"},{"date_updated":"2022-01-06T06:59:03Z","_id":"3184","doi":"10.1145/1889997.1890001","issue":"1","citation":{"short":"J. Derrick, G. Schellhorn, H. Wehrheim, {ACM} Trans. Program. Lang. Syst. (2011) 4:1--4:43.","ieee":"J. Derrick, G. Schellhorn, and H. Wehrheim, “Mechanically verified proof obligations for linearizability,” {ACM} Trans. Program. Lang. Syst., no. 1, pp. 4:1--4:43, 2011.","apa":"Derrick, J., Schellhorn, G., & Wehrheim, H. (2011). Mechanically verified proof obligations for linearizability. {ACM} Trans. Program. Lang. Syst., (1), 4:1--4:43. https://doi.org/10.1145/1889997.1890001","ama":"Derrick J, Schellhorn G, Wehrheim H. Mechanically verified proof obligations for linearizability. {ACM} Trans Program Lang Syst. 2011;(1):4:1--4:43. doi:10.1145/1889997.1890001","chicago":"Derrick, John, Gerhard Schellhorn, and Heike Wehrheim. “Mechanically Verified Proof Obligations for Linearizability.” {ACM} Trans. Program. Lang. Syst., no. 1 (2011): 4:1--4:43. https://doi.org/10.1145/1889997.1890001.","mla":"Derrick, John, et al. “Mechanically Verified Proof Obligations for Linearizability.” {ACM} Trans. Program. Lang. Syst., no. 1, 2011, pp. 4:1--4:43, doi:10.1145/1889997.1890001.","bibtex":"@article{Derrick_Schellhorn_Wehrheim_2011, title={Mechanically verified proof obligations for linearizability}, DOI={10.1145/1889997.1890001}, number={1}, journal={{ACM} Trans. Program. Lang. Syst.}, author={Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}, year={2011}, pages={4:1--4:43} }"},"type":"journal_article","year":"2011","page":"4:1--4:43","title":"Mechanically verified proof obligations for linearizability","user_id":"29719","author":[{"last_name":"Derrick","first_name":"John","full_name":"Derrick, John"},{"full_name":"Schellhorn, Gerhard","first_name":"Gerhard","last_name":"Schellhorn"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"publication":"{ACM} Trans. Program. Lang. Syst.","department":[{"_id":"77"}],"status":"public","date_created":"2018-06-13T08:22:02Z"}]