[{"user_id":"477","title":"Knowledge-based Verification of Service Compositions","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"date_created":"2017-11-20T07:59:31Z","publisher":"Universität Paderborn","author":[{"full_name":"Walther, Sven","first_name":"Sven","last_name":"Walther"}],"department":[{"_id":"77"}],"doi":"10.17619/UNIPB/1-307","_id":"707","date_updated":"2022-01-06T07:03:27Z","supervisor":[{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"language":[{"iso":"eng"}],"type":"dissertation","year":"2017","citation":{"short":"S. Walther, Knowledge-Based Verification of Service Compositions, Universität Paderborn, 2017.","ieee":"S. Walther, Knowledge-based Verification of Service Compositions. Universität Paderborn, 2017.","chicago":"Walther, Sven. Knowledge-Based Verification of Service Compositions. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-307.","apa":"Walther, S. (2017). Knowledge-based Verification of Service Compositions. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-307","ama":"Walther S. Knowledge-Based Verification of Service Compositions. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-307","mla":"Walther, Sven. Knowledge-Based Verification of Service Compositions. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-307.","bibtex":"@book{Walther_2017, title={Knowledge-based Verification of Service Compositions}, DOI={10.17619/UNIPB/1-307}, publisher={Universität Paderborn}, author={Walther, Sven}, year={2017} }"}},{"publication":"Proceedings of the 3rd International Workshop on Software Analytics","file_date_updated":"2018-11-02T14:24:29Z","author":[{"full_name":"Czech, Mike","first_name":"Mike","last_name":"Czech"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","id":"48129"},{"first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine","last_name":"Jakobs"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"file":[{"content_type":"application/pdf","date_updated":"2018-11-02T14:24:29Z","relation":"main_file","success":1,"file_size":822383,"creator":"ups","file_id":"5271","access_level":"closed","date_created":"2018-11-02T14:24:29Z","file_name":"fsews17swan-swanmain1.pdf"}],"date_created":"2017-10-17T12:41:05Z","has_accepted_license":"1","status":"public","abstract":[{"text":"Today, software verification tools have reached the maturity to be used for large scale programs. Different tools perform differently well on varying code. A software developer is hence faced with the problem of choosing a tool appropriate for her program at hand. A ranking of tools on programs could facilitate the choice. Such rankings can, however, so far only be obtained by running all considered tools on the program.In this paper, we present a machine learning approach to predicting rankings of tools on programs. The method builds upon so-called label ranking algorithms, which we complement with appropriate kernels providing a similarity measure for programs. Our kernels employ a graph representation for software source code that mixes elements of control flow and program dependence graphs with abstract syntax trees. Using data sets from the software verification competition SV-COMP, we demonstrate our rank prediction technique to generalize well and achieve a rather high predictive accuracy (rank correlation > 0.6).","lang":"eng"}],"ddc":["000"],"user_id":"15504","page":"23-26","type":"conference","year":"2017","citation":{"chicago":"Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. “Predicting Rankings of Software Verification Tools.” In Proceedings of the 3rd International Workshop on Software Analytics, 23–26. SWAN’17, 2017. https://doi.org/10.1145/3121257.3121262.","apa":"Czech, M., Hüllermeier, E., Jakobs, M.-C., & Wehrheim, H. (2017). Predicting Rankings of Software Verification Tools. In Proceedings of the 3rd International Workshop on Software Analytics (pp. 23–26). https://doi.org/10.1145/3121257.3121262","ama":"Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. Predicting Rankings of Software Verification Tools. In: Proceedings of the 3rd International Workshop on Software Analytics. SWAN’17. ; 2017:23-26. doi:10.1145/3121257.3121262","mla":"Czech, Mike, et al. “Predicting Rankings of Software Verification Tools.” Proceedings of the 3rd International Workshop on Software Analytics, 2017, pp. 23–26, doi:10.1145/3121257.3121262.","bibtex":"@inproceedings{Czech_Hüllermeier_Jakobs_Wehrheim_2017, series={SWAN’17}, title={Predicting Rankings of Software Verification Tools}, DOI={10.1145/3121257.3121262}, booktitle={Proceedings of the 3rd International Workshop on Software Analytics}, author={Czech, Mike and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017}, pages={23–26}, collection={SWAN’17} }","short":"M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 3rd International Workshop on Software Analytics, 2017, pp. 23–26.","ieee":"M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Predicting Rankings of Software Verification Tools,” in Proceedings of the 3rd International Workshop on Software Analytics, 2017, pp. 23–26."},"_id":"71","department":[{"_id":"355"},{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"title":"Predicting Rankings of Software Verification Tools","series_title":"SWAN'17","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:28Z","doi":"10.1145/3121257.3121262"},{"type":"report","citation":{"short":"M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Predicting Rankings of Software Verification Competitions, 2017.","ieee":"M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, Predicting Rankings of Software Verification Competitions. 2017.","ama":"Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. Predicting Rankings of Software Verification Competitions.; 2017.","apa":"Czech, M., Hüllermeier, E., Jakobs, M.-C., & Wehrheim, H. (2017). Predicting Rankings of Software Verification Competitions.","chicago":"Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. Predicting Rankings of Software Verification Competitions, 2017.","mla":"Czech, Mike, et al. Predicting Rankings of Software Verification Competitions. 2017.","bibtex":"@book{Czech_Hüllermeier_Jakobs_Wehrheim_2017, title={Predicting Rankings of Software Verification Competitions}, author={Czech, Mike and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017} }"},"year":"2017","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:29Z","_id":"72","author":[{"last_name":"Czech","full_name":"Czech, Mike","first_name":"Mike"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"},{"full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine","last_name":"Jakobs"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"department":[{"_id":"77"},{"_id":"355"}],"file_date_updated":"2018-11-21T10:50:11Z","file":[{"access_level":"closed","date_created":"2018-11-21T10:50:11Z","file_name":"Predicting Rankings of Soware Verification Competitions.pdf","relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-11-21T10:50:11Z","creator":"florida","file_id":"5782","file_size":869984}],"status":"public","has_accepted_license":"1","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"date_created":"2017-10-17T12:41:05Z","abstract":[{"text":"Software verification competitions, such as the annual SV-COMP, evaluate software verification tools with respect to their effectivity and efficiency. Typically, the outcome of a competition is a (possibly category-specific) ranking of the tools. For many applications, such as building portfolio solvers, it would be desirable to have an idea of the (relative) performance of verification tools on a given verification task beforehand, i.e., prior to actually running all tools on the task.In this paper, we present a machine learning approach to predicting rankings of tools on verification tasks. The method builds upon so-called label ranking algorithms, which we complement with appropriate kernels providing a similarity measure for verification tasks. Our kernels employ a graph representation for software source code that mixes elements of control flow and program dependence graphs with abstract syntax trees. Using data sets from SV-COMP, we demonstrate our rank prediction technique to generalize well and achieve a rather high predictive accuracy. In particular, our method outperforms a recently proposed feature-based approach of Demyanova et al. (when applied to rank predictions). ","lang":"eng"}],"title":"Predicting Rankings of Software Verification Competitions","ddc":["000"],"user_id":"15504"},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:20Z","doi":"10.1145/3054743","department":[{"_id":"77"},{"_id":"78"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"title":"Proof-Carrying Hardware via Inductive Invariants","page":"61:1--61:23","type":"journal_article","citation":{"chicago":"Isenberg, Tobias, Marco Platzner, Heike Wehrheim, and Tobias Wiersema. “Proof-Carrying Hardware via Inductive Invariants.” ACM Transactions on Design Automation of Electronic Systems, no. 4 (2017): 61:1--61:23. https://doi.org/10.1145/3054743.","ama":"Isenberg T, Platzner M, Wehrheim H, Wiersema T. Proof-Carrying Hardware via Inductive Invariants. ACM Transactions on Design Automation of Electronic Systems. 2017;(4):61:1--61:23. doi:10.1145/3054743","apa":"Isenberg, T., Platzner, M., Wehrheim, H., & Wiersema, T. (2017). Proof-Carrying Hardware via Inductive Invariants. ACM Transactions on Design Automation of Electronic Systems, (4), 61:1--61:23. https://doi.org/10.1145/3054743","bibtex":"@article{Isenberg_Platzner_Wehrheim_Wiersema_2017, title={Proof-Carrying Hardware via Inductive Invariants}, DOI={10.1145/3054743}, number={4}, journal={ACM Transactions on Design Automation of Electronic Systems}, publisher={ACM}, author={Isenberg, Tobias and Platzner, Marco and Wehrheim, Heike and Wiersema, Tobias}, year={2017}, pages={61:1--61:23} }","mla":"Isenberg, Tobias, et al. “Proof-Carrying Hardware via Inductive Invariants.” ACM Transactions on Design Automation of Electronic Systems, no. 4, ACM, 2017, pp. 61:1--61:23, doi:10.1145/3054743.","short":"T. Isenberg, M. Platzner, H. Wehrheim, T. Wiersema, ACM Transactions on Design Automation of Electronic Systems (2017) 61:1--61:23.","ieee":"T. Isenberg, M. Platzner, H. Wehrheim, and T. Wiersema, “Proof-Carrying Hardware via Inductive Invariants,” ACM Transactions on Design Automation of Electronic Systems, no. 4, pp. 61:1--61:23, 2017."},"year":"2017","_id":"68","issue":"4","publication":"ACM Transactions on Design Automation of Electronic Systems","file_date_updated":"2018-11-02T16:08:17Z","author":[{"last_name":"Isenberg","first_name":"Tobias","full_name":"Isenberg, Tobias"},{"last_name":"Platzner","id":"398","first_name":"Marco","full_name":"Platzner, Marco"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"},{"full_name":"Wiersema, Tobias","first_name":"Tobias","id":"3118","last_name":"Wiersema"}],"publisher":"ACM","file":[{"creator":"ups","file_id":"5324","file_size":806356,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-11-02T16:08:17Z","date_created":"2018-11-02T16:08:17Z","file_name":"a61-isenberg.pdf","access_level":"closed"}],"date_created":"2017-10-17T12:41:04Z","has_accepted_license":"1","status":"public","abstract":[{"lang":"eng","text":"Proof-carrying hardware (PCH) is a principle for achieving safety for dynamically reconfigurable hardware systems. The producer of a hardware module spends huge effort when creating a proof for a safety policy. The proof is then transferred as a certificate together with the configuration bitstream to the consumer of the hardware module, who can quickly verify the given proof. Previous work utilized SAT solvers and resolution traces to set up a PCH technology and corresponding tool flows. In this article, we present a novel technology for PCH based on inductive invariants. For sequential circuits, our approach is fundamentally stronger than the previous SAT-based one since we avoid the limitations of bounded unrolling. We contrast our technology to existing ones and show that it fits into previously proposed tool flows. We conduct experiments with four categories of benchmark circuits and report consumer and producer runtime and peak memory consumption, as well as the size of the certificates and the distribution of the workload between producer and consumer. Experiments clearly show that our new induction-based technology is superior for sequential circuits, whereas the previous SAT-based technology is the better choice for combinational circuits."}],"ddc":["000"],"user_id":"3118"},{"citation":{"apa":"Jakobs, M.-C. (2017). On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-104","ama":"Jakobs M-C. On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-104","chicago":"Jakobs, Marie-Christine. On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-104.","mla":"Jakobs, Marie-Christine. On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-104.","bibtex":"@book{Jakobs_2017, title={On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring}, DOI={10.17619/UNIPB/1-104}, publisher={Universität Paderborn}, author={Jakobs, Marie-Christine}, year={2017} }","short":"M.-C. Jakobs, On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring, Universität Paderborn, 2017.","ieee":"M.-C. Jakobs, On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring. Universität Paderborn, 2017."},"type":"dissertation","year":"2017","supervisor":[{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_updated":"2022-01-06T07:03:22Z","_id":"685","doi":"10.17619/UNIPB/1-104","file_date_updated":"2018-03-14T12:26:52Z","department":[{"_id":"77"}],"author":[{"last_name":"Jakobs","full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine"}],"publisher":"Universität Paderborn","file":[{"file_name":"685-Dissertation-Jakobs.pdf","date_created":"2018-03-14T12:26:52Z","access_level":"closed","file_id":"1211","creator":"florida","file_size":11828624,"success":1,"relation":"main_file","date_updated":"2018-03-14T12:26:52Z","content_type":"application/pdf"}],"date_created":"2017-11-13T08:13:29Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"status":"public","has_accepted_license":"1","ddc":["040"],"title":"On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring","user_id":"477"},{"title":"Programs from Proofs: A Framework for the Safe Execution of Untrusted Software","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"doi":"10.1145/3014427","date_updated":"2022-01-06T07:03:23Z","language":[{"iso":"eng"}],"ddc":["040"],"user_id":"477","abstract":[{"text":"Today, software is traded worldwide on global markets, with apps being downloaded to smartphones within minutes or seconds. This poses, more than ever, the challenge of ensuring safety of software in the face of (1) unknown or untrusted software providers together with (2) resource-limited software consumers. The concept of Proof-Carrying Code (PCC), years ago suggested by Necula, provides one framework for securing the execution of untrusted code. PCC techniques attach safety proofs, constructed by software producers, to code. Based on the assumption that checking proofs is usually much simpler than constructing proofs, software consumers should thus be able to quickly check the safety of software. However, PCC techniques often suffer from the size of certificates (i.e., the attached proofs), making PCC techniques inefficient in practice.In this article, we introduce a new framework for the safe execution of untrusted code called Programs from Proofs (PfP). The basic assumption underlying the PfP technique is the fact that the structure of programs significantly influences the complexity of checking a specific safety property. Instead of attaching proofs to program code, the PfP technique transforms the program into an efficiently checkable form, thus guaranteeing quick safety checks for software consumers. For this transformation, the technique also uses a producer-side automatic proof of safety. More specifically, safety proving for the software producer proceeds via the construction of an abstract reachability graph (ARG) unfolding the control-flow automaton (CFA) up to the degree necessary for simple checking. To this end, we combine different sorts of software analysis: expensive analyses incrementally determining the degree of unfolding, and cheap analyses responsible for safety checking. Out of the abstract reachability graph we generate the new program. In its CFA structure, it is isomorphic to the graph and hence another, this time consumer-side, cheap analysis can quickly determine its safety.Like PCC, Programs from Proofs is a general framework instantiable with different sorts of (expensive and cheap) analysis. Here, we present the general framework and exemplify it by some concrete examples. We have implemented different instantiations on top of the configurable program analysis tool CPAchecker and report on experiments, in particular on comparisons with PCC techniques.","lang":"eng"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:04Z","publisher":"ACM","author":[{"full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine","last_name":"Jakobs"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"publication":"ACM Transactions on Programming Languages and Systems","file_date_updated":"2018-03-21T13:15:09Z","file":[{"file_size":1215139,"creator":"florida","file_id":"1575","date_updated":"2018-03-21T13:15:09Z","content_type":"application/pdf","relation":"main_file","success":1,"file_name":"69-a7-jakobs.pdf","date_created":"2018-03-21T13:15:09Z","access_level":"closed"}],"issue":"2","_id":"69","citation":{"ieee":"M.-C. Jakobs and H. Wehrheim, “Programs from Proofs: A Framework for the Safe Execution of Untrusted Software,” ACM Transactions on Programming Languages and Systems, no. 2, pp. 7:1-7:56, 2017.","short":"M.-C. Jakobs, H. Wehrheim, ACM Transactions on Programming Languages and Systems (2017) 7:1-7:56.","mla":"Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs: A Framework for the Safe Execution of Untrusted Software.” ACM Transactions on Programming Languages and Systems, no. 2, ACM, 2017, pp. 7:1-7:56, doi:10.1145/3014427.","bibtex":"@article{Jakobs_Wehrheim_2017, title={Programs from Proofs: A Framework for the Safe Execution of Untrusted Software}, DOI={10.1145/3014427}, number={2}, journal={ACM Transactions on Programming Languages and Systems}, publisher={ACM}, author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017}, pages={7:1-7:56} }","chicago":"Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs: A Framework for the Safe Execution of Untrusted Software.” ACM Transactions on Programming Languages and Systems, no. 2 (2017): 7:1-7:56. https://doi.org/10.1145/3014427.","ama":"Jakobs M-C, Wehrheim H. Programs from Proofs: A Framework for the Safe Execution of Untrusted Software. ACM Transactions on Programming Languages and Systems. 2017;(2):7:1-7:56. doi:10.1145/3014427","apa":"Jakobs, M.-C., & Wehrheim, H. (2017). Programs from Proofs: A Framework for the Safe Execution of Untrusted Software. ACM Transactions on Programming Languages and Systems, (2), 7:1-7:56. https://doi.org/10.1145/3014427"},"year":"2017","type":"journal_article","page":"7:1-7:56"},{"author":[{"first_name":"Felix","full_name":"Pauck, Felix","last_name":"Pauck","id":"22398"}],"publisher":"Universität Paderborn","department":[{"_id":"77"}],"file_date_updated":"2019-08-07T09:03:48Z","file":[{"date_updated":"2019-08-07T09:03:48Z","content_type":"application/pdf","relation":"main_file","file_size":5093611,"creator":"fpauck","file_id":"12905","title":"Master's Thesis","access_level":"open_access","file_name":"fpauck_2017.pdf","date_created":"2019-08-07T08:55:58Z"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:12Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"title":"Cooperative static analysis of Android applications","ddc":["000"],"user_id":"22398","citation":{"bibtex":"@book{Pauck_2017, title={Cooperative static analysis of Android applications}, publisher={Universität Paderborn}, author={Pauck, Felix}, year={2017} }","mla":"Pauck, Felix. Cooperative Static Analysis of Android Applications. Universität Paderborn, 2017.","chicago":"Pauck, Felix. Cooperative Static Analysis of Android Applications. Universität Paderborn, 2017.","apa":"Pauck, F. (2017). Cooperative static analysis of Android applications. Universität Paderborn.","ama":"Pauck F. Cooperative Static Analysis of Android Applications. Universität Paderborn; 2017.","ieee":"F. Pauck, Cooperative static analysis of Android applications. Universität Paderborn, 2017.","short":"F. Pauck, Cooperative Static Analysis of Android Applications, Universität Paderborn, 2017."},"type":"mastersthesis","year":"2017","supervisor":[{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:50:52Z","_id":"109","oa":"1"},{"user_id":"15504","title":"Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung","status":"public","date_created":"2017-10-17T12:41:31Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"author":[{"first_name":"Henrik","full_name":"Bröcher, Henrik","last_name":"Bröcher"}],"publisher":"Universität Paderborn","department":[{"_id":"77"}],"date_updated":"2022-01-06T06:54:18Z","_id":"201","language":[{"iso":"ger"}],"supervisor":[{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"citation":{"short":"H. Bröcher, Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung, Universität Paderborn, 2016.","ieee":"H. Bröcher, Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung. Universität Paderborn, 2016.","chicago":"Bröcher, Henrik. Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung. Universität Paderborn, 2016.","apa":"Bröcher, H. (2016). Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung. Universität Paderborn.","ama":"Bröcher H. Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung. Universität Paderborn; 2016.","bibtex":"@book{Bröcher_2016, title={Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung}, publisher={Universität Paderborn}, author={Bröcher, Henrik}, year={2016} }","mla":"Bröcher, Henrik. Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung. Universität Paderborn, 2016."},"type":"bachelorsthesis","year":"2016"},{"_id":"3157","page":"189--204","citation":{"mla":"Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures with Timed Automata.” Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings, edited by Maurice H. ter Beek et al., 2016, pp. 189--204, doi:10.1007/978-3-319-45943-1_13.","bibtex":"@inproceedings{Beringer_Wehrheim_2016, series={Lecture Notes in Computer Science}, title={Verification of AUTOSAR Software Architectures with Timed Automata}, DOI={10.1007/978-3-319-45943-1_13}, booktitle={Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings}, author={Beringer, Steffen and Wehrheim, Heike}, editor={H. ter Beek, Maurice and Gnesi, Stefania and Knapp, AlexanderEditors}, year={2016}, pages={189--204}, collection={Lecture Notes in Computer Science} }","chicago":"Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures with Timed Automata.” In Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings, edited by Maurice H. ter Beek, Stefania Gnesi, and Alexander Knapp, 189--204. Lecture Notes in Computer Science, 2016. https://doi.org/10.1007/978-3-319-45943-1_13.","apa":"Beringer, S., & Wehrheim, H. (2016). Verification of AUTOSAR Software Architectures with Timed Automata. In M. H. ter Beek, S. Gnesi, & A. Knapp (Eds.), Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings (pp. 189--204). https://doi.org/10.1007/978-3-319-45943-1_13","ama":"Beringer S, Wehrheim H. Verification of AUTOSAR Software Architectures with Timed Automata. In: H. ter Beek M, Gnesi S, Knapp A, eds. Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings. Lecture Notes in Computer Science. ; 2016:189--204. doi:10.1007/978-3-319-45943-1_13","ieee":"S. Beringer and H. Wehrheim, “Verification of AUTOSAR Software Architectures with Timed Automata,” in Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings, 2016, pp. 189--204.","short":"S. Beringer, H. Wehrheim, in: M. H. ter Beek, S. Gnesi, A. Knapp (Eds.), Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings, 2016, pp. 189--204."},"type":"conference","year":"2016","user_id":"477","ddc":["000"],"date_created":"2018-06-13T07:39:35Z","has_accepted_license":"1","status":"public","file":[{"file_size":2640695,"creator":"ups","file_id":"5267","date_updated":"2018-11-02T14:17:13Z","content_type":"application/pdf","success":1,"relation":"main_file","file_name":"VerificationOfAUTOSARSoftwareA.pdf","date_created":"2018-11-02T14:17:13Z","access_level":"closed"}],"publication":"Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings","file_date_updated":"2018-11-02T14:17:13Z","author":[{"last_name":"Beringer","full_name":"Beringer, Steffen","first_name":"Steffen"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"doi":"10.1007/978-3-319-45943-1_13","date_updated":"2022-01-06T06:59:01Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","title":"Verification of AUTOSAR Software Architectures with Timed Automata","project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"editor":[{"first_name":"Maurice","full_name":"H. ter Beek, Maurice","last_name":"H. ter Beek"},{"first_name":"Stefania","full_name":"Gnesi, Stefania","last_name":"Gnesi"},{"last_name":"Knapp","full_name":"Knapp, Alexander","first_name":"Alexander"}],"department":[{"_id":"77"}]},{"doi":"10.1007/978-3-319-46750-4_1","date_updated":"2022-01-06T06:59:01Z","_id":"3158","citation":{"short":"O. Travkin, H. Wehrheim, in: A. Sampaio, F. Wang (Eds.), Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings, 2016, pp. 3--24.","ieee":"O. Travkin and H. Wehrheim, “Verification of Concurrent Programs on Weak Memory Models,” in Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings, 2016, pp. 3--24.","ama":"Travkin O, Wehrheim H. Verification of Concurrent Programs on Weak Memory Models. In: Sampaio A, Wang F, eds. Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings. Lecture Notes in Computer Science. ; 2016:3--24. doi:10.1007/978-3-319-46750-4_1","apa":"Travkin, O., & Wehrheim, H. (2016). Verification of Concurrent Programs on Weak Memory Models. In A. Sampaio & F. Wang (Eds.), Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings (pp. 3--24). https://doi.org/10.1007/978-3-319-46750-4_1","chicago":"Travkin, Oleg, and Heike Wehrheim. “Verification of Concurrent Programs on Weak Memory Models.” In Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings, edited by Augusto Sampaio and Farn Wang, 3--24. Lecture Notes in Computer Science, 2016. https://doi.org/10.1007/978-3-319-46750-4_1.","mla":"Travkin, Oleg, and Heike Wehrheim. “Verification of Concurrent Programs on Weak Memory Models.” Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings, edited by Augusto Sampaio and Farn Wang, 2016, pp. 3--24, doi:10.1007/978-3-319-46750-4_1.","bibtex":"@inproceedings{Travkin_Wehrheim_2016, series={Lecture Notes in Computer Science}, title={Verification of Concurrent Programs on Weak Memory Models}, DOI={10.1007/978-3-319-46750-4_1}, booktitle={Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings}, author={Travkin, Oleg and Wehrheim, Heike}, editor={Sampaio, Augusto and Wang, FarnEditors}, year={2016}, pages={3--24}, collection={Lecture Notes in Computer Science} }"},"year":"2016","type":"conference","page":"3--24","series_title":"Lecture Notes in Computer Science","user_id":"29719","title":"Verification of Concurrent Programs on Weak Memory Models","status":"public","date_created":"2018-06-13T07:41:07Z","editor":[{"first_name":"Augusto","full_name":"Sampaio, Augusto","last_name":"Sampaio"},{"full_name":"Wang, Farn","first_name":"Farn","last_name":"Wang"}],"author":[{"last_name":"Travkin","first_name":"Oleg","full_name":"Travkin, Oleg"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"department":[{"_id":"77"}],"publication":"Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings"}]