[{"user_id":"15504","title":"Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions","status":"public","date_created":"2017-10-17T12:41:23Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"author":[{"full_name":"Zhang, Guangli","first_name":"Guangli","last_name":"Zhang"}],"publisher":"Universität Paderborn","department":[{"_id":"77"}],"date_updated":"2022-01-06T06:52:45Z","_id":"162","supervisor":[{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"language":[{"iso":"eng"}],"type":"mastersthesis","year":"2016","citation":{"short":"G. Zhang, Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions, Universität Paderborn, 2016.","ieee":"G. Zhang, Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions. Universität Paderborn, 2016.","ama":"Zhang G. Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions. Universität Paderborn; 2016.","apa":"Zhang, G. (2016). Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions. Universität Paderborn.","chicago":"Zhang, Guangli. Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions. Universität Paderborn, 2016.","mla":"Zhang, Guangli. Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions. Universität Paderborn, 2016.","bibtex":"@book{Zhang_2016, title={Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions}, publisher={Universität Paderborn}, author={Zhang, Guangli}, year={2016} }"}},{"language":[{"iso":"eng"}],"supervisor":[{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"year":"2016","type":"mastersthesis","citation":{"apa":"Czech, M. (2016). Predicting Rankings of Software Verification Tools Using Kernels for Structured Data. Universität Paderborn.","ama":"Czech M. Predicting Rankings of Software Verification Tools Using Kernels for Structured Data. Universität Paderborn; 2016.","chicago":"Czech, Mike. Predicting Rankings of Software Verification Tools Using Kernels for Structured Data. Universität Paderborn, 2016.","mla":"Czech, Mike. Predicting Rankings of Software Verification Tools Using Kernels for Structured Data. Universität Paderborn, 2016.","bibtex":"@book{Czech_2016, title={Predicting Rankings of Software Verification Tools Using Kernels for Structured Data}, publisher={Universität Paderborn}, author={Czech, Mike}, year={2016} }","short":"M. Czech, Predicting Rankings of Software Verification Tools Using Kernels for Structured Data, Universität Paderborn, 2016.","ieee":"M. Czech, Predicting Rankings of Software Verification Tools Using Kernels for Structured Data. Universität Paderborn, 2016."},"date_updated":"2022-01-06T06:52:50Z","_id":"164","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"date_created":"2017-10-17T12:41:24Z","status":"public","department":[{"_id":"77"}],"publisher":"Universität Paderborn","author":[{"full_name":"Czech, Mike","first_name":"Mike","last_name":"Czech"}],"user_id":"15504","title":"Predicting Rankings of Software Verification Tools Using Kernels for Structured Data"},{"language":[{"iso":"ger"}],"supervisor":[{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"type":"bachelorsthesis","year":"2016","citation":{"bibtex":"@book{Dewender_2016, title={Verifikation von Service Kompositionen mit Spin}, publisher={Universität Paderborn}, author={Dewender, Markus}, year={2016} }","mla":"Dewender, Markus. Verifikation von Service Kompositionen mit Spin. Universität Paderborn, 2016.","apa":"Dewender, M. (2016). Verifikation von Service Kompositionen mit Spin. Universität Paderborn.","ama":"Dewender M. Verifikation von Service Kompositionen mit Spin. Universität Paderborn; 2016.","chicago":"Dewender, Markus. Verifikation von Service Kompositionen mit Spin. Universität Paderborn, 2016.","ieee":"M. Dewender, Verifikation von Service Kompositionen mit Spin. Universität Paderborn, 2016.","short":"M. Dewender, Verifikation von Service Kompositionen mit Spin, Universität Paderborn, 2016."},"_id":"133","date_updated":"2022-01-06T06:51:32Z","publisher":"Universität Paderborn","author":[{"last_name":"Dewender","full_name":"Dewender, Markus","first_name":"Markus"}],"department":[{"_id":"77"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"date_created":"2017-10-17T12:41:17Z","abstract":[{"lang":"eng","text":"."}],"user_id":"15504","title":"Verifikation von Service Kompositionen mit Spin"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"date_created":"2017-10-17T12:41:17Z","status":"public","department":[{"_id":"77"}],"publisher":"Universität Paderborn","author":[{"first_name":"Philipp","full_name":"Heinisch, Philipp","last_name":"Heinisch"}],"user_id":"15504","title":"Verifikation von Service Kompositionen mit Prolog","abstract":[{"lang":"eng","text":"."}],"language":[{"iso":"ger"}],"supervisor":[{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"year":"2016","type":"bachelorsthesis","citation":{"mla":"Heinisch, Philipp. Verifikation von Service Kompositionen mit Prolog. Universität Paderborn, 2016.","bibtex":"@book{Heinisch_2016, title={Verifikation von Service Kompositionen mit Prolog}, publisher={Universität Paderborn}, author={Heinisch, Philipp}, year={2016} }","chicago":"Heinisch, Philipp. Verifikation von Service Kompositionen mit Prolog. Universität Paderborn, 2016.","ama":"Heinisch P. Verifikation von Service Kompositionen mit Prolog. Universität Paderborn; 2016.","apa":"Heinisch, P. (2016). Verifikation von Service Kompositionen mit Prolog. Universität Paderborn.","ieee":"P. Heinisch, Verifikation von Service Kompositionen mit Prolog. Universität Paderborn, 2016.","short":"P. Heinisch, Verifikation von Service Kompositionen mit Prolog, Universität Paderborn, 2016."},"_id":"134","date_updated":"2022-01-06T06:51:34Z"},{"series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:56:43Z","doi":"10.1007/978-3-319-22969-0_12","department":[{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"title":"Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning","page":"159--174","citation":{"chicago":"Jakobs, Marie-Christine. “Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning.” In Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM), 159--174. LNCS, 2015. https://doi.org/10.1007/978-3-319-22969-0_12.","apa":"Jakobs, M.-C. (2015). Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning. In Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM) (pp. 159--174). https://doi.org/10.1007/978-3-319-22969-0_12","ama":"Jakobs M-C. Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning. In: Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM). LNCS. ; 2015:159--174. doi:10.1007/978-3-319-22969-0_12","mla":"Jakobs, Marie-Christine. “Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning.” Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM), 2015, pp. 159--174, doi:10.1007/978-3-319-22969-0_12.","bibtex":"@inproceedings{Jakobs_2015, series={LNCS}, title={Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning}, DOI={10.1007/978-3-319-22969-0_12}, booktitle={Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM)}, author={Jakobs, Marie-Christine}, year={2015}, pages={159--174}, collection={LNCS} }","short":"M.-C. Jakobs, in: Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM), 2015, pp. 159--174.","ieee":"M.-C. Jakobs, “Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning,” in Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM), 2015, pp. 159--174."},"year":"2015","type":"conference","_id":"250","file_date_updated":"2018-03-21T09:45:15Z","publication":"Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM)","author":[{"full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine","last_name":"Jakobs"}],"file":[{"file_size":724308,"creator":"florida","file_id":"1489","date_updated":"2018-03-21T09:45:15Z","content_type":"application/pdf","success":1,"relation":"main_file","date_created":"2018-03-21T09:45:15Z","file_name":"250-Jakobs2015.pdf","access_level":"closed"}],"date_created":"2017-10-17T12:41:40Z","has_accepted_license":"1","status":"public","abstract":[{"text":"Before execution, users should formally validate the correctness of software received from untrusted providers. To accelerate this validation, in the proof carrying code (PCC) paradigm the provider delivers the software together with a certificate, a formal proof of the software’s correctness. Thus, the user only checks if the attached certificate shows correctness of the delivered software.Recently, we introduced configurable program certification, a generic, PCC based framework supporting various software analyses and safety properties. Evaluation of our framework revealed that validation suffers from certificate reading. In this paper, we present two orthogonal approaches which improve certificate validation, both reducing the impact of certificate reading. The first approach reduces the certificate size, storing information only if it cannot easily be recomputed. The second approach partitions the certificate into independently checkable parts. The trick is to read parts of the certificate while already checking read parts. Our experiments show that validation highly benefits from our improvements.","lang":"eng"}],"ddc":["040"],"user_id":"477"},{"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:58:00Z","doi":"10.1007/978-3-662-46675-9_7","department":[{"_id":"77"}],"editor":[{"last_name":"Egyed","full_name":"Egyed, Alexander","first_name":"Alexander"},{"first_name":"Ina","full_name":"Schaefer, Ina","last_name":"Schaefer"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"title":"Just test what you cannot verify!","page":"100-114","type":"conference","citation":{"ieee":"M. Czech, M.-C. Jakobs, and H. Wehrheim, “Just test what you cannot verify!,” in Fundamental Approaches to Software Engineering, 2015, pp. 100–114.","short":"M. Czech, M.-C. Jakobs, H. Wehrheim, in: A. Egyed, I. Schaefer (Eds.), Fundamental Approaches to Software Engineering, 2015, pp. 100–114.","bibtex":"@inproceedings{Czech_Jakobs_Wehrheim_2015, series={Lecture Notes in Computer Science}, title={Just test what you cannot verify!}, DOI={10.1007/978-3-662-46675-9_7}, booktitle={Fundamental Approaches to Software Engineering}, author={Czech, Mike and Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Egyed, Alexander and Schaefer, InaEditors}, year={2015}, pages={100–114}, collection={Lecture Notes in Computer Science} }","mla":"Czech, Mike, et al. “Just Test What You Cannot Verify!” Fundamental Approaches to Software Engineering, edited by Alexander Egyed and Ina Schaefer, 2015, pp. 100–14, doi:10.1007/978-3-662-46675-9_7.","ama":"Czech M, Jakobs M-C, Wehrheim H. Just test what you cannot verify! In: Egyed A, Schaefer I, eds. Fundamental Approaches to Software Engineering. Lecture Notes in Computer Science. ; 2015:100-114. doi:10.1007/978-3-662-46675-9_7","apa":"Czech, M., Jakobs, M.-C., & Wehrheim, H. (2015). Just test what you cannot verify! In A. Egyed & I. Schaefer (Eds.), Fundamental Approaches to Software Engineering (pp. 100–114). https://doi.org/10.1007/978-3-662-46675-9_7","chicago":"Czech, Mike, Marie-Christine Jakobs, and Heike Wehrheim. “Just Test What You Cannot Verify!” In Fundamental Approaches to Software Engineering, edited by Alexander Egyed and Ina Schaefer, 100–114. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-662-46675-9_7."},"year":"2015","_id":"283","publication":"Fundamental Approaches to Software Engineering","file_date_updated":"2018-03-21T09:25:36Z","author":[{"last_name":"Czech","first_name":"Mike","full_name":"Czech, Mike"},{"last_name":"Jakobs","first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"file":[{"date_updated":"2018-03-21T09:25:36Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":391253,"creator":"florida","file_id":"1469","access_level":"closed","file_name":"283-FASEsubmission38_01.pdf","date_created":"2018-03-21T09:25:36Z"}],"date_created":"2017-10-17T12:41:47Z","has_accepted_license":"1","status":"public","abstract":[{"text":"Today, software verification is an established analysis method which can provide high guarantees for software safety. However, the resources (time and/or memory) for an exhaustive verification are not always available, and analysis then has to resort to other techniques, like testing. Most often, the already achieved partial verification results arediscarded in this case, and testing has to start from scratch.In this paper, we propose a method for combining verification and testing in which testing only needs to check the residual fraction of an uncompleted verification. To this end, the partial results of a verification run are used to construct a residual program (and residual assertions to be checked on it). The residual program can afterwards be fed into standardtesting tools. The proposed technique is sound modulo the soundness of the testing procedure. Experimental results show that this combinedusage of verification and testing can significantly reduce the effort for the subsequent testing.","lang":"eng"}],"ddc":["040"],"user_id":"477"},{"user_id":"477","ddc":["040"],"abstract":[{"lang":"eng","text":"We propose an incremental workflow for the verification of parameterized systems modeled as symmetric networks of timed automata. Starting with a small number of timed automata in the network, a safety property is verified using IC3, a state-of-the-art algorithm based on induction.The result of the verification, an inductive strengthening, is reused proposing a candidate inductive strengthening for a larger network.If the candidate is valid, our main theorem states that the safety property holds for all sizes of the network of timed automata. Otherwise the number of automata is increased and the next iteration is started with a new run of IC3.We propose and thoroughly examine optimizations to our workflow, e.g. Feedback mechanisms to speed up the run of IC3."}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:47Z","file":[{"file_size":479808,"file_id":"1466","creator":"florida","date_updated":"2018-03-21T09:23:45Z","content_type":"application/pdf","relation":"main_file","success":1,"file_name":"285-07352419.pdf","date_created":"2018-03-21T09:23:45Z","access_level":"closed"}],"author":[{"full_name":"Isenberg, Tobias","first_name":"Tobias","last_name":"Isenberg"}],"publication":"Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD)","file_date_updated":"2018-03-21T09:23:45Z","_id":"285","citation":{"chicago":"Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed Systems.” In Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD), 1–9, 2015. https://doi.org/10.1109/ACSD.2015.13.","apa":"Isenberg, T. (2015). Incremental Inductive Verification of Parameterized Timed Systems. In Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD) (pp. 1–9). https://doi.org/10.1109/ACSD.2015.13","ama":"Isenberg T. Incremental Inductive Verification of Parameterized Timed Systems. In: Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD). ; 2015:1-9. doi:10.1109/ACSD.2015.13","mla":"Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed Systems.” Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD), 2015, pp. 1–9, doi:10.1109/ACSD.2015.13.","bibtex":"@inproceedings{Isenberg_2015, title={Incremental Inductive Verification of Parameterized Timed Systems}, DOI={10.1109/ACSD.2015.13}, booktitle={Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD)}, author={Isenberg, Tobias}, year={2015}, pages={1–9} }","short":"T. Isenberg, in: Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD), 2015, pp. 1–9.","ieee":"T. Isenberg, “Incremental Inductive Verification of Parameterized Timed Systems,” in Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD), 2015, pp. 1–9."},"year":"2015","type":"conference","page":"1-9 ","title":"Incremental Inductive Verification of Parameterized Timed Systems","project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"doi":"10.1109/ACSD.2015.13","date_updated":"2022-01-06T06:58:07Z","language":[{"iso":"eng"}]},{"file_date_updated":"2018-03-21T09:47:14Z","department":[{"_id":"77"}],"publisher":"Universität Paderborn","author":[{"last_name":"Besova","full_name":"Besova, Galina","first_name":"Galina"}],"file":[{"access_level":"closed","date_created":"2018-03-21T09:47:14Z","file_name":"246-Dissertation_-_Besova.pdf","relation":"main_file","success":1,"date_updated":"2018-03-21T09:47:14Z","content_type":"application/pdf","file_id":"1492","creator":"florida","file_size":10091866}],"date_created":"2017-10-17T12:41:40Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"has_accepted_license":"1","status":"public","ddc":["040"],"title":"Systematic Development and Re-Use of Model Tranformations","user_id":"477","related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/hsx/content/titleinfo/1705899"}]},"citation":{"short":"G. Besova, Systematic Development and Re-Use of Model Tranformations, Universität Paderborn, 2015.","ieee":"G. Besova, Systematic Development and Re-Use of Model Tranformations. Universität Paderborn, 2015.","apa":"Besova, G. (2015). Systematic Development and Re-Use of Model Tranformations. Universität Paderborn.","ama":"Besova G. Systematic Development and Re-Use of Model Tranformations. Universität Paderborn; 2015.","chicago":"Besova, Galina. Systematic Development and Re-Use of Model Tranformations. Universität Paderborn, 2015.","bibtex":"@book{Besova_2015, title={Systematic Development and Re-Use of Model Tranformations}, publisher={Universität Paderborn}, author={Besova, Galina}, year={2015} }","mla":"Besova, Galina. Systematic Development and Re-Use of Model Tranformations. Universität Paderborn, 2015."},"year":"2015","type":"dissertation","supervisor":[{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"_id":"246","date_updated":"2022-01-06T06:56:30Z"},{"date_updated":"2022-01-06T06:57:18Z","doi":"10.1145/2695664.2695690","series_title":"SAC '15","language":[{"iso":"eng"}],"title":"Programs from Proofs of Predicated Dataflow Analyses","department":[{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"262","page":"1729-1736","citation":{"ieee":"M.-C. Jakobs and H. Wehrheim, “Programs from Proofs of Predicated Dataflow Analyses,” in Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015, pp. 1729–1736.","short":"M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015, pp. 1729–1736.","bibtex":"@inproceedings{Jakobs_Wehrheim_2015, series={SAC ’15}, title={Programs from Proofs of Predicated Dataflow Analyses}, DOI={10.1145/2695664.2695690}, booktitle={Proceedings of the 30th Annual ACM Symposium on Applied Computing}, author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2015}, pages={1729–1736}, collection={SAC ’15} }","mla":"Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated Dataflow Analyses.” Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015, pp. 1729–36, doi:10.1145/2695664.2695690.","chicago":"Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated Dataflow Analyses.” In Proceedings of the 30th Annual ACM Symposium on Applied Computing, 1729–36. SAC ’15, 2015. https://doi.org/10.1145/2695664.2695690.","apa":"Jakobs, M.-C., & Wehrheim, H. (2015). Programs from Proofs of Predicated Dataflow Analyses. In Proceedings of the 30th Annual ACM Symposium on Applied Computing (pp. 1729–1736). https://doi.org/10.1145/2695664.2695690","ama":"Jakobs M-C, Wehrheim H. Programs from Proofs of Predicated Dataflow Analyses. In: Proceedings of the 30th Annual ACM Symposium on Applied Computing. SAC ’15. ; 2015:1729-1736. doi:10.1145/2695664.2695690"},"year":"2015","type":"conference","abstract":[{"lang":"eng","text":"Programs from Proofs\" is a generic method which generates new programs out of correctness proofs of given programs. The technique ensures that the new and given program are behaviorally equivalent and that the new program is easily verifiable, thus serving as an alternative to proof-carrying code concepts. So far, this generic method has one instantiation that verifies type-state properties of programs. In this paper, we present a whole range of new instantiations, all based on data ow analyses. More precisely, we show how an imprecise but fast data ow analysis can be enhanced with a predicate analysis as to yield a precise but expensive analysis. Out of the safety proofs of this analysis, we generate new programs, again behaviorally equivalent to the given ones, which are easily verifiable\" in the sense that now the data ow analysis alone can yield precise results. An experimental evaluation practically supports our claim of easy verification."}],"user_id":"477","ddc":["040"],"file":[{"file_size":554583,"creator":"florida","file_id":"1483","date_updated":"2018-03-21T09:35:34Z","content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-21T09:35:34Z","file_name":"262-mainSACfinal.pdf","access_level":"closed"}],"publication":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","file_date_updated":"2018-03-21T09:35:34Z","author":[{"first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine","last_name":"Jakobs"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"date_created":"2017-10-17T12:41:43Z","has_accepted_license":"1","status":"public"},{"doi":"10.1016/j.cl.2015.05.003","date_updated":"2022-01-06T06:58:43Z","language":[{"iso":"eng"}],"title":"Grammar-based model transformations: Definition, execution, and quality properties","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"department":[{"_id":"77"}],"_id":"290","year":"2015","type":"journal_article","citation":{"short":"G. Besova, D. Steenken, H. Wehrheim, Computer Languages, Systems & Structures (2015) 116–138.","ieee":"G. Besova, D. Steenken, and H. Wehrheim, “Grammar-based model transformations: Definition, execution, and quality properties,” Computer Languages, Systems & Structures, pp. 116–138, 2015.","chicago":"Besova, Galina, Dominik Steenken, and Heike Wehrheim. “Grammar-Based Model Transformations: Definition, Execution, and Quality Properties.” Computer Languages, Systems & Structures, 2015, 116–38. https://doi.org/10.1016/j.cl.2015.05.003.","ama":"Besova G, Steenken D, Wehrheim H. Grammar-based model transformations: Definition, execution, and quality properties. Computer Languages, Systems & Structures. 2015:116-138. doi:10.1016/j.cl.2015.05.003","apa":"Besova, G., Steenken, D., & Wehrheim, H. (2015). Grammar-based model transformations: Definition, execution, and quality properties. Computer Languages, Systems & Structures, 116–138. https://doi.org/10.1016/j.cl.2015.05.003","mla":"Besova, Galina, et al. “Grammar-Based Model Transformations: Definition, Execution, and Quality Properties.” Computer Languages, Systems & Structures, Elsevier, 2015, pp. 116–38, doi:10.1016/j.cl.2015.05.003.","bibtex":"@article{Besova_Steenken_Wehrheim_2015, title={Grammar-based model transformations: Definition, execution, and quality properties}, DOI={10.1016/j.cl.2015.05.003}, journal={Computer Languages, Systems & Structures}, publisher={Elsevier}, author={Besova, Galina and Steenken, Dominik and Wehrheim, Heike}, year={2015}, pages={116–138} }"},"page":"116-138","user_id":"477","ddc":["040"],"abstract":[{"lang":"eng","text":"Model transformation is a key concept in model-driven software engineering. The definition of model transformations is usually based on meta-models describing the abstract syntax of languages. While meta-models are thereby able to abstract from uperfluous details of concrete syntax, they often loose structural information inherent in languages, like information on model elements always occurring together in particular shapes. As a consequence, model transformations cannot naturally re-use language structures, thus leading to unnecessary complexity in their development as well as in quality assurance.In this paper, we propose a new approach to model transformation development which allows to simplify the developed transformations and improve their quality via the exploitation of the languages׳ structures. The approach is based on context-free graph grammars and transformations defined by pairing productions of source and target grammars. We show that such transformations have important properties: they terminate and are sound, complete, and deterministic."}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:48Z","file":[{"date_created":"2018-03-21T09:22:03Z","file_name":"290-BSW15-main.pdf","access_level":"closed","file_size":1329478,"file_id":"1464","creator":"florida","date_updated":"2018-03-21T09:22:03Z","content_type":"application/pdf","relation":"main_file","success":1}],"author":[{"first_name":"Galina","full_name":"Besova, Galina","last_name":"Besova"},{"last_name":"Steenken","full_name":"Steenken, Dominik","first_name":"Dominik"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publisher":"Elsevier","file_date_updated":"2018-03-21T09:22:03Z","publication":"Computer Languages, Systems & Structures"},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:01Z","doi":"10.1007/s00450-014-0259-7","department":[{"_id":"77"}],"project":[{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"title":"Temporal plans for software architecture reconfiguration","type":"journal_article","year":"2015","citation":{"short":"S. Ziegert, H. Wehrheim, Computer Science - R & D (2015) 303--320.","ieee":"S. Ziegert and H. Wehrheim, “Temporal plans for software architecture reconfiguration,” Computer Science - R & D, no. 3–4, pp. 303--320, 2015.","ama":"Ziegert S, Wehrheim H. Temporal plans for software architecture reconfiguration. Computer Science - R & D. 2015;(3-4):303--320. doi:10.1007/s00450-014-0259-7","apa":"Ziegert, S., & Wehrheim, H. (2015). Temporal plans for software architecture reconfiguration. Computer Science - R & D, (3–4), 303--320. https://doi.org/10.1007/s00450-014-0259-7","chicago":"Ziegert, Steffen, and Heike Wehrheim. “Temporal Plans for Software Architecture Reconfiguration.” Computer Science - R & D, no. 3–4 (2015): 303--320. https://doi.org/10.1007/s00450-014-0259-7.","bibtex":"@article{Ziegert_Wehrheim_2015, title={Temporal plans for software architecture reconfiguration}, DOI={10.1007/s00450-014-0259-7}, number={3–4}, journal={Computer Science - R & D}, author={Ziegert, Steffen and Wehrheim, Heike}, year={2015}, pages={303--320} }","mla":"Ziegert, Steffen, and Heike Wehrheim. “Temporal Plans for Software Architecture Reconfiguration.” Computer Science - R & D, no. 3–4, 2015, pp. 303--320, doi:10.1007/s00450-014-0259-7."},"page":"303--320","_id":"3162","issue":"3-4","author":[{"last_name":"Ziegert","full_name":"Ziegert, Steffen","first_name":"Steffen"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"file_date_updated":"2018-11-02T15:52:13Z","publication":"Computer Science - R & D","file":[{"file_size":2136451,"creator":"ups","file_id":"5315","date_updated":"2018-11-02T15:52:13Z","content_type":"application/pdf","success":1,"relation":"main_file","date_created":"2018-11-02T15:52:13Z","file_name":"TemporalPlansForSoftwareArchit.pdf","access_level":"closed"}],"status":"public","has_accepted_license":"1","date_created":"2018-06-13T07:47:56Z","ddc":["000"],"user_id":"477"},{"doi":"10.1007/978-3-319-23506-6_1","_id":"3163","date_updated":"2022-01-06T06:59:01Z","type":"conference","citation":{"bibtex":"@inproceedings{Meyer_Wehrheim_2015, series={Lecture Notes in Computer Science}, title={From Program Verification to Time and Space: The Scientific Life of Ernst-R{\\\"{u}}diger Olderog}, DOI={10.1007/978-3-319-23506-6_1}, booktitle={Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings}, author={Meyer, Roland and Wehrheim, Heike}, editor={Meyer, Roland and Platzer, Andr{\\’{e}} and Wehrheim, HeikeEditors}, year={2015}, pages={3--4}, collection={Lecture Notes in Computer Science} }","mla":"Meyer, Roland, and Heike Wehrheim. “From Program Verification to Time and Space: The Scientific Life of Ernst-R{\\\"{u}}diger Olderog.” Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings, edited by Roland Meyer et al., 2015, pp. 3--4, doi:10.1007/978-3-319-23506-6_1.","apa":"Meyer, R., & Wehrheim, H. (2015). From Program Verification to Time and Space: The Scientific Life of Ernst-R{\\\"{u}}diger Olderog. In R. Meyer, A. Platzer, & H. Wehrheim (Eds.), Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings (pp. 3--4). https://doi.org/10.1007/978-3-319-23506-6_1","ama":"Meyer R, Wehrheim H. From Program Verification to Time and Space: The Scientific Life of Ernst-R{\\\"{u}}diger Olderog. In: Meyer R, Platzer A, Wehrheim H, eds. Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings. Lecture Notes in Computer Science. ; 2015:3--4. doi:10.1007/978-3-319-23506-6_1","chicago":"Meyer, Roland, and Heike Wehrheim. “From Program Verification to Time and Space: The Scientific Life of Ernst-R{\\\"{u}}diger Olderog.” In Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings, edited by Roland Meyer, Andr{\\’{e}} Platzer, and Heike Wehrheim, 3--4. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-23506-6_1.","ieee":"R. Meyer and H. Wehrheim, “From Program Verification to Time and Space: The Scientific Life of Ernst-R{\\\"{u}}diger Olderog,” in Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings, 2015, pp. 3--4.","short":"R. Meyer, H. Wehrheim, in: R. Meyer, A. Platzer, H. Wehrheim (Eds.), Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings, 2015, pp. 3--4."},"year":"2015","page":"3--4","series_title":"Lecture Notes in Computer Science","title":"From Program Verification to Time and Space: The Scientific Life of Ernst-R{\\\"{u}}diger Olderog","user_id":"29719","editor":[{"first_name":"Roland","full_name":"Meyer, Roland","last_name":"Meyer"},{"first_name":"Andr{\\'{e}}","full_name":"Platzer, Andr{\\'{e}}","last_name":"Platzer"},{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"status":"public","date_created":"2018-06-13T07:49:28Z","author":[{"last_name":"Meyer","first_name":"Roland","full_name":"Meyer, Roland"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"publication":"Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings","department":[{"_id":"77"}]},{"user_id":"29719","title":"Verifying Opacity of a Transactional Mutex Lock","department":[{"_id":"77"}],"publication":"{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings","author":[{"full_name":"Derrick, John","first_name":"John","last_name":"Derrick"},{"full_name":"Dongol, Brijesh","first_name":"Brijesh","last_name":"Dongol"},{"last_name":"Schellhorn","first_name":"Gerhard","full_name":"Schellhorn, Gerhard"},{"last_name":"Travkin","full_name":"Travkin, Oleg","first_name":"Oleg"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"date_created":"2018-06-13T07:50:43Z","project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"status":"public","editor":[{"last_name":"Bj{\\o}rner","full_name":"Bj{\\o}rner, Nikolaj","first_name":"Nikolaj"},{"last_name":"S. de Boer","full_name":"S. de Boer, Frank","first_name":"Frank"}],"_id":"3164","date_updated":"2022-01-06T06:59:01Z","doi":"10.1007/978-3-319-19249-9_11","series_title":"Lecture Notes in Computer Science","page":"161--177","year":"2015","citation":{"chicago":"Derrick, John, Brijesh Dongol, Gerhard Schellhorn, Oleg Travkin, and Heike Wehrheim. “Verifying Opacity of a Transactional Mutex Lock.” In {FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings, edited by Nikolaj Bj{\\o}rner and Frank S. de Boer, 161--177. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-19249-9_11.","ama":"Derrick J, Dongol B, Schellhorn G, Travkin O, Wehrheim H. Verifying Opacity of a Transactional Mutex Lock. In: Bj{\\o}rner N, S. de Boer F, eds. {FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings. Lecture Notes in Computer Science. ; 2015:161--177. doi:10.1007/978-3-319-19249-9_11","apa":"Derrick, J., Dongol, B., Schellhorn, G., Travkin, O., & Wehrheim, H. (2015). Verifying Opacity of a Transactional Mutex Lock. In N. Bj{\\o}rner & F. S. de Boer (Eds.), {FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings (pp. 161--177). https://doi.org/10.1007/978-3-319-19249-9_11","bibtex":"@inproceedings{Derrick_Dongol_Schellhorn_Travkin_Wehrheim_2015, series={Lecture Notes in Computer Science}, title={Verifying Opacity of a Transactional Mutex Lock}, DOI={10.1007/978-3-319-19249-9_11}, booktitle={{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings}, author={Derrick, John and Dongol, Brijesh and Schellhorn, Gerhard and Travkin, Oleg and Wehrheim, Heike}, editor={Bj{\\o}rner, Nikolaj and S. de Boer, FrankEditors}, year={2015}, pages={161--177}, collection={Lecture Notes in Computer Science} }","mla":"Derrick, John, et al. “Verifying Opacity of a Transactional Mutex Lock.” {FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings, edited by Nikolaj Bj{\\o}rner and Frank S. de Boer, 2015, pp. 161--177, doi:10.1007/978-3-319-19249-9_11.","short":"J. Derrick, B. Dongol, G. Schellhorn, O. Travkin, H. Wehrheim, in: N. Bj{\\o}rner, F. S. de Boer (Eds.), {FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings, 2015, pp. 161--177.","ieee":"J. Derrick, B. Dongol, G. Schellhorn, O. Travkin, and H. Wehrheim, “Verifying Opacity of a Transactional Mutex Lock,” in {FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings, 2015, pp. 161--177."},"type":"conference"},{"title":"{TSO} to {SC} via Symbolic Execution","user_id":"29719","editor":[{"full_name":"Piterman, Nir","first_name":"Nir","last_name":"Piterman"}],"date_created":"2018-06-13T07:52:44Z","status":"public","department":[{"_id":"77"}],"publication":"Hardware and Software: Verification and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings","author":[{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"},{"full_name":"Travkin, Oleg","first_name":"Oleg","last_name":"Travkin"}],"doi":"10.1007/978-3-319-26287-1_7","_id":"3165","date_updated":"2022-01-06T06:59:01Z","page":"104--119","citation":{"mla":"Wehrheim, Heike, and Oleg Travkin. “{TSO} to {SC} via Symbolic Execution.” Hardware and Software: Verification and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings, edited by Nir Piterman, 2015, pp. 104--119, doi:10.1007/978-3-319-26287-1_7.","bibtex":"@inproceedings{Wehrheim_Travkin_2015, series={Lecture Notes in Computer Science}, title={{TSO} to {SC} via Symbolic Execution}, DOI={10.1007/978-3-319-26287-1_7}, booktitle={Hardware and Software: Verification and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings}, author={Wehrheim, Heike and Travkin, Oleg}, editor={Piterman, NirEditor}, year={2015}, pages={104--119}, collection={Lecture Notes in Computer Science} }","apa":"Wehrheim, H., & Travkin, O. (2015). {TSO} to {SC} via Symbolic Execution. In N. Piterman (Ed.), Hardware and Software: Verification and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings (pp. 104--119). https://doi.org/10.1007/978-3-319-26287-1_7","ama":"Wehrheim H, Travkin O. {TSO} to {SC} via Symbolic Execution. In: Piterman N, ed. Hardware and Software: Verification and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings. Lecture Notes in Computer Science. ; 2015:104--119. doi:10.1007/978-3-319-26287-1_7","chicago":"Wehrheim, Heike, and Oleg Travkin. “{TSO} to {SC} via Symbolic Execution.” In Hardware and Software: Verification and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings, edited by Nir Piterman, 104--119. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-26287-1_7.","ieee":"H. Wehrheim and O. Travkin, “{TSO} to {SC} via Symbolic Execution,” in Hardware and Software: Verification and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings, 2015, pp. 104--119.","short":"H. Wehrheim, O. Travkin, in: N. Piterman (Ed.), Hardware and Software: Verification and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings, 2015, pp. 104--119."},"year":"2015","type":"conference","series_title":"Lecture Notes in Computer Science"},{"user_id":"29719","title":"Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings","department":[{"_id":"77"}],"date_created":"2018-06-13T07:54:06Z","status":"public","publication_identifier":{"isbn":["978-3-319-23505-9"]},"editor":[{"first_name":"Roland","full_name":"Meyer, Roland","last_name":"Meyer"},{"first_name":"Andr{\\'{e}}","full_name":"Platzer, Andr{\\'{e}}","last_name":"Platzer"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"date_updated":"2022-01-06T06:59:01Z","_id":"3166","doi":"10.1007/978-3-319-23506-6","series_title":"Lecture Notes in Computer Science","year":"2015","citation":{"ieee":"R. Meyer, A. Platzer, and H. Wehrheim, Eds., Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings. 2015.","short":"R. Meyer, A. Platzer, H. Wehrheim, eds., Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings, 2015.","bibtex":"@book{Meyer_Platzer_Wehrheim_2015, series={Lecture Notes in Computer Science}, title={Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings}, DOI={10.1007/978-3-319-23506-6}, year={2015}, collection={Lecture Notes in Computer Science} }","mla":"Meyer, Roland, et al., editors. Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings. 2015, doi:10.1007/978-3-319-23506-6.","ama":"Meyer R, Platzer A, Wehrheim H, eds. Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings.; 2015. doi:10.1007/978-3-319-23506-6","apa":"Meyer, R., Platzer, A., & Wehrheim, H. (Eds.). (2015). Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings. https://doi.org/10.1007/978-3-319-23506-6","chicago":"Meyer, Roland, Andr{\\’{e}} Platzer, and Heike Wehrheim, eds. Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-23506-6."},"type":"conference_editor"},{"citation":{"bibtex":"@inproceedings{Walther_Wehrheim_2014, series={LNCS}, title={Verified Service Compositions by Template-Based Construction}, DOI={10.1007/978-3-319-15317-9_3}, booktitle={Proceedings of the 11th International Symposium on Formal Aspects of Component Software (FACS)}, author={Walther, Sven and Wehrheim, Heike}, editor={Lanese, Ivan and Madelaine, EricEditors}, year={2014}, pages={31–48}, collection={LNCS} }","mla":"Walther, Sven, and Heike Wehrheim. “Verified Service Compositions by Template-Based Construction.” Proceedings of the 11th International Symposium on Formal Aspects of Component Software (FACS), edited by Ivan Lanese and Eric Madelaine, 2014, pp. 31–48, doi:10.1007/978-3-319-15317-9_3.","ama":"Walther S, Wehrheim H. Verified Service Compositions by Template-Based Construction. In: Lanese I, Madelaine E, eds. Proceedings of the 11th International Symposium on Formal Aspects of Component Software (FACS). LNCS. ; 2014:31-48. doi:10.1007/978-3-319-15317-9_3","apa":"Walther, S., & Wehrheim, H. (2014). Verified Service Compositions by Template-Based Construction. In I. Lanese & E. Madelaine (Eds.), Proceedings of the 11th International Symposium on Formal Aspects of Component Software (FACS) (pp. 31–48). https://doi.org/10.1007/978-3-319-15317-9_3","chicago":"Walther, Sven, and Heike Wehrheim. “Verified Service Compositions by Template-Based Construction.” In Proceedings of the 11th International Symposium on Formal Aspects of Component Software (FACS), edited by Ivan Lanese and Eric Madelaine, 31–48. LNCS, 2014. https://doi.org/10.1007/978-3-319-15317-9_3.","ieee":"S. Walther and H. Wehrheim, “Verified Service Compositions by Template-Based Construction,” in Proceedings of the 11th International Symposium on Formal Aspects of Component Software (FACS), 2014, pp. 31–48.","short":"S. Walther, H. Wehrheim, in: I. Lanese, E. Madelaine (Eds.), Proceedings of the 11th International Symposium on Formal Aspects of Component Software (FACS), 2014, pp. 31–48."},"type":"conference","year":"2014","page":"31-48","_id":"336","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:57Z","author":[{"full_name":"Walther, Sven","first_name":"Sven","last_name":"Walther"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"file_date_updated":"2018-03-20T07:29:29Z","publication":"Proceedings of the 11th International Symposium on Formal Aspects of Component Software (FACS)","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-20T07:29:29Z","file_id":"1423","creator":"florida","file_size":484422,"access_level":"closed","file_name":"336-facs2014_walther.pdf","date_created":"2018-03-20T07:29:29Z"}],"ddc":["040"],"user_id":"477","abstract":[{"text":"Today, service compositions often need to be assembled or changed on-the-fly, which leaves only little time for quality assurance. Moreover, quality assurance is complicated by service providers only giving information on their services in terms of domain specific concepts with only limited semantic meaning. In this paper, we propose a method to construct service compositions based on pre-verifiedtemplates. Templates, given as workflow descriptions, are typed over a (domain-independent) template ontology defining concepts and predicates. Templates are proven correct using an abstract semantics, leaving the specific meaning of ontology concepts open, however, only up to given ontology rules. Construction of service compositions amounts to instantiation of templates with domain-specific services.Correctness of an instantiation can then simply be checked by verifying that the domain ontology(a) adheres to the rules of the template ontology, and (b) fulfills the constraints of the employed template.","lang":"eng"}],"language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-15317-9_3","date_updated":"2022-01-06T06:59:13Z","editor":[{"full_name":"Lanese, Ivan","first_name":"Ivan","last_name":"Lanese"},{"last_name":"Madelaine","first_name":"Eric","full_name":"Madelaine, Eric"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"title":"Verified Service Compositions by Template-Based Construction"},{"publisher":"Universität Paderborn","author":[{"last_name":"Korth","first_name":"Philipp","full_name":"Korth, Philipp"}],"department":[{"_id":"77"}],"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:41:58Z","user_id":"15504","title":"Untersuchung transitiver Eigenschaften der Technik \"Programs from Proofs\"","supervisor":[{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"language":[{"iso":"ger"}],"type":"bachelorsthesis","year":"2014","citation":{"ieee":"P. Korth, Untersuchung transitiver Eigenschaften der Technik “Programs from Proofs.” Universität Paderborn, 2014.","short":"P. Korth, Untersuchung transitiver Eigenschaften der Technik “Programs from Proofs,” Universität Paderborn, 2014.","mla":"Korth, Philipp. Untersuchung transitiver Eigenschaften der Technik “Programs from Proofs.” Universität Paderborn, 2014.","bibtex":"@book{Korth_2014, title={Untersuchung transitiver Eigenschaften der Technik “Programs from Proofs”}, publisher={Universität Paderborn}, author={Korth, Philipp}, year={2014} }","apa":"Korth, P. (2014). Untersuchung transitiver Eigenschaften der Technik “Programs from Proofs.” Universität Paderborn.","ama":"Korth P. Untersuchung transitiver Eigenschaften der Technik “Programs from Proofs.” Universität Paderborn; 2014.","chicago":"Korth, Philipp. Untersuchung transitiver Eigenschaften der Technik “Programs from Proofs.” Universität Paderborn, 2014."},"date_updated":"2022-01-06T06:59:14Z","_id":"340"},{"year":"2014","type":"conference","citation":{"short":"M. Becker, S. Becker, G. Besova, S. Walther, H. Wehrheim, in: Proceedings of the 40th Euromicro Conference on Software Engineering and Advanced Applications (Work in Progress Session), 2014.","ieee":"M. Becker, S. Becker, G. Besova, S. Walther, and H. Wehrheim, “Towards Systematic Configuration for Architecture Validation,” in Proceedings of the 40th Euromicro Conference on Software Engineering and Advanced Applications (Work in Progress Session), 2014.","apa":"Becker, M., Becker, S., Besova, G., Walther, S., & Wehrheim, H. (2014). Towards Systematic Configuration for Architecture Validation. In Proceedings of the 40th Euromicro Conference on Software Engineering and Advanced Applications (Work in Progress Session).","ama":"Becker M, Becker S, Besova G, Walther S, Wehrheim H. Towards Systematic Configuration for Architecture Validation. In: Proceedings of the 40th Euromicro Conference on Software Engineering and Advanced Applications (Work in Progress Session). ; 2014.","chicago":"Becker, Matthias, Steffen Becker, Galina Besova, Sven Walther, and Heike Wehrheim. “Towards Systematic Configuration for Architecture Validation.” In Proceedings of the 40th Euromicro Conference on Software Engineering and Advanced Applications (Work in Progress Session), 2014.","bibtex":"@inproceedings{Becker_Becker_Besova_Walther_Wehrheim_2014, title={Towards Systematic Configuration for Architecture Validation}, booktitle={Proceedings of the 40th Euromicro Conference on Software Engineering and Advanced Applications (Work in Progress Session)}, author={Becker, Matthias and Becker, Steffen and Besova, Galina and Walther, Sven and Wehrheim, Heike}, year={2014} }","mla":"Becker, Matthias, et al. “Towards Systematic Configuration for Architecture Validation.” Proceedings of the 40th Euromicro Conference on Software Engineering and Advanced Applications (Work in Progress Session), 2014."},"language":[{"iso":"eng"}],"_id":"344","date_updated":"2022-01-06T06:59:17Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"date_created":"2017-10-17T12:41:59Z","has_accepted_license":"1","status":"public","department":[{"_id":"77"}],"publication":"Proceedings of the 40th Euromicro Conference on Software Engineering and Advanced Applications (Work in Progress Session)","file_date_updated":"2018-03-20T07:27:54Z","author":[{"last_name":"Becker","full_name":"Becker, Matthias","first_name":"Matthias"},{"last_name":"Becker","first_name":"Steffen","full_name":"Becker, Steffen"},{"last_name":"Besova","first_name":"Galina","full_name":"Besova, Galina"},{"last_name":"Walther","full_name":"Walther, Sven","first_name":"Sven"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"file":[{"file_size":80674,"creator":"florida","file_id":"1420","date_updated":"2018-03-20T07:27:54Z","content_type":"application/pdf","relation":"main_file","success":1,"file_name":"344-paper_CAMERA_READY.pdf","date_created":"2018-03-20T07:27:54Z","access_level":"closed"}],"ddc":["040"],"title":"Towards Systematic Configuration for Architecture Validation","user_id":"477"},{"_id":"353","type":"conference","citation":{"short":"F. Mohr, S. Walther, in: Proceedings of the 14th International Conference on Software Reuse (ICSR), 2014, pp. 188–203.","ieee":"F. Mohr and S. Walther, “Template-based Generation of Semantic Services,” in Proceedings of the 14th International Conference on Software Reuse (ICSR), 2014, pp. 188–203.","chicago":"Mohr, Felix, and Sven Walther. “Template-Based Generation of Semantic Services.” In Proceedings of the 14th International Conference on Software Reuse (ICSR), 188–203. LNCS, 2014. https://doi.org/10.1007/978-3-319-14130-5_14.","apa":"Mohr, F., & Walther, S. (2014). Template-based Generation of Semantic Services. In Proceedings of the 14th International Conference on Software Reuse (ICSR) (pp. 188–203). https://doi.org/10.1007/978-3-319-14130-5_14","ama":"Mohr F, Walther S. Template-based Generation of Semantic Services. In: Proceedings of the 14th International Conference on Software Reuse (ICSR). LNCS. ; 2014:188-203. doi:10.1007/978-3-319-14130-5_14","bibtex":"@inproceedings{Mohr_Walther_2014, series={LNCS}, title={Template-based Generation of Semantic Services}, DOI={10.1007/978-3-319-14130-5_14}, booktitle={Proceedings of the 14th International Conference on Software Reuse (ICSR)}, author={Mohr, Felix and Walther, Sven}, year={2014}, pages={188–203}, collection={LNCS} }","mla":"Mohr, Felix, and Sven Walther. “Template-Based Generation of Semantic Services.” Proceedings of the 14th International Conference on Software Reuse (ICSR), 2014, pp. 188–203, doi:10.1007/978-3-319-14130-5_14."},"year":"2014","page":"188-203","user_id":"477","ddc":["040"],"abstract":[{"text":"There are many technologies for the automation of processesthat deal with services; examples are service discovery and composition.Automation of these processes requires that the services are described semantically. However, semantically described services are currently not oronly rarely available, which limits the applicability of discovery and composition approaches. The systematic support for creating new semanticservices usable by automated technologies is an open problem.We tackle this problem with a template based approach: Domain independent templates are instantiated with domain specific services andboolean expressions. The obtained services have semantic descriptionswhose correctness directly follows from the correctness of the template.Besides the theory, we present experimental results for a service repository in which 85% of the services were generated automatically.","lang":"eng"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:00Z","file":[{"file_size":431778,"file_id":"1414","creator":"florida","date_updated":"2018-03-20T07:23:32Z","content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-20T07:23:32Z","file_name":"353-icsr2015_submission_17.pdf","access_level":"closed"}],"author":[{"last_name":"Mohr","full_name":"Mohr, Felix","first_name":"Felix"},{"full_name":"Walther, Sven","first_name":"Sven","last_name":"Walther"}],"file_date_updated":"2018-03-20T07:23:32Z","publication":"Proceedings of the 14th International Conference on Software Reuse (ICSR)","doi":"10.1007/978-3-319-14130-5_14","date_updated":"2022-01-06T06:59:22Z","language":[{"iso":"eng"}],"series_title":"LNCS","title":"Template-based Generation of Semantic Services","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"department":[{"_id":"77"},{"_id":"355"}]},{"date_created":"2017-10-17T12:42:06Z","status":"public","has_accepted_license":"1","file_date_updated":"2018-03-20T07:04:52Z","publication":"Proceedings of the Software Engineering Conference (SE)","author":[{"first_name":"Daniel","full_name":"Wonisch, Daniel","last_name":"Wonisch"},{"last_name":"Schremmer","first_name":"Alexander","full_name":"Schremmer, Alexander"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"file":[{"file_id":"1392","creator":"florida","file_size":66474,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-20T07:04:52Z","date_created":"2018-03-20T07:04:52Z","file_name":"383-programmsFromProofsSE.pdf","access_level":"closed"}],"ddc":["040"],"user_id":"477","abstract":[{"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.","lang":"eng"}],"page":"67-68","year":"2014","citation":{"ama":"Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs -- Approach and Applications. In: Proceedings of the Software Engineering Conference (SE). Lecture Notes in Informatics (LNI). ; 2014:67-68.","apa":"Wonisch, D., Schremmer, A., & Wehrheim, H. (2014). Programs from Proofs -- Approach and Applications. In Proceedings of the Software Engineering Conference (SE) (pp. 67–68).","chicago":"Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Programs from Proofs -- Approach and Applications.” In Proceedings of the Software Engineering Conference (SE), 67–68. Lecture Notes in Informatics (LNI), 2014.","mla":"Wonisch, Daniel, et al. “Programs from Proofs -- Approach and Applications.” Proceedings of the Software Engineering Conference (SE), 2014, pp. 67–68.","bibtex":"@inproceedings{Wonisch_Schremmer_Wehrheim_2014, series={Lecture Notes in Informatics (LNI)}, title={Programs from Proofs -- Approach and Applications}, booktitle={Proceedings of the Software Engineering Conference (SE)}, author={Wonisch, Daniel and Schremmer, Alexander and Wehrheim, Heike}, year={2014}, pages={67–68}, collection={Lecture Notes in Informatics (LNI)} }","short":"D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the Software Engineering Conference (SE), 2014, pp. 67–68.","ieee":"D. Wonisch, A. Schremmer, and H. Wehrheim, “Programs from Proofs -- Approach and Applications,” in Proceedings of the Software Engineering Conference (SE), 2014, pp. 67–68."},"type":"conference","main_file_link":[{"url":"http://eprints.uni-kiel.de/23752/"}],"_id":"383","project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"title":"Programs from Proofs -- Approach and Applications","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Informatics (LNI)","date_updated":"2022-01-06T06:59:38Z"},{"page":"251--280","type":"journal_article","year":"2014","citation":{"chicago":"Schneider, Steve, Helen Treharne, and Heike Wehrheim. “The Behavioural Semantics of Event-B Refinement.” Formal Asp. Comput., no. 2 (2014): 251--280. https://doi.org/10.1007/s00165-012-0265-0.","apa":"Schneider, S., Treharne, H., & Wehrheim, H. (2014). The behavioural semantics of Event-B refinement. Formal Asp. Comput., (2), 251--280. https://doi.org/10.1007/s00165-012-0265-0","ama":"Schneider S, Treharne H, Wehrheim H. The behavioural semantics of Event-B refinement. Formal Asp Comput. 2014;(2):251--280. doi:10.1007/s00165-012-0265-0","bibtex":"@article{Schneider_Treharne_Wehrheim_2014, title={The behavioural semantics of Event-B refinement}, DOI={10.1007/s00165-012-0265-0}, number={2}, journal={Formal Asp. Comput.}, author={Schneider, Steve and Treharne, Helen and Wehrheim, Heike}, year={2014}, pages={251--280} }","mla":"Schneider, Steve, et al. “The Behavioural Semantics of Event-B Refinement.” Formal Asp. Comput., no. 2, 2014, pp. 251--280, doi:10.1007/s00165-012-0265-0.","short":"S. Schneider, H. Treharne, H. Wehrheim, Formal Asp. Comput. (2014) 251--280.","ieee":"S. Schneider, H. Treharne, and H. Wehrheim, “The behavioural semantics of Event-B refinement,” Formal Asp. Comput., no. 2, pp. 251--280, 2014."},"_id":"3167","date_updated":"2022-01-06T06:59:01Z","doi":"10.1007/s00165-012-0265-0","issue":"2","publication":"Formal Asp. Comput.","department":[{"_id":"77"}],"author":[{"last_name":"Schneider","first_name":"Steve","full_name":"Schneider, Steve"},{"first_name":"Helen","full_name":"Treharne, Helen","last_name":"Treharne"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"date_created":"2018-06-13T07:55:10Z","status":"public","title":"The behavioural semantics of Event-B refinement","user_id":"29719"},{"citation":{"apa":"Tofan, B., Travkin, O., Schellhorn, G., & Wehrheim, H. (2014). Two approaches for proving linearizability of multiset. Sci. Comput. Program., 297--314. https://doi.org/10.1016/j.scico.2014.04.001","ama":"Tofan B, Travkin O, Schellhorn G, Wehrheim H. Two approaches for proving linearizability of multiset. Sci Comput Program. 2014:297--314. doi:10.1016/j.scico.2014.04.001","chicago":"Tofan, Bogdan, Oleg Travkin, Gerhard Schellhorn, and Heike Wehrheim. “Two Approaches for Proving Linearizability of Multiset.” Sci. Comput. Program., 2014, 297--314. https://doi.org/10.1016/j.scico.2014.04.001.","bibtex":"@article{Tofan_Travkin_Schellhorn_Wehrheim_2014, title={Two approaches for proving linearizability of multiset}, DOI={10.1016/j.scico.2014.04.001}, journal={Sci. Comput. Program.}, author={Tofan, Bogdan and Travkin, Oleg and Schellhorn, Gerhard and Wehrheim, Heike}, year={2014}, pages={297--314} }","mla":"Tofan, Bogdan, et al. “Two Approaches for Proving Linearizability of Multiset.” Sci. Comput. Program., 2014, pp. 297--314, doi:10.1016/j.scico.2014.04.001.","short":"B. Tofan, O. Travkin, G. Schellhorn, H. Wehrheim, Sci. Comput. Program. (2014) 297--314.","ieee":"B. Tofan, O. Travkin, G. Schellhorn, and H. Wehrheim, “Two approaches for proving linearizability of multiset,” Sci. Comput. Program., pp. 297--314, 2014."},"year":"2014","type":"journal_article","page":"297--314","doi":"10.1016/j.scico.2014.04.001","date_updated":"2022-01-06T06:59:01Z","_id":"3168","status":"public","date_created":"2018-06-13T07:56:12Z","author":[{"first_name":"Bogdan","full_name":"Tofan, Bogdan","last_name":"Tofan"},{"full_name":"Travkin, Oleg","first_name":"Oleg","last_name":"Travkin"},{"last_name":"Schellhorn","full_name":"Schellhorn, Gerhard","first_name":"Gerhard"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publication":"Sci. Comput. Program.","department":[{"_id":"77"}],"user_id":"29719","title":"Two approaches for proving linearizability of multiset"},{"user_id":"29719","title":"A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures","date_created":"2018-06-13T07:57:31Z","status":"public","publication":"{ACM} Trans. Comput. Log.","department":[{"_id":"77"}],"author":[{"full_name":"Schellhorn, Gerhard","first_name":"Gerhard","last_name":"Schellhorn"},{"last_name":"Derrick","first_name":"John","full_name":"Derrick, John"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"issue":"4","doi":"10.1145/2629496","date_updated":"2022-01-06T06:59:01Z","_id":"3169","page":"31:1--31:37","year":"2014","type":"journal_article","citation":{"ieee":"G. Schellhorn, J. Derrick, and H. Wehrheim, “A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures,” {ACM} Trans. Comput. Log., no. 4, pp. 31:1--31:37, 2014.","short":"G. Schellhorn, J. Derrick, H. Wehrheim, {ACM} Trans. Comput. Log. (2014) 31:1--31:37.","mla":"Schellhorn, Gerhard, et al. “A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures.” {ACM} Trans. Comput. Log., no. 4, 2014, pp. 31:1--31:37, doi:10.1145/2629496.","bibtex":"@article{Schellhorn_Derrick_Wehrheim_2014, title={A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures}, DOI={10.1145/2629496}, number={4}, journal={{ACM} Trans. Comput. Log.}, author={Schellhorn, Gerhard and Derrick, John and Wehrheim, Heike}, year={2014}, pages={31:1--31:37} }","ama":"Schellhorn G, Derrick J, Wehrheim H. A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures. {ACM} Trans Comput Log. 2014;(4):31:1--31:37. doi:10.1145/2629496","apa":"Schellhorn, G., Derrick, J., & Wehrheim, H. (2014). A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures. {ACM} Trans. Comput. Log., (4), 31:1--31:37. https://doi.org/10.1145/2629496","chicago":"Schellhorn, Gerhard, John Derrick, and Heike Wehrheim. “A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures.” {ACM} Trans. Comput. Log., no. 4 (2014): 31:1--31:37. https://doi.org/10.1145/2629496."}},{"series_title":"Lecture Notes in Computer Science","year":"2014","type":"conference","citation":{"bibtex":"@inproceedings{Derrick_Dongol_Schellhorn_Tofan_Travkin_Wehrheim_2014, series={Lecture Notes in Computer Science}, title={Quiescent Consistency: Defining and Verifying Relaxed Linearizability}, DOI={10.1007/978-3-319-06410-9_15}, booktitle={{FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings}, author={Derrick, John and Dongol, Brijesh and Schellhorn, Gerhard and Tofan, Bogdan and Travkin, Oleg and Wehrheim, Heike}, editor={B. Jones, Cliff and Pihlajasaari, Pekka and Sun, JunEditors}, year={2014}, pages={200--214}, collection={Lecture Notes in Computer Science} }","mla":"Derrick, John, et al. “Quiescent Consistency: Defining and Verifying Relaxed Linearizability.” {FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings, edited by Cliff B. Jones et al., 2014, pp. 200--214, doi:10.1007/978-3-319-06410-9_15.","chicago":"Derrick, John, Brijesh Dongol, Gerhard Schellhorn, Bogdan Tofan, Oleg Travkin, and Heike Wehrheim. “Quiescent Consistency: Defining and Verifying Relaxed Linearizability.” In {FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings, edited by Cliff B. Jones, Pekka Pihlajasaari, and Jun Sun, 200--214. Lecture Notes in Computer Science, 2014. https://doi.org/10.1007/978-3-319-06410-9_15.","apa":"Derrick, J., Dongol, B., Schellhorn, G., Tofan, B., Travkin, O., & Wehrheim, H. (2014). Quiescent Consistency: Defining and Verifying Relaxed Linearizability. In C. B. Jones, P. Pihlajasaari, & J. Sun (Eds.), {FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings (pp. 200--214). https://doi.org/10.1007/978-3-319-06410-9_15","ama":"Derrick J, Dongol B, Schellhorn G, Tofan B, Travkin O, Wehrheim H. Quiescent Consistency: Defining and Verifying Relaxed Linearizability. In: B. Jones C, Pihlajasaari P, Sun J, eds. {FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings. Lecture Notes in Computer Science. ; 2014:200--214. doi:10.1007/978-3-319-06410-9_15","ieee":"J. Derrick, B. Dongol, G. Schellhorn, B. Tofan, O. Travkin, and H. Wehrheim, “Quiescent Consistency: Defining and Verifying Relaxed Linearizability,” in {FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings, 2014, pp. 200--214.","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."},"page":"200--214","_id":"3170","date_updated":"2022-01-06T06:59:02Z","doi":"10.1007/978-3-319-06410-9_15","author":[{"last_name":"Derrick","first_name":"John","full_name":"Derrick, John"},{"last_name":"Dongol","full_name":"Dongol, Brijesh","first_name":"Brijesh"},{"last_name":"Schellhorn","full_name":"Schellhorn, Gerhard","first_name":"Gerhard"},{"first_name":"Bogdan","full_name":"Tofan, Bogdan","last_name":"Tofan"},{"first_name":"Oleg","full_name":"Travkin, Oleg","last_name":"Travkin"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publication":"{FM} 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings","department":[{"_id":"77"}],"editor":[{"last_name":"B. Jones","full_name":"B. Jones, Cliff","first_name":"Cliff"},{"last_name":"Pihlajasaari","first_name":"Pekka","full_name":"Pihlajasaari, Pekka"},{"last_name":"Sun","first_name":"Jun","full_name":"Sun, Jun"}],"status":"public","date_created":"2018-06-13T07:58:40Z","title":"Quiescent Consistency: Defining and Verifying Relaxed Linearizability","user_id":"29719"},{"page":"132--147","type":"conference","year":"2014","citation":{"ieee":"O. Travkin and H. Wehrheim, “Handling {TSO} in Mechanized Linearizability Proofs,” in Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings, 2014, pp. 132--147.","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.","bibtex":"@inproceedings{Travkin_Wehrheim_2014, series={Lecture Notes in Computer Science}, title={Handling {TSO} in Mechanized Linearizability Proofs}, DOI={10.1007/978-3-319-13338-6_11}, booktitle={Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings}, author={Travkin, Oleg and Wehrheim, Heike}, editor={Yahav, EranEditor}, year={2014}, pages={132--147}, collection={Lecture Notes in Computer Science} }","mla":"Travkin, Oleg, and Heike Wehrheim. “Handling {TSO} in Mechanized Linearizability Proofs.” Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings, edited by Eran Yahav, 2014, pp. 132--147, doi:10.1007/978-3-319-13338-6_11.","chicago":"Travkin, Oleg, and Heike Wehrheim. “Handling {TSO} in Mechanized Linearizability Proofs.” In Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings, edited by Eran Yahav, 132--147. Lecture Notes in Computer Science, 2014. https://doi.org/10.1007/978-3-319-13338-6_11.","apa":"Travkin, O., & Wehrheim, H. (2014). Handling {TSO} in Mechanized Linearizability Proofs. In E. Yahav (Ed.), Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings (pp. 132--147). https://doi.org/10.1007/978-3-319-13338-6_11","ama":"Travkin O, Wehrheim H. Handling {TSO} in Mechanized Linearizability Proofs. In: Yahav E, ed. Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings. Lecture Notes in Computer Science. ; 2014:132--147. doi:10.1007/978-3-319-13338-6_11"},"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-319-13338-6_11","date_updated":"2022-01-06T06:59:02Z","_id":"3171","date_created":"2018-06-13T07:59:46Z","status":"public","editor":[{"last_name":"Yahav","first_name":"Eran","full_name":"Yahav, Eran"}],"publication":"Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014. Proceedings","department":[{"_id":"77"}],"author":[{"last_name":"Travkin","full_name":"Travkin, Oleg","first_name":"Oleg"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"user_id":"29719","title":"Handling {TSO} in Mechanized Linearizability Proofs"},{"doi":"10.1007/978-3-319-11737-9_14","date_updated":"2022-01-06T06:59:02Z","_id":"3172","page":"203--218","citation":{"bibtex":"@inproceedings{Isenberg_Wehrheim_2014, series={Lecture Notes in Computer Science}, title={Timed Automata Verification via {IC3} with Zones}, DOI={10.1007/978-3-319-11737-9_14}, booktitle={Formal Methods and Software Engineering - 16th International Conference on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings}, author={Isenberg, Tobias and Wehrheim, Heike}, editor={Merz, Stephan and Pang, JunEditors}, year={2014}, pages={203--218}, collection={Lecture Notes in Computer Science} }","mla":"Isenberg, Tobias, and Heike Wehrheim. “Timed Automata Verification via {IC3} with Zones.” Formal Methods and Software Engineering - 16th International Conference on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings, edited by Stephan Merz and Jun Pang, 2014, pp. 203--218, doi:10.1007/978-3-319-11737-9_14.","chicago":"Isenberg, Tobias, and Heike Wehrheim. “Timed Automata Verification via {IC3} with Zones.” In Formal Methods and Software Engineering - 16th International Conference on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings, edited by Stephan Merz and Jun Pang, 203--218. Lecture Notes in Computer Science, 2014. https://doi.org/10.1007/978-3-319-11737-9_14.","apa":"Isenberg, T., & Wehrheim, H. (2014). Timed Automata Verification via {IC3} with Zones. In S. Merz & J. Pang (Eds.), Formal Methods and Software Engineering - 16th International Conference on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings (pp. 203--218). https://doi.org/10.1007/978-3-319-11737-9_14","ama":"Isenberg T, Wehrheim H. Timed Automata Verification via {IC3} with Zones. In: Merz S, Pang J, eds. Formal Methods and Software Engineering - 16th International Conference on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings. Lecture Notes in Computer Science. ; 2014:203--218. doi:10.1007/978-3-319-11737-9_14","ieee":"T. Isenberg and H. Wehrheim, “Timed Automata Verification via {IC3} with Zones,” in Formal Methods and Software Engineering - 16th International Conference on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings, 2014, pp. 203--218.","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."},"year":"2014","type":"conference","series_title":"Lecture Notes in Computer Science","user_id":"29719","title":"Timed Automata Verification via {IC3} with Zones","date_created":"2018-06-13T08:01:04Z","status":"public","editor":[{"first_name":"Stephan","full_name":"Merz, Stephan","last_name":"Merz"},{"last_name":"Pang","first_name":"Jun","full_name":"Pang, Jun"}],"publication":"Formal Methods and Software Engineering - 16th International Conference on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings","department":[{"_id":"77"}],"author":[{"last_name":"Isenberg","first_name":"Tobias","full_name":"Isenberg, Tobias"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}]},{"title":"Managing {LTL} Properties in Event-B Refinement","user_id":"29719","editor":[{"full_name":"Albert, Elvira","first_name":"Elvira","last_name":"Albert"},{"last_name":"Sekerinski","first_name":"Emil","full_name":"Sekerinski, Emil"}],"status":"public","date_created":"2018-06-13T08:04:33Z","author":[{"last_name":"A. Schneider","full_name":"A. Schneider, Steve","first_name":"Steve"},{"full_name":"Treharne, Helen","first_name":"Helen","last_name":"Treharne"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"},{"last_name":"M. Williams","full_name":"M. Williams, David","first_name":"David"}],"department":[{"_id":"77"}],"publication":"Integrated Formal Methods - 11th International Conference, {IFM} 2014, Bertinoro, Italy, September 9-11, 2014, Proceedings","doi":"10.1007/978-3-319-10181-1_14","_id":"3173","date_updated":"2022-01-06T06:59:02Z","year":"2014","type":"conference","citation":{"ieee":"S. A. Schneider, H. Treharne, H. Wehrheim, and D. M. Williams, “Managing {LTL} Properties in Event-B Refinement,” in Integrated Formal Methods - 11th International Conference, {IFM} 2014, Bertinoro, Italy, September 9-11, 2014, Proceedings, 2014, pp. 221--237.","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.","bibtex":"@inproceedings{A. Schneider_Treharne_Wehrheim_M. Williams_2014, series={Lecture Notes in Computer Science}, title={Managing {LTL} Properties in Event-B Refinement}, DOI={10.1007/978-3-319-10181-1_14}, booktitle={Integrated Formal Methods - 11th International Conference, {IFM} 2014, Bertinoro, Italy, September 9-11, 2014, Proceedings}, author={A. Schneider, Steve and Treharne, Helen and Wehrheim, Heike and M. Williams, David}, editor={Albert, Elvira and Sekerinski, EmilEditors}, year={2014}, pages={221--237}, collection={Lecture Notes in Computer Science} }","mla":"A. Schneider, Steve, et al. “Managing {LTL} Properties in Event-B Refinement.” Integrated Formal Methods - 11th International Conference, {IFM} 2014, Bertinoro, Italy, September 9-11, 2014, Proceedings, edited by Elvira Albert and Emil Sekerinski, 2014, pp. 221--237, doi:10.1007/978-3-319-10181-1_14.","apa":"A. Schneider, S., Treharne, H., Wehrheim, H., & M. Williams, D. (2014). Managing {LTL} Properties in Event-B Refinement. In E. Albert & E. Sekerinski (Eds.), Integrated Formal Methods - 11th International Conference, {IFM} 2014, Bertinoro, Italy, September 9-11, 2014, Proceedings (pp. 221--237). https://doi.org/10.1007/978-3-319-10181-1_14","ama":"A. Schneider S, Treharne H, Wehrheim H, M. Williams D. Managing {LTL} Properties in Event-B Refinement. In: Albert E, Sekerinski E, eds. Integrated Formal Methods - 11th International Conference, {IFM} 2014, Bertinoro, Italy, September 9-11, 2014, Proceedings. Lecture Notes in Computer Science. ; 2014:221--237. doi:10.1007/978-3-319-10181-1_14","chicago":"A. Schneider, Steve, Helen Treharne, Heike Wehrheim, and David M. Williams. “Managing {LTL} Properties in Event-B Refinement.” In Integrated Formal Methods - 11th International Conference, {IFM} 2014, Bertinoro, Italy, September 9-11, 2014, Proceedings, edited by Elvira Albert and Emil Sekerinski, 221--237. Lecture Notes in Computer Science, 2014. https://doi.org/10.1007/978-3-319-10181-1_14."},"page":"221--237","series_title":"Lecture Notes in Computer Science"},{"publication":"CoRR","department":[{"_id":"77"}],"author":[{"last_name":"Schneider","first_name":"Steve","full_name":"Schneider, Steve"},{"last_name":"Treharne","full_name":"Treharne, Helen","first_name":"Helen"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"},{"full_name":"M. Williams, David","first_name":"David","last_name":"M. Williams"}],"date_created":"2018-06-13T08:05:39Z","status":"public","title":"Managing {LTL} properties in Event-B refinement","user_id":"29719","year":"2014","type":"journal_article","citation":{"ieee":"S. Schneider, H. Treharne, H. Wehrheim, and D. M. Williams, “Managing {LTL} properties in Event-B refinement,” CoRR, 2014.","short":"S. Schneider, H. Treharne, H. Wehrheim, D. M. Williams, CoRR (2014).","mla":"Schneider, Steve, et al. “Managing {LTL} Properties in Event-B Refinement.” CoRR, 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} }","apa":"Schneider, S., Treharne, H., Wehrheim, H., & M. Williams, D. (2014). Managing {LTL} properties in Event-B refinement. CoRR.","ama":"Schneider S, Treharne H, Wehrheim H, M. Williams D. Managing {LTL} properties in Event-B refinement. CoRR. 2014.","chicago":"Schneider, Steve, Helen Treharne, Heike Wehrheim, and David M. Williams. “Managing {LTL} Properties in Event-B Refinement.” CoRR, 2014."},"_id":"3174","date_updated":"2022-01-06T06:59:02Z"},{"_id":"3175","date_updated":"2022-01-06T06:59:02Z","year":"2014","citation":{"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}.” CoRR, 2014.","chicago":"Isenberg, Tobias, and Heike Wehrheim. “Proof-Carrying Hardware via {IC3}.” CoRR, 2014.","ama":"Isenberg T, Wehrheim H. Proof-Carrying Hardware via {IC3}. CoRR. 2014.","apa":"Isenberg, T., & Wehrheim, H. (2014). Proof-Carrying Hardware via {IC3}. CoRR.","ieee":"T. Isenberg and H. Wehrheim, “Proof-Carrying Hardware via {IC3},” CoRR, 2014.","short":"T. Isenberg, H. Wehrheim, CoRR (2014)."},"type":"journal_article","user_id":"29719","title":"Proof-Carrying Hardware via {IC3}","date_created":"2018-06-13T08:07:24Z","status":"public","department":[{"_id":"77"}],"publication":"CoRR","author":[{"first_name":"Tobias","full_name":"Isenberg, Tobias","last_name":"Isenberg"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}]},{"_id":"450","page":"30-39","type":"conference","citation":{"bibtex":"@inproceedings{Jakobs_Wehrheim_2014, series={SPIN 2014}, title={Certification for Configurable Program Analysis}, DOI={10.1145/2632362.2632372}, booktitle={Proceedings of the 21st International Symposium on Model Checking of Software (SPIN)}, author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2014}, pages={30–39}, collection={SPIN 2014} }","mla":"Jakobs, Marie-Christine, and Heike Wehrheim. “Certification for Configurable Program Analysis.” Proceedings of the 21st International Symposium on Model Checking of Software (SPIN), 2014, pp. 30–39, doi:10.1145/2632362.2632372.","apa":"Jakobs, M.-C., & Wehrheim, H. (2014). Certification for Configurable Program Analysis. In Proceedings of the 21st International Symposium on Model Checking of Software (SPIN) (pp. 30–39). https://doi.org/10.1145/2632362.2632372","ama":"Jakobs M-C, Wehrheim H. Certification for Configurable Program Analysis. In: Proceedings of the 21st International Symposium on Model Checking of Software (SPIN). SPIN 2014. ; 2014:30-39. doi:10.1145/2632362.2632372","chicago":"Jakobs, Marie-Christine, and Heike Wehrheim. “Certification for Configurable Program Analysis.” In Proceedings of the 21st International Symposium on Model Checking of Software (SPIN), 30–39. SPIN 2014, 2014. https://doi.org/10.1145/2632362.2632372.","ieee":"M.-C. Jakobs and H. Wehrheim, “Certification for Configurable Program Analysis,” in Proceedings of the 21st International Symposium on Model Checking of Software (SPIN), 2014, pp. 30–39.","short":"M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 21st International Symposium on Model Checking of Software (SPIN), 2014, pp. 30–39."},"year":"2014","abstract":[{"lang":"eng","text":"Configurable program analysis (CPA) is a generic concept for the formalization of different software analysis techniques in a single framework. With the tool CPAchecker, this framework allows for an easy configuration and subsequent automatic execution of analysis procedures ranging from data-flow analysis to model checking. The focus of the tool CPAchecker is thus on analysis. In this paper, we study configurability from the point of view of software certification. Certification aims at providing (via a prior analysis) a certificate of correctness for a program which is (a) tamper-proof and (b) more efficient to check for validity than a full analysis. Here, we will show how, given an analysis instance of a CPA, to construct a corresponding sound certification instance, thereby arriving at configurable program certification. We report on experiments with certification based on different analysis techniques, and in particular explain which characteristics of an underlying analysis allow us to design an efficient (in the above (b) sense) certification procedure. "}],"ddc":["040"],"user_id":"477","file_date_updated":"2018-03-16T11:25:35Z","publication":"Proceedings of the 21st International Symposium on Model Checking of Software (SPIN)","author":[{"last_name":"Jakobs","first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"file":[{"relation":"main_file","success":1,"date_updated":"2018-03-16T11:25:35Z","content_type":"application/pdf","file_id":"1345","creator":"florida","file_size":487366,"access_level":"closed","date_created":"2018-03-16T11:25:35Z","file_name":"450-p30-jakobs.pdf"}],"date_created":"2017-10-17T12:42:19Z","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T07:01:07Z","doi":"10.1145/2632362.2632372","series_title":"SPIN 2014","language":[{"iso":"eng"}],"title":"Certification for Configurable Program Analysis","department":[{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}]},{"_id":"408","page":"307-322","type":"conference","citation":{"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} }","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.","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.","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.","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."},"year":"2014","abstract":[{"lang":"eng","text":"Verification of hardware and software usually proceeds separately, software analysis relying on the correctness of processors executing instructions. This assumption is valid as long as the software runs on standard CPUs that have been extensively validated and are in wide use. However, for processors exploiting custom instruction set extensions to meet performance and energy constraints the validation might be less extensive, challenging the correctness assumption.In this paper we present an approach for integrating software analyses with hardware verification, specifically targeting custom instruction set extensions. We propose three different techniques for deriving the properties to be proven for the hardware implementation of a custom instruction in order to support software analyses. The techniques are designed to explore the trade-off between generality and efficiency and span from proving functional equivalence over checking the rules of a particular analysis domain to verifying actual pre and post conditions resulting from program analysis. We demonstrate and compare the three techniques on example programs with custom instructions, using stateof-the-art software and hardware verification techniques."}],"user_id":"477","ddc":["040"],"file":[{"file_size":561325,"file_id":"1364","creator":"florida","date_updated":"2018-03-16T11:35:28Z","content_type":"application/pdf","success":1,"relation":"main_file","file_name":"408-jakobs14_ifm.pdf","date_created":"2018-03-16T11:35:28Z","access_level":"closed"}],"publication":"Proceedings of the 11th International Conference on Integrated Formal Methods (iFM)","file_date_updated":"2018-03-16T11:35:28Z","author":[{"last_name":"Jakobs","full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine"},{"id":"398","last_name":"Platzner","full_name":"Platzner, Marco","first_name":"Marco"},{"last_name":"Wiersema","id":"3118","first_name":"Tobias","full_name":"Wiersema, Tobias"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"date_created":"2017-10-17T12:42:11Z","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T07:00:14Z","doi":"10.1007/978-3-319-10181-1_19","series_title":"LNCS","language":[{"iso":"eng"}],"title":"Integrating Software and Hardware Verification","department":[{"_id":"77"},{"_id":"78"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"editor":[{"last_name":"Albert","full_name":"Albert, Elvira","first_name":"Elvira"},{"full_name":"Sekerinski, Emil","first_name":"Emil","last_name":"Sekerinski"}]},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:00:28Z","doi":"10.1016/j.cl.2015.05.003","department":[{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"title":"Grammar-based model transformations","type":"conference","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.","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","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","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","page":"1601-1610","_id":"417","author":[{"full_name":"Besova, Galina","first_name":"Galina","last_name":"Besova"},{"first_name":"Dominik","full_name":"Steenke, Dominik","last_name":"Steenke"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"file_date_updated":"2018-03-16T11:33:33Z","publication":"Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)","file":[{"file_size":643382,"file_id":"1360","creator":"florida","content_type":"application/pdf","date_updated":"2018-03-16T11:33:33Z","relation":"main_file","success":1,"file_name":"417-main.pdf","date_created":"2018-03-16T11:33:33Z","access_level":"closed"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:13Z","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."}],"ddc":["040"],"user_id":"477"},{"oa":"1","_id":"418","date_updated":"2022-01-06T07:00:30Z","year":"2014","citation":{"ieee":"F. Pauck, Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren. Universität Paderborn, 2014.","short":"F. Pauck, Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren, Universität Paderborn, 2014.","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} }","chicago":"Pauck, Felix. Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren. Universität Paderborn, 2014.","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."},"type":"bachelorsthesis","language":[{"iso":"ger"}],"supervisor":[{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"ddc":["000"],"title":"Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren","user_id":"22398","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"date_created":"2017-10-17T12:42:13Z","status":"public","has_accepted_license":"1","file_date_updated":"2019-08-07T09:05:38Z","department":[{"_id":"77"}],"author":[{"first_name":"Felix","full_name":"Pauck, Felix","last_name":"Pauck","id":"22398"}],"publisher":"Universität Paderborn","file":[{"access_level":"open_access","date_created":"2019-08-07T09:00:20Z","file_name":"fpauck_2014.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2019-08-07T09:05:38Z","creator":"fpauck","file_id":"12906","title":"Bachelorarbeit","file_size":3191756}]},{"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","department":[{"_id":"77"}],"author":[{"last_name":"Isenberg","first_name":"Tobias","full_name":"Isenberg, Tobias"},{"first_name":"Dominik","full_name":"Steenken, Dominik","last_name":"Steenken"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"editor":[{"first_name":"Dirk","full_name":"Beyer, Dirk","last_name":"Beyer"},{"last_name":"Boreale","first_name":"Michele","full_name":"Boreale, Michele"}],"date_created":"2018-06-13T08:08:39Z","status":"public","title":"Bounded Model Checking of Graph Transformation Systems via {SMT} Solving","user_id":"29719","series_title":"Lecture Notes in Computer Science","page":"178--192","type":"conference","citation":{"ama":"Isenberg T, Steenken D, Wehrheim H. Bounded Model Checking of Graph Transformation Systems via {SMT} Solving. In: Beyer D, Boreale M, eds. Formal Techniques for Distributed Systems - Joint {IFIP} {WG} 6.1 International Conference, {FMOODS/FORTE} 2013, Held as Part of the 8th International Federated Conference on Distributed Computing Techniques, DisCoTec 2013, Florence, Italy, June 3-5, 2013. Proceedings. Lecture Notes in Computer Science. ; 2013:178--192. doi:10.1007/978-3-642-38592-6_13","apa":"Isenberg, T., Steenken, D., & Wehrheim, H. (2013). Bounded Model Checking of Graph Transformation Systems via {SMT} Solving. In D. Beyer & M. Boreale (Eds.), Formal Techniques for Distributed Systems - Joint {IFIP} {WG} 6.1 International Conference, {FMOODS/FORTE} 2013, Held as Part of the 8th International Federated Conference on Distributed Computing Techniques, DisCoTec 2013, Florence, Italy, June 3-5, 2013. Proceedings (pp. 178--192). https://doi.org/10.1007/978-3-642-38592-6_13","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.","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} }","mla":"Isenberg, Tobias, et al. “Bounded Model Checking of Graph Transformation Systems via {SMT} Solving.” Formal Techniques for Distributed Systems - Joint {IFIP} {WG} 6.1 International Conference, {FMOODS/FORTE} 2013, Held as Part of the 8th International Federated Conference on Distributed Computing Techniques, DisCoTec 2013, Florence, Italy, June 3-5, 2013. Proceedings, edited by Dirk Beyer and Michele Boreale, 2013, pp. 178--192, doi:10.1007/978-3-642-38592-6_13.","short":"T. Isenberg, D. Steenken, H. Wehrheim, in: D. Beyer, M. Boreale (Eds.), Formal Techniques for Distributed Systems - Joint {IFIP} {WG} 6.1 International Conference, {FMOODS/FORTE} 2013, Held as Part of the 8th International Federated Conference on Distributed Computing Techniques, DisCoTec 2013, Florence, Italy, June 3-5, 2013. Proceedings, 2013, pp. 178--192.","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."},"year":"2013","_id":"3176","date_updated":"2022-01-06T06:59:02Z","doi":"10.1007/978-3-642-38592-6_13"},{"user_id":"29719","title":"{SPIN} as a Linearizability Checker under Weak Memory Models","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":[{"first_name":"Oleg","full_name":"Travkin, Oleg","last_name":"Travkin"},{"full_name":"Mütze, Annika","first_name":"Annika","last_name":"Mütze"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"date_created":"2018-06-13T08:09:44Z","status":"public","editor":[{"first_name":"Valeria","full_name":"Bertacco, Valeria","last_name":"Bertacco"},{"first_name":"Axel","full_name":"Legay, Axel","last_name":"Legay"}],"_id":"3177","date_updated":"2022-01-06T06:59:02Z","doi":"10.1007/978-3-319-03077-7_21","series_title":"Lecture Notes in Computer Science","page":"311--326","type":"conference","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."},"year":"2013"},{"status":"public","date_created":"2018-06-13T08:13:31Z","editor":[{"first_name":"Zhiming","full_name":"Liu, Zhiming","last_name":"Liu"},{"last_name":"Woodcock","full_name":"Woodcock, Jim","first_name":"Jim"},{"last_name":"Zhu","first_name":"Huibiao","full_name":"Zhu, Huibiao"}],"author":[{"last_name":"Dongol","full_name":"Dongol, Brijesh","first_name":"Brijesh"},{"first_name":"Oleg","full_name":"Travkin, Oleg","last_name":"Travkin"},{"first_name":"John","full_name":"Derrick, John","last_name":"Derrick"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"department":[{"_id":"77"}],"publication":"Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings","user_id":"29719","title":"A High-Level Semantics for Program Execution under Total Store Order Memory","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} }","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","chicago":"Dongol, Brijesh, Oleg Travkin, John Derrick, and Heike Wehrheim. “A High-Level Semantics for Program Execution under Total Store Order Memory.” In Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings, edited by Zhiming Liu, Jim Woodcock, and Huibiao Zhu, 177--194. Lecture Notes in Computer Science, 2013. https://doi.org/10.1007/978-3-642-39718-9_11.","ieee":"B. Dongol, O. Travkin, J. Derrick, and H. Wehrheim, “A High-Level Semantics for Program Execution under Total Store Order Memory,” in Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International Colloquium, Shanghai, China, September 4-6, 2013. Proceedings, 2013, pp. 177--194.","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."},"year":"2013","type":"conference","page":"177--194","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-642-39718-9_11","_id":"3178","date_updated":"2022-01-06T06:59:02Z"},{"editor":[{"last_name":"Kowalewski","first_name":"Stefan","full_name":"Kowalewski, Stefan"},{"last_name":"Rumpe","full_name":"Rumpe, Bernhard","first_name":"Bernhard"}],"status":"public","date_created":"2018-06-13T08:15:08Z","author":[{"last_name":"Ziegert","full_name":"Ziegert, Steffen","first_name":"Steffen"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"publication":"Software Engineering 2013: Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\\\"{a}}rz 2013 in Aachen","department":[{"_id":"77"}],"title":"Temporal Reconfiguration Plans for Self-Adaptive Systems","user_id":"29719","citation":{"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.","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.","ama":"Ziegert S, Wehrheim H. Temporal Reconfiguration Plans for Self-Adaptive Systems. In: Kowalewski S, Rumpe B, eds. Software Engineering 2013: Fachtagung Des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\\\"{a}}rz 2013 in Aachen. {LNI}. ; 2013:271--284.","apa":"Ziegert, S., & Wehrheim, H. (2013). Temporal Reconfiguration Plans for Self-Adaptive Systems. In S. Kowalewski & B. Rumpe (Eds.), Software Engineering 2013: Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar - 2. M{\\\"{a}}rz 2013 in Aachen (pp. 271--284).","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}} }"},"type":"conference","year":"2013","page":"271--284","series_title":"{LNI}","date_updated":"2022-01-06T06:59:02Z","_id":"3179"},{"title":"Zero Overhead Runtime Monitoring","department":[{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"date_updated":"2022-01-06T07:01:18Z","doi":"10.1007/978-3-642-40561-7_17","series_title":"LNCS","language":[{"iso":"eng"}],"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"}],"ddc":["040"],"user_id":"477","author":[{"last_name":"Wonisch","full_name":"Wonisch, Daniel","first_name":"Daniel"},{"full_name":"Schremmer, Alexander","first_name":"Alexander","last_name":"Schremmer"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"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","date_created":"2018-03-16T11:18:41Z","file_name":"469-WSW2013-2.pdf","date_updated":"2018-03-16T11:18:41Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":394804,"file_id":"1332","creator":"florida"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:23Z","_id":"469","type":"conference","citation":{"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.","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","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} }","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."},"year":"2013","page":"244-258"},{"supervisor":[{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"year":"2013","citation":{"mla":"Timm, Nils. Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems. 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). 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.","chicago":"Timm, Nils. Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems. Universität Paderborn, 2013.","ieee":"N. Timm, Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems. Universität Paderborn, 2013.","short":"N. Timm, Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems, Universität Paderborn, 2013."},"type":"dissertation","_id":"478","date_updated":"2022-01-06T07:01:22Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"date_created":"2017-10-17T12:42:25Z","status":"public","has_accepted_license":"1","file":[{"file_id":"1324","creator":"florida","file_size":931458,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-15T14:06:05Z","date_created":"2018-03-15T14:06:05Z","file_name":"478-Dissertation-Timm.pdf","access_level":"closed"}],"department":[{"_id":"77"}],"file_date_updated":"2018-03-15T14:06:05Z","publisher":"Universität Paderborn","author":[{"last_name":"Timm","first_name":"Nils","full_name":"Timm, Nils"}],"user_id":"477","title":"Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems","ddc":["040"],"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."}]},{"abstract":[{"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.","lang":"eng"}],"user_id":"477","ddc":["040"],"file":[{"file_id":"1313","creator":"florida","file_size":487617,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-15T13:42:30Z","file_name":"498-WonischSchremmerWehrheim2013.pdf","date_created":"2018-03-15T13:42:30Z","access_level":"closed"}],"publication":"Proceedings of the 25th International Conference on Computer Aided Verification (CAV)","file_date_updated":"2018-03-15T13:42:30Z","author":[{"last_name":"Wonisch","first_name":"Daniel","full_name":"Wonisch, Daniel"},{"first_name":"Alexander","full_name":"Schremmer, Alexander","last_name":"Schremmer"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_created":"2017-10-17T12:42:29Z","has_accepted_license":"1","status":"public","_id":"498","page":"912-927","year":"2013","citation":{"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 Proceedings of the 25th International Conference on Computer Aided Verification (CAV), 2013, pp. 912–927.","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.","ama":"Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs – A PCC Alternative. In: Proceedings of the 25th International Conference on Computer Aided Verification (CAV). LNCS. ; 2013:912-927. doi:10.1007/978-3-642-39799-8_65","apa":"Wonisch, D., Schremmer, A., & Wehrheim, H. (2013). Programs from Proofs – A PCC Alternative. In Proceedings of the 25th International Conference on Computer Aided Verification (CAV) (pp. 912–927). https://doi.org/10.1007/978-3-642-39799-8_65","bibtex":"@inproceedings{Wonisch_Schremmer_Wehrheim_2013, series={LNCS}, title={Programs from Proofs – A PCC Alternative}, DOI={10.1007/978-3-642-39799-8_65}, booktitle={Proceedings of the 25th International Conference on Computer Aided Verification (CAV)}, author={Wonisch, Daniel and Schremmer, Alexander and Wehrheim, Heike}, year={2013}, pages={912–927}, collection={LNCS} }","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."},"type":"conference","title":"Programs from Proofs – A PCC Alternative","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"date_updated":"2022-01-06T07:01:32Z","doi":"10.1007/978-3-642-39799-8_65","series_title":"LNCS","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"doi":"10.1109/ICECCS.2013.14","date_updated":"2022-01-06T07:01:41Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"department":[{"_id":"77"}],"title":"Knowledge-Based Verification of Service Compositions - An SMT approach","citation":{"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.","short":"S. Walther, H. Wehrheim, in: Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), 2013, pp. 24–32.","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} }","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.","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","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."},"type":"conference","year":"2013","page":"24 - 32 ","_id":"517","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:33Z","file":[{"file_size":217085,"file_id":"5248","creator":"ups","date_updated":"2018-11-02T13:26:08Z","content_type":"application/pdf","relation":"main_file","date_created":"2018-11-02T13:26:08Z","file_name":"06601801.pdf","access_level":"closed"}],"author":[{"first_name":"Sven","full_name":"Walther, Sven","last_name":"Walther"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"file_date_updated":"2018-11-02T13:26:08Z","publication":"Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)","user_id":"477","ddc":["000"],"abstract":[{"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.","lang":"eng"}]},{"author":[{"first_name":"Oleg","full_name":"Travkin, Oleg","last_name":"Travkin"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"},{"last_name":"Schellhorn","first_name":"Gerhard","full_name":"Schellhorn, Gerhard"}],"department":[{"_id":"77"}],"publication":"{ECEASST}","status":"public","date_created":"2018-06-13T08:16:49Z","user_id":"29719","title":"Proving Linearizability of Multiset with Local Proof Obligations","type":"journal_article","year":"2012","citation":{"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.","ama":"Travkin O, Wehrheim H, Schellhorn G. Proving Linearizability of Multiset with Local Proof Obligations. {ECEASST}. 2012.","apa":"Travkin, O., Wehrheim, H., & Schellhorn, G. (2012). Proving Linearizability of Multiset with Local Proof Obligations. {ECEASST}.","chicago":"Travkin, Oleg, Heike Wehrheim, and Gerhard Schellhorn. “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} }","mla":"Travkin, Oleg, et al. “Proving Linearizability of Multiset with Local Proof Obligations.” {ECEASST}, 2012."},"date_updated":"2022-01-06T06:59:03Z","_id":"3180"},{"date_updated":"2022-01-06T06:59:03Z","_id":"3181","issue":"3","doi":"10.1016/j.scico.2011.04.007","year":"2012","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.","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","chicago":"Ruhroth, Thomas, and Heike Wehrheim. “Model Evolution and Refinement.” Sci. Comput. Program., no. 3 (2012): 270--289. https://doi.org/10.1016/j.scico.2011.04.007.","ieee":"T. Ruhroth and H. Wehrheim, “Model evolution and refinement,” Sci. Comput. Program., no. 3, pp. 270--289, 2012.","short":"T. Ruhroth, H. Wehrheim, Sci. Comput. Program. (2012) 270--289."},"type":"journal_article","page":"270--289","user_id":"29719","title":"Model evolution and refinement","author":[{"full_name":"Ruhroth, Thomas","first_name":"Thomas","last_name":"Ruhroth"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"publication":"Sci. Comput. Program.","department":[{"_id":"77"}],"status":"public","date_created":"2018-06-13T08:17:58Z"},{"_id":"3182","date_updated":"2022-01-06T06:59:03Z","doi":"10.1007/978-3-642-31424-7_21","series_title":"Lecture Notes in Computer Science","page":"243--259","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.","ama":"Schellhorn G, Wehrheim H, Derrick J. How to Prove Algorithms Linearisable. In: Madhusudan P, A. Seshia S, eds. Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings. Lecture Notes in Computer Science. ; 2012:243--259. doi:10.1007/978-3-642-31424-7_21","apa":"Schellhorn, G., Wehrheim, H., & Derrick, J. (2012). How to Prove Algorithms Linearisable. In P. Madhusudan & S. A. Seshia (Eds.), Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings (pp. 243--259). https://doi.org/10.1007/978-3-642-31424-7_21","chicago":"Schellhorn, Gerhard, Heike Wehrheim, and John Derrick. “How to Prove Algorithms Linearisable.” In Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings, edited by P. Madhusudan and Sanjit A. Seshia, 243--259. Lecture Notes in Computer Science, 2012. https://doi.org/10.1007/978-3-642-31424-7_21.","ieee":"G. Schellhorn, H. Wehrheim, and J. Derrick, “How to Prove Algorithms Linearisable,” in Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings, 2012, pp. 243--259.","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","title":"How to Prove Algorithms Linearisable","user_id":"29719","department":[{"_id":"77"}],"publication":"Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings","author":[{"last_name":"Schellhorn","full_name":"Schellhorn, Gerhard","first_name":"Gerhard"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"},{"last_name":"Derrick","first_name":"John","full_name":"Derrick, John"}],"editor":[{"full_name":"Madhusudan, P.","first_name":"P.","last_name":"Madhusudan"},{"last_name":"A. Seshia","full_name":"A. Seshia, Sanjit","first_name":"Sanjit"}],"date_created":"2018-06-13T08:19:33Z","status":"public"},{"title":"Predicate Analysis with Block-Abstraction Memoization","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"date_updated":"2022-01-06T07:02:46Z","doi":"10.1007/978-3-642-34281-3_24","series_title":"LNCS","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Predicate abstraction is an established technique for reducing the size of the state space during verification. In this paper, we extend predication abstraction with block-abstraction memoization (BAM), which exploits the fact that blocks are often executed several times in a program. The verification can thus benefit from caching the values of previous block analyses and reusing them upon next entry into a block. In addition to function bodies, BAM also performs well for nested loops. To further increase effectiveness, block memoization has been integrated with lazy abstraction adopting a lazy strategy for cache refinement. Together, this achieves significant performance increases: our tool (an implementation within the configurable program analysis framework CPAchecker) has won the Competition on Software Verification 2012 in the category “Overall”."}],"ddc":["040"],"user_id":"477","publication":"Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)","file_date_updated":"2018-03-15T08:33:56Z","author":[{"full_name":"Wonisch, Daniel","first_name":"Daniel","last_name":"Wonisch"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"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","date_created":"2018-03-15T08:33:56Z","file_name":"590-WonischWehrheim2012.pdf"}],"date_created":"2017-10-17T12:42:47Z","status":"public","has_accepted_license":"1","_id":"590","page":"332-347","citation":{"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.","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","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","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.","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} }","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."},"type":"conference","year":"2012"},{"date_created":"2017-10-17T12:42:50Z","status":"public","has_accepted_license":"1","publication":"Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)","file_date_updated":"2018-03-15T08:15:33Z","author":[{"full_name":"Timm, Nils","first_name":"Nils","last_name":"Timm"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"},{"full_name":"Czech, Mike","first_name":"Mike","last_name":"Czech"}],"file":[{"access_level":"closed","date_created":"2018-03-15T08:15:33Z","file_name":"608-Timm2013-0main.pdf","date_updated":"2018-03-15T08:15:33Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":396337,"creator":"florida","file_id":"1250"}],"ddc":["040"],"user_id":"477","abstract":[{"lang":"eng","text":"Predicate abstraction is an established technique in software verification. It inherently includes an abstraction refinement loop successively adding predicates until the right level of abstraction is found. For concurrent systems, predicate abstraction can be combined with spotlight abstraction, further reducing the state space by abstracting away certain processes. Refinement then has to decide whether to add a new predicate or a new process. Selecting the right predicates and processes is a crucial task: The positive effect of abstraction may be compromised by unfavourable refinement decisions. Here we present a heuristic approach to abstraction refinement. The basis for a decision is a set of refinement candidates, derived by multiple counterexample-generation. Candidates are evaluated with respect to their influence on other components in the system. Experimental results show that our technique can significantly speed up verification as compared to a naive abstraction refinement."}],"page":"348-363","citation":{"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","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.","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} }","short":"N. Timm, H. Wehrheim, M. Czech, in: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–363.","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."},"year":"2012","type":"conference","_id":"608","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"title":"Heuristic-Guided Abstraction Refinement for Concurrent Systems","language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-642-34281-3_25","date_updated":"2022-01-06T07:02:52Z"},{"ddc":["040"],"user_id":"477","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."}],"date_created":"2017-10-17T12:42:54Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-03-15T06:46:05Z","publication":"Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":[{"last_name":"Wonisch","first_name":"Daniel","full_name":"Wonisch, Daniel"}],"file":[{"file_name":"627-WonischSV-Comp2012_01.pdf","date_created":"2018-03-15T06:46:05Z","access_level":"closed","creator":"florida","file_id":"1242","file_size":184000,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-15T06:46:05Z"}],"_id":"627","page":"531-533","year":"2012","citation":{"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.","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."},"type":"conference","title":"Block Abstraction Memoization for CPAchecker","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"doi":"10.1007/978-3-642-28756-5_41","date_updated":"2022-01-06T07:02:59Z","language":[{"iso":"eng"}],"series_title":"LNCS"},{"title":"Weaving-based configuration and modular transformation of multi-layer systems","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_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","user_id":"477","ddc":["040"],"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"}],"date_created":"2017-10-17T12:42:42Z","has_accepted_license":"1","status":"public","file":[{"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","access_level":"closed","file_id":"1276","creator":"florida","file_size":589972,"relation":"main_file","success":1,"content_type":"application/pdf","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","author":[{"full_name":"Besova, Galina","first_name":"Galina","last_name":"Besova"},{"full_name":"Walther, Sven","first_name":"Sven","last_name":"Walther"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"},{"full_name":"Becker, Steffen","first_name":"Steffen","last_name":"Becker"}],"_id":"565","page":"776-792","citation":{"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.","ama":"Besova G, Walther S, Wehrheim H, Becker S. Weaving-based configuration and modular transformation of multi-layer systems. In: Proceedings of the 15th International Conference on Model Driven Engineering Languages & Systems (MoDELS). LNCS. ; 2012:776-792. doi:10.1007/978-3-642-33666-9_49","apa":"Besova, G., Walther, S., Wehrheim, H., & Becker, S. (2012). Weaving-based configuration and modular transformation of multi-layer systems. In Proceedings of the 15th International Conference on Model Driven Engineering Languages & Systems (MoDELS) (pp. 776–792). https://doi.org/10.1007/978-3-642-33666-9_49","bibtex":"@inproceedings{Besova_Walther_Wehrheim_Becker_2012, series={LNCS}, title={Weaving-based configuration and modular transformation of multi-layer systems}, DOI={10.1007/978-3-642-33666-9_49}, booktitle={Proceedings of the 15th International Conference on Model Driven Engineering Languages & Systems (MoDELS)}, author={Besova, Galina and Walther, Sven and Wehrheim, Heike and Becker, Steffen}, year={2012}, pages={776–792}, collection={LNCS} }","mla":"Besova, Galina, et al. “Weaving-Based Configuration and Modular Transformation of Multi-Layer Systems.” Proceedings of the 15th International Conference on Model Driven Engineering Languages & Systems (MoDELS), 2012, pp. 776–92, doi:10.1007/978-3-642-33666-9_49.","short":"G. Besova, S. Walther, H. Wehrheim, S. Becker, in: Proceedings of the 15th International Conference on Model Driven Engineering Languages & Systems (MoDELS), 2012, pp. 776–792.","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."},"type":"conference","year":"2012"},{"_id":"3183","date_updated":"2022-01-06T06:59:03Z","doi":"10.1016/j.entcs.2011.11.019","year":"2011","type":"journal_article","citation":{"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.","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} }","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.","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","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."},"page":"69--80","title":"Bounded Retransmission in Event-B{\\(\\parallel\\)}CSP: a Case Study","user_id":"29719","author":[{"first_name":"Steve","full_name":"Schneider, Steve","last_name":"Schneider"},{"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"},{"type":"journal_article","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} }"},"year":"2011","page":"4:1--4:43","issue":"1","doi":"10.1145/1889997.1890001","date_updated":"2022-01-06T06:59:03Z","_id":"3184","status":"public","date_created":"2018-06-13T08:22:02Z","author":[{"full_name":"Derrick, John","first_name":"John","last_name":"Derrick"},{"first_name":"Gerhard","full_name":"Schellhorn, Gerhard","last_name":"Schellhorn"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"publication":"{ACM} Trans. Program. Lang. Syst.","department":[{"_id":"77"}],"user_id":"29719","title":"Mechanically verified proof obligations for linearizability"}]